Transmission range designation broadcasting methods for wireless ad hoc networks

Authors:
Jian-Feng Huang;Sheng-Yan Chuang;Sheng-De Wang
Affiliations:
Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan;Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan;Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan
Venue:
UIC'06 Proceedings of the Third international conference on Ubiquitous Intelligence and Computing
Year:
2006

Citing 11
Cited 0

The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Multicast tree construction and flooding in wireless ad hoc networks

Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Narrowband Land-Mobile Radio Networks

Narrowband Land-Mobile Radio Networks
Computer Networks

Computer Networks
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks

IEEE Transactions on Mobile Computing
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Power Adaptive Broadcasting with Local Information in Ad Hoc Networks

ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Ad Hoc Networking

Ad Hoc Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The broadcast operation in ad hoc wireless networks is essential, but expensive in terms of power consumption. In DP (dominant pruning) algorithms, the number of forward nodes is treated as a criterion to measure the consumed power. However, this principle is not suitable anymore if the power-adaptive characteristic is supported and each node can detect the strength of a received packet and tune its transmission power level. Thus, in this paper, we propose a modified version of the DP algorithm with the objective being to minimize the total power consumption of forward nodes. Comparing with original DP algorithms, the sender in our algorithm not only chooses its forward nodes, but also designates the transmission ranges of its forward nodes. As a result, the designated transmission ranges not only maintain the same coverage as DP algorithms, but also reduce the total power consumption. We propose a new forward nodes selection process where the weight of a node is dependent on the incremental transmission cost rather than the effective degree. Although the resultant number of forward nodes in the proposed approach is often greater than DP algorithms, the power consumption shown in simulations is less than DP algorithms.