Cover Image

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

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...

Full description

Saved in:
Bibliographic Details
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
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.34985
record_format eprints
spelling my.upm.eprints.349852015-12-25T07:30:00Z http://psasir.upm.edu.my/id/eprint/34985/ Predetermined path of mobile data gathering in wireless sensor networks based on network layout Ghaleb, Mukhtar Subramaniam, Shamala Othman, Mohamed Ahmad Zulkarnain, Zuriati 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. SpringerOpen 2014-12 Article PeerReviewed Ghaleb, Mukhtar and Subramaniam, Shamala and Othman, Mohamed and Ahmad Zulkarnain, Zuriati (2014) Predetermined path of mobile data gathering in wireless sensor networks based on network layout. EURASIP Journal on Wireless Communications and Networking, 2014. art. no. 51. pp. 1-18. ISSN 1687-1472; ESSN: 1687-1499 http://link.springer.com/article/10.1186%2F1687-1499-2014-51 10.1186/1687-1499-2014-51
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
description 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.
format Article
author Ghaleb, Mukhtar
Subramaniam, Shamala
Othman, Mohamed
Ahmad Zulkarnain, Zuriati
spellingShingle Ghaleb, Mukhtar
Subramaniam, Shamala
Othman, Mohamed
Ahmad Zulkarnain, Zuriati
Predetermined path of mobile data gathering in wireless sensor networks based on network layout
author_facet Ghaleb, Mukhtar
Subramaniam, Shamala
Othman, Mohamed
Ahmad Zulkarnain, Zuriati
author_sort Ghaleb, Mukhtar
title Predetermined path of mobile data gathering in wireless sensor networks based on network layout
title_short Predetermined path of mobile data gathering in wireless sensor networks based on network layout
title_full Predetermined path of mobile data gathering in wireless sensor networks based on network layout
title_fullStr Predetermined path of mobile data gathering in wireless sensor networks based on network layout
title_full_unstemmed Predetermined path of mobile data gathering in wireless sensor networks based on network layout
title_sort predetermined path of mobile data gathering in wireless sensor networks based on network layout
publisher SpringerOpen
publishDate 2014
url http://psasir.upm.edu.my/id/eprint/34985/
http://link.springer.com/article/10.1186%2F1687-1499-2014-51
_version_ 1643831318858956800
score 13.211869

Similar Items