Abstract
The HELLO messages of the OLSR protocol can be used as a way to exchange packet counters for each advertised link between the originating node and its neighbors. These counters are aimed to enable nodes receiving the HELLO messages to check that the property of flow conservation is verified on the originating node. The addition of this information incurs a significant overhead that could prevent the node from being able to advertise all its links in one HELLO message. Although plain OLSR has been designed to deal with partial information in its control messages, enabling the verification of the flow conservation property is not trivial. In this paper, we present a way to perform partial advertisement of packet counters and complete verification of the property of flow conservation that remains scalable. Simulation results show that in practical conditions, the use of the method incurs a limited overhead that makes it very acceptable.
Chapter PDF
Similar content being viewed by others
References
Ignacy Gawędzki and Khaldoun Al Agha. Proactive resilience to dropping nodes in mobile ad hoc networks. In AINTEC, pages 139–158, 2006.
T. Clausen and P. Jacquet. Optimized link state routing (OLSR) protocol. RFC 3626, IETF, October 2003.
A. MCDonald and T. Znati. A mobility-based framework for adaptive clustering in wireless ad hoc networks, 1999.
IEEE. IEEE Std 802.11-1999, Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 International Federation for Information Processing
About this paper
Cite this paper
Gawędzki, I., Al Agha, K. (2008). Scalable Exchange of Packet Counters in OLSR. In: Cuenca, P., Guerrero, C., Puigjaner, R., Serra, B. (eds) Advances in Ad Hoc Networking. Med-Hoc-Net 2008. IFIP International Federation for Information Processing, vol 265. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09490-8_11
Download citation
DOI: https://doi.org/10.1007/978-0-387-09490-8_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09489-2
Online ISBN: 978-0-387-09490-8
eBook Packages: Computer ScienceComputer Science (R0)