An efficient distributed routing protocol for wireless sensor networks with mobile sinks

Introducing mobile sinks into a wireless sensor network can effectively improve the network performance. However, sink mobility can bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose a dynamic layered routing protocol to address this problem. The proposed protocol integrates dynamic layered Voronoi scoping and dynamic anchor selection to effectively reduce the dissemination scopes and frequencies of routing updates as the sinks move in the network. Simulation results show that the proposed protocol can effectively reduce the protocol overhead while ensuring high packet delivery ratio as compared with existing work. Copyright © 2014 John Wiley & Sons, Ltd.     

多基站数据聚合无线传感器网络中的最大生命期路由

研究了多基站数据聚合无线传感器网络中的最大生命期路由问题.首先证明该类问题具有NP-hard性质,然后提出一种基于最小生成森林的启发式算法,并采用次梯度方法设计了分布式算法,最后通过大量的仿真实验分析所提路由算法性能,并给出分布式算法的收敛性能.     

Reinforcement learning movement path for multiple mobile sinks in wireless sensor networks

Mobile sink nodes play a very active role in wireless sensor network (WSN) routing. Because hiring these nodes can decrease the energy consumption of each node, end-to-end delay, and network latency significantly. Therefore, mobile sinks can soar the network lifetime dramatically. Generally, there are three movement paths for a mobile sink, which are as follows: (1) Random/stochastic, (2) controlled, and (3) fixed/ predictable/predefined paths. In this paper, a novel movement path is introduced as a fourth category of movement paths for mobile sinks. This path is based on deep learning, so a mobile sink node can go to the appropriate region that has more data at a suitable time. Thereupon, WSN routing can improve very much in terms of end-to-end delay, network latency, network lifetime, delivery ratio, and energy efficiency. The new proposed routing suggests a reinforcement learning movement path (RLMP) for multiple mobile sinks. The network in the proposed work consists of a couple of regions; each region can be employed for a special purpose, so this method is hired for any application and any size of the network. All simulations in this paper are done by network simulator 3 (NS-3). The experimental results clearly show that the RLMP overcomes other approaches by at least 32.48% in the network lifetime benchmark.     

Data security in unattended wireless sensor networks with mobile sinks

Unattended wireless sensor networks operating in hostile environments face the risk of compromise. Given the unattended nature, sensors must safeguard their sensed data of high value temporarily. However, saving data inside a network creates security problems due to the lack of tamper‐resistance of sensors and the unattended nature of the network. In some occasions, a network controller may periodically dispatch mobile sinks to collect data. If a mobile sink is given too many privileges, it will become very attractive for attack. Thus, the privilege of mobile sinks should be restricted. Additionally, secret keys should be used to achieve data confidentiality, integrity, and authentication between communicating parties. To address these security issues, we present mAKPS, an asymmetric key predistribution scheme with mobile sinks, to facilitate the key distribution and privilege restriction of mobile sinks, and schemes for sensors to protect their collected data in unattended wireless sensor networks. Copyright © 2011 John Wiley & Sons, Ltd.     

Optimization energy consumption with multiple mobile sinks using fuzzy logic in wireless sensor networks

Wireless Networks - Each sensor in WSNs receives data from the limited area under its coverage. The received data is processed by the sensor; then, it is wirelessly transmitted to the sink....     

Hierarchical location service for wireless sensor networks with mobile sinks

In wireless sensor networks (WSNs), a mobile sink can help eliminate the hotspot effect in the vicinity of the sink, which can balance the traffic load in the network and thus improve the network performance. Location‐based routing is an effective routing paradigm for supporting sink mobility in WSNs with mobile sinks (mWSNs). To support efficient location‐based routing, scalable location service must be provided to advertise the location information of mobile sinks in an mWSN. In this paper, we propose a new hierarchical location service for supporting location‐based routing in mWSNs. The proposed location service divides an mWSN into a grid structure and exploits the characteristics of static sensors and mobile sinks in selecting location servers. It can build, maintain, and update the grid‐spaced network structure via a simple hashing function. To reduce the location update cost, a hierarchy structure is built by choosing a subset of location servers in the network to store the location information of mobile sinks. The simulation results show that the proposed location service can significantly reduce the communication overhead caused by sink mobility while maintaining high routing performance, and scales well in terms of network size and sink number. Copyright © 2009 John Wiley & Sons, Ltd.     

DDRP: An efficient data‐driven routing protocol for wireless sensor networks with mobile sinks

Introduction of mobile sinks into a wireless sensor network can largely improve the network performance. However, sink mobility can cause unexpected changes of network topology, which may bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose an efficient data‐driven routing protocol (DDRP) to address this problem. The design objective is to effectively reduce the protocol overhead for data gathering in wireless sensor networks with mobile sinks. DDRP exploits the broadcast feature of wireless medium for route learning. Specifically, each data packet carries an additional option recording the known distance from the sender of the packet to target mobile sink. The overhearing of transmission of such a data packet will gratuitously provide each listener a route to a mobile sink. Continuous such route‐learning among nodes will provide fresh route information to more and more nodes in the network. When no route to mobile sink is known, random walk routing simply is adopted for data packet forwarding. Simulation results show that DDRP can achieve much lower protocol overhead and longer network lifetime as compared with existing work while preserving high packet delivery ratio. Copyright © 2012 John Wiley & Sons, Ltd.     

On providing location privacy for mobile sinks in wireless sensor networks

A common practice in sensor networks is to collect sensing data and report them to the sinks or to some pre-defined data rendezvous points via multi-hop communications. Attackers may locate the sink easily by reading the destination field in the packet header or predicting the arrival of the sink at the rendezvous points, which opens up vulnerabilities to location privacy of the sinks. In this paper, we propose a random data collection scheme to protect the location privacy of mobile sinks in wireless sensor networks. Data are forwarded along random paths and stored at the intermediate nodes probabilistically in the network. The sinks will move around randomly to collect data from the local nodes occasionally, which prevents the attackers from predicting their locations and movements. We analyze different kind of attacks threatening the location privacy of the sinks in sensor networks. We also evaluate the delivery rate, data collection delay and protection strength of our scheme by both analysis and simulations. Both analytical and simulation results show that our scheme can protect location privacy of mobile sinks effectively, while providing satisfactory data collection services.     

Novel service protocol for supporting remote and mobile users in wireless sensor networks with multiple static sinks

A wireless sensor network typically consists of users, a sink, and a number of sensor nodes. The users may be remotely connected to a wireless sensor network and via legacy networks such as Internet or Satellite the remote users obtain data collected by the sink that is statically located at a border of the wireless sensor network. However, in practical sensor network applications, there might be two types of users: the traditional remote users and mobile users such as firefighters and soldiers. The mobile users may move around sensor fields and they communicate with the static sink only via the wireless sensor networks in order to obtain data like location information of victims in disaster areas. For supporting the mobile users, existing studies consider temporary structures. However, the temporary structures are constructed per each mobile user or each source nodes so that it causes large energy consumption of sensor nodes. Moreover, since some of them establish the source-based structure, sinks in them cannot gather collective information like mean temperature and object detection. In this paper, to effectively support both the remote users and the mobile users, we propose a novel service protocol relying on the typical wireless sensor network. In the protocol, multiple static sinks connect with legacy networks and divide a sensor field into the number of the multiple sinks. Through sharing queries and data via the legacy networks, the multiple static sinks provide high throughput through distributed data gathering and low latency through short-hops data delivery. Multiple static sinks deliver the aggregated data to the remote users via the legacy networks. In case of the mobile users, when a mobile user moves around, it receives the aggregated data from the nearest static sink. Simulation results show that the proposed protocol is more efficient in terms of energy consumption, data delivery ratio, and delay than the existing protocols.     

接触时间感知的移动WSNs路由

多数无线传感网络应用中需要处理节点移动性,为此,面向移动无线传感网络(M-WSNs),提出基于接触时间的区路由(CTAR)。CTAR路由先利用源节点和目的节点的相对位置信息形成活动区,只有区内的节点才能参与路由;然后,利用节点的移动矢量信息选择能够最大化接触时间的邻居节点作为下一跳转发节点。仿真数据表明,与RoF协议相比,CTAR协议的数据包传递率得到有效提高。     

移动WSNs的能耗区路由

节点的移动对移动无线传感网络(MWSNs)路由设计提出了挑战.为此,提出基于接触时间的能耗区路由(CECA).CECA路由采用休眠-唤醒机制,降低了节点能耗.CECA路由利用源节点与信宿的位置信息构成圆角矩形区域,且只允许区域内的节点才能参与路由.通过节点移动信息,计算接触时间,并利用接触时间设置定时器,进而通过定时器...     

A distributed data storage protocol for heterogeneous wireless sensor networks with mobile sinks

This paper presents ProFlex, a distributed data storage protocol for large-scale Heterogeneous Wireless Sensor Networks (HWSNs) with mobile sinks. ProFlex guarantees robustness in data collection by intelligently managing data replication among selected storage nodes in the network. Contrarily to related protocols in the literature, ProFlex considers the resource constraints of sensor nodes and constructs multiple data replication structures, which are managed by more powerful nodes. Additionally, ProFlex takes advantage of the higher communication range of such powerful nodes and uses the long-range links to improve data distribution by storage nodes. When compared with related protocols, we show through simulation that Proflex has an acceptable performance under message loss scenarios, decreases the overhead of transmitted messages, and decreases the occurrence of the energy hole problem. Moreover, we propose an improvement that allows the protocol to leverage the inherent data correlation and redundancy of wireless sensor networks in order to decrease even further the protocol’s overhead without affecting the quality of the data distribution by storage nodes.     

Sink-oriented tree based data dissemination protocol for mobile sinks wireless sensor networks

Wireless Networks - Data dissemination toward static sinks causes the nearby nodes to deplete their energy quicker than the other nodes in the field (i.e., this is referred to as the hotspot...     

Rendezvous-based data dissemination for supporting mobile sinks in multi-hop clustered wireless sensor networks

In wireless sensor networks, a clustering-based technique is considered as an efficient approach for supporting mobile sinks without using position information. It exploits a Backbone-based Virtual Infrastructure (BVI) which uses only cluster heads (CHs) to construct routing structures. Since sensor nodes have constrained energy and are failure-prone, the effective design of both a clustering structure to construct a BVI and a routing protocol in the BVI is an important issue to achieve energy-efficient and reliable data delivery. However, since previous studies use one-hop clustering for a BVI, they are not robust against node and link failures and thus leading low data delivery ratio. They also use flooding-based routing protocols in a BVI and thus leading high energy consumption. Thus, in this paper, we propose a rendezvous-based data dissemination protocol based on multi-hop clustering (RDDM). Since RDDM uses a multi-hop clustering to provide enough backup sensor nodes to substitute a CH and enough backup paths between neighbor CHs, it can provide high robustness against node and link failures. By using a rendezvous CH, RDDM constructs routing paths from source nodes to mobile sinks without flooding in our BVI and thus can save energy of sensor nodes. By considering movement types of sinks, RDDM finds out a shorter path between a source node and a mobile sink through signaling only between neighbor CHs and thus can reduce the energy consumption. Analysis and simulation results show that RDDM provides better performance than previous protocols in terms of energy consumption and data delivery ratio.     

Energy efficient rendezvous points based routing technique using multiple mobile sink in heterogeneous wireless sensor networks

Wireless Networks - In recent decades, Sensor nodes (SNs) are used in numerous uses of heterogeneous wireless sensor networks (HWSNs) to obtain a variety of sensing data sources. Sink mobility...     

Mapping density to bandwidth in tree-based wireless sensor networks

Sensors in a wireless sensor network (WSN) are often resource constrained: they are limited in processing speed, storage capacity and energy. Therefore, most of the research projects in WSN domain are aiming at the energy issue, while leaving some equally crucial issues unexplored, like the QoS support. In this paper, we present QoS support in WSN while highlighting the QoS mapping issue, a complex process in which QoS parameters are translated from level to level and we present a case study of a TDMA tree-based clustered WSN, where network density at the user level is mapped to bandwidth at the network level. We end our paper with simulations that prove our formulas and highlight the relationships between QoS parameters.     

无线传感器网络中基于协同的机会路由

提出了一种适用于无线传感器网络的基于协同的机会路由协议,协议在结合区域路由、会聚机制和睡眠机制的基础上,使用跨层的方法对无线传感器网络的路由协议进行改进,以增强网络连接随机变化条件下路由协议的顽健性,并以能量有效的方式提高了数据的转发速度.仿真结果表明,在不同节点密度条件下,基于协同的机会路由在数据转发能效方面比非协同的机会路由有很大的提高.     

Maximum lifetime routing in wireless sensor networks

A routing problem in static wireless ad hoc networks is considered as it arises in a rapidly deployed, sensor based, monitoring system known as the wireless sensor network. Information obtained by the monitoring nodes needs to be routed to a set of designated gateway nodes. In these networks, every node is capable of sensing, data processing, and communication, and operates on its limited amount of battery energy consumed mostly in transmission and reception at its radio transceiver. If we assume that the transmitter power level can be adjusted to use the minimum energy required to reach the intended next hop receiver then the energy consumption rate per unit information transmission depends on the choice of the next hop node, i.e., the routing decision. We formulate the routing problem as a linear programming problem, where the objective is to maximize the network lifetime, which is equivalent to the time until the network partition due to battery outage. Two different models are considered for the information-generation processes. One assumes constant rates and the other assumes an arbitrary process. A shortest cost path routing algorithm is proposed which uses link costs that reflect both the communication energy consumption rates and the residual energy levels at the two end nodes. The algorithm is amenable to distributed implementation. Simulation results with both information-generation process models show that the proposed algorithm can achieve network lifetime that is very close to the optimal network lifetime obtained by solving the linear programming problem.     

Distributed power-source-aware routing in wireless sensor networks

Wireless Networks - Although many applications use battery-powered sensor nodes, in some applications battery- and mains-powered nodes coexist. In this paper, we present a distributed algorithm...     

移动Sink传感网中基于IEEE 802.15.4的拓扑控制与路由

针对查询驱动的移动Sink无线传感器网络,基于IEEE 802.15.4标准,提出了一个联合簇树组网和移动路由的跨层协议设计方案。以能耗、网络连通度、负载均衡和子树深度等指标为评价因子,在多目标优化模型下定义了一个拓扑综合评价函数,构建稳定的最优簇树网络结构;改进了IEEE 802.15.4 MAC中基于信标帧调度的分布式睡眠同步算法,维护较低占空比下的网络同步与拓扑修正;利用拓扑形成过程中依"最早信标帧"、"最好链路"、"最小层次"3种准则确立的父子关系,建立移动Sink与N-Hop范围内节点的双向路由路径。最终将上述MAC层的拓扑控制方案与网络层的查询路由方法完整实现于TinyOS协议栈中。实验结果表明,评价函数能够有效地反映组网质量,N-Hop后验式路由结合睡眠同步机制,在"最好链路"拓扑下表现出较高的能量效率。