Abstract
Scalability is a key design challenge that routing protocols for ad hoc networks must properly address to maintain the network performance when the number of nodes increases. We focus on this issue by reducing the amount of control information messages that a link state proactive routing algorithm introduces to the network. Our proposal is based on the observation that a high percentage of those messages is always the same. Therefore, we introduce a new mechanism that can predict the control messages that nodes need for building an accurate map of the network topology so they can avoid resending the same messages. This prediction mechanism, applied to OLSR protocol, could be used to reduce the number of messages transmitted through the network and to save computational processing and energy consumption. Our proposal is independent of the OLSR configuration parameters and it can dynamically self-adapt to network changes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brewer, E.: Lessons from giant-scale services. IEEE Internet Computing 5(4), 46–55 (2001)
Clausen, T., Jacquet, P.: RFC3626 Optimized link state routing protocol, OLSR (2003)
Choi, J.-M., Ko, Y.-B.: A performance evaluation for ad hoc routing protocols in realistic military scenarios. Cellular and Intelligent Communications (2004)
De Rosa, F., Malizia, A., Mecella, M.: Disconnection prediction in mobile ad hoc networks for supporting cooperative work. IEEE Pervasive Computing 4(3), 62–70 (2005)
Gao, Y., Wu, K., Li, F.: Analysis on the redundancy of wireless sensor networks. In: Wireless Sensor Networks and Applications, pp. 108–114. ACM, New York (2003)
Härri, J., Filali, F., Bonnet, C.: Kinetic multipoint relaying: improvements using mobility predictions. In: Hutchison, D., Denazis, S., Lefevre, L., Minden, G.J. (eds.) IWAN 2005. LNCS, vol. 4388, pp. 224–229. Springer, Heidelberg (2009)
Hong, X., Xu, K., Gerla, M.: Scalable routing protocols for mobile ad hoc networks. Network 16(4), 11–21 (2002)
Iwata, A., Chiang, C.C., Pei, G., Gerla, M., Chen, T.-W.: Scalable routing strategies for ad hoc wireless networks. IEEE Journal on Selected Areas in Communications 17(8), 1369–1379 (1999)
Le, H.-C., Guyennet, H., Zerhouni, N.: Redundant communication avoidance for event-driven sensor network. J. Computer Science and Network Security 7(3), 193–200 (2007)
Lipasti, M.H., Wilkerson, C.B., Shen, J.P.: Value locality and load value prediction. In: Architectural Support for Programming Languages and Operating Systems, pp. 138–147. ACM, New York (1996)
Maleki, M., Dantu, K., Pedram, M.: Lifetime prediction routing in mobile ad hoc networks. In: Wireless Communications and Networking, pp. 1185–1190. IEEE, Los Alamitos (2003)
The Network Simulator, http://www.nsnam.org/
Pentikousis, K., Blume, O., Agüero, R., Papavassiliou, S., Puliafito, A.: Topology-aware hybrid random walk protolcs for wireless multihop networks. In: Mobile networks and management. LNICST, vol. 32, pp. 107–118. Springer, Heidelberg (2010)
Smith, J.E.: A study of branch prediction strategies. In: 25 years of the International Symposia on Computer Architecture, pp. 202–215. ACM, New York (1998)
Guifi network, http://www.guifi.net/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Medina, E., Meseguer, R., Molina, C., Royo, D. (2011). OLSRp: Predicting Control Information to Achieve Scalability in OLSR Ad Hoc Networks. In: Pentikousis, K., Agüero, R., García-Arranz, M., Papavassiliou, S. (eds) Mobile Networks and Management. MONAMI 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 68. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21444-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-21444-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21443-1
Online ISBN: 978-3-642-21444-8
eBook Packages: Computer ScienceComputer Science (R0)