Efficient construction of connected dominating set in wireless ad hoc networks

No abstract is available for this paper.

• Publication year

  2004

• Venue

  2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)

• Publication date

  2004-10-25

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/MAHSS.2004.1392211
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Constant-time distributed dominating set approximation

  2003cited by this paper
• Ad hoc On-Demand Distance Vector (AODV) Routing

  2003cited by this paper
• A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks

  2003cited by this paper
• Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

  2002cited by this paper
• New distributed algorithm for connected dominating set in wireless ad hoc networks

  2002cited by this paper
• Distributed heuristics for connected dominating sets in wireless ad hoc networks

  2002cited by this paper
• Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks

  2001cited by this paper
• On calculating connected dominating set for efficient routing in ad hoc wireless networks

  1999cited by this paper
• Propagation and Leader Election in a Multihop Broadcast Environment

  1998cited by this paper
• Routing in ad-hoc networks using minimum connected dominating sets

  1997cited by this paper
• Approximation Algorithms for NP-Hard Problems

  1997cited by this paper
• Routing in ad hoc networks using a spine

  1997cited by this paper
• Hardness of approximations

  1996cited by this paper
• Dynamic Source Routing in Ad Hoc Wireless Networks

  1994cited by this paper
• Simple heuristics for unit disk graphs

  1994cited by this paper
• Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

  1994cited by this paper
• Unit disk graphs

  1991cited by this paper
• Finding small dominating sets in stationless mobile packet radio networks Abhay K. Parekh.

  1991cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm

  1981cited by this paper
• Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran

  1979cited by this paper
• Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

  1979cited by this paper

• An Overview of Own Tracking Wireless Sensors with GSM-GPS Features

  2021cites this paper
• Using NDN in Improving Energy Efficiency of MANET

  2019cites this paper
• An Integrated Defense Approach for Distributed Denial of Service Attacks In Mobile Ad-Hoc Network

  2016cites this paper
• A STUDY AND AN ANALYSIS TO MITIGATE DISTRIBUTED DENIAL OF SERVICE ATTACKS IN MOBILE AD-HOC NETWORK

  2016cites this paper
• Efficient content delivery in mobile ad-hoc networks using CCN

  2016cites this paper
• Crytography Bases Solution FOR Distributed Denial of Service Attack in Manet

  2016cites this paper
• Energy-Efficient Content Distribution in Mobile Ad-hoc Networks using CCN

  2014cites this paper
• Network connectivity maintenance of WSNs in node failure-prone environment: A detailed survey

  2014cites this paper
• A Novel Solution to Handle DDOS Attack in MANET

  2013cites this paper
• On Constructing 2-Connected2-Dominating Set Using Distributed Algorithm

  2013cites this paper
• An Efficient Scheduling Model for Broadcasting in Wireless Sensor Networks

  2013influential citation
• Energy-Efficient Algorithm for Broadcasting in Ad Hoc Wireless Sensor Networks

  2013cites this paper
• Energy-awareness in multihop routing

  2012cites this paper
• Mobility management algorithms and applications for mobile sensor networks

  2012cites this paper
• Analyzing multi-hop routing feasibility for sensor data harvesting using mobile sinks

  2012cites this paper
• A survey on energy efficient techniques in wireless sensor networks

  2011cites this paper
• Simple algorithm for solving broadcast storm in mobile ad hoc network

  2011cites this paper
• An Efficient Data-Gathering Scheme for Heterogeneous Sensor Networks via Mobile Sinks

  2011cites this paper
• Network-assisted sink navigation for distributed data gathering: Stability and delay-energy trade-offs

  2010cites this paper
• Energy efficiency in wireless ad hoc and sensor networks: routing, node activity scheduling and cross-layering

  2010cites this paper
• A Power Aware Minimum Connected Dominating Set for Wireless Sensor Networks

  2009cites this paper
• Local Repair for Extending Lifetime of Wireless Sensor Networks

  2009cites this paper
• Efficient Distributed Algorithms for Topology Control Problem with Shortest Path Constraints

  2009cites this paper
• A Heuristic for Minimum Connected Dominating Set with Local Repair for Wireless Sensor Networks

  2009cites this paper
• Survey of Energy Efficient Strategies in Wireless Ad Hoc and Sensor Networks

  2008cites this paper
• A balanced 1-hop clustering scheme for Mobile Ad Hoc Network

  2008cites this paper
• Joint routing and navigation protocols for data harvesting in sensor networks

  2008cites this paper
• Data harvesting in sensor networks using mobile sinks

  2008cites this paper
• Optimal distributed algorithm for minimum connected dominating sets in Wireless Sensor Networks

  2008cites this paper
• PRACTICAL ASPECTS OF MOBILITY IN WIRELESS SELF-ORGANIZING NETWORKS

  2008cites this paper
• Network-Assisted Sink Navigation Protocols for Data Harvesting in Sensor Networks

  2008cites this paper
• Techniques for maintaining connectivity in wireless ad-hoc networks under energy constraints

  2007cites this paper