An energy-efficient path determination strategy for mobile data collectors in wireless sensor network. (November 2015)

• Record Type: Journal Article
• Authors: Ghosh, Nimisha; Banerjee, Indrajit
• Is Part Of: Computers & electrical engineering. Volume 48(2015)
• Page Start: 417
• Page End: 435
• Publication Date: 2015-11
• Subjects: Wireless Sensor Network (WSN) -- Mobile collector -- Sojourn points (SPs) -- Data collection -- Obstacles; 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.2015.09.004
• Languages: English
• ISSNs: 0045-7906

Abstract

Graphical abstract: Abstract: In wireless sensor networks, introduction of mobility has been considered to be a good strategy to greatly reduce the energy dissipation of the static sensor nodes. This task is achieved by considering the path in which the mobile data collectors move to collect data from the sensors. In this work a data gathering approach is proposed in which some mobile collectors visit only certain sojourn points (SPs) or data collection points in place of all sensor nodes. The mobile collectors start out on their journey after gathering information about the network from the sink, gather data from the sensors and transfer the data to the sink. To address this problem, an algorithm named Mobile Collector Path Planning (MCPP) is proposed. MCPP schema is validated via computer simulation considering both obstacle free and obstacle-resisting network and based on metrics like energy consumption by the static sensor nodes and network life time. The simulation results show a reduction of about 12% in energy consumption and 15% improvement in network lifetime as compared with existing algorithms.