Discrete Mathematics - Topics on domination
Computer networks (3rd ed.)
Multicluster, mobile, multimedia radio network
Wireless Networks
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
Path-based depth-first search for strong and biconnected components
Information Processing Letters
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Efficient flooding with Passive Clustering (PC) in ad hoc networks
ACM SIGCOMM Computer Communication Review
Algorithms in C
Introduction to Algorithms
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
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
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
On Constructing k-Connected k-Dominating Set in Wireless Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Fault-Tolerant Beacon Vector Routing for Mobile Ad Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17
Efficient Broadcasting with Guaranteed Coverage in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs
IEEE Transactions on Computers
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison
IEEE Transactions on Parallel and Distributed Systems
Efficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas
IEEE Transactions on Parallel and Distributed Systems
A Mobility-Resistant Efficient Clustering Approach for ad hoc and sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
The Geodesic Broadcast Scheme for Wireless Ad Hoc Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Efficient Distributed Low-Cost Backbone Formation for Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication
IEEE Transactions on Parallel and Distributed Systems
Clustering wireless ad hoc networks with weakly connected dominating set
Journal of Parallel and Distributed Computing
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Backbone construction in selfish wireless networks
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
IEEE Transactions on Mobile Computing
Distributed algorithms for connected domination in wireless networks
Journal of Parallel and Distributed Computing
Enabling SIP-based sessions in ad hoc networks
Wireless Networks
A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
ACM SIGMOBILE Mobile Computing and Communications Review
Energy conservation in wireless sensor networks and connectivity of graphs
Theoretical Computer Science
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Minimization of the Redundant Coverage for Dense Wireless Sensor Networks
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Octopus: a fault-tolerant and efficient ad-hoc routing protocol
Wireless Networks
Maintaining CDS in Mobile Ad Hoc Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Efficient location-aided flooding scheme initiated by receiver for MANETs
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Pervasive and Mobile Computing
A local algorithm for dominating sets of quasi-unit disk graphs
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Cross layering in wireless sensor networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Energy-Efficient Composite Event Detection in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Fast track article: Improved sensor network lifetime with multiple mobile sinks
Pervasive and Mobile Computing
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
A new local algorithm for backbone formation in ad hoc networks
Proceedings of the 6th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Efficient flooding scheme based on regular polygonal tiling in wireless ad hoc networks
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Improving network lifetime with mobile wireless sensor networks
Computer Communications
Hypothesis test of moving status for target localization algorithm in WSN
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A Distributed Intelligent Broadcasting Protocol for Mobile Ad Hoc Networks
Mobile Networks and Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Discrete Applied Mathematics
An energy efficient connected coverage protocol in wireless sensor networks
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
A location aided flooding protocol for wireless ad hoc networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Vertex domination in dynamic networks
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
An adaptive self-organizing protocol with multiple stages for wireless mesh networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Triangular tiling-based efficient flooding scheme in wireless ad hoc networks
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
Backbone construction for heterogeneous wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
GMPLS network reliability enhancement by using the dominating nodes approach
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Fast connected dominating set construction in mobile ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks
The Journal of Supercomputing
VBS: maximum lifetime sleep scheduling for wireless sensor networks using virtual backbones
INFOCOM'10 Proceedings of the 29th conference on Information communications
Message-efficient CDS construction in MANETs
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
On quantifying the quality of CDS-based virtual backbones in mobile ad hoc networks
Proceedings of the 8th ACM international workshop on Mobility management and wireless access
Performance evaluation of distributed self-organization protocols in wireless sensor networks
Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
Journal of Parallel and Distributed Computing
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
IEEE Transactions on Communications
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy efficient mobile routing in actuator and sensor networks with connectivity preservation
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
An exact algorithm for the Maximum Leaf Spanning Tree problem
Theoretical Computer Science
Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks
Journal of Parallel and Distributed Computing
An efficient distributed algorithm for finding virtual backbones in wireless ad-hoc networks
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Strongly connected dominating sets in wireless sensor networks with unidirectional links
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
A dominating set based clustering algorithm for mobile ad hoc networks
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Distributed approximation algorithms in unit-disk graphs
DISC'06 Proceedings of the 20th international conference on Distributed Computing
On the minimization of the number of forwarding nodes for multicast in wireless ad hoc networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Efficient broadcasting in ad hoc networks using directional antennas
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
Extended dominating set in ad hoc networks using cooperative communication
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
Distributed clustering algorithm for finding virtual backbone in ad hoc networks
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Load-balanced CDS construction in wireless sensor networks via genetic algorithm
International Journal of Sensor Networks
STAB-WIN: Self Organized, Topology Control Ability Backbone Node in Wireless Networks
Wireless Personal Communications: An International Journal
Finding minimum weight connected dominating set in stochastic graph based on learning automata
Information Sciences: an International Journal
An adaptive backbone formation algorithm for wireless sensor networks
Computer Communications
Journal of Combinatorial Optimization
A location-unaware connected coverage protocol in wireless sensor networks
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Distributed approximations for packing in unit-disk graphs
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Handling large-scale node failures in mobile sensor/robot networks
Journal of Network and Computer Applications
Management Scheme for Data Collection within Wireless Sensor Networks
International Journal of Adaptive, Resilient and Autonomic Systems
An adaptive connectivity restoration algorithm for wireless sensor and actor networks
International Journal of Autonomous and Adaptive Communications Systems
Connected dominating set algorithms for wireless sensor networks
International Journal of Sensor Networks
An energy-efficient topology construction algorithm for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Mobility-Based Backbone Formation in Wireless Mobile Ad-hoc Networks
Wireless Personal Communications: An International Journal
Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
Theoretical Computer Science
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
Mobile Networks and Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dominating problems in swapped networks
Information Sciences: an International Journal
Detection and replacement of a failing node in the wireless sensors networks
Computers and Electrical Engineering
Hi-index | 0.01 |
Efficient routing among a set of mobile hosts is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in the system are either in the set or neighbors of hosts in the set. The efficiency of dominating-set-based routing mainly depends on the overhead introduced in the formation of the dominating set and the size of the dominating set. In this paper, we first review a localized formation of a connected dominating set called marking process and dominating-set-based routing. Then, we propose a dominant pruning rule to reduce the size of the dominating set. This dominant pruning rule (called Rule k) is a generalization of two existing rules (called Rule 1 and Rule 2, respectively). We prove that the vertex set derived by applying Rule k is still a connected dominating set. Rule k is more effective in reducing the dominating set derived from the marking process than the combination of Rules 1 and 2 and, surprisingly, in a restricted implementation with local neighborhood information, Rule k has the same communication complexity and less computation complexity. Simulation results confirm that Rule k outperforms Rules 1 and 2, especially in networks with relatively high vertex degree and high percentage of unidirectional links. We also prove that an upper bound exists on the average size of the dominating set derived from Rule k in its restricted implementation.