MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
An Integrated Neighbor Discovery and MAC Protocol for Ad Hoc Networks Using Directional Antennas
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Hello Protocols for Ad-Hoc Networks: Overhead and Accuracy Tradeoffs
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
The capacity of wireless networks
IEEE Transactions on Information Theory
Worldsens: development and prototyping tools for application specific wireless sensors networks
Proceedings of the 6th international conference on Information processing in sensor networks
Reactive and reliable neighbor discovery protocols in wireless networks
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
Rendezvous MAC protocols for use in cognitive radio networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Accuracy of link status detection in wireless multi-hop networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Continuous neighbor discovery in asynchronous sensor networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In wireless multi-hop networks, hello protocols for neighbor discovery are a basic service offered by the networking stack. However, their study usually rely on rather simplistic models which do not take into account problems resulting from low level layers, such as the physical layer. One of the peculiarities of radio communications is the presence of interferences which decrease the capacity of the medium.In this paper, we consider a random hello protocol inspired by aloha and we study the impact of the interferences on the neighbor discovery process. As expected, we prove that, in average and in the presence of interferences, a node discovers only a subset of its neighbors. We propose then an analytical model to compute the average number of nodes that a given node may expect to discover in its neighborhood.Finally, we present a hello protocol with sleep periods. We show how to optimize this protocol using our hybrid model. A real scenario stemming from the CAPNET project is then analyzed and studied.