On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Efficient flooding with Passive Clustering (PC) in ad hoc networks
ACM SIGCOMM Computer Communication Review
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A Distributed Formation of a Virtual Backbone in MANETs Using Adjustable Transmission Ranges
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-efficient broadcasting with cooperative transmissions in wireless sensor networks
IEEE Transactions on Wireless Communications
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Cooperative communication in wireless networks
IEEE Communications Magazine
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
Topology Control in Ad Hoc Wireless Networks Using Cooperative Communication
IEEE Transactions on Mobile Computing
Topology control algorithms in WISELIB
Proceedings of the 2010 ICSE Workshop on Software Engineering for Sensor Network Applications
Cooperative bridges: topology control in cooperative wireless ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Toward worm detection in online social networks
Proceedings of the 26th Annual Computer Security Applications Conference
Poly: A reliable and energy efficient topology control protocol for wireless sensor networks
Computer Communications
Energy efficient joint data aggregation and link scheduling in solar sensor networks
Computer Communications
Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks
Journal of Parallel and Distributed Computing
Journal of Combinatorial Optimization
Journal of Network and Computer Applications
Sleep-based topology control in the Ad Hoc networks by using fitness aware learning automata
Computers & Mathematics with Applications
An energy-efficient topology construction algorithm for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-balanced cooperative routing in multihop wireless networks
Wireless Networks
A cutting-plane algorithm for solving a weighted influence interdiction problem
Computational Optimization and Applications
Adding the Reliability on Tree Based Topology Construction Algorithms for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Topology Control in Cooperative Ad Hoc Wireless Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
We propose a notion of an extended dominating set where 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 whereby transmitting independent copies of a packet generates diversity and combats the effects of fading. We first show the NP-completeness of the minimum extended dominating set problem. Then, several heuristic algorithms, global and local, for constructing a small extended dominating set are proposed. These are nontrivial extensions of the existing algorithms for the regular dominating set problem. The application of the extended dominating set in efficient broadcasting is also discussed. The performance analysis includes an analytical study in terms of approximation ratio and a simulation study of the average size of the extended dominating set derived from the proposed algorithms.