Extended dominating set in ad hoc networks using cooperative communication

Authors:
Jie Wu;Mihaela Cardei;Fei Dai;Shuhui Yang
Affiliations:
Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL;Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL;Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL;Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 3
Cited 1

An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Cooperative communication in wireless networks

IEEE Communications Magazine

Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a notion of extended dominating set whereby each node in an ad hoc network is covered by either a dominating neighbor or several 2-hop dominating neighbors. This work is motivated by cooperative communication in ad hoc networks where transmitting independent copies of a packet generates diversity and combats the effects of fading. In this paper we propose several efficient heuristic algorithms for constructing a small extended dominating set.