A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A point-distribution index and its application to sensor-grouping in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
SenseWeb: An Infrastructure for Shared Sensing
IEEE MultiMedia
IEEE Communications Magazine
Reprogramming wireless sensor networks: challenges and approaches
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Many state-of-the-art wireless sensor networks have been equipped with reprogramming modules, e.g., those for software/firmware updates. System migration tasks such as software reprogramming however will interrupt normal sensing and data reporting operations of a sensor node. Although such tasks are occasionally invoked, the long time of such tasks may disable the network from detecting critical events, posing a severe threat to many sensitive applications. In this paper, we present the first formal study on the problem of downtime-free migration. We demonstrate that the downtime can effectively be eliminated, by partitioning the sensors into subsets, and let them perform migration tasks successively with the rest still performing normal services. We then present a series of effective algorithms, and further extend our solution to a practical distributed and localized implementation, namely, the Sensor Network Reconfiguration Protocol (SNRP). The performance of these algorithms have been evaluated through extensive simulations, and the results demonstrate that our algorithms achieve good balance between the sensing quality and system migration time.