Construction of directional virtual backbones with minimum routing cost in wireless networks

—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless networks, we study a special virtual backbone (VB) using directional antennas, requiring that from one node to any other node in the network, there exists at least one directional shortest path all of whose intermediate directions should belong to the VB, named as Minimum rOuting Cost Directional VB (MOC-DVB). In addition, VB has been well studied in Unit Disk Graph (UDG). However, radio wave based communications in wireless networks may be interrupted by obstacles (e.g., buildings and mountains). Thus, in this paper, we model a network as a general directed graph. We prove that construction of a minimum MOC-DVB is an NPhard problem in a general directed graph and in term of the size of MOC-DVB, there exists an unreachable lower bound of the polynomial-time selected MOC-DVB. Therefore, we propose a distributed...

• Type: Journal
• Year: 2011
• Where: INFOCOM
• Authors: Ling Ding, Weili Wu, James Willson, Hongjie Du, Wonjun Lee
• Keywords: Communications, Directional Antennas, General Directed Graph, INFOCOM 2011, Wireless Networks