Abstract
One of the important aspects of a mobile ad hoc network (MANET) is the limitation of the amount of available energy and the network lifetime. The tremendous amount of using mobile nodes in wireless communication medium makes energy efficiency a fundamental requirement for MANETs. In this paper, we propose a novel energy aware clustering algorithm for the optimized link state routing (OLSR) routing protocol. This algorithm takes into account the node density and mobility and gives major improvements regarding the number of elected cluster heads. Our objective is to elect a reasonable number of cluster heads that will serve for hierarchical routing based on OLSR. The proposed algorithm aims to increase the network lifetime by considering the ad hoc residual energy while taking routing decisions. It also optimizes the delay of carried flows by adopting a selective forwarding approach based on a hierarchical routing model.
Similar content being viewed by others
References
Corson S, Macker J (1999) “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations”, RFC 2501, IETF, http://www.ietf.org/rfc/rfc2501.txt. Accessed 16 July 2012
Perkins C, Belding-Royer E, Das S (2003) “Ad hoc On-Demand Distance Vector (AODV) Routing”, RFC 3561, IETF, http://www.ietf.org/rfc/rfc3561.txt. Accessed 16 July 2012
Johnson D, Hu Y, Maltz D (2007) “The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4”, RFC 4728, IETF, http://www.ietf.org/rfc/rfc4728.txt. Accessed 16 July 2012
Clausen T, Jacquet P (2003) “Optimized Link State Routing Protocol (OLSR)”, RFC3626, IETF, http://www.ietf.org/rfc/rfc3626.txt. Accessed 16 July 2012
Ros FJ, Ruiz PM (2007) “Cluster-based OLSR extensions to reduce control overhead in mobile Ad hoc networks”, In Proceedings of the 2007 conference on Wireless Communications and Mobile Computing, New York, ACM, pp.202–207
Baccelli E (2006) “OLSR trees: A simple clustering mechanism for OLSR”, Challenges in ad-hoc networking, IFIP International Federation for Information Processing, 197:265–274
Lacharite Y, Wang M, Minet P, Clausen T (2009) “Hierarchical OLSR”, http://tools.ietf.org/html/draftlacharite-manet-holsr-02. Accessed 16 July 2012
Hajam A, Oudidi K, Elkoutbi M (2010) A distributed key management scheme based on multi hop clustering algorithm for MANETs. Int J Comput Sci Netw Secur 10(1):39–49
Loutfi A, Elkoutbi M (2012) “Optimizing the process of OLSR Clustering based on Mobility and Density in Ad hoc Networks”, the 3nd International Conference on Multimedia Computing and Systems, Tangier, Morocco
Information Sciences Institute University of Southern California, The Network Simulator NS-2, 2010. http://www.isi.edu/nsnam/ns/. Accessed 16 July 2012
Yoon J, Liu M, Noble B (2003) “Random Waypoint Considered Harmful”, Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications, pp.1312-1321
Bettestetter C (2001) Mobility modeling in wireless networks: categorization, smooth movement, border effects. Mob Comp Commun Rev 5(3):55–67
Hong X, Gerla M, Pei G, Chiang CC (1999) A Group Mobility Model for Ad hoc Wireless Networks, Proceedings of the ACM International Workshop on Modeling and Simulation of Wireless and Mobile Systems, Seattle, pp.53-60
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Loutfi, A., Elkoutbi, M., BenOthman, J. et al. An energy aware algorithm for OLSR clustering. Ann. Telecommun. 69, 201–207 (2014). https://doi.org/10.1007/s12243-013-0411-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12243-013-0411-6