PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
An architecture for mobile radio networks with dynamically changing topology using virtual subnets
Mobile Networks and Applications - Special issue: mobility management
Multicluster, mobile, multimedia radio network
Wireless Networks
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
Fast distributed construction of small k-dominating sets and applications
Journal of Algorithms
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
The wakeup problem in synchronous broadcast systems (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection
IEEE Transactions on Parallel and Distributed Systems
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
A transmission control scheme for media access in sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Geometric Spanners for Wireless Ad Hoc Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Energy-efficient collision-free medium access control for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
ALOHA packet system with and without slots and capture
ACM SIGCOMM Computer Communication Review
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
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A distributed coordination framework for wireless sensor and actor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Power balanced coverage-time optimization for clustered wireless sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Scalable topology control for deployment-support networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor 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
Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing
Distributed algorithms for connected domination in wireless networks
Journal of Parallel and Distributed Computing
Key management for long-lived sensor networks in hostile environments
Computer Communications
A biologically-inspired clustering protocol for wireless sensor networks
Computer Communications
Communication and Coordination in Wireless Sensor and Actor Networks
IEEE Transactions on Mobile Computing
A novel cluster-header selection method in wireless sensor networks
EC'07 Proceedings of the 8th Conference on 8th WSEAS International Conference on Evolutionary Computing - Volume 8
An algorithmic approach to geographic routing in ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
An Adaptive Data Dissemination Strategy for Wireless Sensor Networks
International Journal of Distributed Sensor Networks - Heterogenous Wireless Ad Hoc and Sensor Networks
Ad hoc networks beyond unit disk graphs
Wireless Networks
CASAN: Clustering algorithm for security in ad hoc networks
Computer Communications
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Distributed global ID assignment for wireless sensor networks
Ad Hoc Networks
Coloring unstructured wireless multi-hop networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Scaling laws for data-centric storage and querying in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Algorithms for ad hoc and sensor networks
Computer Communications
IMSA '07 Proceedings of the Eleventh IASTED International Conference on Internet and Multimedia Systems and Applications
NoSE: efficient maintenance and initialization of wireless sensor networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
REputation based Clustering Algorithm for security management in ad hoc networks with liars
International Journal of Information and Computer Security
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Accelerating initialization for sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
IEEE/ACM Transactions on Networking (TON)
Structuring unreliable radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Sensor networks: distributed algorithms reloaded – or revolutions?
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Infrastructure-establishment from scratch in wireless sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Deterministic recurrent communication in restricted Sensor Networks
Theoretical Computer Science
Wireless networking: graph theory unplugged
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Distributed ($#916;+1)-coloring in the physical model
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Mobility-assisted minimum connected cover in a wireless sensor network
Journal of Parallel and Distributed Computing
Towards tight bounds for local broadcasting
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
A state-based model of sensor protocols
Theoretical Computer Science
Minimum connected cover of a query region in heterogeneous wireless sensor networks
Information Sciences: an International Journal
An early-stopping protocol for computing aggregate functions in Sensor Networks
Journal of Parallel and Distributed Computing
Efficient symmetry breaking in multi-channel radio networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Theoretical Computer Science
An energy aware fuzzy approach to unequal clustering in wireless sensor networks
Applied Soft Computing
Connectivity and aggregation in multihop wireless networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems existing during the initialization phase of ad hoc and sensor networks. Particularly, we model the network as a multi-hop quasi unit disk graph and allow nodes to wake up asynchronously at any time. Further, nodes do not feature a reliable collision detection mechanism, and they have only limited knowledge about the network topology. We show that even for this restricted model, a good clustering can be computed efficiently. Our algorithm efficiently computes an asymptotically optimal clustering. Based on this algorithm, we describe a protocol for quickly establishing synchronized sleep and listen schedule between nodes within a cluster. Additionally, we provide simulation results in a variety of settings.