New methods to color the vertices of a graph
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Z-MAC: a hybrid MAC for wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
AINA '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications
TDMA-ASAP: Sensor Network TDMA Scheduling with Adaptive Slot-Stealing and Parallelism
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
| Hi-index | 0.00 |
Data gathering applications constitute the main class of applications supported by wireless sensor networks. However, these networks have resources of limited capacity. In this paper, we show how to use the resources more efficiently by reducing the energy required and improving both the throughput and end-to-end delays that can be provided to such applications. The proposed solution is based on graph coloring. It ensures parallel transmissions, taking advantage of spatial reuse. It allows data gathering in a single cycle, reducing the data gathering delays and ensuring a better time consistency of collected data. It considerably reduces energy consumption by allowing nodes to sleep. Unlike TDMA-ASAP, it allows an immediate acknowledgement of unicast transmissions. We compare the number of colors needed by TDMA-ASAP and our algorithm for different configurations of wireless sensor networks. We compute the benefits brought by our coloring algorithm, in terms of bandwidth, consumed energy and maximum end-to-end delays. We also apply our solution to a ZigBee network. With network calculus, we compute buffer dimensioning and end-to-end delays. We then show how the active period of ZigBee is reduced with our coloring algorithm and thus energy is more efficiently used.