Analysis of link break detection using HELLO messages

Zaidi, Zainab R., Portmann, Marius and Tan, Wee Lum (2011). Analysis of link break detection using HELLO messages. In: , MSWiM’11: Proceedings of the 14th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems. 14th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems, Miami Beach, FL, United States, (143-150). 31 October - 4 November 2011.

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author Zaidi, Zainab R.
Portmann, Marius
Tan, Wee Lum
Title of paper Analysis of link break detection using HELLO messages
Conference Paper Type Fully Published Paper
Conference name 14th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems    (ERA 2010 Rank A)
DOI 10.1145/2068897.2068924
Conference location Miami Beach, FL, United States
Conference dates 31 October - 4 November 2011
Proceedings title MSWiM’11: Proceedings of the 14th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems
Place published New York, United States
Publisher Association for Computing Machinery (ACM)
Publication date 2011
ISBN 9781450308984
Start page 143
End page 150
Total pages 8
Collection year 2012
Language eng
Abstract/Summary HELLO messages are widely used for neighbor discovery in routing protocols for wireless multihop networks. In this paper, we provide mathematical and experimental proofs that the current strategy of declaring a link down based on observations that a specific number of HELLO messages are lost, is 110t a correct strategy. In our mathematical analysis, we characterized the error bursts over wireless links by extending the Gilbert bit error model, and validate our model using HELLO loss data from our wireless mesh testbed. Our analysis shows that error burst lengths follow a geometric distribution, i.e. the probability of additional losses in the burst does not depend on the observed losses. We propose an alternative link break detection strategy where a link break is declared when the observed mean error burst length for the link is longer than the mean route recovery time. Our testbed results show that running the AODV routing protocol with our proposed strategy yields better throughput and lower control message overhead, compared to the case where AODV relies on its default settings of declaring link breaks when two consecutive HELLO messages are lost.
Q-Index Code E1
Q-Index Status Confirmed Code
Institutional Status UQ
Additional Notes Session 6: Topology Control and Neighbor Discovery

Document type: Conference Paper
Sub-type: Fully Published Paper
Collections: Official 2012 Collection
School of Information Technology and Electrical Engineering Publications
 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Access Statistics: 52 Abstract Views, 8 File Downloads  -  Detailed Statistics
Created: Fri, 28 Oct 2011, 15:10:47 EST by Dr Marius Portmann on behalf of School of Information Technol and Elec Engineering