### Abstract

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 NP-hard 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 approximation algorithm for constructing MOC-DVB with approximation ratio of 1 + lnK + 2lnδ_{D}, where K is the number of antennas on each node and _{D} is the maximum direction degree in the network. Extensive simulations demonstrate that our constructed MOC-DVB is much more efficient in the sense of MOC-DVB size and routing cost compared to other VBs.

Original language | English |
---|---|

Title of host publication | 2011 Proceedings IEEE INFOCOM |

Pages | 1557-1565 |

Number of pages | 9 |

DOIs | |

Publication status | Published - 2011 |

Event | IEEE INFOCOM 2011 - Shanghai, China Duration: 2011 Apr 10 → 2011 Apr 15 |

### Publication series

Name | Proceedings - IEEE INFOCOM |
---|---|

ISSN (Print) | 0743-166X |

### Other

Other | IEEE INFOCOM 2011 |
---|---|

Country | China |

City | Shanghai |

Period | 11/4/10 → 11/4/15 |

### ASJC Scopus subject areas

- Computer Science(all)
- Electrical and Electronic Engineering

## Fingerprint Dive into the research topics of 'Construction of directional virtual backbones with minimum routing cost in wireless networks'. Together they form a unique fingerprint.

## Cite this

*2011 Proceedings IEEE INFOCOM*(pp. 1557-1565). [5934946] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2011.5934946