A weight-value algorithm for finding connected dominating sets in a MANET

Authors:
Seiven Leu;Ruay-Shiung Chang
Affiliations:
Department of Computer Science and Information Engineering, National Dong Hwa University, No. 1, Sec. 2, Da Hsueh Road, Shoufeng, Hualien, Taiwan, ROC;Department of Computer Science and Information Engineering, National Dong Hwa University, No. 1, Sec. 2, Da Hsueh Road, Shoufeng, Hualien, Taiwan, ROC
Venue:
Journal of Network and Computer Applications
Year:
2012

Citing 14
Cited 0

The broadcast storm problem in a mobile ad hoc network

Wireless Networks - Selected Papers from Mobicom'99
Constant-time distributed dominating set approximation

Proceedings of the twenty-second annual symposium on Principles of distributed computing
The full steiner tree problem

Theoretical Computer Science
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs

IEEE Transactions on Computers
A simple improved distributed algorithm for minimum CDS in unit disk graphs

ACM Transactions on Sensor Networks (TOSN)
A location routing protocol based on smart antennas for ad hoc networks

Journal of Network and Computer Applications
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Minimizing broadcast latency and redundancy in ad hoc networks

IEEE/ACM Transactions on Networking (TON)
Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
A passive tree-based backbone construction scheme for MANETs

Computer Communications
Message-efficient CDS construction in MANETs

ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Building a trusted route in a mobile ad hoc network considering communication reliability and path length

Journal of Network and Computer Applications
An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, mobile devices are becoming popular and high-speed wireless communication is uproaring. In a wireless network environment, a mobile ad hoc network (MANET) has the characteristics of being infrastructure-free and self-organizing. Although the topology of MANET can be deployed easily with few restrictions, the maintenance faces great challenges. Furthermore, all nodes transmit packets by multi-hop in MANET. If transmission is by traditional broadcasting, it has a broadcasting storm problem and it can significantly reduce the wireless network throughput. The CDS (Connected Dominating Set) scheme is a well-known solution to the broadcasting storm problem. In a MANET, a virtual backbone network can be constructed by using CDS. All nodes can transmit data effectively through the virtual backbone network. In previous research on the subject, most algorithms are only suitable for a static MANET environment, with all nodes being stationary. This is contrary to the desirable characteristics of MANET. In this paper, we present an algorithm which is suitable for both static and dynamic MANET environments.