Energy-Efficient Algorithm for Data Path Selection in High-Density Wireless Sensor Networks

Relevance. Increasing the number of sensor devices per unit area consequently reduces the physical distance between the devices in the sensor network. Such networks are usually deployed over a large area and the sensor device that wants to transmit a data packet is located far away from the base station. In such a case, the source device is challenged to choose a transmission path that consumes the least amount of energy resources and satisfies the delivery time requirements. The objective of this study is to develop and validate the effectiveness of an empirical algorithm for selecting a transmission path that reduces the energy consumption of high-density wireless sensor networks. Methods of system analysis, analytical modeling, geometry and probability theories are used. Solution. It is assumed that the sensor network is deployed in a limited area and is a set of devices that are connected to each other informationally and energetically. When building data transmission routes, any sensor devices can be used as repeaters. At the same time, the increase in the number of repeaters leads to an increase in the time of data delivery. Novelty. It is assumed that the sensor network is deployed in a limited area and is a set of devices that are connected to each other informationally and energetically. Any sensor devices may be used as repeaters when constructing data transmission routes. Significance (theoretical). Dependences of power consumption level on various system parameters affecting the processes of functioning of high-density wireless sensor networks have been obtained. Significance (practical). The proposed empirical algorithm for selecting a rational data transmission route in a wireless sensor network allows us to determine, among all alternatives, the route to the coordinator that requires the least power. The effectiveness of the proposed empirical power-saving algorithm is confirmed by simulation modeling.