Uniform Leader Election Protocols for Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Hardware design experiences in ZebraNet
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Training a wireless sensor network
Mobile Networks and Applications
Coloring the square of a planar graph
Journal of Graph Theory
Efficient corona training protocols for sensor networks
Theoretical Computer Science
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Asynchronous Corona Training Protocols in Wireless Sensor and Actor Networks
IEEE Transactions on Parallel and Distributed Systems
Cooperative training for high density sensor and actor networks
IEEE Journal on Selected Areas in Communications
Efficient Location Training Protocols for Heterogeneous Sensor and Actor Networks
IEEE Transactions on Mobile Computing
Collision-free routing in sink-centric sensor networks with coarse-grain coordinates
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Wireless sensor networks: leveraging the virtual infrastructure
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
When the environment does not allow direct access to disseminated data, a sensor network could be one of the most appropriate solutions to retrieve the map of interesting areas. Based on existing approaches, we start our study from the standard random deployment of a sensor network and then we consider a coarse-grain localization algorithm that associates sensors with coordinates related to a central node, called the sink. Once each sensor is associated with an estimated position, it starts to send data to the sink according to a designed schedule of communications that minimizes energy consumption and time by means of collisions avoidance. The outcome is a challenging combinatorial coloring problem for a specific graph class. We propose a schedule of communications based on distributed and fast coloring algorithms. The proposed solutions solve the underlying problems for the graphs of interest by means of an optimal, and in some cases near-optimal, number of colors. Finally, as the localization provides coarse-grain coordinates, different sensors might be associated with the same coordinates. Hence, in order to avoid that all such sensors perform the same actions (i.e., waste energy), a leader-election mechanism is considered.