Time-Efficient Protocols for Neighbor Discovery in Wireless Ad Hoc Networks

Neighbor discovery (ND) is a basic and crucial step for initializing wireless ad hoc networks. A fast, precise, and energy-efficient ND protocol has significant importance to subsequent operations in wireless networks. However, many existing protocols have a high probability of generating idle slots in their neighbor discovering processes, which prolongs the executing duration, thus compromising their performance. In this paper, we propose a novel randomized protocol FRIEND, which is a prehandshaking ND protocol, to initialize synchronous full-duplex wireless ad hoc networks. By introducing a prehandshaking strategy to help each node be aware of activities of its neighborhood, we significantly reduce the probabilities of generating idle slots and collisions. Moreover, with the development of single-channel full-duplex communication technology, we further decrease the processing time needed in FRIEND and construct the first fullduplex ND protocol. Our theoretical analysis proves that FRIEND can decrease the duration of ND by up to 48% in comparison with classical ALOHA-like protocols. In addition, we propose HD-FRIEND for half-duplex networks and variants of FRIEND for multihop and duty-cycled networks. Both theoretical analysis and simulation results show that FRIEND can adapt to various scenarios and significantly decrease the duration of ND.

[1]  Reuven Cohen,et al.  Continuous Neighbor Discovery in Asynchronous Sensor Networks , 2011, IEEE/ACM Transactions on Networking.

[2]  Donald F. Towsley,et al.  Neighbor Discovery with Reception Status Feedback to Transmitters , 2010, 2010 Proceedings IEEE INFOCOM.

[3]  Donald F. Towsley,et al.  Neighbor discovery in wireless networks and the coupon collector's problem , 2009, MobiCom '09.

[4]  Bo Li,et al.  Neighbor discovery in mobile ad hoc self-configuring networks with directional antennas: algorithms and comparisons , 2008, IEEE Transactions on Wireless Communications.

[5]  Srdjan Capkun,et al.  SecNav: secure broadcast localization and time synchronization in wireless networks , 2007, MobiCom '07.

[6]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[7]  Srikanth V. Krishnamurthy,et al.  An integrated neighbor discovery and MAC protocol for ad hoc networks using directional antennas , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[8]  Radu Stoleru,et al.  Secure neighbor discovery and wormhole localization in mobile ad hoc networks , 2012, Ad Hoc Networks.

[9]  Marco Lops,et al.  Neighbor Discovery in Wireless Networks: A Multiuser-Detection Approach , 2007, 2007 Information Theory and Applications Workshop.

[10]  Philip Levis,et al.  Achieving single channel, full duplex wireless communication , 2010, MobiCom.

[11]  Anthony Ephremides,et al.  Neighbor discovery in a wireless sensor network: multipacket reception capability and physical-layer signal processing , 2010 .

[12]  Adam Wolisz,et al.  Optimized asynchronous multi-channel neighbor discovery , 2011, 2011 Proceedings IEEE INFOCOM.

[13]  Wei Zeng,et al.  Neighbor Discovery in Wireless Networks with Multipacket Reception , 2011, IEEE Transactions on Parallel and Distributed Systems.

[14]  Timo Hämäläinen,et al.  Energy-efficient neighbor discovery protocol for mobile wireless sensor networks , 2009, Ad Hoc Networks.

[15]  Guihai Chen,et al.  ALOHA-like neighbor discovery in low-duty-cycle wireless sensor networks , 2011, 2011 IEEE Wireless Communications and Networking Conference.

[16]  Panagiotis Papadimitratos,et al.  Secure neighbor discovery in wireless networks: formal investigation of possibility , 2008, ASIACCS '08.

[17]  Guihai Chen,et al.  Neighbor Discovery in Low-Duty-Cycle Wireless Sensor Networks with Multipacket Reception , 2012, 2012 IEEE 18th International Conference on Parallel and Distributed Systems.

[18]  Philip Levis,et al.  Practical, real-time, full duplex wireless , 2011, MobiCom.

[19]  Ignas G. Niemegeers,et al.  Impact of Antenna Pattern and Link Model on Directional Neighbor Discovery in 60 GHz Networks , 2011, IEEE Transactions on Wireless Communications.

[20]  P. Erd6s ON A CLASSICAL PROBLEM OF PROBABILITY THEORY b , 2001 .

[21]  Anthony Ephremides,et al.  An asynchronous neighbor discovery algorithm for wireless sensor networks , 2007, Ad Hoc Networks.

[22]  Mihail L. Sichitiu,et al.  Tiny-sync: Tight time synchronization for wireless sensor networks , 2007, TOSN.

[23]  Linghe Kong,et al.  Accelerating Initialization for Sensor Networks , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[24]  Guihai Chen,et al.  Neighbor discovery in peer-to-peer wireless networks with multi-channel MPR capability , 2012, 2012 IEEE International Conference on Communications (ICC).

[25]  Yin Wang,et al.  Direct multi-hop time synchronization with constructive interference , 2012, IPSN.

[26]  Guihai Chen,et al.  PHED: Pre-Handshaking Neighbor Discovery Protocols in full duplex wireless ad hoc networks , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[27]  Anthony Ephremides,et al.  Neighbor discovery in a wireless sensor network: multipacket reception capability and physical-layer signal processing , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[28]  Elif Uysal-Biyikoglu,et al.  Energy-efficient link assessment in wireless sensor networks , 2004, IEEE INFOCOM 2004.

[29]  Steven A. Borbash,et al.  Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks , 2001, MobiHoc '01.