Distributed algorithms for connected domination in wireless networks
Authors:
- Rajiv GandhiRGRajiv Gandhi
- Srinivasan ParthasarathySPSrinivasan Parthasarathy
- 1 July 2007
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 67 (7) , 848-862
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- An extended localized algorithm for connected dominating set formation in ad hoc wireless networksIEEE Transactions on Parallel and Distributed Systems, 2004
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKSInternational Journal of Foundations of Computer Science, 2003
- An efficient distributed algorithm for constructing small dominating setsDistributed Computing, 2002
- Extended dominating-set-based routing in ad hoc wireless networks with unidirectional linksIEEE Transactions on Parallel and Distributed Systems, 2002
- Dominating‐Set‐Based Routing in Ad Hoc Wireless Networks2002
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- Simple heuristics for unit disk graphsNetworks, 1995
- Removing randomness in parallel computation without a processor penaltyJournal of Computer and System Sciences, 1993
- Scheduling algorithms for multihop radio networksIEEE/ACM Transactions on Networking, 1993
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986