Algorithms of Convergecast Schedule Calculation for a Sensor Network Model with Regular Grid Topology
Abstract
Introduction: In recent years, a new approach of information gathering has appeared in the area of distributed measuring systems, known as wireless sensor networks. This technique is very promising, but its efficient use in real applications requires developing special schemes of information message transmission which would prevent possible collisions. Purpose: Developing algorithms for wireless sensor networks with a 2D lattice topologies which would provide the shortest time of data gathering. Results: For wireless sensor networks with «all-to-one» logical structure and the topology of a triangular, rectangular or hexagonal grid, a group of collisionfree time-optimal algorithms have been proposed (N slots for a network containing N sensors). The obtained algorithms have polynomial complexity and can be implemented in modern hardware. Practical relevance: The results of the research can be used by the developers of distributed data gathering systems based on wireless sensor networks for the development of new communication protocols.Published
2017-12-20
How to Cite
Bakin, E., Evseev, G., & Smirnov, K. (2017). Algorithms of Convergecast Schedule Calculation for a Sensor Network Model with Regular Grid Topology. Information and Control Systems, (6), 107-112. https://doi.org/10.15217/issn1684-8853.2017.6.107
Issue
Section
Information channels and medium