Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Proximity awareness and fast connection establishment in Bluetooth
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Link Stability in Mobile Wireless Ad Hoc Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
PATHS: analysis of PATH duration statistics and their impact on reactive MANET routing protocols
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
User Mobility for Opportunistic Ad-Hoc Networking
WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
Distributed Token Circulation in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Mobility assessment for MANETs requiring persistent links
WiTMeMo '05 Papers presented at the 2005 workshop on Wireless traffic measurements and modeling
Exploring Mesh and Tree-Based Multicast Routing Protocols for MANETs
IEEE Transactions on Mobile Computing
On the Link Excess Life in Mobile Wireless Networks
ICCTA '07 Proceedings of the International Conference on Computing: Theory and Applications
The Impact of Stationary Notes on the Performance of Wireless Mobile Networks
ICWMC '07 Proceedings of the Third International Conference on Wireless and Mobile Communications
Controlled flooding in disconnected sparse mobile networks
Wireless Communications & Mobile Computing
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
Modeling path duration distributions in MANETs and their impact on reactive routing protocols
IEEE Journal on Selected Areas in Communications
Adaptive energy conserving algorithms for neighbor discovery in opportunistic Bluetooth networks
IEEE Journal on Selected Areas in Communications
Automation and Remote Control
| Hi-index | 0.00 |
One of the intrinsic problems of mobility in wireless networks is the discovery of mobile nodes. A widely used solution for this problem is to use different variations of beacons, such as hello packets. Although a poorly designed beaconing scheme may lead to unnecessary energy usage or poor throughput, a systematic approach to analyze and select beaconing parameters is not provided in the literature. Here, we propose a model to study the beaconing efficiency using some measures such as the link lifetime, the probability of link establishment, and the delay to discover a new neighbor. The model is general and does not adhere to any particular mobility model; the only input from the mobility is the distribution of physical link durations, which not only abstracts away the mobility details but also all effects that contribute to the link stability such as non-perfectly omni-directional antennas and the path loss exponents. Among our results, we prove that the periodic beaconing (which is widely used owing to its simplicity) is the best in terms of beacon hits; we compare one-way and two-way beaconing schemes and study beaconing energy optimization. Finally, the model is applied to three cases of ad hoc, delay-tolerant, and sensor networks, and a simple rule of thumb is proposed to efficiently adjust the beacon interval.