Moralism: mobility prediction with link stability based multicast routing protocol in MANETs

In recent research, link stability is getting tremendous attention in mobile adhoc networks (MANETs), because of several impediments that occur in a reliable and robust network. Link stability metric is used to improve network performance in terms of end-to-end delay, data success delivery ratio (DSDR) and available route time (ART). Energy consumption, bandwidth and communication delay of major concern in ad hoc networks. A high mobility of MANET nodes reduces the reliability of network communication. In a dynamic networks, high mobility of the nodes makes it very difficult to predict the dynamic routing topology and hence cause route/link failures. Multicast in MANETs is an emerging trend that effectively improves the performance while lowering the energy consumption and bandwidth usage. Multicast routing protocol transmits a packet to multicast a group at a given time instant to achieve a better utilization of resources. In this paper, node mobility is considered to map better their movement in the network. So, the links with long active duration time can be identified as a stable link for route construction. Variation in signal strength is used to identify whether the direction of the node is towards or away from estimating node. We consider signal strength as QoS metric to calculate link stability for route construction. Efforts are made to identify the link with highly probable longer lifetime as the best suitable link between two consecutive nodes. We predict the movement time of nodes that define the route path to the node destination. Exata/cyber simulator is used for network simulation. The simulation results of the proposed routing protocol are compared with on-demand multicast routing protocol and E-ODMRP, which works on minimum hop count path. Analysis of our simulation results has shown improvement of various routing performance metrics such as DSDR, ART, routing overhead and packet drop ratio.     

CJBR: connected junction-based routing protocol for city scenarios of VANETs

Telecommunication Systems - In this work, a new routing protocol designed exclusively for improving the connectivity of junction-based routing in city scenarios of vehicular ad hoc networks is...     

车载自组织网中基于车辆密度的可靠性路由协议

为了降低转发节点在转发范围内直接寻找一个最优或次优节点的复杂度、减少平均跳数和提高链路的可靠性,提出一种车载自组织网络中基于车辆密度的可靠性路由协议,转发节点首先根据道路车辆密度设置最优块的大小,并将转发范围分割成若干大小相等的块,然后选择其中一个距离转发节点最远的块,最后在被选中的块里根据可靠性原则选择连接时间最长的邻居节点作为中继节点进行转发。仿真结果表明,与EG-RAODV 相比,所提路由协议的平均跳数较少,平均每跳前进距离较大,能够使数据分组快速到达目的节点。     

车载自组织网络中基于十字路口的地理感知路由协议

为了解决城市道路多十字路口,对单个车辆节点运动感知不敏感所带来的通信性能下降问题,提出一种车载自组织网络中基于十字路口的地理感知路由(IGPR)协议,通过网络网关选择道路十字路口,形成骨干路由,在保证高连通概率的同时满足时延和误比特率要求.在双向道路模型的基础上分析获得平均时延和平均跳数的数学计算式.仿真结果表明,IGPR协议与FRGR协议、VRR协议相比,传输时延小,跳数少,通信性能好.     

Geographic routing protocol for vehicular ad hoc networks in city scenarios: a proposal and analysis

The characteristics of vehicular ad hoc networks (VANETs) make the design of routing protocol a great challenge. In this paper, we propose a vehicle density and load aware routing protocol for VANETs called VDLA. VDLA adopts sequential selection of junctions to construct the route. The selection is based on the real‐time vehicle density, the traffic load, and the distance to the destination. The network information is collected by a decentralized mechanism. Through factoring in these metrics, the packets are avoided being sent to roads where network is disconnected, and the network load is balanced to mitigate network congestion. The intermediate junctions are selected before the packet reaches a junction to reduce the unnecessary hops. Our study also investigates the impact of the high mobility of the nodes. An analytical framework is proposed to analyze the mobility. Based on the analysis, the traditional Hello scheme is enhanced to improve the accuracy of the neighbor table. In the simulation, we compare VDLA with greedy perimeter coordinator routing and GpsrJ+, which are geographic routings protocols proposed for VANETs. The results validate the superiority of VDLA in terms of end‐to‐end delay and packet delivery rate. And the superiority holds in different scenarios. Copyright © 2013 John Wiley & Sons, Ltd.     

RMRPTS: a reliable multi-level routing protocol with tabu search in VANET

Vehicular ad hoc network (VANET), a subclass of mobile ad hoc networks (MANETs), is a promising approach for the intelligent transportation system (ITS). One of the main challenges in VANETs is establishment of vehicular communication and stable routing. Another problem of VANETs is their tendency of being trapped in a local optimum. In this paper, a reliable multi-level routing protocol based on clustering, RMRPTS has been introduced in VANETs. Even if this topology constantly changes, clustering based multi-level routing will create the possibility of self-organization and route maintaining; moreover, it will solve the problem of developing a trap in the local optimum using tabu search. At the first level, the proposed protocol is an extension of AODV routing protocol that has been improved using fuzzy logic in order to create reliable routing between cluster members. Tabu search has been used at a higher level for routing between cluster heads and destination. Tabu search is a meta-heuristic improved learning method used for solving hybrid optimization problems, and it uses cost function to select a solution among a set of possible solutions. The effective parameters used in the proposed method to select the best path include nodes distance, the velocity of nodes, node’s angle, link stability, and link reliability. The proposed protocol was simulated using an NS-2 simulator, and the results of its performance showed increased average packet delivery rate and decreased average end to end delays, number of packet losses compared with earlier protocols.     

一种改进的候选邻居节点的VANET路由协议

车载自组网的大多路由协议都使用泛洪算法来传递路由更新包,而基本的泛洪算法会有很高的重传率,高重传率直接会导致数据包的碰撞以及网络的阻塞,这些都极大影响了网络的性能。为此,提出一种高效泛洪算法,在发送的RREQ中包含4个最稳定候选邻居节点的地址,只有这4个节点对收到的RREQ进行转发,其余节点则丢弃。仿真结果表明该算法降低了丢包率,提高了网络的吞吐量。     

Zone-based routing protocol with mobility consideration for wireless sensor networks

Hierarchical routing and clustering mechanisms in Wireless Sensor Networks (WSN) help to reduce the energy consumptions and the overhead created when all the sensor nodes in the network are sending information to the central data collection point. Most of the routing and clustering protocols proposed for WSN assume that the nodes are stationary. However, in applications like habitat monitoring or search and rescue, that assumption makes those clustering mechanisms invalid, since the static nature of sensors is not real. In this paper, we propose Zone-based Routing Protocol for Mobile Sensor Networks (ZoroMSN) that considers the design aspects such as mobility of sensors, zones and routes maintenance, information update and communication between sensor nodes. Simulation results show the effectiveness and strengths of the ZoroMSN protocol such as a low routing and mobility overhead, while achieving a good performance in WSN using small zone sizes and sensors with low speed. Simulation results also show that ZoroMSN outperforms existing LEACH-ME and LEACH-M protocols in terms of network lifetime and energy consumptions.     

Enhanced mobility routing protocol for wireless sensor network

Wireless Networks - Recently, the routing protocol for low power and lossy networks (RPL) was standardized and is considered as the default standard for routing over the low power and lossy...     

PRP: peripheral routing protocol for WSN realistic marginal mobility model

This article proposes a new routing protocol called Peripheral Routing Protocol (PRP) for the scenario where the mobile destination (D) moves at the wireless sensor network (WSN) periphery for gathering data. From a connectivity point of view, when D follows the marginal mobility model (MMM), the WSN becomes a hybrid network: a sparse network, because of the interrupted connectivity between D and the rest of the nodes and a well-connected network, because of the connectivity between all the other nodes of the WSN except D. It will be proven through MATLAB simulations that, for a military application scenario where D’s connectivity to the WSN varies between 10% and 95%, compared with the 100% case, PRP outperforms routing protocols recommended for Mobile Ad-hoc Networks (MANET) in three ways: it maintains an average Packet Delivery Ratio (PDR) over 90%, a below 10% and 5% increase for the Average End to End Delay (AETED) and energy per transmitted packet.     

VANET中基于分布式的分簇的路由机制

车载自组网(VANET)是一种将高速移动车辆作为通信节点的自组网,动态的拓扑结构致使传统的自组网路由机制不再适用。为此,提出基于分布式的分簇路由机制(DCRM)。DCRM首先引用RTB/CTB握手策略,源节点利用RTB/CTB数据包,获取其一跳邻居的信息,然后源节点根据每两个邻近节点间的距离小于门限值的原则,以分布式方式对这些邻居节点进行簇划分。随后,将每个簇中选择一个离源节点最远的节点作为簇头,源节点将消息传输至簇头。接收消息后,簇头成了源节点,重复此过程直至消息传输至目的节点。仿真结果表明,提出的DCRM提高了消息传输效率、降低了消息传输时延。     

互域移动性的一种新的安全路由最优化协议

下一代移动网络提供一种方法支持移动用户在异构的接入网络之间漫游。我们需要在不同的移动管理域之间建立信任关系。在这篇文章中,提出了基于公钥密钥交换协议的互域网移动性的新的安全最优化路由协议。移动节点之间的信息交换将比通常的方法少。     

Zigbee路由协议在VANET监控系统中的应用分析

本文以VANET的应用需求为出发点,提出一种基于双层拓扑结构的网络模型,并使用Network Simulator 2．0版软件完成了模型仿真,分析了簇树、AODVjr以及ZBR三种路由协议在相同车联网环境下的性能表现。最终表明,ZBR路由协议能够在确保较短时延以及较高分组递交率的条件下,很好地实现网络开销的降低。     

基于链路可用性预测的AODV路由协议研究

传统的AODV路由协议无法适应Ad hoc网络拓扑的高度动态变化.对AODV路由算法进行链路可用性预测扩展,节点通过接收分组的能量值和链路连续可用时间选择最可靠的路径进行路由,并在链路真正失效之前启动预先修复过程.仿真结果表明,改进后的AODV协议提高了分组的投递率,降低了分组端到端平均传输延时,路由协议的可靠性得到改进.     

Vehicle density based multihop broadcast protocol in VANET

In vehicular ad hoc networks (VANET), the medium access control (MAC) protocol was of crucial importance to provide time-critical multihop broadcast. Contemporary multihop broadcast protocols in VANET usually choose the farthest node in broadcast range as the forwarder to reduce the number of forwarding hops. However, it was demonstrated that the farthest forwarder may experience long contention delay in case of high vehicle density. An IEEE 802.11p-based multihop broadcast protocol vehicle density based forwarding (VDF) was proposed, which adaptively chose the forwarder according to the vehicle density. The evaluation results in safety warning and online game applications show that, VDF could shorten broadcast delay by achieving the proper trade-off between the contention delay and coverage speed.     

MQ-Routing: Mobility-, GPS- and energy-aware routing protocol in MANETs for disaster relief scenarios

Mobile-Ad-Hoc-Networks (MANETs) are self-configuring networks of mobile nodes, which communicate through wireless links. The main issues in MANETs include the mobility of the network nodes, the scarcity of computational, bandwidth and energy resources. Thus, MANET routing protocols should explicitly consider network changes and node changes into the algorithm design. MANETs are particularly suited to guarantee connectivity in disaster relief scenarios, which are often impaired by the absence of network infrastructures. Moreover, such scenarios entail strict requirements on the lifetime of the device batteries and on the reactivity to possibly frequent link failures. This work proposes a proactive routing protocol, named MQ-Routing, aimed at maximizing the minimum node lifetime and at rapidly adapting to network topology changes. The proposed protocol modifies the Q-Routing algorithm, developed via Reinforcement Learning (RL) techniques, by introducing: (i) new metrics, which account for the paths availability and the energy in the path nodes, and which are dynamically combined and adapted to the changing network topologies and resources; (ii) a fully proactive approach to assure the protocol usage and reactivity in mobile scenarios. Extensive simulations validate the effectiveness of the proposed protocol, through comparisons with both the standard Q-Routing and the Optimized Link State Routing (OLSR) protocols.     

A location prediction based routing protocol and its extensions for multicast and multi-path routing in mobile ad hoc networks

This paper discusses a new location prediction based routing (LPBR) protocol for mobile ad hoc networks (MANETs) and its extensions for multicast and multi-path routing. The objective of the LPBR protocol is to simultaneously minimize the number of flooding-based route discoveries as well as the hop count of the paths for a source–destination (s–d) session. During a regular flooding-based route discovery, LPBR collects the location and mobility information of nodes in the network and stores the collected information at the destination node of the route search process. When the minimum-hop route discovered through flooding fails, the destination node locally predicts a global topology based on the location and mobility information collected during the latest flooding-based route discovery and runs a minimum-hop path algorithm. If the predicted minimum-hop route exists in reality, no expensive flooding-based route discovery is needed and the source continues to send data packets on the discovered route. Similarly, we propose multicast extensions of LPBR (referred to as NR-MLPBR and R-MLPBR) to simultaneously reduce the number of tree discoveries and the hop count per path from the source to each multicast group receiver. Nodes running NR-MLPBR are not aware of the receivers of the multicast group. R-MLPBR assumes that each receiver node also knows the identity of the other receiver nodes of the multicast group. Finally, we also propose a node-disjoint multi-path extension of LPBR (referred to as LPBR-M) to simultaneously minimize the number of multi-path route discoveries as well as the hop count of the paths.     

Optimized mobility management protocol for the IoT based WBAN with an enhanced security

Wireless Networks - Today, Wireless Sensor Network (WSN) is widely used for general purposes. With the propagation of the Internet of Things (IoT), security issues arise wherever the healthcare...     

Contention aware mobility prediction routing for intermittently connected mobile networks

This paper introduces a novel multi-copy routing protocol, called predict and forward (PF), for delay tolerant networks, which aims to explore the possibility of using mobile nodes as message carriers for end-to-end delivery of the messages. With PF, the message forwarding decision is made by manipulating the probability distribution of future inter-contact and contact durations based on the network status, including wireless link condition and nodal buffer availability. In particular, PF is based on the observations that the node mobility behavior is semi-deterministic and could be predicted once there is sufficient mobility history information. We implemented the proposed protocol and compared it with a number of existing encounter-based routing approaches in terms of delivery delay, delivery ratio, and the number of transmissions required for message delivery. The simulation results show that PF outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.