By Topic

On Construction of Virtual Backbone in Wireless Ad Hoc Networks with Unidirectional Links

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Thai, M.T. ; Dept. of Comput. & Inf. Sci. & Eng., Florida Univ., Gainesville, FL ; Tiwari, R. ; Ding-Zhu Du

Since there is no fixed infrastructure in wireless ad hoc networks , virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem. The virtual backbone construction has been studied extensively in undirected graphs, especially in unit disk graphs, in which each node has the same transmission range. In practice, however, transmission ranges of all nodes are not necessarily equal. In this paper, we model such a network as a disk graph, where unidirectional links are considered. To study the virtual backbone construction in disk graphs, we consider two problems: strongly connected dominating set (SCDS) and strongly connected dominating and absorbing set (SCDAS). We propose a constant approximation algorithm and discuss its improvements for the SCDS problem . We also propose a heuristic for the SCDAS problem. Through extensive simulations, we verify our theoretical analysis and also demonstrate that the SCDS can be extended to form an SCDAS with marginal extra overhead.

Published in:

Mobile Computing, IEEE Transactions on  (Volume:7 ,  Issue: 9 )