Maximum lifetime broadcasting in cooperative multi-hop wireless ad hoc networks

被引:3
作者
Acharya, Tamaghna [2 ]
Chattopadhyay, Samiran [1 ]
Roy, Rajarshi [3 ]
机构
[1] Jadavpur Univ, Dept Informat Technol, Kolkata 700098, India
[2] BESU, Dept ETCE, Sibpur 711103, Howrah, India
[3] Indian Inst Technol, Dept Elect & Elect Commun Engn, Kharagpur 721302, W Bengal, India
关键词
wireless ad hoc networks; maximum lifetime broadcast; cooperative transmission; minimising broadcast power; performance evaluation; greedy algorithm; broadcast tree; omni-directional antenna; polynomial time algorithm;
D O I
10.1504/IJAHUC.2010.033822
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We investigate the scope of using cooperative routing for maximising network lifetime for a given broadcast connection in an energy-constrained multi-hop static wireless ad-hoc network Unlike existing broadcast algorithms which have formulated lifetime maximisation as a min-max tree problem our formulation reflects node-based nature of wireless networks We consider three different transmission techniques at the physical layer point-to-point point-to-multipomt (i.e., multicast) multipoint-to-point (i.e, cooperative transmission) We propose a polynomial time algorithm for lifetime maximising broadcast tree construction Simulation results show that our algorithm outperforms the global optimal solution that achieves maximum network lifetime without using cooperation
引用
收藏
页码:10 / 23
页数:14
相关论文
共 22 条