Mobility assessment on‐demand (MAOD) routing protocol for mobile ad hoc networks

In ad hoc wireless networks, the high mobility of hosts is usually a major reason for link failures. The general ‘shortest path’ based routing protocols may not lead to stable routes. In this paper, we propose a mobility assessment on‐demand (MAOD) routing protocol to select a stable route in order to enhance system throughput and performance. An error count parameter is used to judge whether a host is highly mobile. The proposed MAOD routing protocol is an on‐demand routing protocol similar to dynamic source routing (DSR). The difference between MAOD and DSR is in the path selection method. Because MAOD takes the mobility of hosts into consideration, it will select a more stable and reliable path than DSR. In comparison, DSR only considers whether this route is a shortest path or not. Finally, the system performance is analyzed by using the global mobile simulation (GloMoSim) simulator. We can observe that MAOD routing protocol outperforms DSR routing protocol especially in the high mobility environment. Copyright © 2004 John Wiley & Sons, Ltd.     

Energy efficient routing protocols for mobile ad hoc networks

Although establishing correct and efficient routes is an important design issue in mobile ad hoc networks (MANETs), a more challenging goal is to provide energy efficient routes because mobile nodes' operation time is the most critical limiting factor. This article surveys and classifies the energy‐aware routing protocols proposed for MANETs. They minimize either the active communication energy required to transmit or receive packets or the inactive energy consumed when a mobile node stays idle but listens to the wireless medium for any possible communication requests from other nodes. Transmission power control approach and load distribution approach belong to the former category, and sleep/power‐down mode approach belongs to the latter category. While it is not clear whether any particular algorithm or a class of algorithms is the best for all scenarios, each protocol has definite advantages/disadvantages and is well suited for certain situations. The purpose of this paper is to facilitate the research efforts in combining the existing solutions to offer a more energy efficient routing mechanism. Copyright © 2003 John Wiley & Sons, Ltd.     

Energy efficient broadcast routing in mobile ad hoc networks

In this paper, we address the problem of broadcast routing in mobile ad hoc networks from the viewpoint of energy efficiency. In an ad hoc wireless network, each node runs on a local energy source which has a limited energy lifespan. Thus, energy conservation is a critical issue in ad hoc networks. One approach for energy conservation is to establish routes which require lowest total energy consumption. This optimization problem is referred as the minimum‐energy broadcast routing problem (MEBRP). In this paper, we propose new efficient algorithms for the construction of energy‐efficient trees for broadcast in mobile ad hoc networks. These algorithms exploit the broadcast nature of the wireless channel, and address the need for energy‐efficient operations. Empirical studies show that our algorithms are able to achieve better performance than algorithms that have been developed for MEBRP. Copyright © 2004 John Wiley & Sons, Ltd.     

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

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

Localized energy efficient routing in mobile ad hoc networks

We consider the problem of localized energy aware routing in mobile ad hoc networks. In localized routing algorithms, each node forwards a message based on the position of itself, its neighbors and the destination. The objective of energy aware routing algorithms is to minimize the total power for routing a message from source to destination or to maximize the total number of routing tasks that a node can perform before its battery power depletes. In this paper we propose new localized energy aware routing algorithms called OLEAR. The algorithms have very high packet delivery rate with low packet forwarding and battery power consumption. In addition, they ensure good energy distribution among the nodes. Finally, packets reach the destination using smaller number of hops. All these properties make our algorithm suitable for routing in any energy constrained environment. We compare the performance of our algorithms with other existing energy and non‐energy aware localized algorithms. Simulation experiments show that our algorithms present comparable energy consumption and distribution to other energy aware algorithms and better packet delivery rate. Copyright © 2006 John Wiley & Sons, Ltd.     

Localized power‐aware alternate routing for wireless ad hoc networks

In this paper, we design a localized power‐aware alternate routing (LPAR) protocol for dynamic wireless ad hoc networks. The design objective is to prolong the lifetime of wireless ad hoc networks wherein nodes can adaptively adjust their transmission power based on communication ranges. LPAR achieves this goal via two phases. In the first phase, energy draining balancing is achieved by identifying end‐to‐end paths with high residual energy. The second phase is designed to effectively reduce the power consumed for packet forwarding. This is achieved by iteratively performing adaptive localized power‐aware alternate rerouting to bypass each (potentially) high‐power link along the end‐to‐end path identified in the first phase. Further, the design of LPAR enables nodes to collect their neighborhood information ‘on‐demand’, which can effectively reduce the overhead for gathering such information. LPAR is suitable for both homogeneous and non‐homogeneous networks. Simulation results demonstrate that LPAR achieves improved performance in reducing protocol overhead and also in prolonging network lifetime as compared with existing work. Copyright © 2008 John Wiley & Sons, Ltd.     

Lifetime evaluation in energy‐efficient rectangular ad hoc wireless networks

Ad hoc wireless network nodes are typically battery‐powered, therefore energy limit is one of the critical constraints of ad hoc wireless networks' development. This paper evaluates the network lifetime of a rectangular network model that achieves energy efficiency by optimizing the node radio range based on the geographical adaptive fidelity (GAF) topology management protocol (Proceedings of ACMMobil'01, July 2001; 70–84). We derive the optimal transmission range of nodes and analyze both static and dynamic traffic scenarios in both equal‐grid and adjustable‐grid rectangular GAF models, where the results show that the adjustable‐grid model saves 78.1% energy in comparison with the minimum energy consumption of equal‐grid model. The impact of node density on both equal‐grid and adjustable‐grid models is investigated to achieve grid‐lifetime balance among all grids to optimize the entire network lifetime. The lifetime estimation results show that without node density control the adjustable‐grid model prolongs the entire network lifetime by a factor of 4.2 compared with the equal‐grid model. Furthermore, the adjustable‐grid model with node density control is able to prolong the entire network lifetime by a factor of 6 compared with the equal‐grid model. Copyright © 2010 John Wiley & Sons, Ltd.     

Adding sense of spatial locality to routing protocols for mobile ad hoc networks

Recently, there has been an increasing interest in mobile ad hoc networks. In a mobile ad hoc network, each mobile node can freely move around and the network is dynamically constructed by collections of mobile nodes without using any existing network infrastructure. Compared to static networks, it faces many problems such as the inefficiency of routing algorithms. Also, the number of control packets in any routing algorithm increases as the mobile speed or the number of mobile nodes increases. Most of the current routing protocols in ad hoc networks broadcast the control packets to the entire network. Therefore, by reducing the number of control packets, the efficiency of the network routing will be improved. If we know where the destination is, we can beam our search toward that direction. However, without using global positioning systems, how can we do this? Define the range nodes as the 1‐hop or 2‐hop neighbors of the destination node. In this paper, we propose using the range nodes to direct our searches for the destination. It can be combined with the existing routing protocols to reduce the control overhead. We show through simulations that AODV and DSR combined with the range node method outperforms the original AODV and DSR routing protocols in terms of control packets overhead. We also show that the delay introduced in find range nodes is insignificant. Copyright © 2006 John Wiley & Sons, Ltd.     

On‐demand flow regulated routing for ad hoc wireless networks

In this paper, we present an on‐demand flow regulated routing algorithm (OFRA) for ad hoc wireless networks. The OFRA consists of two parts: an intermediate node load evaluation process and a routing path selection process. The intermediate node load evaluation process evaluates the load efficiency of the intermediate nodes according to bandwidth, data packets and computing capability. The routing path selection process selects the routing path with lower flow and fewer intermediate nodes. The OFRA can prevent intermediate nodes to be overcrowded and distribute traffic load over routing paths more evenly. The simulation result shows that the percentage of blocked routing paths is reduced and the total flow is more balanced and distributed. Copyright © 2006 John Wiley & Sons, Ltd.     

An energy‐efficient localized topology control algorithm for wireless ad hoc and sensor networks

Topology control plays an important role in the design of wireless ad hoc and sensor networks and has demonstrated its high capability in constructing networks with desirable characteristics such as sparser connectivity, lower transmission power, and smaller node degree. However, the enforcement of a topology control algorithm in a network may degrade the energy‐draining balancing capability of the network and thus reduce the network operational lifetime. For this reason, it is important to take into account energy efficiency in the design of a topology control algorithm in order to achieve prolonged network lifetime. In this paper, we propose a localized energy‐efficient topology control algorithm for wireless ad hoc and sensor networks with power control capability in network nodes. To achieve prolonged network lifetime, we introduce a concept called energy criticality avoidance and propose an energy criticality avoidance strategy in topology control and energy‐efficient routing. Through theoretical analysis and simulation results, we prove that the proposed topology control algorithm can maintain the global network connectivity with low complexity and can significantly prolong the lifetime of a multi‐hop wireless network as compared with existing topology control algorithms with little additional protocol overhead. Copyright © 2008 John Wiley & Sons, Ltd.     

An efficient MAC protocol with cooperative retransmission in mobile ad hoc networks

In emerging wireless networks, cooperative retransmission is employed to replace packet retransmission between a pair of sender and receiver with poor channel condition. A cooperative MAC protocol which utilizes such benefit is proposed in this paper to improve the network performance in mobile ad hoc networks. In the proposed protocol, relay nodes between sender and receiver are used if the sender cannot communicate with the receiver reliably. Furthermore, the receiver may also stop forwarding the received data frame if the frame is received by the next‐hop receiver on the route to the final destination node. Simulation results show that the proposed protocol outperforms previous works in terms of increased transmission reliability and reduced delay time. Copyright © 2010 John Wiley & Sons, Ltd.     

A routing protocol for mobile ad‐hoc networks using the profit optimization model

Recently, wireless networks have become one of the major development trends in computer network technology. Because there is no more need of the wired transmission medium, applications have thus diversified. One such growing field of wireless networks is the mobile ad‐hoc network (MANET). A MANET consists of mobile hosts (such as portable laptops, vehicles, etc.), and no fixed infrastructure is required. MANETs provide ease of self‐configuration and can extend coverage at a low cost. Numerous applications have therefore been proposed under this network environment for daily life use. Because MANETs nodes are capable of moving, MANET network topology changes frequently. Thus, the traditional routing protocols fail to fit such an environment. In this paper, we propose an efficient routing protocol for MANETs, which integrates the mathematical model of profit optimization (the Kelly formula) from the field of economics to cope with the routing problem caused by node mobility. Some numerical simulations have been conducted to evaluate the performance of the proposed method using the network simulator NS‐2. The results show that our proposed method outperforms conventional routing protocols in packet delivery ratio comparisons; and the average end‐to‐end delays are within a tolerable range. Copyright © 2013 John Wiley & Sons, Ltd.     

An opportunistic routing mechanism for real‐time voice service in mobile ad hoc networks

The opportunistic routing mechanism can use several lossy broadcast links to support reliable transmission. In this paper, a simple opportunistic routing mechanism for real‐time multimedia services is proposed. This mechanism is based on the dynamic source routing protocol with some modifications, multiple route request, and route reply messages are used to construct the forwarder list, and the nodes within the forwarder list forward the packets which they overhear. The forwarder list is placed on the packet header in the form of a Bloom filter, which will restrict the size of the forwarder list to a constant value. There are no strict scheduling mechanisms for the forwarding order of the forwarder nodes, thus our opportunistic routing mechanism can be scalable for multiple simultaneous flows. Simulations show that our mechanism can effectively decrease the transmission times and the amount of the control messages for each packet and reduce the end‐to‐end delay for real‐time voice service, the quality of service for these services can be supported well over the unstable wireless channel. Copyright © 2009 John Wiley & Sons, Ltd.     

A secure and efficient password‐authenticated group key exchange protocol for mobile ad hoc networks

Password‐authenticated group key exchange protocols enable communication parties to establish a common secret key (a session key) by only using short secret passwords. Such protocols have been receiving significant attention. This paper shows some security weaknesses in some recently proposed password‐authenticated group key exchange protocols. Furthermore, a secure and efficient password‐authenticated group key exchange protocol in mobile ad hoc networks is proposed. It only requires constant round to generate a group session key under the dynamic scenario. In other words, the overhead of key generation is independent of the size of a total group. Further, the security properties of our protocol are formally validated by a model checking tool called AVISPA. Security and performance analyses show that, compared with other related group key exchange schemes, the proposed protocol is also efficient for real‐world applications in enhancing the security over wireless communications. Copyright © 2011 John Wiley & Sons, Ltd.     

A load‐balancing and coding‐aware multicast protocol for mobile ad hoc networks

In this paper, we propose a Load‐Balancing and Coding‐Aware Multicast (LCM) protocol for mobile ad hoc networks. In LCM protocol, a new route metric named Expected Transmission Time with Coding and Load Balancing (ETTCL) is presented at first, aiming at effectively selecting the path not only that has the possible coding opportunity but also where overflow due to network overload can be prevented. Then, we describe the route discovery phase by constructing the node‐disjoint multicast tree on the basis of ETTCL and employ network coding to encode the data flows for route maintenance. The effectiveness of LCM protocol is simulated and analyzed by NS‐2, which shows that this protocol has good performance in reducing average end‐to‐end delay and control overhead and can improve packet delivery ratio compared with the existing protocol. Copyright © 2015 John Wiley & Sons, Ltd.     

An efficient reliable broadcasting protocol for wireless mobile ad hoc networks

The mobile ad hoc network (MANET) has recently been recognized as an attractive network architecture for wireless communication. Reliable broadcast is an important operation in MANET (e.g., giving orders, searching routes, and notifying important signals). However, using a naive flooding to achieve reliable broadcasting may be very costly, causing a lot of contention, collision, and congestion, to which we refer as the broadcast storm problem. This paper proposes an efficient reliable broadcasting protocol by taking care of the potential broadcast storm problem that could occur in the medium-access level. Existing protocols are either unreliable, or reliable but based on a too costly approach. Our protocol differs from existing protocols by adopting a low-cost broadcast, which does not guarantee reliability, as a basic operation. The reliability is ensured by additional acknowledgement and handshaking. Simulation results do justify the efficiency of the proposed protocol.     

Performance evaluation of mobile ad hoc networks under flooding‐based attacks

A mobile ad hoc network (MANET) is an open wireless network that comprises a set of mobile, decentralized, and self‐organized nodes. Its properties render its environment susceptible to different types of attacks, which can paralyze the mobile nodes in MANET. A particularly dangerous type of attack is run primarily under flooding bogus packet mechanisms, such as hello floods, routing table overflows, exploitation of node penalizing schemes, and resource consumption attack (RCA). Flooding‐based attacks impose severe effects because they are intended to consume MANET resources, such as bandwidth, node memory, and battery power. Therefore, identifying such effects facilitates the development of countermeasures against the intrusions. In this paper, we introduce a simulation‐based study on the effects of RCA on MANET. Qual Net v5.0.2 is used to examine the severity of the effects on MANET performance metrics in terms of throughput, end‐to‐end delay, energy consumption, and routing overhead. The effects of RCA are also monitored under two combinations of four factors: we first vary the number of attackers and attackers' positions, and then modify the attackers' radio range and flooding rate. We also examine the effect of flooding mechanism on the energy consumed by resource consumption attackers. Copyright © 2013 John Wiley & Sons, Ltd.     

An efficient MAC protocol for multi‐channel mobile ad hoc networks based on location information

This paper considers the channel assignment problem in a multi‐channel MANET environment. We propose a scheme called GRID, by which a mobile host can easily determine which channel to use based on its current location. In fact, following the GSM style, our GRID spends no communication cost to allocate channels to mobile hosts since channel assignment is purely determined by hosts' physical locations. We show that this can improve the channel reuse ratio. We then propose a multi‐channel MAC protocol, which integrates GRID. Our protocol is characterized by the following features: (i) it follows an ‘on‐demand’ style to access the medium and thus a mobile host will occupy a channel only when necessary, (ii) the number of channels required is independent of the network topology, and (iii) no form of clock synchronization is required. On the other hand, most existing protocols assign channels to a host statically even if it has no intention to transmit [IEEE/ACM Trans. Networks 1995; 3 (4):441–449; 1993; 1 (6): 668–677; IEEE J. Selected Areas Commun. 1999; 17 (8):1345–1352], require a number of channels which is a function of the maximum connectivity [IEEE/ACM Trans. Networks 1995; 3 (4):441–449; 1993; 1 (6): 668–677; Proceedings of IEEE MILCOM'97, November 1997; IEEE J. Selected Areas Commun. 1999; 17 (8):1345–1352], or necessitate a clock synchronization among all hosts in the MANET [IEEE J. Selected Areas Commun. 1999; 17 (8):1345–1352; Proceedings of IEEE INFOCOM'99, October 1999]. Through simulations, we demonstrate the advantages of our protocol. Copyright © 2005 John Wiley & Sons, Ltd.     

移动Ad hoc网络中AODV路由协议的研究与改进

针对移动Ad hoc网络AODV路由协议存在的一些缺点,提出了一个改进的路由协议。在改进方案中增加了备份路由和电池电量门阀值,可以有效避免路由的重新发现。性能分析与仿真结果表明,改进后的AODV路由协议更能适应网络拓扑结构的变化,并能在链路中断后迅速找到可用的路由。     

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

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