IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Data Gathering Algorithms and Sink Mobility Models for Wireless Sensor Networks

Data Gathering Algorithms and Sink Mobility Models for Wireless Sensor Networks
View Sample PDF
Author(s): Natarajan Meghanathan (Jackson State University, USA)
Copyright: 2014
Pages: 29
Source title: Multidisciplinary Perspectives on Telecommunications, Wireless Systems, and Mobile Computing
Source Author(s)/Editor(s): Wen-Chen Hu (University of North Dakota, USA)
DOI: 10.4018/978-1-4666-4715-2.ch008

Purchase

View Data Gathering Algorithms and Sink Mobility Models for Wireless Sensor Networks on the publisher's website for pricing and purchasing information.

Abstract

In the first half of the chapter, the authors provide a comprehensive description of two broad categories of data gathering algorithms for wireless sensor networks: the classical energy-unaware algorithms and the modern energy-aware algorithms, as well as presented an exhaustive performance comparison of representative algorithms from both these categories. While the first half of the chapter focuses on static sink (that is located outside on the network boundary), the second half of the chapter explores the use of mobile sinks that gather data by stopping at the vicinity of the sensor nodes. As a first step, the authors investigate the performance of three different strategies to develop sink mobility models for delay and energy-efficient data gathering in static wireless sensor networks. The three strategies differ on the approach to take to determine the next stop for data gathering: randomly choosing a sensor node that is yet to be covered (Random), choose the sensor node that has the maximum number of uncovered neighbor nodes (Max-Density), and choose the sensor node that has the largest value for the product of the maximum number of uncovered neighbor nodes and the residual energy (Max-Density-Energy). Based on the simulation results, the authors recommend incorporating the random node selection-based strategy to be a better strategy for sink mobility models (with minimal deployment overhead) rather than keeping track of the number of uncovered neighbor nodes per node and the residual energy available at the nodes.

Related Content

Taoufik Benyetho, Larbi El Abdellaoui, Abdelali Tajmouati, Abdelwahed Tribak, Mohamed Latrach. © 2017. 33 pages.
Naveen Jaglan, Samir Dev Gupta, Binod Kumar Kanaujia, Shweta Srivastava. © 2017. 51 pages.
Anirban Karmakar. © 2017. 30 pages.
Hassan Elmajid, Jaouad Terhzaz, Hassan Ammor. © 2017. 31 pages.
Salvatore Caorsi, Claudio Lenzi. © 2017. 23 pages.
Abdessamed Chinig, Ahmed Errkik, Abdelali Tajmouati, Hamid Bennis, Jamal Zbitou, Mohamed Latrach. © 2017. 35 pages.
Fouad Aytouna, Mohamed Aghoutane, Naima Amar Touhami, Mohamed Latrach. © 2017. 39 pages.
Body Bottom