Channel Assignment on Strongly-Simplicial Graphs
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Wakeup scheduling in wireless sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Distributed time-optimal scheduling for convergecast in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quick convergecast in ZigBee beacon-enabled tree-based wireless sensor networks
Computer Communications
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
Scheduling for information gathering on sensor network
Wireless Networks
Understanding the real behavior of Mote and 802.11 ad hoc networks: an experimental approach
Pervasive and Mobile Computing
TDMA scheduling algorithms for wireless sensor networks
Wireless Networks
The capacity of wireless networks
IEEE Transactions on Information Theory
Lower bounds on data collection time in sensory networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Convergecast is a typical form of data collection in wireless sensor networks (WSNs), wherein nodes sample data from the environment and send them to a common destination. In order to prolong the network lifetime, a duty-cycle mechanism is usually coupled with a routing tree structure, in which nodes are organized in clusters. Each cluster aggregates data and sends them towards the root of the tree. However, clusters can interfere each other if their active time is not properly chosen. Furthermore, scheduling can lead to a long data delivery delay when a duty-cycle mechanism is used. In this article, we introduce a receiver-oriented scheduling algorithm for cluster-tree WSNs which provides a bounded latency for convergecast data collection. In contrast with most of the existing works in the literature, where two nodes are assumed to interfere if they are at most 2 hops away, we address the more general and realistic case where interfering nodes can be up to t hops away from each other, where te2. We first show that the minimum-latency convergecast problem is NP-hard for cluster-based WSNs with arbitrary topologies. We then focus on tree-based WSNs and derive bounds on the latency for convergecast data collection. We also propose a heuristic to obtain a t-interference-free scheduling in O(nt) time, where n is the number of clusters in the WSN. We finally validate our findings by simulation on both synthetic topologies and routing trees obtained from WSN deployments.