The Community for Technology Leaders
Green Image
Issue No. 07 - July (2012 vol. 11)
ISSN: 1536-1233
pp: 1102-1112
Ling Ding , The University of Texas at Dallas, Richardson
Weili Wu , The University of Texas at Dallas, Richardson
James Willson , The University of Texas at Dallas, Richardson
Hongjie Du , The University of Texas at Dallas, Richardson
Wonjun Lee , Korea University, Seoul
Directional antennas can divide the transmission range into several sectors. Thus, through switching off sectors in unnecessary directions in wireless networks, we can save bandwidth and energy consumption. In this paper, we will study a directional virtual backbone (VB) in the network where directional antennas are used. When constructing a VB, we will take routing and broadcasting into account since they are two common operations in wireless networks. Hence, we will study a VB with guaranteed routing costs, named \alpha Minimum rOuting Cost Directional VB (\alpha-MOC-DVB). Besides the properties of regular VBs, \alpha-MOC-DVB also has a special constraint—for any pair of nodes, there exists at least one path all intermediate directions on which must belong to \alpha-MOC-DVB and the number of intermediate directions on the path is smaller than \alpha times that on the shortest path. We prove that construction of a minimum \alpha-MOC-DVB is an NP-hard problem in a general directed graph. A heuristic algorithm is proposed and theoretical analysis is also discussed in the paper. Extensive simulations demonstrate that our \alpha-MOC-DVB is much more efficient in the sense of VB size and routing costs compared to other VBs.
Directional antennas, connected dominating set, routing costs, wireless network, obstacle, general graph, NP-hard, virtual backbone.

L. Ding, W. Wu, W. Lee, H. Du and J. Willson, "Efficient Virtual Backbone Construction with Routing Cost Constraint in Wireless Networks Using Directional Antennas," in IEEE Transactions on Mobile Computing, vol. 11, no. , pp. 1102-1112, 2011.
240 ms
(Ver 3.3 (11022016))