A Survey about Routing Protocols with Mobile Sink for Wireless Sensor Network
---
paper_title: A survey on the use of Mobile Agents in Wireless Sensor Networks

paper_content:

This survey paper describes and classifies solutions/approaches that use Mobile Agents in Wireless Sensor Networks. There are eight identified criteria which are used for classification of available solutions/approaches and include: autonomicity, security, adaptability, availability, routing, filtering, recovery, and configuration. For each criterion, a selected solution/approach is described so that it illustrates principles corresponding to that criterion. Description of each solution is given from the viewpoint of the role which a Mobile Agent has in the Wireless Sensor Network, also shown in a figure per surveyed paper. Every described solution has been discussed in respect of improvements that are implemented and potential drawbacks.
---
paper_title: Routing Techniques in Wireless Sensor Networks: A Survey

paper_content:

Wireless sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. Routing protocols in WSNs might differ depending on the application and network architecture. In this article we present a survey of state-of-the-art routing techniques in WSNs. We first outline the design challenges for routing protocols in WSNs followed by a comprehensive survey of routing techniques. Overall, the routing techniques are classified into three categories based on the underlying network structure: flit, hierarchical, and location-based routing. Furthermore, these protocols can be classified into multipath-based, query-based, negotiation-based, QoS-based, and coherent-based depending on the protocol operation. We study the design trade-offs between energy and communication overhead savings in every routing paradigm. We also highlight the advantages and performance issues of each routing technique. The article concludes with possible future research areas.
---
paper_title: A Survey on Routing Techniques Supporting Mobility in Sensor Networks

paper_content:

Wireless sensor networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Even in predominantly static sensor networks, it is possible to have a few mobile nodes. Mobility of nodes in WSNs adds a significant challenge. In this article we present a survey of state-of-the-art routing techniques in wireless ad hoc and sensor networks and highlight the advantages/disadvantages and performance issues of each routing technique. The aim is to identify routing protocols that will be able to support the mobility of sensor nodes in WSNs consisting of both static and mobile (mixed WSN) nodes. The article concludes by presenting an approach for such a routing protocol.
---
paper_title: A survey on the use of Mobile Agents in Wireless Sensor Networks

paper_content:

This survey paper describes and classifies solutions/approaches that use Mobile Agents in Wireless Sensor Networks. There are eight identified criteria which are used for classification of available solutions/approaches and include: autonomicity, security, adaptability, availability, routing, filtering, recovery, and configuration. For each criterion, a selected solution/approach is described so that it illustrates principles corresponding to that criterion. Description of each solution is given from the viewpoint of the role which a Mobile Agent has in the Wireless Sensor Network, also shown in a figure per surveyed paper. Every described solution has been discussed in respect of improvements that are implemented and potential drawbacks.
---
paper_title: Controlled sink mobility for prolonging wireless sensor networks lifetime

paper_content:

This paper demonstrates the advantages of using controlled mobility in wireless sensor networks (WSNs) for increasing their lifetime, i.e., the period of time the network is able to provide its intended functionalities. More specifically, for WSNs that comprise a large number of statically placed sensor nodes transmitting data to a collection point (the sink), we show that by controlling the sink movements we can obtain remarkable lifetime improvements. In order to determine sink movements, we first define a Mixed Integer Linear Programming (MILP) analytical model whose solution determines those sink routes that maximize network lifetime. Our contribution expands further by defining the first heuristics for controlled sink movements that are fully distributed and localized. Our Greedy Maximum Residual Energy (GMRE) heuristic moves the sink from its current location to a new site as if drawn toward the area where nodes have the highest residual energy. We also introduce a simple distributed mobility scheme (Random Movement or RM) according to which the sink moves uncontrolled and randomly throughout the network. The different mobility schemes are compared through extensive ns2-based simulations in networks with different nodes deployment, data routing protocols, and constraints on the sink movements. In all considered scenarios, we observe that moving the sink always increases network lifetime. In particular, our experiments show that controlling the mobility of the sink leads to remarkable improvements, which are as high as sixfold compared to having the sink statically (and optimally) placed, and as high as twofold compared to uncontrolled mobility.
---
paper_title: A Survey on Routing Techniques Supporting Mobility in Sensor Networks

paper_content:

Wireless sensor networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Even in predominantly static sensor networks, it is possible to have a few mobile nodes. Mobility of nodes in WSNs adds a significant challenge. In this article we present a survey of state-of-the-art routing techniques in wireless ad hoc and sensor networks and highlight the advantages/disadvantages and performance issues of each routing technique. The aim is to identify routing protocols that will be able to support the mobility of sensor nodes in WSNs consisting of both static and mobile (mixed WSN) nodes. The article concludes by presenting an approach for such a routing protocol.
---
paper_title: Meeting Position Aware Routing for Query-Based Mobile Enabled Wireless Sensor Network

paper_content:

In this paper, meeting position aware routing (MPAR) is proposed for query-based mobile enabled wireless sensor network (mWSN). We consider mWSNs with dense sensor nodes deployed in the sensing field. A mobile sink (MS) moving through the sensing field with random speed queries a specific area or a point of interest for information from physical world. Queried data over a area is aggregated to a source node and delivered to the mobile sink via multi-hop communication. The feature of MPAR is that the mWSNs can predict the position of the mobile sink at the time it meets the data packet. The queried data packet is delivered towards this predicted position from the source node during the propagation. We compared MPAR with the existing routing protocol for the similar sce- narios. Analysis was conducted to discover the conditions under which MPAR demonstrates the optimal performance. Extensive simulations were also conducted to evaluate the performance of the routing mechanism as well as to compare it with existing method. Evaluation results show that MPAR outperforms the existing mechanism in that it provides less end-to-end delivery latency, and consequently reduces the energy consumption. The robustness to variation of MS velocity is also improved. Index Terms—Wireless sensor networks; query-based data collection; mobile sink
---
paper_title: A multicast-query-based data dissemination protocol for wireless sensor networks with multiple mobile sinks

paper_content:

In wireless sensor networks with mobile sinks, it is a challenge to design reasonable data dissemination protocols to realize reliable, real-time and efficient data transmission from multiple sources to multiple sinks. Recently, many protocols such as TTDD, GHT and LBDD are proposed to solve this problem. However, most of them depend on the whole network topology information to optimize the data dissemination structure or involve a lot of sensor nodes in the structure construction and maintenance, which puts a big burden on the wireless sensor network. In order to meet the demand of energy efficiency and scalability, we present a Multicast-Query-based Data Dissemination protocol (MQDD). MQDD utilizes multicast for event queries and unicast for data transmission with either beacon-based or beacon-less geographic routing algorithms. To further reduce energy consumption in delivering event data to multiple sinks, geographic multicast routing is also integrated in MQDD. Simulation results indicate that MQDD outperforms TTDD in packets delivery ratio, average delay and total energy consumption with varying number of sources and sinks.
---
paper_title: A Survey on Routing Techniques Supporting Mobility in Sensor Networks

paper_content:

Wireless sensor networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Even in predominantly static sensor networks, it is possible to have a few mobile nodes. Mobility of nodes in WSNs adds a significant challenge. In this article we present a survey of state-of-the-art routing techniques in wireless ad hoc and sensor networks and highlight the advantages/disadvantages and performance issues of each routing technique. The aim is to identify routing protocols that will be able to support the mobility of sensor nodes in WSNs consisting of both static and mobile (mixed WSN) nodes. The article concludes by presenting an approach for such a routing protocol.
---
paper_title: A Hybrid Routing Protocol for Mobile Ad Hoc and Wireless Sensor Networks

paper_content:

The growing popularity of location-enabled devices has driven the demand for more efficient and reliable geographical routing algorithms for mobile ad hoc networks (MANET) and wireless sensor networks. The characteristic of this network is that nodes exchange geographical location with neighbors, and no global topology or central management is required. This paper proposes a hybrid approach for routing in MANET and wireless sensor networks without location service. Our approach combines both geographical routing and On-Demand Distance Vector Routing where location information is requested on demand. The request is used to create a backup shortest-path route to avoid dead-ends. The proposed algorithm can adopt automatically if a minimum connected dominating set (MCDS) exists, which is to limit the flooding of location and route requests. The performances metrics in this study include: packet loss, protocol overhead, end-to-end latency, and path length. Our simulation shows that our hybrid algorithm is more efficient, scalable and adaptable to rapid topology changes as compared to other popular routing algorithms, such as ad hoc on-demand vector (AODV) routing protocol and greedy perimeter stateless routing (GPSR) protocol. The hybrid algorithm combines two efficient routing algorithms where each one is a backup for the other and hence it reduces the need for flooding and overcomes the problems associated with planarization, face routing and location service. Our hybrid approach has the potential to support 3D topologies as well.
---
paper_title: On the Data Dissemination in WSNs

paper_content:

Data dissemination has been put forward as an important mechanism for WSN. The dissemination schemes allow sink nodes to diffuse information in the network. It is known as an energy-consuming phase. In this paper, we propose to resolve this problem in two steps: firstly using a localized self-organization scheme which generates a non-directed backbone; secondly, sink node sends a request through this backbone to create a directed dissemination structure in the network. Our scheme effectively reduces the data traffic during the dissemination phase and saves energy when compared to other schemes. It is also extended to run properly in multiple sinks and mobile sink scenarios. The results also put forward the benefits of using a self-organization scheme for data dissemination.
---
paper_title: Mobile Sink Routing Protocol with Registering in Cluster-Based Wireless Sensor Networks

paper_content:

Wireless Sensor Networks (WSNs) are wireless networks consisting of sink nodes and multiple sensor nodes. While the wireless sensor nodes have several advantages, such as the compact size and the low cost, corresponding constraints on resources can result. The greatest challenge among all is the constraint on energy. Therefore, how to minimize the energy consumption while maintaining an extended network lifetime becomes the most critical issue when it comes to the design of the routing protocol for the wireless sensor networks.
---
paper_title: A Line-Based Data Dissemination Protocol for Wireless Sensor Networks with Mobile Sink

paper_content:

In wireless sensor networks, data dissemination is generally performed from the sensor nodes towards a static sink. In this paper, we address the particular case where the sink is mobile, according to an unpredictable mobility pattern. First, we study existing approaches. As an alternative, we present the line-based data dissemination (LBDD) protocol. Next, we analytically evaluate the communication cost of this protocol and we compare it to other approaches. Finally, realistic simulations are performed and results show that LBDD outperforms previous approaches and presents the best tradeoff among the evaluated protocols.
---
paper_title: TTDD: Two-Tier Data Dissemination in Large-Scale Wireless Sensor Networks

paper_content:

Sink mobility brings new challenges to data dissemination in large sensor networks. It suggests that information about each mobile sink's location be continuously propagated throughout the sensor field in order to keep all sensors informed of the direction of forwarding future data reports. Unfortunately, frequent location updates from multiple sinks can lead to both excessive drain of sensors' limited battery supply and increased collisions in wireless transmissions. In this paper, we describe TTDD, a Two-Tier Data Dissemination approach that provides scalable and efficient data delivery to multiple, mobile sinks. Each data source in TTDD proactively constructs a grid structure, which enables mobile sinks to continuously receive data on the move by flooding queries within a local cell only. TTDD's design exploits the fact that sensors are stationary and location-aware to construct and maintain the grid infrastructure with low overhead. We evaluate TTDD through both analysis and extensive simulations. Our results show that TTDD handles sink mobility effectively with performance comparable with that of stationary sinks.
---
paper_title: Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table

paper_content:

Making effective use of the vast amounts of data gathered by large-scale sensor networks (sensornets) will require scalable, self-organizing, and energy-efficient data dissemination algorithms. For sensornets, where the content of the data is more important than the identity of the node that gathers them, researchers have found it useful to move away from the Internet's point-to-point communication abstraction and instead adopt abstractions that are more data-centric. This approach entails naming the data and using communication abstractions that refer to those names rather than to node network addresses [1,11]. Previous work on data-centric routing has shown it to be an energy-efficient data dissemination method for sensornets [12]. Herein, we argue that a companion method, data-centric storage (DCS), is also a useful approach. Under DCS, sensed data are stored at a node determined by the name associated with the sensed data. In this paper, we first define DCS and predict analytically where it outperforms other data dissemination approaches. We then describe GHT, a Geographic Hash Table system for DCS on sensornets. GHT hashes keys into geographic coordinates, and stores a key-value pair at the sensor node geographically nearest the hash of its key. The system replicates stored data locally to ensure persistence when nodes fail. It uses an efficient consistency protocol to ensure that key-value pairs are stored at the appropriate nodes after topological changes. And it distributes load throughout the network using a geographic hierarchy. We evaluate the performance of GHT as a DCS system in simulation against two other dissemination approaches. Our results demonstrate that GHT is the preferable approach for the application workloads we analytically predict, offers high data availability, and scales to large sensornet deployments, even when nodes fail or are mobile.
---

Title: A Survey about Routing Protocols with Mobile Sink for Wireless Sensor Network

Section 1: Introduction
Description 1: Provide an overview of Wireless Sensor Networks (WSNs) and the importance of routing protocols with mobile sinks. Discuss the main contributions of the survey.

Section 2: Routing Strategies with Sink Mobility Support
Description 2: Discuss various strategies for supporting sink mobility in routing protocols, including an overview of different mobility schemes and classifications of routing protocols.

Section 3: Query-based Routing Protocols
Description 3: Describe several query-based routing protocols that support sink mobility, including specific examples like MPAR and MQDD, along with their characteristics and advantages.

Section 4: Location-based Routing Protocols
Description 4: Introduce location-based routing protocols that use geographic information to enhance routing efficiency. Categorize these protocols into backbone-based and rendezvous-based.

Section 5: Backbone-based Routing Protocols
Description 5: Discuss specific backbone-based routing protocols such as DDB and HMRP, explaining their mechanisms, energy efficiency, and impact on network performance.

Section 6: Rendezvous-based Routing Protocols
Description 6: Evaluate rendezvous-based routing protocols like GHT, TTDD, and LBDD, focusing on their methods for data storage, retrieval, and network scalability.

Section 7: Protocols Structure
Description 7: Summarize the structure, characteristics, and limitations of various routing protocols involved, highlighting differences in mobility models and delivery strategies.

Section 8: Discussion
Description 8: Discuss the implications of node deployment strategies, the benefits of mobile sink nodes, and challenges such as data latency and buffer overflow.

Section 9: Conclusions
Description 9: Provide a summary that emphasizes the effectiveness of using mobile sink nodes in WSNs, along with an analysis of the presented routing protocols and future research directions.