Broadcast routing based on new link cost model for ad-hoc networks

Authors:
Chia-Hung Yen;Hwang-Cheng Wang
Affiliations:
National Ilan University, Taiwan, Taiwan Roc;National Ilan University, Taiwan, Taiwan Roc
Venue:
Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Year:
2008

Citing 7
Cited 0

Power-aware routing in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Introduction to Algorithms

Introduction to Algorithms
A note on greedy algorithms for the maximum weighted independent set problem

Discrete Applied Mathematics
Power Consumption in Packet Radio Networks (Extended Abstract)

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks

HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
Maximum lifetime routing in wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Minimizing broadcast latency in ad hoc wireless networks

ACM-SE 45 Proceedings of the 45th annual southeast regional conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

For many wireless applications such as group conference and digital audio/video broadcast, it is necessary to send data to all devices that form an ad-hoc network. In this paper, minimum cost broadcast routing (MCBR) and minimum cost broadcast routing with forbidden set (MCBRF) are proposed. We first formulate a new cost model for the underlying graph by considering the distance between nodes, the remaining battery energy, and battery discharge pattern at each node. A minimum cost broadcast routing (MCBR) based on minimum cost graph spanning is described. Then forbidden set is introduced into MCBR to obtain MCBRF. The performance of the algorithms is investigated through simulations and contrasted against several other routing methods. A set of performance metrics are defined. The results on a variety of topologies of different sizes indicate that the spanning tree constructed by MCBRF algorithm has more leaf nodes than BIP and MMLE. Although the broadcast trees constructed by MWIS and MCDS have more leaf nodes, they suffer serious drawbacks in terms of energy consumption. Also, MCBR and MCBRF generate spanning trees that select nodes with higher remaining battery capacity as relay nodes. Thus more robust broadcast routes are established.