Rendezvous based routing protocol for wireless sensor networks with mobile sink

In wireless sensor networks, the sensor nodes find the route towards the sink to transmit data. Data transmission happens either directly to the sink node or through the intermediate nodes. As the sensor node has limited energy, it is very important to develop efficient routing technique to prolong network life time. In this paper we proposed rendezvous-based routing protocol, which creates a rendezvous region in the middle of the network and constructs a tree within that region. There are two different modes of data transmission in the proposed protocol. In Method 1, the tree is directed towards the sink and the source node transmits the data to the sink via this tree, whereas in Method 2, the sink transmits its location to the tree, and the source node gets the sink’s location from the tree and transmits the data directly to the sink. The proposed protocol is validated through experiment and compared with the existing protocols using some metrics such as packet delivery ratio, energy consumption, end-to-end latency, network life time.     

Energy efficient and QoS aware routing protocol for Clustered Wireless Sensor Network

In this paper, a protocol called Energy Efficient and QoS aware Routing (EEQR) protocol for Clustered Wireless Sensor Network is proposed. To ensure QoS for different traffic types, prioritization of data is done based on message type and content. To address energy efficiency (hotspot problem) and high end-to-end delay problem, a combination of mobile and static sink is used for data gathering. Delay sensitive message are sent through the static sink and delay tolerant message are send through the mobile sink. Consequently, EEQR incurs less end-to-end delay, is energy efficient as well as able to ensure QoS. To evaluate the performance of the proposed strategy, intensive simulations are carried out. Performance of the proposed strategy is compared with the static sink and mobile sinks strategies. The results demonstrated that EEQR has prolonged the network and coverage lifetime, as well as has improved the other QoS routing parameters, such as delay, packet loss ratio, and throughput.     

基于位置服务器树的移动汇聚点的位置管理与路由协议

对于无线传感器网( WSN),提出了基于位置服务器树的移动汇聚点(Sink)的位置管理与路由协议LSTLMRP( Location Server Tree based Location Management and Routing Protocol).当汇聚点移动时,它只需对它的局部位置服务器树或整个位置服务器树,而不...     

Proactive Highly Ambulatory Sensor Routing (PHASeR) protocol for mobile wireless sensor networks

This paper presents a novel multihop routing protocol for mobile wireless sensor networks called PHASeR (Proactive Highly Ambulatory Sensor Routing). The proposed protocol uses a simple hop-count metric to enable the dynamic and robust routing of data towards the sink in mobile environments. It is motivated by the application of radiation mapping by unmanned vehicles, which requires the reliable and timely delivery of regular measurements to the sink. PHASeR maintains a gradient metric in mobile environments by using a global TDMA MAC layer. It also uses the technique of blind forwarding to pass messages through the network in a multipath manner. PHASeR is analysed mathematically based on packet delivery ratio, average packet delay, throughput and overhead. It is then simulated with varying mobility, scalability and traffic loads. The protocol gives good results over all measures, which suggests that it may also be suitable for a wider array of emerging applications.     

A honeycomb structure based data gathering scheme with a mobile sink for wireless sensor networks

With the widespread use of wireless sensor networks, more and more applications require energy efficient and low packet loss rate data collection methods. Recently, the concept of ‘mobile’ is introduced in various mechanisms to meet the needs of this kind. In this paper, a honeycomb structure based data gathering scheme, HSDG, is proposed for wireless sensor networks with a mobile sink. By partitioning the network into a honeycomb structure and giving each partition a direction value, every sensor node can obtain the latest location of the mobile sink dynamically with a small amount of broadcasting overhead. HSDG uncouples the moving strategy of mobile sink from the data forwarding mechanism, and three subscheme HSDG_RM, HSDG_DGM, and HSDG_EGM are proposed. Our schemes are investigated from average energy consumption, maintenance cost, packet loss rate and the number of packets collected. Compared with BTDG and ALURP, HSDG_DGM is the most energy efficient with a low packet loss rate.     

Performance evaluation of tree based data aggregation for real time indoor environment monitoring using wireless sensor network

A fundamental challenge in the implementation of Wireless Sensor Network is to reduce packet loss when channel bandwidth is limited and the energy of sensor is finite. In this paper, a suitable solution is provided for controlling packet loss through tree-based data aggregation and routing. From this perspective, a binary tree-based data aggregation and routing has been proposed which can reduce packet loss and energy dissipation which occurs due to unsuccessful packet delivery. Simulation result using NS-2 shows that binary tree-based data aggregation reduces packet loss up to 63.1% compared to cluster based protocol LEACH, up to 26.5% compared to chain based protocol PEGASIS. Moreover binary tree based data aggregation out performs both LEACH and PEGASIS with respect to the parameters end to end delay, packet delivery ratio and total energy consumption. Our proposed architecture integrates sensor network, mobile device, Access point and Cloud services as a single unit for real time monitoring. An experimental analysis of the proposed approach for indoor environment monitoring is carried out in the university laboratory to evaluate the performance in terms of time and energy consumption.

     

一种移动终端辅助的传感器网络数据收集协议

提出了一种利用具有传感器通信接口的移动终端设备（如手机、手提电脑、个人数字助理等）进行辅助数据获取的传感器网络数据收集协议。网络中固定汇聚节点与移动终端共存,全部传感器节点都维护到固定汇聚节点的路由,移动终端进入网络后定期向其附近小范围内的传感器节点扩散自己的存在信息,传感器节点向距自己跳数最小的汇聚节点或移动终端发送或转发数据包,移动终端和传感器节点之间通过应答和重传的机制来保证数据的可靠传输。仿真研究证明,该协议在延长网络生存时间的同时可以获得较高的数据传输成功率和较短的数据传输延迟,而且可靠性、灵活性、可扩展性较强。     

An Energy-Aware Geographic Routing Protocol for Mobile Ad Hoc Networks

Mobile ad hoc networks (MANET) are characterized by multi-hop wireless links and resource constrained nodes. To improve network lifetime, energy balance is an important concern in such networks. Geographic routing has been widely regarded as efficient and scalable. However, it cannot guarantee packet delivery in some cases, such as faulty location services. Moreover, greedy forwarding always takes the shortest local path so that it has a tendency of depleting the energy of nodes on the shortest path. The matter gets even worse when the nodes on the boundaries of routing holes suffer from excessive energy consumption, since geographic routing tends to deliver data packets along the boundaries by perimeter routing. In this paper, we present an Energy-Aware Geographic Routing (EGR) protocol for MANET that combines local position information and residual energy levels to make routing decisions. In addition, we use the prediction of the range of a destination''s movement to improve the delivery ratio. The simulation shows that EGR exhibits a noticeably longer network lifetime and a higher delivery rate than some non-energy-aware geographic routing algorithms, such as GPSR, while not compromising too much on end-to-end delivery delay.     

Analyzing multi-hop routing feasibility for sensor data harvesting using mobile sinks

This paper presents a modeling framework for characterizing the feasibility and impacts of multi-hop packet routing in sensor networks with mobile sinks. Data collection in sensor networks using mobile sinks has recently been investigated to improve energy performance at the cost of collection delay. Although the data collection can be accomplished with varying degrees of multi-hop routing, for a given data generation rate, as the extent of multi-hop routing increases, the round traversal time of the sink decreases. At the same time, the interference experienced by the mobile sink-to-sensor links and the consequent upload time go up. This paper characterizes these competing effects and develops a methodology for determining the extent of multi-hop routing that is feasible for given network and application parameters such as sensor data generation rate, wireless link capacity between sensors and mobile sink, the speed of the mobile sink and node density.     

A Novel Gradient Boosted Energy Optimization Model (GBEOM) for MANET

Mobile Ad Hoc Network (MANET) is an infrastructure-less network that is comprised of a set of nodes that move randomly. In MANET, the overall performance is improved through multipath multicast routing to achieve the quality of service (quality of service). In this, different nodes are involved in the information data collection and transmission to the destination nodes in the network. The different nodes are combined and presented to achieve energy-efficient data transmission and classification of the nodes. The route identification and routing are established based on the data broadcast by the network nodes. In transmitting the data packet, evaluating the data delivery ratio is necessary to achieve optimal data transmission in the network. Furthermore, energy consumption and overhead are considered essential factors for the effective data transmission rate and better data delivery rate. In this paper, a Gradient-Based Energy Optimization model (GBEOM) for the route in MANET is proposed to achieve an improved data delivery rate. Initially, the Weighted Multi-objective Cluster-based Spider Monkey Load Balancing (WMC-SMLB) technique is utilized for obtaining energy efficiency and load balancing routing. The WMC algorithm is applied to perform an efficient node clustering process from the considered mobile nodes in MANET. Load balancing efficiency is improved with a higher data delivery ratio and minimum routing overhead based on the residual energy and bandwidth estimation. Next, the Gradient Boosted Multinomial ID3 Classification algorithm is applied to improve the performance of multipath multicast routing in MANET with minimal energy consumption and higher load balancing efficiency. The proposed GBEOM exhibits ∼4% improved performance in MANET routing.     

一种基于链路质量的移动Ad-hoc网络地理路由算法

如何实现简单的路由机制,使节点能够快速、高效地完成分组传递,是移动aa-ho}网络研究的一个基本问题。针对无线链路在高误码率和杭干扰技术方面的不足,提出了将链路质量作为路由选择的度量,设计并实现了基于链路质量的地理路由算法LQPR,解决了在非理想无线链路上采用传统贪婪算法引起数据分组传送率下降的问题。该算法综合了链路质量选择模式和边界选择模式,并利用目标定位技术获取的地理位置信息指导分组的转发,以减少控制开销,优化路径选择,实现数据分组快速有效的传输。在NS-2中完整实现了LQPR协议的仿真,并通过对网络节点发送数据包的端到端时延、吞吐量以及包传送率进行比较、评估和检侧,验证了LQPR路由协议的有效性。     

基于簇的无线传感器网络交会路由协议

针对现有无线传感器网络(WSN)协议中更多消耗sink附近节点能量导致网络寿命短的问题,本文提出一种基于簇的无线传感器网络交会路由协议(Cluster-based Rendezvous Routing Protocol, CRRP)。该协议是基于交会的路由协议,其中在网络的中间构建交会区域,该交会区域划分整个网络区域并在传感器节点之间分配网络负载,这延长了网络寿命。此交会区域内的节点分为不同的簇,每个簇的簇头(CH)负责不同簇之间的通信,sink在此交会区域内发送其更新的位置信息,并且当传感器节点想要发送数据时,会从该交会区域检索sink的当前位置信息并直接将数据发送到sink。仿真实验结果表明,在能耗与网络寿命性能方面,本文CRRP协议优于Rendezvous协议、LBDD协议、Railroad协议和Ring协议。     

具有移动sink 的无线传感器网络能量均衡分簇路由协议

提出了一种具有移动sink的无线传感器网络能量均衡分簇路由协议.将整个网络划分为若干个网格,每个网格采用簇头评判模型选出簇头,簇头负责收集簇内兴趣事件,进行数据融合后转发给移动sink.当sink在同一个网格内移动时,只需要将新位置通知当前网格的簇头;当sink移动到新的网格时,先将位置报告给新网格的簇头,然后由该簇头将位置信息分发给其他簇头.该协议能够有效地均衡节点的能量消耗,延长网络的生存时间.     

一种MANET网络的位置辅助路由协议

Ad-Hoc网络（即MANET）由于节点的移动，导致路由频繁变化．基于位置辅助路由协议（LAR1），本文提出了一种带路径优化的增强LAR1协议（ELAR1）．节点通过在接收到的路由请求包中获取其携带的其它转发节点位置信息，提高发起路由请求时预知目的节点位置的几率，降低网络内路由广播包的数量．针对路由路径中可能存在非最短路由，利用位置信息对获得的路由进行路径优化．仿真结果表明，ELAR1比LAR1有较低的路由请求开销、较高的包投递率和较低的端到端延迟．     

基于矢量转发的节能型水声传感器网络路由协议

近年来,水下物联网和海洋物联网已经成为一个热门的研究方向,水声传感器网络路由协议作为海洋物联网的重要组成部分也得到研究人员的广泛重视。因此在HH-VBF协议的基础上,提出一种基于矢量转发的节能型水声传感器网络路由协议——ES-HH-VBF协议。ES-HH-VBF协议在保留了将下一跳节点的位置信息作为计算节点转发因子的参考值的基础上,引入了节点剩余能量改进节点转发因子的计算方式,以此来均衡网络中的能量消耗;并且还将预设的距离阈值由HH-VBF协议中的固定值改为根据节点剩余能量变化的动态值,从而可以动态地控制数据冗余。为了验证ES-HH-VBF协议的性能,在水下传感器网络仿真器Aqua-Sim上对HH-VBF协议和ES-HH-VBF协议的性能进行了对比分析。仿真结果表明,随着节点发包间隔的增加,ES-HH-VBF协议的包传递率比HH-VBF协议的包传递率高4.2%左右,网络平均时延比HH-VBF协议低11.3%左右,网络平均能耗比HH-VBF协议低8.2%左右。通过对ES-HH-VBF 协议和HH-VBF协议的仿真实验分析可知,ES-HH-VBF协议在提高数据包传递率、降低平均能耗和降低平均延时方面具有较大优势。     

An enhanced real-time routing protocol with load distribution for mobile wireless sensor networks

Mobile wireless sensor network (MWSN) is a wireless ad hoc network that consists of a very large number of tiny sensor nodes communicating with each other in which sensor nodes are either equipped with motors for active mobility or attached to mobile objects for passive mobility. A real-time routing protocol for MWSN is an exciting area of research because messages in the network are delivered according to their end-to-end deadlines (packet lifetime) while sensor nodes are mobile. This paper proposes an enhanced real-time with load distribution (ERTLD) routing protocol for MWSN which is based on our previous routing protocol RTLD. ERTLD utilized corona mechanism and optimal forwarding metrics to forward the data packet in MWSN. It computes the optimal forwarding node based on RSSI, remaining battery level of sensor nodes and packet delay over one-hop. ERTLD ensures high packet delivery ratio and experiences minimum end-to-end delay in WSN and MWSN compared to baseline routing protocol. In this paper we consider a highly dynamic wireless sensor network system in which the sensor nodes and the base station (sink) are mobile. ERTLD has been successfully studied and verified through simulation experiment.     

一种异构传感器网络的能量有效路由算法

无线传感器网络设计能量有效的路由算法是至关重要的.对于不同类型的传感器节点传输不同大小数据包信息以及拥有不同初始能量的异构传感器网络,本文提出了一种适合此传感器网络的D-REECR路由算法,此算法是在之前提出的REECR算法上改进而来.基于REECR没有考虑簇头在选择时的分布不均匀性,D-REECR将簇头闻的距离作为选择簇头的因素之一,与节点的剩余能量及能量消耗率一起作为选择簇头的依据.这样使各个簇大小基本一致,从而平衡各个节点的能量消耗,达到延长网络生命的目的.仿真结果显示,改进后的D-REECR算法比REECR算法在能量效率上大约提高5%～10%.     

End-to-end support for statistical quality of service in heterogeneous mobile ad hoc networks

In heterogeneous mobile ad hoc networks (MANETs), different types of mobile devices with diverse capabilities may coexist in the same network. The heterogeneity of MANETs makes end-to-end support for quality of service (QoS) guarantees more difficult than in other types of networks, not to mention the limited bandwidth and frequent topology changes of these networks. Since QoS routing is the first step toward achieving end-to-end QoS guarantees in heterogeneous MANETs, we propose a QoS routing protocol for heterogeneous MANETs. The proposed protocol, called virtual grid architecture protocol (VGAP), uses a cross-layer approach in order to provide end-to-end statistical QoS guarantees. VGAP operates on a fixed virtual rectilinear architecture (virtual grid), which is obtained using location information obtained from global positioning system (GPS). The virtual grid consists of a few, but possibly more powerful, mobile nodes known as ClusterHeads (CHs) that are elected periodically. CHs discover multiple QoS routes on the virtual grid using an extended version of the open shortest path first (OSPF) routing protocol and an extended version of WFQ scheduling policy that takes into account the wireless channel state. Moreover, VGAP utilizes a simple power control algorithm at the physical layer that provides efficient energy savings in this heterogeneous setting. Simulation experiments show that VGAP has a good performance in terms of packet delivery ratio, end-to-end packet delay, call blocking probability, and network scalability.     

基于活动区域的移动无线传感器网络路由协议

为了解决移动无线传感器网络中能量效率问题,提出了一种基于活动区域的移动无线传感器网络（WSN）路由协议。本方法使用源和sink节点相对位置来形成路由的活动区域,网络中的移动节点使用睡眠唤醒模式来节约能源。移动向量信息（如当前位置、方向和速度）以及节点的剩余能量,用于选择能够提供最大连接保留时间的邻居,移动向量信息也被用来唤醒活动区域中的移动节点。实验表明,与其他路由协议进行比较,该方法在分组传输过程中具有更高的可靠性。     

基于多Mobile-Sink能量有效的WSN再编程协议研究

现有的WSN再编程能量有效协议多集中在单个Sink的静态网络环境下,这就限制了网络规模。基于多Sink的动态WSN再编程能量有效协议能够适应大规模网络环境。提出一种基于多Mobile-Sink能量有效的WSN再编程协议,在该协议中,网络拓扑采用圆形部署,以圆心为坐标系原点,将圆形拓扑分为八个半象限,而每一个mobile sink沿着八个半象限相交的直线往返运动,在每条直线上隔一定距离设置一个信息交换点IEP,Sink在IEP同周围的节点通信。仿真结果表明,提出的方案同MNP协议相比,在节点平均能耗和单个数据包传输能耗两项上更有效率和优势。