A MATHEMATICAL PROGRAMMING APPROACH TO THE MULTI-ROUND TOPOLOGY CONSTRUCTION PROBLEM IN WIRELESS SENSOR NETWORKS A MATHEMATICAL PROGRAMMING APPROACH TO THE MULTI-ROUND TOPOLOGY CONSTRUCTION PROBLEM IN WIRELESS SENSOR NETWORKS
Access this Article
Search this Article
One of the important issues in wireless sensor networks is how to save power consumption and extend the network lifetime. For this purpose, various network topology construction algorithms have been studied. However, most of them are based on a method repeating single round optimization. In other words, by considering the energy dissipation of sensor nodes only in the next round, a network topology in the next round is constructed in a round-by-round manner. The set of the topology constructions based on such a round-by-round view may be far from the optimal solution to maximize the network lifetime. To address this issue, we take the energy dissipation of sensor nodes over multiple rounds into account, and we consider the problem as a multi-dimensional knapsack problem, which enables us to find optimal network topologies until at least one sensor node exhausts its battery power. We also propose a solution method to maximize the network lifetime. The computational experiments show that the proposed approach provides efficient topology construction in the wireless sensor network in terms of network lifetime compared to the cluster-based approach.
- Journal of the Operations Research Society of Japan
Journal of the Operations Research Society of Japan 55(3), 199-208, 2012
The Operations Research Society of Japan