Multicast communications in Ad hoc networks using directional antennas:: A lifetime-centric approach

被引:18
作者
Hou, Y. Thomas [1 ]
Shi, Yi
Sherali, Hanif D.
Wieselthier, E.
机构
[1] Virginia Tech, Bradley Dept Elect & Comp Engn, Blacksburg, VA 24061 USA
[2] Virginia Tech, Grado Dept Ind & Syst Engn, Blacksburg, VA 24061 USA
[3] USN, Res Lab, Informat Technol Div, Washington, DC 20375 USA
基金
美国国家科学基金会;
关键词
Ad hoc networks; directional antenna; energy constraint; multicast; network lifetime; online algorithm; optimization; wireless communications;
D O I
10.1109/TVT.2007.895478
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We consider a wireless ad hoc network where each node employs a single-beam directional antenna and is provisioned with limited energy. We are interested in an online routing algorithm for successive multicast communication requests with the aim of maximizing the network lifetime. The beam-forming property, which is associated with single-beam directional antennas, introduces some unique problems that do not exist for omnidirectional antennas and, therefore, significantly increases the design space for routing algorithms. The contributions of this paper are twofold. First, we provide some important theoretical understanding on various multicast problems and deduce that even an offline version of this problem is NP-hard. Second, we develop a highly competitive online routing algorithm that takes the network lifetime consideration directly into iterative calculations and show that an algorithm that is designed under this methodology provides consistently better performance than the current state-of-the-art algorithm that only considers remaining energy. The theoretical results and routing algorithm in this paper offer some important insights on algorithm design for energy-constrained wireless ad hoc networks with directional antennas.
引用
收藏
页码:1333 / 1344
页数:12
相关论文
共 26 条
  • [1] Adamou M, 2002, IEEE INFOCOM SER, P1783, DOI 10.1109/INFCOM.2002.1019432
  • [2] Agarwal M, 2004, IEEE INFOCOM SER, P2096
  • [3] [Anonymous], P WORKSH FDN MOB COM
  • [4] Blough DM., 2002, P 8 ANN INT C MOB CO, P183, DOI DOI 10.1145/570645.570668
  • [5] Cagalj M., 2002, P 8 ANN INT C MOB CO, P172
  • [6] Cartigny J, 2003, IEEE INFOCOM SER, P2210
  • [7] Das AK, 2003, GLOB TELECOMM CONF, P523
  • [8] Das AK, 2003, GLOB TELECOMM CONF, P362
  • [9] Das AK, 2003, IEEE INFOCOM SER, P1001
  • [10] Garey MR, 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness