History-Aware Adaptive Backoff for Neighbor Discovery in Wireless Networks

2011 ◽  
Author(s):  
Zimu Yuan ◽  
You Lizhao ◽  
Wei Li ◽  
Biao Chen ◽  
Zhiwei Xu
Keyword(s):  
Wireless Networks ◽  
Neighbor Discovery

scholarly journals Neighbor discovery for wireless networks via compressed sensing

2013 ◽  
Vol 70 (7-8) ◽  
pp. 457-471 ◽  
Author(s):  
Lei Zhang ◽  
Jun Luo ◽  
Dongning Guo
Keyword(s):  
Wireless Networks ◽  
Compressed Sensing ◽  
Neighbor Discovery

Asymmetric Geographic Forwarding

2011 ◽  
Vol 2 (4) ◽  
pp. 46-70 ◽  
Author(s):  
Pramita Mitra ◽  
Christian Poellabauer
Keyword(s):  
Wireless Networks ◽  
Experimental Research ◽  
Routing Algorithm ◽  
Neighbor Discovery ◽  
Hop Count ◽  
Disk Model ◽  
Geographic Forwarding ◽  
Discovery Method ◽  
Asymmetric Links ◽  
The Ideal

Geographic Forwarding (GF) algorithms typically employ a neighbor discovery method to maintain a neighborhood table that works well only if all wireless links are symmetric. Recent experimental research has revealed that the link conditions in realistic wireless networks vary significantly from the ideal disk model and a substantial percentage of links are asymmetric. Existing GF algorithms fail to consider asymmetric links in neighbor discovery and thus discount a significant number of potentially stable routes with good one-way reliability. This paper introduces Asymmetric Geographic Forwarding (A-GF), which discovers asymmetric links in the network, evaluates them for stability (e.g., based on mobility), and uses them to obtain more efficient and shorter routes. A-GF also successfully identifies transient asymmetric links and ignores them to further improve the routing efficiency. Comparisons of A-GF to the original GF algorithm and another related symmetric routing algorithm indicate a decrease in hop count (and therefore latency) and an increase in successful route establishments, with only a small increase in overhead.

Efficient Algorithms for Neighbor Discovery in Wireless Networks

2013 ◽  
Vol 21 (1) ◽  
pp. 69-83 ◽  
Author(s):  
Sudarshan Vasudevan ◽  
Micah Adler ◽  
Dennis Goeckel ◽  
Don Towsley
Keyword(s):  
Wireless Networks ◽  
Efficient Algorithms ◽  
Neighbor Discovery

PND: a p-persistent neighbor discovery protocol in wireless networks

2011 ◽  
Vol 13 (7) ◽  
pp. 650-662 ◽  
Author(s):  
Kyunghwi Kim ◽  
Heejun Roh ◽  
Wonjun Lee ◽  
Sinjae Lee ◽  
Ding-Zhu Du
Keyword(s):  
Wireless Networks ◽  
Neighbor Discovery ◽  
Neighbor Discovery Protocol
Sign in / Sign up

Export Citation Format

Share Document