DocumentCode
2736362
Title
A fast ad-hoc neighbor discovery algorithm based on a Friend Trust mechanism
Author
Yimei Kang ; Xian Xu
Author_Institution
Coll. of Software, Beihang Univ., Beijing, China
fYear
2015
fDate
9-11 April 2015
Firstpage
69
Lastpage
74
Abstract
A fast ad-hoc neighbor discovery algorithm based on a Friend Trust mechanism (FTM) is proposed for a MANET randomly and temporarily deployed by mission driven, called mission-driven MANET. We work on three aspects to reduce the neighbor discovery time. First, we design a simplified Interframe Space mechanism to constrain collisions in a transmission round. Second, we proposed a novel Friend Trust mechanism to reduce the discovery time and guarantee algorithm operate in a bad condition. Experimental results show that this mechanism can reduce the networking time on average 19.62% for a 16 nodes network. Third, we apply multiple contentions to reuse the idle time, which reduce the networking time on average 24.3% (16 nodes). Our comprehensive algorithm have an excellent performance in the experiment, which reduces the networking time on average 40.04% (16 nodes).
Keywords
access protocols; mobile ad hoc networks; FTM; constrain collisions; fast ad hoc neighbor discovery; friend trust mechanism; interframe space mechanism; mission-driven MANET; neighbor discovery time; networking time; transmission round; Acceleration; Algorithm design and analysis; Delays; Mobile ad hoc networks; Protocols; Software algorithms; Interframe Space; MANET; friend trust mechanism; multiple contention; neighbor discovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Networking, Sensing and Control (ICNSC), 2015 IEEE 12th International Conference on
Conference_Location
Taipei
Type
conf
DOI
10.1109/ICNSC.2015.7116012
Filename
7116012
Link To Document