TY - GEN
T1 - Localized spanner construction for ad hoc networks with variable transmission range
AU - Peleg, David
AU - Roditty, Liam
PY - 2008
Y1 - 2008
N2 - This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions for ad hoc networks assumed that all nodes in the network have the same transmission range. This allowed a succinct representation of the network as a unit disk graph, serving as the basis for the construction. In contrast, when nodes have variable transmission range, the ad hoc network must be modeled by a general disk graph. Whereas unit disk graphs are undirected, general disk graphs are directed. This complicates the construction of a spanner for the network, since currently there are no efficient constructions of low-stretch spanners for general directed graphs. Nevertheless, in this paper it is shown that the class of disk graphs enjoys (efficiently constructible) spanners of quality similar to that of unit disk graph spanners. Moreover, it is shown that the new construction can be done in a localized fashion.
AB - This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions for ad hoc networks assumed that all nodes in the network have the same transmission range. This allowed a succinct representation of the network as a unit disk graph, serving as the basis for the construction. In contrast, when nodes have variable transmission range, the ad hoc network must be modeled by a general disk graph. Whereas unit disk graphs are undirected, general disk graphs are directed. This complicates the construction of a spanner for the network, since currently there are no efficient constructions of low-stretch spanners for general directed graphs. Nevertheless, in this paper it is shown that the class of disk graphs enjoys (efficiently constructible) spanners of quality similar to that of unit disk graph spanners. Moreover, it is shown that the new construction can be done in a localized fashion.
UR - http://www.scopus.com/inward/record.url?scp=56449109353&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-85209-4_11
DO - 10.1007/978-3-540-85209-4_11
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:56449109353
SN - 3540852085
SN - 9783540852087
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 135
EP - 147
BT - Ad-hoc, Mobile and Wireless Networks - 7th International Conference, ADHOC-NOW 2008, Proceedings
T2 - 7th International Conference on Ad-hoc, Mobile and Wireless Networks, ADHOC-NOW 2008
Y2 - 10 September 2008 through 12 September 2008
ER -