SMORT: Scalable multipath on-demand routing for mobile ad hoc networks

Increasing popularity and availability of portable wireless devices, which constitute mobile ad hoc networks, calls for scalable ad hoc routing protocols. On-demand routing protocols adapt well with dynamic topologies of ad hoc networks, because of their lower control overhead and quick response to route breaks. But, as the size of the network increases, these protocols cease to perform due to large routing overhead generated while repairing route breaks. We propose a multipath on-demand routing protocol (SMORT), which reduces the routing overhead incurred in recovering from route breaks, by using secondary paths. SMORT computes fail-safe multiple paths, which provide all the intermediate nodes on the primary path with multiple routes (if exists) to destination. Exhaustive simulations using GloMoSim with large networks (2000 nodes) confirm that SMORT is scalable, and performs better even at higher mobility and traffic loads, when compared to the disjoint multipath routing protocol (DMRP) and ad hoc on-demand distance vector (AODV) routing protocol.     

Secure position-based routing protocol for mobile ad hoc networks

In large and dense mobile ad hoc networks, position-based routing protocols can offer significant performance improvement over topology-based routing protocols by using location information to make forwarding decisions. However, there are several potential security issues for the development of position-based routing protocols. In this paper, we propose a secure geographic forwarding (SGF) mechanism, which provides source authentication, neighbor authentication, and message integrity by using both the shared key and the TIK protocol. By combining SGF with the Grid Location Service (GLS), we propose a Secure Grid Location Service (SGLS) where any receiver can verify the correctness of location messages. We also propose a Local Reputation System (LRS) aiming at detecting and isolating both compromised and selfish users. We present the performance analysis of both SGLS and LRS, and compare them with the original GLS. Simulation results show that SGLS can operate efficiently by using effective cryptographic mechanisms. Results also show that LRS effectively detects and isolates message dropping attackers from the network.     

SPREAD: Improving network security by multipath routing in mobile ad hoc networks

We propose and investigate the SPREAD scheme as a complementary mechanism to enhance secure data delivery in a mobile ad hoc network. The basic idea is to transform a secret message into multiple shares, and then deliver the shares via multiple paths to the destination so that even if a certain number of message shares are compromised, the secret message as a whole is not compromised. We present the overall system architecture and discuss three major design issues: the mathematical model for the generation and reconstruction of the secret message shares, the optimal allocation of the message shares onto multiple paths in terms of security, and the multipath discovery techniques in a mobile ad hoc network. Our extensive simulation results justify the feasibility and the effectiveness of the SPREAD approach.

Ad hoc网络中带宽保证路由协议

研究ad hoc网络中无线链路存在邻近链路干扰及隐藏终端和暴露终端问题，提出新的带宽预留模型及带宽保证路由协议(BGRP)，旨在按需探测符合带宽需要的路由路径并预留可靠的带宽资源。理论分析证明，BGRP探测的路由路径能满足带宽需要，而且预留的带宽资源准确有效。仿真结果表明，就有效带宽而言，BGRP较INSIGNIA和BGSR算法有效，而且消息复杂性较小，具有良好的网络扩展性。     

Ad Hoc网络基于能源熵的多路径安全路由协议

由于节点是随机移动的,且其电池容量有限,在无线Ad Hoc网络(自组织网络)中减少能源消耗以延长网络生存期、保证节点的安全性是研究多路径路由中的主要问题。文章分析了AODV(基于距离矢量单路径按需路由)协议和AOMDV(基于距离矢量多路径按需路由)协议的一些基本特点,在考虑安全网格定位服务的基础上,结合能源熵,提出了一种新的安全多路径路由协议-EEBSMRP。仿真计算结果表明,EEBSMRP在发现最小的节点能源消耗路由、平衡各个节点能源利用率、延长整个网络生存期以及安全性方面有较大的改进。     

A secure incentive protocol for mobile ad hoc networks

The proper functioning of mobile ad hoc networks depends on the hypothesis that each individual node is ready to forward packets for others. This common assumption, however, might be undermined by the existence of selfish users who are reluctant to act as packet relays in order to save their own resources. Such non-cooperative behavior would cause the sharp degradation of network throughput. To address this problem, we propose a credit-based Secure Incentive Protocol (SIP) to stimulate cooperation among mobile nodes with individual interests. SIP can be implemented in a fully distributed way and does not require any pre-deployed infrastructure. In addition, SIP is immune to a wide range of attacks and is of low communication overhead by using a Bloom filter. Detailed simulation studies have confirmed the efficacy and efficiency of SIP. This work was supported in part by the U.S. Office of Naval Research under Young Investigator Award N000140210464 and under grant N000140210554. Yanchao Zhang received the B.E. degree in Computer Communications from Nanjing University of Posts and Telecommunications, Nanjing, China, in July 1999, and the M.E. degree in Computer Applications from Beijing University of Posts and Telecommunications, Beijing, China, in April 2002. Since September 2002, he has been working towards the Ph.D. degree in the Department of Electrical and Computer Engineering at the University of Florida, Gainesville, Florida, USA. His research interests are network and distributed system security, wireless networking, and mobile computing, with emphasis on mobile ad hoc networks, wireless sensor networks, wireless mesh networks, and heterogeneous wired/wireless networks. Wenjing Lou is an assistant professor in the Electrical and Computer Engineering department at Worcester Polytechnic Institute. She obtained her Ph.D degree in Electrical and Computer Engineering from University of Florida in 2003. She received the M.A.Sc degree from Nanyang Technological University, Singapore, in 1998, the M.E degree and the B.E degree in Computer Science and Engineering from Xi'an Jiaotong University, China, in 1996 and 1993 respectively. From Dec 1997 to Jul 1999, she worked as a Research Engineer in Network Technology Research Center, Nanyang Technological University. Her current research interests are in the areas of ad hoc and sensor networks, with emphases on network security and routing issues. Wei Liu received his B.E. and M.E. in Electrical and Information Engineering from Huazhong University of Science and Technology, Wuhan, China, in 1998 and 2001. In August 2005, he received his PhD in Electrical and Computer Engineering from University of Florida. Currently, he is a senior technical member with Scalable Network Technologies. His research interest includes cross-layer design, and communication protocols for mobile ad hoc networks, wireless sensor networks and cellular networks. Yuguang Fang received a Ph.D. degree in Systems Engineering from Case Western Reserve University in January 1994 and a Ph.D degree in Electrical Engineering from Boston University in May 1997. He was an assistant professor in the Department of Electrical and Computer Engineering at New Jersey Institute of Technology from July 1998 to May 2000. He then joined the Department of Electrical and Computer Engineering at University of Florida in May 2000 as an assistant professor, got an early promotion to an associate professor with tenure in August 2003 and a professor in August 2005. He has published over 150 papers in refereed professional journals and conferences. He received the National Science Foundation Faculty Early Career Award in 2001 and the Office of Naval Research Young Investigator Award in 2002. He has served on many editorial boards of technical journals including IEEE Transactions on Communications, IEEE Transactions on Wireless Communications, IEEE Transactions on Mobile Computing and ACM Wireless Networks. He is a senior member of the IEEE.     

Secure routing in mobile wireless ad hoc networks

We discuss several well known contemporary protocols aimed at securing routing in mobile wireless ad hoc networks. We analyze each of these protocols against requirements of ad hoc routing and in some cases identify fallibilities and make recommendations to overcome these problems so as to improve the overall efficacy of these protocols in securing ad hoc routing, without adding any significant computational or communication overhead.     

Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks

One possibility direction to assist routing in Mobile Ad Hoc Network (MANET) is to use geographical location information provided by positioning devices such as global positioning systems (GPS). Instead of searching the route in the entire network blindly, position-based routing protocol uses the location information of mobile nodes to confine the route searching space into a smaller estimated range. The smaller route searching space to be searched, the less routing overhead and broadcast storm problem will occur. In this paper, we proposed a location-based routing protocol called LARDAR. There are three important characteristics be used in our protocol to improve the performance. Firstly, we use the location information of destination node to predict a smaller triangle or rectangle request zone that covers the position of destination in the past. The smaller route discovery space reduces the traffic of route request and the probability of collision. Secondly, in order to adapt the precision of the estimated request zone, and reduce the searching range, we applied a dynamic adaptation of request zone technique to trigger intermediate nodes using the location information of destination node to redefine a more precise request zone. Finally, an increasing-exclusive search approach is used to redo route discovery by a progressive increasing search angle basis when route discovery failed. This progressive increased request zone and exclusive search method is helpful to reduce routing overhead. It guarantees that the areas of route rediscovery will never exceed twice the entire network. Simulation results show that LARDAR has lower routing cost and collision than other protocols. Tzay-Farn Shih was with Department of Electrical Engineering, National Taiwan University. Tzay-Farn Shih received the B.S. degree in Information Management from Chinese Culture University, Taiwan, in 1992, the M.S. degree in Computer Science Engineering from Tatung University, Taiwan, in 1996, and the Ph.D. degree in Electrical Engineering from National Taiwan University, Taiwan, in 2006. He is presently an assistant professor of Computer Science and Information Engineering at Chaoyang University of Technology, where he initially joined in August 2006. He is currently an overseas member of the Institute of Electronics, Information and Communication Engineers (IEICE). His current research interests include computer simulation, computer networks routing protocol, wireless networks, Mobile Ad Hoc networks and sensor networks. Hsu-Chun Yen was born in Taiwan, Republic of China, on May 29, 1958. He received the B.S. degree in electrical engineering from National Taiwan University, Taiwan, in 1980, the M.S. degree in computer engineering from National Chiao-Tung University, Taiwan, in 1982, and the Ph.D. degree in computer science from the University of Texas at Austin, U.S.A., in 1986. He is presently a Professor of Electrical Engineering at National Taiwan University, where he initially joined in August 1990. From August 1986 to July 1990, he was an Assistant Professor of Computer Science at Iowa State University, Ames, Iowa, U.S.A. His current research interests include Petri net theory, formal methods, design and analysis of algorithms, and complexity theory. Dr. Yen is an editor of International Journal of Foundations of Computer Science (IJFCS, World Scientific Publisher).     

Secure message transmission in mobile ad hoc networks

The vision of nomadic computing with its ubiquitous access has stimulated much interest in the mobile ad hoc networking (MANET) technology. However, its proliferation strongly depends on the availability of security provisions, among other factors. In the open, collaborative MANET environment, practically any node can maliciously or selfishly disrupt and deny communication of other nodes. In this paper, we propose the secure message transmission (SMT) protocol to safeguard the data transmission against arbitrary malicious behavior of network nodes. SMT is a lightweight, yet very effective, protocol that can operate solely in an end-to-end manner. It exploits the redundancy of multi-path routing and adapts its operation to remain efficient and effective even in highly adverse environments. SMT is capable of delivering up to 83% more data messages than a protocol that does not secure the data transmission. Moreover, SMT achieves up to 65% lower end-to-end delays and up to 80% lower delay variability, compared with an alternative single-path protocol––a secure data forwarding protocol, which we term secure single path (SSP) protocol. Thus, SMT is better suited to support quality of service for real-time communications in the ad hoc networking environment. The security of data transmission is achieved without restrictive assumptions on the network nodes’ trust and network membership, without the use of intrusion detection schemes, and at the expense of moderate multi-path transmission overhead only.     

Delay constraint multipath routing for wireless multimedia ad hoc networks

According to the disadvantages of real time and continuity for multimedia services in ad hoc networks, a delay constraint multipath routing protocol for wireless multimedia ad hoc networks, which can satisfy quality of service (QoS) requirement (QoS multipath optimized link state routing [MOLSR]), is proposed. The protocol firstly detects and analyzes the link delay among the nodes and collects the delay information as the routing metric by HELLO message and topology control message. Then, through using the improved multipath Dijkstra algorithm for path selection, the protocol can gain the minimum delay path from the source node to the other nodes. Finally, when the route is launched, several node‐disjoint or link‐disjoint multipaths will be built through the route computation. The simulation and test results show that QoS‐MOLSR is suitable for large and dense networks with heavy traffic. It can improve the real time and reliability for multimedia transmission in wireless multimedia ad hoc networks. The average end‐to‐end delay of QoS‐MOLSR is four times less than the optimized link state routing. Copyright © 2014 John Wiley & Sons, Ltd.     

Adaptive zone routing protocol for ad hoc network nodes with non‐uniform mobilities

In recent years, a variety of new routing protocols for mobile ad hoc wireless NETworks (MANETs) have been developed. Performance evaluation and comparison of many of these routing protocols have been performed using detailed simulation models. Zone routing protocol (ZRP) is one of these routing protocols, which is a hybrid routing protocol that proactively maintains routing information for a local neighbourhood (routing zone), while reactively acquiring routes to destinations beyond the routing zone. The studies on ZRP have assumed homogeneous scenarios where all mobile nodes have uniform mobility and are statistically identical, lacking the studies on heterogeneous scenarios where mobile nodes move with non‐uniform mobilities in the same network. In this paper, we study the performance of ZRP in such scenarios. We propose an efficient scheme for ZRP to adapt to the non‐uniform mobilities scenario and study its performance for different mobility scenarios, network loads and network sizes. Copyright © 2003 John Wiley & Sons, Ltd.     

Stable routing protocol based on fuzzy logic system in vehicular ad hoc networks

Vehicular ad‐hoc networks have several roles in alert messages dissemination between vehicles in danger, the most important role is to provide helpful information for drivers (eg, road traffic state). But, some performance improvements are frequently needed in terms of routing. Hence, several clustering approaches have been proposed to optimize the network services. These approaches are based on increasing data delivery, reducing data congestion, and dividing the traffic into clusters. However, a stable clustering algorithm is always required in order to ensure the data dissemination in a dense, mobile, or a large‐scale environment. Therefore, in this paper, we have proposed a stable routing protocol based on the fuzzy logic system, which can deliver alert messages with minimum delay and improve the stability of clusters structure by generating only a small number of clusters in the network. In this work, the fuzzy logic system has been used to create the clusters and select a cluster head for each cluster. We have used the network simulator (NS2) to generate the results. As a result, we could reduce the cluster head changes and increase the cluster member lifetime compared with recent approaches.     

基于节点接入能力的ad hoc网络按需路由协议

基于802.11协议MAC层重传策略,提出一个衡量节点接入能力的参数CAM(capacity of access to medium),以体现节点周围信道的繁忙程度及其抢占信道能力。在此基础上,联合MAC层和网络层进行跨层设计,提出了一个拥塞感知路由CAOR(congestion aware on-demand routing)协议。仿真表明:该协议能够在降低开销的前提下,显著增加网络吞吐量,并降低平均端到端的时延。     

Throughput and delay analysis of directional‐location aided routing protocol for vehicular ad hoc networks

Vehicular ad hoc networks is an integral component of intelligent transportation systems and it is an important requisite for smarter cities. Network formation and deformation among the vehicles are very frequent because of the variation in speed. Furthermore, for safety applications, messages should not face any kind of delay or collision. Therefore, establishing communication between the vehicles becomes even more challenging. Position‐based routing protocols work productively in vehicular ad hoc networks. Only finding an efficient routing protocol does not solve our purport. We need to carefully examine the effect of media access control layer parameters additionally. In the event of collisions, a large number of nodes would be re‐transmitting rather than sending fresh packets. A node busy in sending the retransmitted packet is called a backlog node. With an increase in the number of collisions, number of backlog nodes also increases, which affects the delay and throughput. In this article, we present the mathematical modeling of delay and throughput with IEEE 802.11 distributed coordination function (at media access control layer) for directional‐location aided routing (D‐LAR) position based routing protocol. For performance evaluation, simulation has been done in realistic environment created with SUMO (traffic simulator) and NS‐2 (network simulator). Simulation results show the comparison between D‐LAR and location aided routing (LAR) on various metrics in terms of delay, packet delivery ratio, routing overhead, throughput, and collision probability. To validate the mathematical model, analytical results has been compared with simulation results. The results confirm that performance of D‐LAR is better than LAR in terms of increasing the throughput and reduction in routing overhead and delay.     

Message trust‐based secure multipath routing protocol for opportunistic networks

Opportunistic networks (OppNets) are composed of wireless nodes opportunistically communicating with each other. These networks are designed to operate in a challenging environment characterized by high delay, intermittent connectivity, and no guarantee of fixed path between the sender and the destination nodes. One of the most vital issues in designing and maintaining practical networks over a time period is the security of the messages flowing in OppNets. This paper proposes a new method called message trust‐based secure multipath routing protocol (MT‐SMRP) for opportunistic networks. Various routing protocols such as ProPHet, Epidemic, and HiBOp, to name a few, have been proposed for OppNets, but none of these have applied a secure multipath routing technique. The proposed MT‐SMRP scheme relays the message to the destination through the disjoint paths, each applying a soft‐encryption technique to prevent message fabrication attacks. Simulations are conducted using the Haggle Infocom'06 real mobility data traces, showing that when time‐to‐live is varied, (1) the proposed MT‐SMRP scheme outperforms D‐MUST by 18.10%, 7.55%, 3.275%, respectively, in terms of delivery probability, messages dropped, and average latency; (2) it also outperforms SHBPR by 21.30%, 7.44%, and 4.85%, respectively, in terms of delivery probability, messages dropped, and average latency. Under similar performance metrics, the performance of MT‐SMRP is also shown to be better than that of D‐MUST and SHBPR when the buffer size (respondents. the message generation interval) is varied.     

低开销的MANET网络按需路由协议

针对简单泛洪效率低的问题,提出了一个限制洪泛的高效的路由广播算法,通过Euclidean距离来限制路由发现过程中请求分组被转发的次数;研究了减少路由维护开销,并降低路由发现的频率的方法,提出了一个基于节点高度的路由修复与优化算法,该算法使用节点监听来对链路断裂的路由进行修复与优化.基于限制泛洪的高效的路由广播算法和路由修复优化算法,提出了一种新的低开销的MANET网络按需路由协议LOOR(low overhead on-demand routing).仿真结果表明,新协议增强了路由的顽健性,减少了路由跳数,降低了路由发现的频率,提高了数据分组递送率,并显著地降低了路由控制开销.     

感知无线电ad hoc网络基于干扰的路由

感知无线电技术作为一种新兴技术,通过时间和空间维度上的频谱空洞的利用能很好地提高频谱利用率。感知无线电的路由不同于传统的路由度量,因为次用户从时间和空间上都不能对主用户造成干扰。在感知无线电ad hoc网络环境下,选取了干扰作为路由的度量,并将干扰分为系统内干扰(次用户自身之间的干扰)和系统间干扰(次用户对主用户的干扰)。在已有的ad hoc网络干扰路由协议的基础上对干扰权重做出改进,并提出新的基于系统间路由干扰(对主用户干扰最小化)和基于联合系统内和系统间干扰的路由协议。仿真结果表明,该干扰模型符合感知无线电移动ad hoc网络的特性。     

A routing framework for providing robustness to node failures in mobile ad hoc networks

Nodes in a mobile ad hoc network are often vulnerable to failures. The failures could be either due to fading effects, battery drainage, or as a result of compromised nodes that do not participate in network operations. Intermittent node failures can disrupt routing functionalities. As such, it is important to provide redundancy in terms of providing multiple node-disjoint paths from a source to a destination. In line with this objective, we first propose a modified version of the widely studied ad hoc on-demand distance vector routing protocol to facilitate the discovery of multiple node-disjoint paths from a source to a destination. We find that very few of such paths can be found. Furthermore, as distances between sources and destinations increase, bottlenecks inevitably occur and thus, the possibility of finding multiple paths is considerably reduced. We conclude that it is necessary to place what we call reliable nodes (in terms of both being robust to failure and being secure) in the network to support efficient routing operations. We propose a deployment strategy that determines the positions and the trajectories of these reliable nodes such that we can achieve a framework for reliably routing information. We define a notion of a reliable path which is made up of multiple segments, each of which either entirely consists of reliable nodes, or contains a preset number of multiple paths between the end points of the segment. We show that the probability of establishing a reliable path between a random source and destination pair increases tremendously even with a small number of reliable nodes when we use our algorithm to appropriately position these reliable nodes.     

Sparsely‐deployed relay node assisted routing algorithm for vehicular ad hoc networks

In this paper, we study the issue of routing in a vehicular ad hoc network with the assistance of sparsely deployed auxiliary relay nodes at some road intersections in a city. In such a network, vehicles keep moving, and relay nodes are static. The purpose of introducing auxiliary relay nodes is to reduce the end‐to‐end packet delivery delay. We propose a sparsely deployed relay node assisted routing (SRR) algorithm, which differs from existing routing protocols on how routing decisions are made at road intersections where static relay nodes are available such that relay nodes can temporarily buffer a data packet if the packet is expected to meet a vehicle leading to a better route with high probability in certain time than the current vehicles. We further calculate the joint probability for such a case to happen on the basis of the local vehicle traffic distribution and also the turning probability at an intersection. The detailed procedure of the protocol is presented. The SRR protocol is easy to implement and requires little extra routing information. Simulation results show that SRR can achieve high performance in terms of end‐to‐end packet delivery latency and delivery ratio when compared with existing protocols. Copyright © 2013 John Wiley & Sons, Ltd.     

EEAODR: An energy‐efficient ad hoc on‐demand routing protocol for mobile ad hoc networks

Mobile ad hoc networks (MANETs) are characterized by random, multi‐hop topologies that do not have a centralized coordinating entity or a fixed infrastructure that may change rapidly over time. In addition, mobile nodes operate with portable and finite power sources. In this work, we propose an energy‐efficient routing protocol for MANETs to minimize energy consumption and increase the network's consistency. Traditional works mainly focused on the shortest path‐based schemes to minimize energy, which might result into network failure because some nodes might exhaust fast as they are used repetitively, while some other nodes might not be used at all. This can lead to energy imbalance and to network life reduction. We propose an energy‐efficient ad hoc on‐demand routing protocol that balances energy load among nodes so that a minimum energy level is maintained among nodes and the network life increases. We focused on increasing the network longevity by distributing energy consumption in the network. We also compared the simulation results with a popular existing on‐demand routing protocol in this area, AODV, to establish the superiority of our approach. Copyright © 2009 John Wiley & Sons, Ltd.