Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks

Authors:
G. Alonso;E. Kranakis;R. Wattenhofer;P. Widmayer
Affiliations:
-;-;-;-
Venue:
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Year:
2003

Citing 0
Cited 9

Revisiting neighbor discovery with interferences consideration

Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Performance analysis of the link layer protocol for UWB impulse radio networks

Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Evaluation of physical carrier sense based spanner construction and maintenance as well as broadcast and convergecast in ad hoc networks

Ad Hoc Networks
Speed Dating Despite Jammers

DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
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
Continuous neighbor discovery in asynchronous sensor networks

IEEE/ACM Transactions on Networking (TON)
Mobility prediction based neighborhood discovery in mobile Ad Hoc networks

NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Messages with implicit destinations as mobile agents

Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions

Quantified Score

Hi-index	0.00

Visualization

Abstract

The initial state in an ad-hoc network is a collection of nodes that are unaware of each other's presence. The very first step in joining and building the ad-hoc network is, thus, to discover other nodes. This node discovery procedure is a key step in configuring and optimizing the topology of the network. In spite of its relevance, node discovery has not yet been studied in detail and existing protocols are strongly tied to concrete network implementations. In this paper, we propose a model for node discovery that facilitates the analytical treatment of the problem. We concentrate on networks with a single shared broadcast channel. For these networks, we propose a number of protocols that shed light on the problem of node discovery.