Skip to main content

Advertisement

SpringerLink
Log in

Interval graph based energy efficient routing scheme for a connected topology in wireless sensor networks

  • Original Paper
  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Energy conservation has always been a major issue in wireless sensor network since wireless sensors spend lots of energy while sensing, receiving and transmitting signals, meanwhile network lifetime decreases. Excessive power usage in transmission among the sensors can be reduced by designing an energy efficient routing topology which reduces nodes’ energy consumption by abandoning those links which are highly energy expensive. In this paper, energy optimizing algorithms are taken over those wireless sensor network whose graphical layout formation can be a ‘connected bidirectional interval graph’, in which each node has been assigned with an appropriate power interval to hold network communication. Two new polynomial time algorithms are proposed to optimize energy consumption over the network subject to constraint that the resultant network topology remains strongly connected with minimum number of required links. Both the algorithms work to evaluate an energy optimal path cover whose path components combine to result an energy efficient connected routing structure (spanning path/tree) in an interval graph, reduces power usage over links and nodes in wireless sensor network. Optimization of maximum transmission cost in worst case scenario over a maximum weighted bidirectional interval graph and reduction of maximum power consumption limit of nodes in an interval weighted interval graph to the minimum possible value are also discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20

Similar content being viewed by others

References

  1. Abd Aziz, A., Sekercioglu, Y. A., Fitzpatrick, P., & Ivanovich, M. (2012). A survey on distributed topology control techniques for extending the lifetime of battery powered wireless sensor networks. IEEE Communications Surveys & Tutorials, 15(1), 121–144.

    Article  Google Scholar 

  2. Aneja, Y. P., Chandrasekaran, R., Li, X., & Nair, K. (2010). A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks. European Journal of Operational Research, 204(3), 604–612.

    Article  MathSciNet  Google Scholar 

  3. Arikati, S. R., & Rangan, C. P. (1990). Linear algorithm for optimal path cover problem on interval graphs. Information Processing Letters, 35(3), 149–153.

    Article  MathSciNet  Google Scholar 

  4. Basagni, S., Chlamtac, I., Syrotiuk, V. R., & Woodward, B. A. (1998). A distance routing effect algorithm for mobility (dream). In Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking (pp. 76–84)

  5. Booth, K. S., & Lueker, G. S. (1976). Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. Journal of Computer and System Sciences, 13(3), 335–379.

    Article  MathSciNet  Google Scholar 

  6. Burkhart, M., Von Rickenbach, P., Wattenhofer, R., & Zollinger, A. (2004). Does topology control reduce interference? In Proceedings of the 5th ACM international symposium on mobile ad hoc networking and computing (pp. 9–19)

  7. Carlos-Mancilla, M., López-Mellado, E., & Siller, M. (2016). Wireless sensor networks formation: approaches and techniques. Journal of Sensors, 2016.

  8. Cheng, X., Narahari, B., Simha, R., Cheng, M. X., & Liu, D. (2003). Strong minimum energy topology in wireless sensor networks: Np-completeness and heuristics. IEEE Transactions on Mobile Computing, 2(3), 248–256.

    Article  Google Scholar 

  9. Khemapech, I., Miller, A., & Duncan, I. (2007). A survey of transmission power control in wireless sensor networks. Proc. PGNet, (pp. 15–20).

  10. Lakshmi, M. P., et al. (2019). Minimizing the total range with two power levels in wireless sensor networks. In Advanced Computing and Communication Technologies (pp. 183–191).

  11. Lakshmi, M. P., & Pushparaj, S. D. (2018). Range assignment with k-power levels in a wireless sensor network. 2018 IEEE Distributed Computing (pp. 18–23). Electrical Circuits and Robotics (DISCOVER): VLSI.

  12. Lakshmi, M. P., & Pushparaj Shetty, D. (2019). Optimal algorithm for minimizing interference with two power levels in wireless sensor networks. Journal of Communications, 14(12)

  13. Li, D., Du, H., Liu, L., & Huang, S.C.-H. (2008). Joint topology control and power conservation for wireless sensor networks using transmit power adjustment. In International computing and combinatorics conference (pp. 541–550).

  14. Li, L., & Halpern, J. Y. (2004). A minimum-energy path-preserving topology-control algorithm. IEEE Transactions on Wireless Communications, 3(3), 910–921.

    Article  Google Scholar 

  15. Li, L., Halpern, J. Y., Bahl, P., Wang, Y.-M., & Wattenhofer, R. (2005). A cone-based distributed topology-control algorithm for wireless multi-hop networks. IEEE/ACM Transactions on Networking, 13(1), 147–159.

    Article  Google Scholar 

  16. Li, X., Feng, H., Jiang, H., & Zhu, B. (2016). A polynomial time algorithm for finding a spanning tree with maximum number of internal vertices on interval graphs. International Workshop on Frontiers in Algorithmics, 92–101.

  17. Marks, M., & Niewiadomska-Szynkiewicz, E. (2011). Self-adaptive localization using signal strength measurements. In Proc. Fifth Int. Conf. Sensor Technol. Appl. SENSORCOMM, vol. 2011 (pp. 73–78).

  18. Moaveninejad, K., & Li, X.-Y. (2005). Low-interference topology control for wireless ad hoc networks. Ad Hoc & Sensor Wireless Networks, 1(1–2), 41–64.

    Google Scholar 

  19. Moscibroda, T., & Wattenhofer, R. (2005). Minimizing interference in ad hoc and sensor networks. In Proceedings of the 2005 joint workshop on Foundations of mobile computing (pp. 24–33).

  20. Panda, B., Bhatta, B., Mishra, D., & De, S. (2015). Boruvka-incremental power greedy heuristic for strong minimum energy topology in wireless sensor networks. In Proceedings of the 2015 International Conference on Distributed Computing and Networking (pp. 1–8).

  21. Panda, B., Bhatta, B., Mishra, D., & De, S. (2017). New heuristics for strong minimum energy topology with reduced time complexity. In 2017 IEEE International Conference on Advanced Networks and Telecommunications Systems (pp. 1–6).

  22. Panda, B., & Shetty, D. P. (2011). An incremental power greedy heuristic for strong minimum energy topology in wireless sensor networks. International conference on distributed computing and internet technology (pp. 187–196).

  23. Panda, B., & Shetty, D. P. (2013). Minimum interference strong bidirectional topology for wireless sensor networks. International Journal of Ad Hoc and Ubiquitous Computing, 13(3–4), 243–253.

    Article  Google Scholar 

  24. Ramalingam, G., & Rangan, C. P. (1988). A unified approach to domination problems on interval graphs. Information Processing Letters, 27(5), 271–274.

    Article  MathSciNet  Google Scholar 

  25. Santi, P. (2005). Topology control in wireless ad hoc and sensor networks. ACM Computing Surveys (CSUR), 37(2), 164–194.

    Article  Google Scholar 

  26. Sharma, A. K., Thakral, N., Udgata, S. K., & Pujari, A. K. (2009). Heuristics for minimizing interference in sensor networks. In International Conference on Distributed Computing and Networking (pp. 49–54).

  27. Singla, P., & Munjal, A. (2020). Topology control algorithms for wireless sensor networks: A review. Wireless Personal Communications, 113, 1–23.

    Article  Google Scholar 

  28. Von Rickenbach, P., Wattenhofer, R., & Zollinger, A. (2009). Algorithmic models of interference in wireless ad hoc and sensor networks. IEEE/ACM Transactions on Networking, 17(1), 172–185.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Delhi Technological University, Bawana Road, Rohini, Delhi, India

    Radhika Kavra, Anjana Gupta & Sangita Kansal

Authors
  1. Radhika Kavra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anjana Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sangita Kansal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anjana Gupta.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supplementary Information

Below is the link to the electronic supplementary material.

Supplementary material 1 (py 7 KB)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kavra, R., Gupta, A. & Kansal, S. Interval graph based energy efficient routing scheme for a connected topology in wireless sensor networks. Wireless Netw 27, 5085–5104 (2021). https://doi.org/10.1007/s11276-021-02782-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-021-02782-0

Keywords

Search

Navigation