Options
Probabilistic addressing: Stable addresses in unstable wireless networks
Publikationstyp
Conference Paper
Date Issued
2011-06-23
Sprache
English
Author(s)
Vaegs, Tobias
Götz, Stefan
Link, Jó Ágila Bitsch
Start Page
61
End Page
72
Article Number
5779065
Citation
Proceedings of the 10th ACM/IEEE International Conference on Information Processing in Sensor Networks: 61-72 (2011)
Contribution to Conference
Scopus ID
Publisher
IEEE
ISBN
9781612848549
Unreliable connectivity and rapidly changing link qualities make it challenging to establish stable addressing in wireless networks. This is especially difficult in communication scenarios where nodes determine their own addresses based on the underlying connectivity in the network. In this paper, we present Probabilistic ADdressing (PAD), a virtual coordinate based addressing mechanism that efficiently deals with dynamic communication links in wireless networks. It assigns probabilistic addresses to nodes without needing to pessimistically estimate links over longer periods of time. The routing metric predicts the current location of a node in its address distribution. Our prototype implementation over real testbeds compares PAD with Beacon Vector Routing (BVR), a prominent routing approach in sensornets, and S4, a cluster based extension of BVR and state-of-the-art in point-to-point routing in sensornets. Our results from three widely used testbeds indicate that PAD achieves 37 times more stable addressing than BVR, and minimizes the number of transmissions in the network by 26% when compared with S4 under challenging networking conditions.
Subjects
Addressing | Tree Construction | Virtual Coordinates
DDC Class
005: Computer Programming, Programs, Data and Security