Energy-aware routing algorithm for wireless sensor networks. (January 2015)

• Record Type: Journal Article
• Authors: Amgoth, Tarachand; Jana, Prasanta K.
• Is Part Of: Computers & electrical engineering. Volume 41(2015)
• Page Start: 357
• Page End: 367
• Publication Date: 2015-01
• Subjects: Wireless sensor networks -- Clustering -- Routing -- Energy efficient -- Network lifetime -- Energy consumption; Computer engineering -- Periodicals; Electrical engineering -- Periodicals; Electrical engineering -- Data processing -- Periodicals; Ordinateurs -- Conception et construction -- Périodiques; Électrotechnique -- Périodiques; Électrotechnique -- Informatique -- Périodiques; Computer engineering; Electrical engineering; Electrical engineering -- Data processing; Periodicals; Electronic journals; 621.302854
• DOI: 10.1016/j.compeleceng.2014.07.010
• Languages: English
• ISSNs: 0045-7906

Abstract

Graphical abstract: Highlights: A new energy aware routing algorithm has been proposed for cluster based wireless sensor networks. It achieves O (1) message complexity per sensor node and O ( n ) time complexity for a WSN having n sensor nodes. It efficiently forms the directed virtual backbone of cluster heads to facilitate data routing to the sink. It is successful in balancing the relaying load among the sensor nodes with respect to their residual energy. Abstract: The main constraint of wireless sensor networks (WSNs) is the limited and generally irreplaceable power source of the sensor nodes. Therefore, designing energy saving routing algorithm is one of the most focused research issues. In this paper, we propose an energy aware routing algorithm for cluster based WSNs. The algorithm is based on a clever strategy of cluster head (CH) selection, residual energy of the CHs and the intra-cluster distance for cluster formation. To facilitate data routing, a directed virtual backbone of CHs is constructed which is rooted at the sink. The proposed algorithm is also shown to balance energy consumption of the CHs during data routing process. We prove that the algorithm achieves constant message and linear time complexity. We test the proposed algorithm extensively. The experimental results show that the algorithm outperforms other existing algorithms in terms of network lifetime, energy consumption and other parameters.