Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling
Randomized algorithms
A new approach to channel access scheduling for Ad Hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Priority and Collision Detection with Active Signaling - The Channel Access Mechanism of HIPERLAN
Wireless Personal Communications: An International Journal
A cone-based distributed topology-control algorithm for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications
Proceedings of the 6th ACM conference on Embedded network sensor systems
An Integrated Neighbor Discovery and MAC Protocol for Ad Hoc Networks Using Directional Antennas
IEEE Transactions on Wireless Communications
Ad hoc networking with directional antennas: a complete system solution
IEEE Journal on Selected Areas in Communications
Compressed neighbor discovery for wireless ad hoc networks: the Rayleigh fading case
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Neighbor discovery in mobile ad hoc networks using an abstract MAC layer
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Neighbor discovery with reception status feedback to transmitters
INFOCOM'10 Proceedings of the 29th conference on Information communications
JENNA: a jamming evasive network-coding neighbor-discovery algorithm for cognitive radio networks
IEEE Wireless Communications
Directional neighbor discovery in 60 GHz indoor wireless networks
Performance Evaluation
A novel neighbor discovery protocol for ultraviolet wireless networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Neighborhood discovery in a wireless sensor networks
Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
Neighbor discovery in wireless networks with multipacket reception
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
On efficient neighbor sensing in vehicular networks
Computer Communications
Neighbor discovery algorithm based on the regulation of duty-cycle in mobile sensor network
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Hi-index | 0.00 |
Neighbor discovery is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discovery in wireless networks. We first consider an ALOHA-like neighbor discovery algorithm in a synchronous system, proposed in an earlier work. When nodes do not have a collision detection mechanism, we show that this algorithm reduces to the classical {\em Coupon Collector's Problem}. Consequently, we show that each node discovers all its $n$ neighbors in an expected time equal to $ne (\ln n + c)$, for some constant $c$. When nodes have a collision detection mechanism, we propose an algorithm based on receiver status feedback which yields a $\ln n$ improvement over the ALOHA-like algorithm. Our algorithms do not require nodes to have any estimate of the number of neighbors. In particular, we show that not knowing $n$ results in no more than a factor of two slowdown in the algorithm performance. In the absence of node synchronization, we develop asynchronous neighbor discovery algorithms that are only a factor of two slower than their synchronous counterparts. We show that our algorithms can achieve neighbor discovery despite allowing nodes to begin execution at different time instants. Furthermore, our algorithms allow each node to detect when to terminate the neighbor discovery phase.