Support Sink Mobility Research Articles

Expected Area-Based Real-Time Routing Protocol for Supporting Mobile Sinks in Wireless Sensor Networks

To deliver real-time data within a desired time deadline, a spatiotemporal approach has been proposed in wireless sensor networks. In the approach, real-time data can be delivered with a delivery speed calculated by both the distance from a source to a static sink and the desired time deadline. In the case of a mobile sink, because the distance from a source to the sink would be dynamically changed due to its movement, real-time data cannot be delivered due to the inability to calculate a delivery speed. Thus, we propose a novel real-time routing protocol, called EAR2 (expected area-based real-time routing) for mobile sinks. Instead of the immediate distance, EAR2 considers the static distance to the expected area of a mobile sink’s location using its movement speed. To satisfy the desired time deadline, EAR2 guarantees that the total summation of the unicasting time to the expected area and the flooding time within the expected area can be smaller than the deadline. To do this, EAR2 calculates a data delivery speed by using the static distance and the unicasting time and exploits the flooding time observed from various network environments. Because EAR2 has a high flooding time and data loss problems due to a single flooding point, we propose a protocol called EAR2M with multiple flooding points, which reduces the flooding time and enhances the reliability of data transmission. We also propose two extensions of EAR2M, called EAR2M_R and EAR2M_E for efficient data transmission from a source to multiple flooding points. They aim to reduce the transmission delay and the energy consumption for efficient data transmission among multiple flooding points, respectively. Simulation results show that EAR2 improves the deadline miss ratio and the energy consumption, with averages improvements of 47.17% and 29.99% over the existing schemes, respectively. Furthermore, EAR2M with four flooding points enhances the deadline miss ratio and the energy consumption by an average of 12.69% and 131.86% over EAR2.

Harvested Energy Scavenging and Transfer capabilities in Opportunistic Ring Routing

Energy conservation has always been a prominent design goal for hierarchical routing protocols supporting sink mobility. Advertising the current position of mobile sink introduces control packet overhead which ultimately results in an increase in energy consumption and shorter network lifetime. Energy harvesting through ambient sources have enabled the utilization of rechargeable devices for Wireless Sensor Networks to perpetually remain operational. The modifications in the hierarchical structure of wireless sensor networks along with energy scavenging approaches could possibly minimize the control packet overhead and also provide a significant improvement in energy conservation. In this paper, we propose a novel Harvested Energy Scavenging and Transfer capabilities in Opportunistic Ring Routing protocol which uses a distinguishing approach of hybrid (ring + cluster) topology in which the network architecture is initially supported by the formation of a virtual ring structure and then a two-tier routing topology is used in the virtual ring as an overlay by grouping nodes into clusters. The rate of energy gain from solar harvesting and radio frequency transfer is the criterion for selecting cluster heads. The role of cluster heads is exploited to advertise the mobile sink current position as well as forward the aggregated data towards mobile sink using energy transfer based opportunistic routing. The simulation results reveal that our scheme considerably outperforms the existing benchmarks in terms of control packet overhead, energy conservation, network lifetime, packet delivery ratio and average end-end delay.

Agent-Based Multipath Management for Supporting Sink Mobility in Wireless Sensor Networks

In wireless sensor networks, sink mobility support is one of the essential functionalities in many applications. With continuous advancement, future applications will require not only sink mobility support but also high-performance data delivery service. Multipath routing is one of the promising technologies for improving data delivery performance by collaboratively using alternative or redundant multiple routing paths. However, existing multipath routing protocols had not dealt with sink mobility. As a result, they lead to bad performance in terms of energy efficiency due to the end-to-end path reconstruction. Consequently, a novel multipath management scheme is required thereby supporting sink mobility without performance degradation. In this paper, we propose a multipath management scheme for supporting sink mobility. The proposed scheme dynamically constructs multipath along the moving path of a sink. In addition, the proposed scheme provides the path shortening schemes according to the sink’s movement for reducing energy consumption. Our simulation results show that the proposed scheme is superior to existing path management schemes in terms of reliability and energy efficiency.

Dynamic Cluster Based Routing Protocol with Sink Mobility Support for Underwater Wireless Sensor Networks

Underwater wireless sensor networks are energy resource constrained due to the scarce battery capacity. Energy efficient routing protocol is highly demanded to be developed for such networks. It is indeed a challenging task to design routing protocol that can achieve energy efficiency due to the dynamic and harsh underwater environment. A dynamic cluster based routing protocol coupled with sink mobility support (DCMMS) is proposed. Two schemes are combined together in the protocol. One is the formation of clusters and two is the mobile sink management. The cluster formation includes cluster head election process and member association process. Each cluster member sends the sensed data to the cluster head. Multiple mobile sinks are deployed to gather data directly from cluster heads. Finally, mobile sinks send the collected data after proper aggregation to the static sinks located at the surface. Thus, sink mobility and the dynamic clustering technique together help to balance the load among the nodes thereby minimizing energy consumption to a significant extent and extending the network life span. Analytical simulations are extensively carried out to attest how the proposed protocol (DCMMS) achieves better performance with minimum energy consumption, less end to end delay and higher packet delivery ratio than its counterpart existing protocol (AA-RP).

Restoring Connection Method for Sink Mobility Support in Irregular Wireless Sensor Networks

무선 센서 망에서 모바일싱크로의 데이터 전달을 위해서는 싱크의 주기적인 위치갱신이 필요하다. 기존 연구들은 위치갱신비용 최소화를 위해 소스와 싱크 간의 연결을 전역적, 지역적 연결의 두 단계로 나누는 방안을 제안했다. 하지만, 두 단계 연결 방안은 노드가 존재하지 않는 영역인 홀이 있는 환경에서는 데이터 손실을 야기할 수 있다. 즉, 싱크가 홀을 지나가며 발생하는 지역적 연결의 단절 때문에, 싱크는 홀을 벗어나 전역적 연결을 다시 구성할 때까지 데이터를 수신하지 못한다. 본 논문에서는 불규칙적인 환경에서 모바일 싱크를 지원하기 위한 연결 복원 방안을 제안한다. 제안 방안에서, 싱크가 홀 내부로 이동하면 홀 주변 노드들은 서로 유기적으로 연결된다. 이후 싱크가 홀을 벗어나면, 홀 주변 노드들을 통해 연결을 복원하여 싱크에게 데이터를 전달할 수 있다.

Attacks and Secure Geographic Routing In Wireless Sensor Networks

Due to open network nature of wireless sensor networks make them highly vulnerable to a variety of security attacks and easy target for adversaries, which may capture these nodes, analyze and easily insert fake route information. Wireless sensor network is an emerging, cost effective and unsupervised solution for collecting this information from the physical world and sending this information back to centralized authority for further processing. GRPW (Geographic Routing in connected wireless sensor networks based on Multiple Sinks) is one of the basic routing protocols used for Supporting Mobile Sinks in Wireless Sensor Networks. GRPW, a geographical routing protocol for wireless sensor networks, is based on an architecture partitioned by logical levels, on the other hand based on a multipoint relaying flooding technique to reduce the number of topology broadcast. GRPW-MuS uses periodic HELLO packets to neighbor detection. The wormhole attack can form a serious threat in wireless sensor networks, especially against many wireless sensor networks routing protocols and location-based wireless security systems. Here, a trust model to handle this attack in GRPW is provided called GRPW-MuS-s. Using OMNET++ simulation and the MiXiM framework, results show that GRPW-MuS-s protocol only has very small false positives for wormhole detection during the neighbor discovery process (less than GRPW). The average energy usage at each node for GRPW-MuS-s protocol during the neighbor discovery and route discovery is very low than GRPW-MuS, which is much lower than the available energy at each node. The cost analysis shows that GRPW-MuS-s protocol only needs small memory usage at each node, which is suitable for the sensor network.

무선 센서 네트워크에서 이동 싱크 그룹을 위한 위치 서비스와 데이터 전송 프로토콜

본 논문은 센서 노드들의 에너지 소비를 줄이고 소스로부터 이동 싱크 그룹까지 데이터를 전달하기 위한 새로운 위치 서비스와 위치 기반 라우팅을 제안한다. 기존 방안들과는 다르게, 제안 방안은 그룹 영역 대신 싱크 그룹을 대표하는 리더 싱크 위치 정보를 사용한다. 그래서, 제안 방안은 소스와 리더 싱크 간의 위치 서비스와 위치 기반 라우팅을 위한 상위 계층과 리더 싱크와 멤버 싱크들 간의 위치 서비스와 라우팅을 위한 하위 계층으로 이루어진 계층적 위치 서비스와 위치 기반 라우팅을 사용한다. 각각의 상위와 하위 계층의 위치 서비스와 위치 기반 라우팅은 플러딩을 사용하지 않기 때문에 제안 방안은 센서 노드들의 에너지 소비를 줄일 수 있다. 다양한 시뮬레이션 결과는 제안 방안이 기존 방안보다 우수함을 증명한다. In this paper, we propose a new location service and location-based routing for data dissemination from a source to a mobile group sink in less energy consumption of the sensor node. Unlike the existing protocols, the proposed protocol uses a leader sink instead of a group area as the location information to represent a mobile sink group. The proposed protocol also uses grid leaders on virtual grid structure to support sink mobility in location service. By using a leader sink as a representative and grid leaders for mobility supporting, the proposed protocol can exploit an efficient hierarchical location service and data dissemination method without using flooding. Accordingly, the proposed protocol carries out upper layer location services and data dissemination between a leader sink and a source and lower layer location services and data dissemination between the leader sink and member sinks. Simulation results demonstrate that the proposed protocol achieves energy-efficiency.

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

Mobile sink node properly used in routing protocols can improve network performance. Thus we investigate the state-of-the-art mobile sink based query-based and location-based routing protocols. The latter strategy can be further classified into backbone-based and rendezvous-based routing protocols. In this paper, we first describe the main principles of the most representative routing strategies with sink mobility support, and highlight their advantages and disadvantages. Descriptions and comparisons of several typical routing protocols are given to deepen the understanding.

Enabling energy efficient sensory data collection using multiple mobile sink

Mobile sink is the challenging task for wireless sensor networks (WSNs). In this paper we propose to design an efficient routing protocol for single mobile sink and multiple mobile sink for data gathering in WSN. In this process, a biased random walk method is used to determine the next position of the sink. Then, a rendezvous point selection with splitting tree technique is used to find the optimal data transmission path. If the sink moves within the range of the rendezvous point, it receives the gathered data and if moved out, it selects a relay node from its neighbours to relay packets from rendezvous point to the sink. Proposed algorithm reduces the signal overhead and improves the triangular routing problem. Here the sink acts as a vehicle and collect the data from the sensor. The results show that the proposed model effectively supports sink mobility with low overhead and delay when compared with Intelligent Agent-based Routing protocol (IAR) and also increases the reliability and delivery ratio when the number of sources increases.

Termite-hill: Performance optimized swarm intelligence based routing algorithm for wireless sensor networks

A wireless sensor network (WSN) is a large collection of sensor nodes with limited power supply, constrained memory capacity, processing capability, and available bandwidth. The main problem in event gathering in wireless sensor networks is the formation of energy-holes or hot spots near the sink. Due to the restricted communication range and high network density, events forwarding in sensor networks is very challenging, and require multi-hop data forwarding. Improving network lifetime and network reliability are the main factors to consider in the research associated with WSN. In static wireless sensor networks, sensors nodes close to the sink node run out of energy much faster than nodes in other parts of the monitored area. The nodes near the sink are more likely to use up their energy because they have to forward all the traffic generated by the nodes farther away to the sink. The uneven energy consumption results in network partitioning and limit the network lifetime. To this end, we propose an on-demand and multipath routing algorithm that utilizes the behavior of real termites on hill building termed Termite-hill which support sink mobility. The main objective of our proposed algorithm is to efficiently relay all the traffic destined for the sink, and also balance the network energy. The performance of our proposed algorithm was tested on static, dynamic and mobile sink scenarios with varying speed, and compared with other state-of-the-art routing algorithms in WSN. The results of our extensive experiments on Routing Modeling Application Simulation Environment (RMASE) demonstrated that our proposed routing algorithm was able to balance the network traffic load, and prolong the network lifetime.

Energy-efficient data reporting with sink mobility support in object tracking sensor networks

This study proposes an energy–efficient data reporting scheme that supports sink mobility in Object Tracking Sensor Networks (OTSN). To achieve energy efficiency, the proposed scheme presents an active node selection and scheduling method to save and balance the energy consumption among nodes based on a virtual grid structure. In addition, the proposed scheme develops an elegant weight function associated with active nodes, allowing active nodes to forward data to the mobile sink efficiently. This study also proposes an object tracking method. Simulation results show that the proposed scheme outperforms TNT and SNEM in terms of the energy consumption and average path length.

An intelligent agent-based routing structure for mobile sinks in WSNs

Mobile sink brings new challenges to densely deployed and large wireless sensor networks (WSNs). When the sink moves, frequent location updates from the sink can generate excessive power consumption of sensors. In this paper, we propose IAR, an Intelligent Agent-based Routing protocol that provides efficient data delivery to mobile sink. Proposed algorithm reduces signal overhead and improve degraded route called triangular routing problem. We have evaluated IAR performance through both mathematical analysis and simulation experiments. The results show that our scheme effectively supports sink mobility with low overhead and the improvement of triangular routing problem.

무선센서 네트워크에서의 다중 가상 그리드를 이용한 데이터 전송 메커니즘

무선 센서망은 전력공급이 제한적인 센서 노드들로 구성됨으로, 에너지 비용의 최소화는 망의 수명 연장을 위해 매우 중요하다. 그러나 다수의 사건(event)과 싱크(sink)가 이동하는 환경에서 에너지 비용이 증가한다. 이는 센서 노드들과 싱크들간의 데이터 전달을 위한 라우팅 정보가 빈번히 갱신되어야 하는 문제가 있다. 즉, 싱크의 이동성을 지원하기 위한 라우팅 방안은 이동 싱크에게 끊임없이 데이터를 전달해 주어야 할 뿐만 아니라, 망 내 센서 노드들의 에너지비용을 충분히 고려해야 한다. 하지만 기존 연구들은 싱크와 소스의 이동성을 고려하지 않는 환경에서의 에너지 평준화에 초점을 둔다. 본 논문은 다중 가상 그리드 기법을 이용하여 이동성을 고려한 에너지비용 및 데이터 전송률에 있어 효율적인 라우팅 프로토콜을 제안한다. 그리고 실험을 통해 제안한 프로토콜이 데이터 전송률, 시간지연, 그리고 에너지 비용에 있어서 기존 연구 된 프로토콜들에 비해 성능의 우수함을 입증한다. Sensor networks are composed of a great number of sensor nodes. Since all sensor nodes are energy-restricted and hard to recharge, it is very important.However, the energy consumption may significantly increase if mobile sources or sinks exist in sensor networks. The reason is that the routing information for mobile sources and sinks needs to be update frequently for efficientdata delivery. The routing algorithm supporting mobile sinks should consider not only continuous data delivery but also the energy consumption of sensor nodes. However, most of the existing research focuses on even energy consumption while the mobility of sinks and sources is rarely consider. In this paper, we propose an efficient routing protocol with multiple virtual grids to reduce energy consumption and improve packets delivery efficiency. Then this paper considers the mobility. Simulation results show that our algorithm can guarantee high data delivery ratio and lower average delivery delay, while consuming lower energy than existing routing protocols in sensor networks.

SWER: small world-based efficient routing for wireless sensor networks with mobile sinks

The interest in small-world network has highlighted the applicability of both the graph theory and the scaling theory to the analysis of network systems. In this paper, we introduce a new routing protocol, small world-based efficient routing (SWER), dedicated to supporting sink mobility and small transfers. The method is based on the concept of the small worlds where the addition of a small number of long-range links in highly clustered networks results in significant reduction in the average path length. Based on the characteristic of sensor networks, a cluster-based small world network is presented, and an analytical model is developed to analyze the expected path length. SWER adopts a simple and effective routing strategy to forward data to the mobile sink in a small transfer scene and avoid expensive mechanisms to construct a high quality route. We also study the routing scheme and analyze the expected path length in the case where every node is aware of the existence of p long-range links. In addition, we develop a hierarchical mechanism in which the mobile sink only transmits its location information to the cluster heads when it enters a new cluster. Thus we also avoid expensive cost to flood the location of the mobile sink to the whole network.

Strategies for data dissemination to mobile sinks in wireless sensor networks

A wireless sensor network is a multihop wireless network consisting of spatially distributed autonomous sensors with sensing, computation, and wireless communication capabilities. Generally, each sensor has the task to monitor and measure ambient conditions and disseminate the collected data toward a base station, or sink, for data post-analysis and processing. Many data dissemination protocols have been proposed to allow the dissemination of the collected data toward a static sink. Recently, mobile sinks were shown to be more energy-effective than static ones. In this article, existing data dissemination protocols supporting mobile sinks are summarized. In addition, sink mobility is analyzed, as well as its impact on energy consumption and the network lifetime.