Your browser does not support JavaScript!

Energy balanced optimum path determination based on graph theory for wireless sensor network

Energy balanced optimum path determination based on graph theory for wireless sensor network

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Wireless Sensor Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

One of the challenging tasks in wireless sensor network is to route data efficiently from source to destination. Sensors collect data from the sensor network area and pass on the aggregated data to the base station. Three techniques have been proposed in the literature: namely, direct, hierarchal and hybrid to fulfil this data transmission task. Sending data on a single path multiple times results in depletion of energy and hence failure of those nodes. Thus, a fault tolerance mechanism is essential for finding multiple disjoint paths for data transmission. In this mechanism, the system can switch from an inaccessible path with broken links to available candidate paths. In this study, a new graph theory method for optimal path selection based on quality of service parameters is proposed. To prolong the lifetime of the network, a fault tolerant mechanism is also adopted. Simulation results show that the proposed approach enhances network lifetime and improves path stability.


    1. 1)
      • 15. Roy, B., Choudhury, I., Sharma, A.R., et al: ‘Shortest path based geographical routing algorithm in wireless sensor network’. Proc. Communications, Devices and Intelligent Systems (CODIS), 2012, 2, pp. 262265, doi: 10.1109/CODIS.2012.6422188.
    2. 2)
    3. 3)
      • 10. Shah, R., Rabaey, J.: ‘Energy aware routing for low energy adhoc sensor networks’. Proc. IEEE Wireless Communications and Networking Conf. (IEEE WCNC'02), USA, Orlando, March 2002, pp. 350355.
    4. 4)
    5. 5)
    6. 6)
      • 9. Kumar, D.: ‘Performance analysis of energy efficient clustering protocols for maximizing lifetime of wireless sensor networks’, IET Wirel. Sensor Syst., 2014, 4, (1), p. 916.
    7. 7)
      • 4. Leiserson, C., Rivest, C.: ‘Introduction to algorithms’ (McGraw-Hill, Cambridge, UK, 2001, 2nd edn.).
    8. 8)
    9. 9)
    10. 10)
    11. 11)
      • 17. Krishnaveni, P., Seeni Sumaya, S.: ‘Energy balanced shortest path routing for wireless sensor networks’, Int. J. Eng. Res. Technol. (IJERT), 2013, 2, (6), pp. 397403, ISSN: 2278–0181.
    12. 12)
    13. 13)
      • 14. Pu, J., Tang, X., Wang, F., et al: ‘A multicast routing protocol with pruning and energy balancing for wireless sensor networks’, Int. J. Distrib. Sens. Netw., 2012, pp. 113.
    14. 14)
      • 18. Zhang, H., Shen, H.: ‘Balancing energy consumption to maximize network lifetime in data gathering sensor networks’, ACM Trans. Sens. Netw., 2009, 5, (2), pp. 125.
    15. 15)
    16. 16)
      • 5. Chanak, P., Banerjee, I.: ‘Distributed multipath fault tolerance routing scheme for wireless sensor network’. Proc. Int. Conf. on Advanced Computing and Computing Technologies, 2013, pp. 241247.
    17. 17)
    18. 18)
      • 16. Youssef, M., Younis, M., Arisha, K.A.: ‘A constrained shortest-path energy-aware routing algorithm for wireless sensor networks’. Proc. Wireless Communications and Networking Conf., IEEE, 2002, 2, pp. 794799, doi: 10.1109/WCNC.2002.993370.
    19. 19)
    20. 20)
    21. 21)
    22. 22)
      • 19. Hajian, E., Jamshidi, K., Bohlooli, A.: ‘Improve energy efficiency routing in WSN by using automata’, Comput. Commun., 2005, 29, (13), pp. 24822493.

Related content

This is a required field
Please enter a valid email address