scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Routing in mobile wireless sensor network: a survey

01 Sep 2014-Telecommunication Systems (Springer US)-Vol. 57, Iss: 1, pp 51-79
TL;DR: The classification presented here summarizes the main features of many published proposals in the literature for efficient routing in MWSN and also gives an insight into the enhancements that can be done to improve the existing routing protocols.
Abstract: The Mobile Wireless Sensor Network (MWSN) is an emerging technology with significant applications. The MWSN allows the sensor nodes to move freely and they are able to communicate with each other without the need for a fixed infrastructure. These networks are capable of out-performing static wireless sensor networks as they tend to increase the network lifetime, reduce the power consumption, provide more channel capacity and perform better targeting. Usually routing process in a mobile network is very complex and it becomes even more complicated in MWSN as the sensor nodes are low power, cost effective mobile devices with minimum resources. Recent research works have led to the design of many efficient routing protocols for MWSN but still there are many unresolved problems like retaining the network connectivity, reducing the energy cost, maintaining adequate sensing coverage etc. This paper addresses the various issues in routing and presents the state of the art routing protocols in MWSN. The routing protocols are categorized based on their network structure, state of information, energy efficiency and mobility. The classification presented here summarizes the main features of many published proposals in the literature for efficient routing in MWSN and also gives an insight into the enhancements that can be done to improve the existing routing protocols.
Citations
More filters
Journal ArticleDOI
TL;DR: A moving strategy called energy-aware sink relocation (EASR) for mobile sinks in WSNs is proposed and some theoretical and numerical analyze are given to show that the EASR method can extend the network lifetime of the WSN significantly.
Abstract: Recent advances in micromanufacturing technology have enabled the development of low-cost, low-power, multifunctional sensor nodes for wireless communication. Diverse sensing applications have also become a reality as a result. These include environmental monitoring, intrusion detection, battlefield surveillance, and so on. In a wireless sensor network (WSN), how to conserve the limited power resources of sensors to extend the network lifetime of the WSN as long as possible while performing the sensing and sensed data reporting tasks, is the most critical issue in the network design. In a WSN, sensor nodes deliver sensed data back to the sink via multihopping. The sensor nodes near the sink will generally consume more battery power than others; consequently, these nodes will quickly drain out their battery energy and shorten the network lifetime of the WSN. Sink relocation is an efficient network lifetime extension method, which avoids consuming too much battery energy for a specific group of sensor nodes. In this paper, we propose a moving strategy called energy-aware sink relocation (EASR) for mobile sinks in WSNs. The proposed mechanism uses information related to the residual battery energy of sensor nodes to adaptively adjust the transmission range of sensor nodes and the relocating scheme for the sink. Some theoretical and numerical analyze are given to show that the EASR method can extend the network lifetime of the WSN significantly.

153 citations


Cites methods from "Routing in mobile wireless sensor n..."

  • ...In our considered energy consumption model, we adopt the first order radio model [1]–[3] for later performance simulation....

    [...]

Journal ArticleDOI
TL;DR: This paper articulate this problem and classify current routing protocols for WSNs into two categories according to their orientation toward either homogeneous or heterogeneous W SNs, further classified into static and mobile ones.
Abstract: Due to a battery constraint in wireless sensor networks (WSNs), prolonging their lifetime is important. Energy-efficient routing techniques for WSNs play a great role in doing so. In this paper, we articulate this problem and classify current routing protocols for WSNs into two categories according to their orientation toward either homogeneous or heterogeneous WSNs. They are further classified into static and mobile ones. We give an overview of these protocols in each category by summarizing their characteristics, limitations, and applications. Finally, some open issues in energy-efficient routing protocol design for WSNs are indicated.

148 citations


Cites background or methods from "Routing in mobile wireless sensor n..."

  • ...In addition, this work gives application scopes of each protocol which were missing in the earlier surveys [2], [12], [14], [15], [17], [20]....

    [...]

  • ...From Table 1, we have: i) The 2004 survey [14] presents a comprehensive survey of earlier routing protocols, but not all described are energyefficient; [7] addresses various aspects of energy harvesting sensor systems; [12] exploits routing protocols designed for large-scale WSNs; [2] describes energy-efficient routing protocols; [15] classifies routing protocols based on different design criteria, and discusses the mobility including mobile sinks only, few mobile nodes act as mobile relays, all nodes mobile and few nodes are stationary; [1] gives an overview of WSNs from an industrial perspective; [12] discusses routing protocols based on intelligent algorithms; [16] considers only the routing protocols with mobile sinks; [20] focuses on hierarchical routing protocols for heterogeneous WSNs; and [21] categorizes various heterogeneous routing protocols for WSNs based upon various predefined parameters....

    [...]

  • ...By introducing mobility in WSNs, mobile nodes can move to the sensors near sinks or isolated parts of the network and hence energy consumption in the nodes becomes even and connectivity is better maintained [15]–[17]....

    [...]

Journal ArticleDOI
TL;DR: This paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs and presents a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications.
Abstract: Introducing mobility to Wireless Sensor Networks (WSNs) puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs). Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.

121 citations

Journal ArticleDOI
TL;DR: A comprehensive and meticulous investigation of the reliability theory of MWSNs which was developed in recent years is presented and the existing methods are systematically compared and the advantages and disadvantages of the methods are presented.

110 citations

Journal ArticleDOI
TL;DR: This survey explores various research approaches and extensions to the WSN lifetime maximization problem, which include online routing, clustering approaches, and lifetime maximizations on specially structured networks.

92 citations


Cites background from "Routing in mobile wireless sensor n..."

  • ...Additionally, Yu et al. [113], Tunca et al. [101], and Sara and Sridharan [91] survey routing protocols and deployment techniques for mobile-sink WSNs....

    [...]

  • ...[101], and Sara and Sridharan [91] survey routing protocols and deployment techniques for mobile-sink WSNs....

    [...]

References
More filters
Proceedings ArticleDOI
04 Jan 2000
TL;DR: The Low-Energy Adaptive Clustering Hierarchy (LEACH) as mentioned in this paper is a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network.
Abstract: Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.

12,497 citations

01 Jan 2000
TL;DR: LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network, is proposed.
Abstract: Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have signicant impact on the overall energy dissipation of these networks. Based on our ndings that the conventional protocols of direct transmission, minimum-transmission-energy, multihop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster base stations (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show that LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional routing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.

11,412 citations

Proceedings ArticleDOI
25 Feb 1999
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Abstract: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.

11,360 citations

Proceedings ArticleDOI
01 Aug 2000
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Abstract: We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.

7,384 citations

Proceedings ArticleDOI
01 Oct 1994
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Abstract: An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP [5], to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile Hosts. Finally, we describe the ways in which the basic network-layer routing can be modified to provide MAC-layer support for ad-hoc networks.

6,877 citations