Scalable location guide overlay multicast in mobile ad hoc networks using tree partition scheme

Nodes mobility brings flinty challenges to multicast in Mobile ad hoc Networks (MANETs). To track nodes mobility, flooding messages are widely used for data delivery structure construction and maintenance in many multicast protocols. These periodic flooding messages significantly consume network resources, such as energy and bandwidth, and result in network collisions. To release data delivery structure maintenance onus, profited from GPS location service, a number of stateless location based multicast protocol were proposed, where a destination list is encapsulated into each data packet for data packet orientation. However, due to data packet capability limitation, the way of encapsulating a destination list in each data packet header restricts the protocol scalability. To solve the scalability issue of multicast protocols, we propose a Scalable Location Guide Overlay Multicast (SLGOM) for MANETs. Analysis and simulation results show that SLGOM achieves high performance in large multicast group and significantly improves the scalability of stateless multicast with respect to group size. Copyright © 2010 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.     

Entire network load‐aware cooperative routing algorithm for video streaming over mobile ad hoc networks

In this paper, we present an entire network load‐aware cooperative routing algorithm based on IEEE 802.11 multi‐rate for video streaming over mobile ad hoc networks. The proposed routing algorithm is designed to minimize the consumed time slots while guaranteeing the required time slots at all the pairs of adjacent nodes over the route and the contention neighbors of these nodes to support the route. Furthermore, the proposed routing algorithm can distribute the network loads well over the entire network. This technology is essential because video streaming applications require stringent quality of service and even larger network resources compared with traditional data services, and these demands may dramatically increase the entire network load and/or cause network congestion. Finally, experimental results are provided to show a performance of the proposed routing algorithm. Copyright © 2011 John Wiley & Sons, Ltd.     

Stability‐aware multi‐metric clustering in mobile ad hoc networks with group mobility

Clustering can help aggregate the topology information and reduce the size of routing tables in a mobile ad hoc network (MANET). The maintenance of the cluster structure should be as stable as possible to reduce overhead and make the network topology less dynamic. Hence, stability measures the goodness of clustering. However, for a complex system like MANET, one clustering metric is far from reflecting the network dynamics. Some prior works have considered multiple metrics by combining them into one weighted sum, which suffers from intrinsic drawbacks as a scalar objective function to provide solution for multi‐objective optimization. In this paper, we propose a stability‐aware multi‐metric clustering algorithm, which can (1) achieve stable cluster structure by exploiting group mobility and (2) optimize multiple metrics with the help of a multi‐objective evolutionary algorithm (MOEA). Performance evaluation shows that our algorithm can generate a stable clustered topology and also achieve optimal solutions in small‐scale networks. For large‐scale networks, it outperforms the well‐known weighted clustering algorithm (WCA) that uses a weighted sum of multiple metrics. Copyright © 2008 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.     

Using a new protocol to enhance path reliability and realize load balancing in mobile ad hoc networks

In this paper we introduce a novel end-to-end approach for achieving the dual goal of enhanced reliability under path failures, and multi-path load balancing in mobile ad hoc networks (MANETs). These goals are achieved by fully exploiting the presence of multiple paths in mobile ad hoc networks in order to jointly attack the problems of frequent route failures and load balancing. More specifically, we built a disjoint-path identification mechanism for maintaining multiple routes between two endpoints on top of the Stream Control Transmission Protocol (SCTP), and the Dynamic Source Routing (DSR) protocol. A number of additional modifications are incorporated to the SCTP protocol in order to allow its smooth operation. The proposed approach differs from previously related work since it consists of an entirely end-to-end scheme built on top of a transport layer protocol. We provide both analytical and simulation results that prove the efficiency of our approach over a wide range of mobility scenarios.     

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.     

The diameter of mobile ad hoc networks

With the prevalence of mobile devices, it is of much interest to study the properties of mobile ad hoc networks. In this paper, we extend the concept of diameter from static ad hoc network to mobile ad hoc network, which is the expected number of rounds for one node to transmit a message to all other nodes in the network, reflecting the worst end‐to‐end delay between any two node. Specifically, we investigate the diameter of identically and independently mobility model in cell‐partitioned network and random walk mobility model in two‐dimensional torus network, achieving the boundary , when (k=Ω(n)), and O(k log2k), respectively, where n is the number of nodes and k is the number of cells of network and especially under random walk mobility model . A comparison is made among the diameter of mobile ad hoc networks under identically and independently mobility model, random walk mobility model and static ad hoc network, showing that mobility dramatically decreases the diameter of the network and speed is an essential and decisive factor of diameter. Copyright © 2016 John Wiley & Sons, Ltd.     

Secure multicast routing protocols in mobile ad‐hoc networks

A mobile ad‐hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi‐hop radio network. Routing protocols in MANETs define how routes between source and destination nodes are established and maintained. Multicast routing provides a bandwidth‐efficient means for supporting group‐oriented applications. The increasing demand for such applications coupled with the inherent characteristics of MANETs (e.g., lack of infrastructure and node mobility) have made secure multicast routing a crucial yet challenging issue. Recently, several multicast routing protocols (MRP) have been proposed in MANETs. Depending on whether security is built‐in or added, MRP can be classified into two types: secure and security‐enhanced routing protocols, respectively. This paper presents a survey on secure and security‐enhanced MRP along with their security techniques and the types of attacks they can confront. A detailed comparison for the capability of the various routing protocols against some known attacks is also presented and analyzed. Copyright © 2013 John Wiley & Sons, Ltd.     

SDMAC: Selectively Directional MAC protocol for wireless mobile ad hoc networks

Using directional antennas in wireless mobile ad hoc networks can greatly improve the transmission range as well as the spatial reuse. However, it will also cause some problems such as deafness problem and hidden terminal problem, which greatly impair the network performance. This paper first proposes a MAC protocol called Selectively Directional MAC (SDMAC) that can effectively address these problems and significantly improve the network throughput. Then two improvements on SDMAC are proposed. The first one is to improve the network throughput by scheduling the packets in the queue (a scheme called Q-SDMAC), thus the head-of-line (HOL) blocking problem can be addressed. The second one is to relax the assumption that each node knows the relative directions of its neighboring nodes and use caches to buffer those relative directions (a scheme named Q-SDMAC using cache). Extensive simulations show that: (1) SDMAC can achieve much better performance than the existing MAC protocols using directional antennas; (2) The network throughput can be significantly improved by scheduling the packets in the queue; (3) Using caches can still achieve high network throughput when nodes are moving; and (4) Network throughput decreases when directional antennas have side lobe gain.

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.     

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

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

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 green trust‐distortion resistant trust management scheme on mobile ad hoc networks

Trust management is an emerging security approach used to conduct nodes' relationships in mobile ad hoc networks. It relates to assigning a trust level to each network component based on its cooperative behavior with respect to system goals. Because of its infrastructure‐less nature, frequent network dynamics, and severe resource constraints, it is complex to establish trust in such a network. Mainly, trust systems are vulnerable to attacks that make use of inherent properties of the trust model to alter the accuracy of estimated trust levels, referred to as trust‐distortion attacks. Because of the contradictory nature of such attacks, their detection can be confusing, complex, and energy‐demanding, especially in multiattack environments. To handle such threats, we propose a Green Trust‐distortion Resistant Trust Management Scheme, called GTRTMS, which handles different trust‐distortion attacks in multiattack environments. The proposed solution self‐adapts its trust knowledge monitoring according to the network context to conserve the energy of mobile nodes and reduce the produced CO₂ emissions. Simulation results prove that GTRTMS exhibits significantly better performance than the other counterpart in presence of simultaneous and contradictory different trust‐distortion attacks.     

Distributed formation of core-based forwarding multicast trees in mobile ad hoc networks

A core-based forwarding multicast tree is a shortest path tree rooted at core node that distributes multicast packets to all group members via the tree after the packets are sent to the core. Traditionally, the bandwidth cost consumed by transmitting a packet from the core via the tree is evaluated by the total weights of all the edges. And, the bandwidth cost is minimized by constructing the multicast tree that has minimum total weights of edges to span all group members. However, when the local broadcast operation is used to multicast a packet, we found that the bandwidth cost is supposed to be evaluated by the total weights of all senders that include the core and all non-leaves. Since the multicast tree with the number of nodes greater than or equal to three has minimum bandwidth cost only when the core is not a leaf, it leads us to find the multicast tree with the minimum number of non-leaves when each sender node has a unit weight. However, no polynomial time approximation scheme can be found for the minimum non-leaf multicast tree problem unless P = NP since the problem is not only NP-hard but also MAX-SNP hard. Thus, a heuristic is proposed to dynamically reduce the number of non-leaves in the multicast tree. Experimental results show that the multicast tree after the execution of our method has smaller number of non-leaves than others in the geometrically distributed network model.     

A survey on congestion control for mobile ad hoc networks

Congestion control is a key problem in mobile ad hoc networks. The standard congestion control mechanism of the Transmission Control Protocol (TCP) is not able to handle the special properties of a shared wireless multi‐hop channel well. In particular, the frequent changes of the network topology and the shared nature of the wireless channel pose significant challenges. Many approaches have been proposed to overcome these difficulties. In this paper, we give an overview over existing proposals, explain their key ideas and show their interrelations. Copyright © 2007 John Wiley & Sons, Ltd.     

TCP performance over mobile ad hoc networks: a quantitative study

In this paper, we study the performance of the transmission control protocol (TCP) over mobile ad‐hoc networks. We present a comprehensive set of simulation results and identify the key factors that impact TCP's performance over ad‐hoc networks. We use a variety of parameters including link failure detection latency, route computation latency, packet level route unavailability index, and flow level route unavailability index to capture the impact of mobility. We relate the impact of mobility on the different parameters to TCP's performance by studying the throughput, loss‐rate and retransmission timeout values at the TCP layer. We conclude from our results that existing approaches to improve TCP performance over mobile ad‐hoc networks have identified and hence focused only on a subset of the affecting factors. In the process, we identify a comprehensive set of factors influencing TCP performance. Finally, using the insights gained through the performance evaluations, we propose a framework called Atra consisting of three simple and easily implementable mechanisms at the MAC and routing layers to improve TCP's performance over ad‐hoc networks. We demonstrate that Atra improves on the throughput performance of a default protocol stack by 50%–100%. Copyright © 2004 John Wiley & Sons, Ltd.     

Secure interconnection protocol for integrated Internet and ad hoc networks

Integration of ad hoc networks with the Internet provides global Internet connectivity for ad hoc hosts through the coordination of mobile IP and ad hoc protocols. In a pure ad hoc network, it is difficult to establish trust relationship between two ad hoc hosts due to lack of infrastructure or centralized administration. In this paper, an infrastructure‐supported and distributed authentication protocol is proposed to enhance trust relationships amongst ad hoc hosts. In addition, an effective secure routing protocol (SRP) is discussed to protect the multi‐hop route for Internet and ad hoc communication. In the integrated ad hoc networks with Internet accessibility, the ad hoc routing security deployed with the help of infrastructure has a fundamental impact on ad hoc hosts in term of Internet access, integrity, and authentication. Both analysis and simulation results demonstrate the effectiveness of the proposed security protocol. Copyright © 2007 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.     

Load balancing geographic routing strategy for aeronautical ad hoc networks

In aeronautical ad hoc networks, the traditional greedy perimeter stateless routing (GPSR) protocol poses sev-eral issues. For example, it is difficult to adapt to the highly-dynamic network environment, and it is prone to cause con-gestions. In order to address the problems, a TTE (time to enter the communication range of the destination)-based load balancing geographic routing (LBGR) protocol was presented. Taking TTE as the main routing decision metrics, this pro-tocol included the TTE-based packet forwarding scheme, multi-path traffic allocation scheme, and local optimum han-dling scheme. Furthermore, the multi-path traffic allocation scheme employing the queueing theory was modeled, and the mathematical expressions of some metrics were derived, such as the mean queue size, mean number of packets waiting in the queue, and mean waiting time. Finally, the analysis of the OMNeT++ simulations shows LBGR protocol has advan-tages over GPSR and some other protocols in terms of the packet delivery ratio and end-to-end delay, and is more suitable for the highly-dynamic aeronautical environment.