Abstract

Approaches based on integer linear programming have been recently proposed for topology optimization in wireless sensor networks. They are, however, based on over-theoretical, unrealistic models. Our aim is to show that it is possible to accommodate realistic models for energy consumption and communication protocols into integer linear programming. We analyze the maximum lifetime broadcasting topology problem and we present realistic models that are also shown to provide efficient and practical solving tools. We present a strategy to substantially speed up the convergence of the solving process of our algorithm. This strategy introduces a practical drawback, however, in the characteristics of the optimal solutions retrieved. A method to overcome this drawback is discussed. Computational experiments are reported.

Highlights

  • Since the very beginning of research in the area of wireless sensor networks, one of the major issues has been saving power

  • The objective of the problem we model is maximizing the lifetime of wireless sensor networks [16]

  • The speed-up strategy we have proposed in Section 6 has a practical drawback, which is clear from the example reported in Figures 3: in the optimal solution reported in Figure 3(c), there are many nodes transmitting to a power which is higher than necessary

Read more

Summary

Introduction

Since the very beginning of research in the area of wireless sensor networks, one of the major issues has been saving power This optimization is typically faced during the design, and prior the deployment of the nodes of a network. Such a high attention for this factor is easy to identify: the nodes of the network (devices) are typically equipped with low capacity, tiny batteries, and they have to stay alive in the longest possible time horizon. This in an environment usually characterized by reduced accessibility.

Methods
Results
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.