### Abstract

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 α Minimum rOuting Cost Directional VB (α-MOC-DVB). Besides the properties of regular VBs, α-MOC-DVB also has a special constraintfor any pair of nodes, there exists at least one path all intermediate directions on which must belong to α-MOC-DVB and the number of intermediate directions on the path is smaller than α times that on the shortest path. We prove that construction of a minimum α-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 α-MOC-DVB is much more efficient in the sense of VB size and routing costs compared to other VBs.

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

Article number | 6202811 |

Pages (from-to) | 1102-1112 |

Number of pages | 11 |

Journal | IEEE Transactions on Mobile Computing |

Volume | 11 |

Issue number | 7 |

DOIs | |

Publication status | Published - 2012 Jul 1 |

### Fingerprint

### Keywords

- connected dominating set
- Directional antennas
- general graph
- NP-hard
- obstacle
- routing costs
- virtual backbone
- wireless network

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Computer Networks and Communications
- Software

### Cite this

*IEEE Transactions on Mobile Computing*,

*11*(7), 1102-1112. [6202811]. https://doi.org/10.1109/TMC.2011.129

**Efficient virtual backbone construction with routing cost constraint in wireless networks using directional antennas.** / Ding, Ling; Wu, Weili; Willson, James; Du, Hongjie; Lee, Wonjun.

Research output: Contribution to journal › Article

*IEEE Transactions on Mobile Computing*, vol. 11, no. 7, 6202811, pp. 1102-1112. https://doi.org/10.1109/TMC.2011.129

}

TY - JOUR

T1 - Efficient virtual backbone construction with routing cost constraint in wireless networks using directional antennas

AU - Ding, Ling

AU - Wu, Weili

AU - Willson, James

AU - Du, Hongjie

AU - Lee, Wonjun

PY - 2012/7/1

Y1 - 2012/7/1

N2 - 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 α Minimum rOuting Cost Directional VB (α-MOC-DVB). Besides the properties of regular VBs, α-MOC-DVB also has a special constraintfor any pair of nodes, there exists at least one path all intermediate directions on which must belong to α-MOC-DVB and the number of intermediate directions on the path is smaller than α times that on the shortest path. We prove that construction of a minimum α-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 α-MOC-DVB is much more efficient in the sense of VB size and routing costs compared to other VBs.

AB - 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 α Minimum rOuting Cost Directional VB (α-MOC-DVB). Besides the properties of regular VBs, α-MOC-DVB also has a special constraintfor any pair of nodes, there exists at least one path all intermediate directions on which must belong to α-MOC-DVB and the number of intermediate directions on the path is smaller than α times that on the shortest path. We prove that construction of a minimum α-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 α-MOC-DVB is much more efficient in the sense of VB size and routing costs compared to other VBs.

KW - connected dominating set

KW - Directional antennas

KW - general graph

KW - NP-hard

KW - obstacle

KW - routing costs

KW - virtual backbone

KW - wireless network

UR - http://www.scopus.com/inward/record.url?scp=84861441534&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84861441534&partnerID=8YFLogxK

U2 - 10.1109/TMC.2011.129

DO - 10.1109/TMC.2011.129

M3 - Article

AN - SCOPUS:84861441534

VL - 11

SP - 1102

EP - 1112

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 7

M1 - 6202811

ER -