Message-efficient CDS construction in MANETs

Authors:
Kazuya Sakai;Min-Te Sun;Wei-Shinn Ku
Affiliations:
Department of Computer Science and Software Engineering, Auburn University, Auburn, Alabama;Department of Computer Science and Information Engineering, National Central University, Taoyuan, Taiwan;Department of Computer Science and Software Engineering, Auburn University, Auburn, Alabama
Venue:
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Year:
2010

Citing 8
Cited 1

Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links

IEEE Transactions on Parallel and Distributed Systems
Distributed construction of connected dominating set in wireless ad hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
A Timer-based Protocol for Connected Dominating Set Construction in IEEE 802.11 Multihop Mobile Ad Hoc Networks

SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks

ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Fast connected dominating set construction in mobile ad hoc networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications

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

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The connected dominating set (CDS) has been extensively used for routing and broadcast in mobile ad hoc networks (MANETs). Due to the nature of MANETs, it is preferred that the CDS protocol not only creates a CDS with small size, but also incurs less communication and computational overhead, adapts to the nodal mobility, and generates CDS as quickly as possible. While the CDS protocols developed in the past create small size of CDS, they tend to incur too much communication overhead. In this paper, we propose the Message-Efficient Dominator Tree Connection algorithm (ME-DTC), which significantly reduces the number of control messages during the tree connection phase in Tree-based CDS protocols. By incorporating this algorithm with the Multi-Initiator CDS protocol, we have a CDS protocol which meets all the desirable features in MANETs. The simulation as well as analytical results validate that our proposed algorithm achieves its design goals.