International Journal of Engineering and Management Research (IJEMR)
  • Year: 2015
  • Volume: 5
  • Issue: 4

Efficient Mechanisms for Data Gathering in Wireless Sensor Netowrks by Mobile Collectors

  • Author:
  • G. Nagendra Babu1, M. Krishna Murthy2, S Zeenathunnisa3
  • Total Page Count: 3
  • Page Number: 105 to 107

1Assistant Professor in CSE Department, KSRMCE, KADAPA, India

2Professor & HOD (ME-CSE), KCG College of Engineering, Chennai, India

3M. Tech Student, KSRMCE, KADAPA, India

Online published on 21 November, 2017.

Abstract

We propose a new data-gathering mechanism for large-scale wireless sensor networks by introducing mobility into the network. A mobile data collector, for convenience called M-collector is a mobile robot or a vehicle equipped with a powerful transceiver and battery, and it gathers data from polling points(PPs) while moving through the field. Single M-collector is suitable for small areas and multiple Mcollectors are used for large areas. An M-collector starts the data-gathering tour periodically from the static data sink, polls each sensor while traversing its transmission range, then directly collects data from the sensor in single-hop communications, and finally transports the data to the static sink. Since data packets are directly gathered without relays and collisions, the lifetime of sensors is expected to be prolonged. In this paper, we mainly focus on the problem of minimizing the length of each data-gathering tour and refer to this as the single-hop data-gathering problem (SHDGP). We first formalize the SHDGP into a mixed-integer program and then present a heuristic tour-planning algorithm for the case where a single M-collector is employed. For the applications with strict distance time constraints, we consider utilizing multiple M-collectors and propose a data-gathering algorithm where multiple M-collectors traverse through several shorter sub tours concurrently to satisfy the distance/time constraints. Our proposed mobile data gathering scheme can improve the scalability and balance the energy consumption among sensors. It can be used in both connected and disconnected networks. Simulation results demonstrate that the proposed data-gathering scheme can greatly shorten the moving distance of the collectors compared with the covering line approximation algorithm and is close to the optimal algorithm for small networks. In addition, the proposed data-gathering scheme can significantly prolong the network lifetime compared with a network with static data sink.

Keywords

Mobile data collector(M-collector), Polling Points(PPs), Wireless sensor networks, Data gathering, Movement planning