Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection
IEEE Transactions on Parallel and Distributed Systems
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Challenges: towards truly scalable ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Robust sensor self-initialization: Whispering to avoid intruders
SECUREWARE '07 Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies
A survey of clustering schemes for mobile ad hoc networks
IEEE Communications Surveys & Tutorials
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.01 |
Initialization is an indispensable process for wireless sensor networks since newly deployed sensors lack a reliable infrastructure for communication. Many efforts have been made to address the problem on initialization. However, most of them fall into the category of energy efficiency. In missioncritical scenarios, it is vital to reduce the initialization time in order to gather information as early as possible. In this paper, we study a new problem of accelerating initialization. First, we provide a novel parallel initialization mechanism that selects cluster heads before deployment and organizes singlehop clusters simultaneously after random deployment. Then, we prior-estimate that the number of cluster head candidates from n sensors is Θ (log n). Finally, simulation results show that these cluster head candidates can achieve the parallel initialization bounded by 16 time slots even for a large n.