Predetermined path of mobile data gathering in wireless sensor networks based on network layout

• Main Authors: Ghaleb, Mukhtar, Subramaniam, Shamala, Othman, Mohamed, Ahmad Zulkarnain, Zuriati
• Format: Article
• Published: SpringerOpen 2014
• Online Access: http://psasir.upm.edu.my/id/eprint/34985/; http://link.springer.com/article/10.1186%2F1687-1499-2014-51
• Institution: Universiti Putra Malaysia

Data gathering is among the issues constantly acquiring attention in the area of wireless sensor networks (WSNs). There is a consistent increase in the research directed on the gains of applying mobile elements (MEs) to collect data from sensors, especially those oriented to power issues. There are two prevailing strategies used to collect data in sensor networks. The first approach requires data packets to be serviced via multi-hop relay to reach the respective base station (BS). Thus, sensors will send their packets through other intermediate sensors. However, this strategy has proven to consume high and a substantial amount of energy due to the dependency on other nodes for transmission. The second approach encompasses a ME which serves as the core element for the searching of data. This ME will visit the transmission range of each sensor to upload its data before eventually returning to the BS to complete the data transmission. This approach has proven to reduce the energy consumption substantially as compared to the multi-hop strategy. However, it has a trade-off which is the increase of delay incurred and is constrained by the speed of ME. Furthermore, some sensors may lose their data due to overflow while waiting for the ME. In this paper, it is proposed that by strategically divisioning the area of data collection, the optimization of the ME can be elevated. These derived area divisions are focused on the determination of a common configuration range and the correlation with a redundant area within an identified area. Thus, within each of these divided areas, the multi-hop collection is deployed as a sub-set to the main collection. The ME will select a centroid point between two sub-polling points, subsequently selecting common turning points as the core of the basis of the tour path. Extensive discrete-event simulations have been developed to assess the performance of the proposed algorithm. The acquired results depicted through the performance metrics of tour length and latency have determined the superior performance of the proposed algorithm in comparison to the existing strategy. In addition, the proposed algorithm maintains the energy consumption within an acceptable level.