ND++ – an extended IPv6 Neighbor Discovery protocol for enhanced stateless address autoconfiguration in MANETs

Recent trends in information and communications technologies are oriented toward the design of the Future Internet and the Internet of Things. While IPv6‐based mobile ad hoc networks (MANETs) are emerging as an important building block of these new technologies, it is necessary to come up with adequate self‐configuration capabilities allowing for seamless and automated configuration of addresses in mobile environment. The mechanisms of stateless address autoconfiguration proposed for IPv6 networks are supposed to automate some configuration steps; however, they would need to be aligned with the requirements imposed by MANET networks. Therefore, in this article, we present Neighbor Discovery ++ – an extended IPv6 Neighbor Discovery protocol for enhanced duplicate address detection in MANETs, which provides increased coverage of network nodes, while minimizing protocol overhead. It exploits efficient flooding mechanism on the basis of the multipoint relay concept, which makes it an interesting approach also for large‐scale networks. Trials performed on the designated real‐world testbed platform indicate that ND++ is a promising solution to support efficient address autoconfiguration in MANETs. Copyright © 2012 John Wiley & Sons, Ltd.     

A survey of current architectures for connecting wireless mobile ad hoc networks to the Internet

Connecting wired and wireless networks, and particularly mobile wireless ad hoc networks (MANETs) and the global Internet, is attractive in real‐world scenarios due to its usefulness and praticality. Because of the various architectural mismatches between the Internet and MANETs with regard to their communication topology, routing protocols, and operation, it is necessary to introduce a hybrid interface capable of connecting to the Internet using Mobile IP protocol and to MANETs owing to an ad hoc routing protocol. Specifically, the approaches available in the literature have introduced updated versions of Mobile IP agents or access points at the edge of the Internet to help MANET nodes get multi‐hop wireless Internet access. The main differences in the existing approaches concern the type of ad hoc routing protocol as well as the switching algorithm used by MANET nodes to change their current Mobile IP agents based on specific switching criteria. This paper surveys a variety of approaches to providing multi‐hop wireless Internet access to MANET nodes. Copyright © 2006 John Wiley & Sons, Ltd.     

Provisioning of adaptability to variable topologies for routing schemes in MANETs

Frequent changes in network topologies caused by mobility in mobile ad hoc networks (MANETs) impose great challenges to designing routing schemes for such networks. Various routing schemes each aiming at particular type of MANET (e.g., flat or clustered MANETs) with different mobility degrees (e.g., low, medium, and high mobility) have been proposed in the literature. However, since a mobile node should not be limited to operate in a particular MANET assumed by a routing scheme, an important issue is how to enable a mobile node to achieve routing performance as high as possible when it roams across different types of MANETs. To handle this issue, a quantity that can predict the link status for a time period in the future with the consideration of mobility is required. In this paper, we discuss such a quantity and investigate how well this quantity can be used by the link caching scheme in the dynamic source routing protocol to provide the adaptability to variable topologies caused by mobility through computer simulation in NS-2.     

Mobile IPv6-based ad hoc networks: its development and application

The Internet protocol version 6 (IPv6)-enabled network architecture has recently attracted much attention. In this paper, we address the issue of connecting mobile ad hoc networks (MANETs) to global IPv6 networks, while supporting IPv6 mobility. Specifically, we propose a self-organizing, self-addressing, self-routing IPv6-enabled MANET infrastructure, referred to as IPv6-based MANET. The proposed self-organization addressing protocol automatically organizes nodes into tree architecture and configures their global IPv6 addresses. Novel unicast and multicast routing protocols, based on longest prefix matching and soft state routing cache, are specially designed for the IPv6-based MANET. Mobile IPv6 is also supported such that a mobile node can move from one MANET to another. Moreover, a peer-to-peer (P2P) information sharing system is also designed over the proposed IPv6-based MANET. We have implemented a prototyping system to demonstrate the feasibility and efficiency of the IPv6-based MANET and the P2P information sharing system. Simulations are also conducted to show the efficiency of the proposed routing protocols.     

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.     

移动IPv6分层式路由管理模型的分析与研究

分层移动IPV6协议减少了注册延迟，但仍具有路由不够优化等问题。通过分析HMIPv6．提出一种基于分层机制的移动IPv6路由管理模型。该模型支持路由优化，能在域内、域间移动时实现快速切换以减少延迟．提高网络资源利用率。仿真分析结果验证模型的有效性．     

Performance Modeling of MANET Interconnectivity

The proliferation of mobile wireless computing devices and the increasing usage of wireless networking have motivated substantial research in mobile ad hoc networks (MANETs). In addition, much has also been done to link autonomous MANETs to the Internet, and as MANETs become more prevalent, the need to interconnect multiple MANETs becomes increasingly important too. However, direct interconnection of MANETs has rarely been studied. In this paper, we first report an experimental study on the performance of interconnected MANETs running two different routing protocols, viz., the Ad hoc On-Demand Distance Vector (AODV) and Optimized Link State Routing (OLSR) protocols, which represent the two major categories, and show that with the use of multiple gateways, it is possible to viably interconnect multiple networks running different MANET routing protocols. We then follow with a simulation study to evaluate the performance in large networks, which not only validates the scalability of the proposed scheme, but also helps to identify various problems that were not apparent in small experimental networks.     

IoT energy efficiency routing protocol using FHO-based clustering and improved CSO model-based routing in MANET

Many protocols, services, and electrical devices with built-in sensors have been developed in response to the rapid expansion of the Internet of Things. Mobile ad hoc networks (MANETs) consist of a collection of autonomous mobile nodes that can form an ad hoc network in the absence of any pre-existing infrastructure. System performance may suffer due to the changeable topology of MANETs. Since most mobile hosts operate on limited battery power, energy consumption poses the biggest challenge for MANETs. Both network lifetime and throughput improve when energy usage is reduced. However, existing approaches perform poorly in terms of energy efficiency. Scalability becomes a significant issue in large-scale networks as they grow, leading to overhead associated with routing updates and maintenance that can become unmanageable. This article employs a MANET routing protocol combined with an energy conservation strategy. The clustering hierarchy is used in MANETs to maximize the network's lifespan, considering its limited energy resources. In the MANET communication process, the cluster head (CH) is selected using Fire Hawk Optimization (FHO). When choosing nodes to act as a cluster for an extended period, CH election factors in connectivity, mobility, and remaining energy. This process is achieved using an optimized version of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, utilizing Improved Chicken Swarm Optimization (ICSO). In comparison to existing protocols and optimization techniques, the proposed method offers an extended network lifespan ranging from 90 to 160 h and reduced energy consumption of 80 to 110 J, as indicated by the implementation results.     

利用ad hoc网络实现下一代移动互联

随着ad hoc网络的研究工作的发展,以Internet接入为代表的ad hoc网络的应用问题越来越被人们所关注.在本文中,我们提出了一个将ad hoc网络和移动IPv6相结合的方案,首先将基于动态源路由(dynamic source routing,DSR)的MANET升级到IPv6使其能够接入6Bone网,并通过搭建测试床进行了验证和测量;在此基础上,又提出了移动IPv6的兼容方案,并通过仿真对其在不同环境下的性能进行了验证.     

Using group mobility and multihomed mobile gateways to connect mobile ad hoc networks to the global IP Internet

Connecting multihop mobile ad hoc wireless networks (MANETs) to the Internet would enable MANET nodes to share wireless Internet access with mobile hosts that are one‐hop away from their foreign networks. The integration of MANETs and the global Internet, however, faces an obstacle due to their network architectural mismatches regarding their infrastructure, topology, and mobility management mechanisms. Solutions to the integration problem should introduce an intermediate facility with hybrid mechanism, enabling it to connect to both networks. The quality of the multihop wireless Internet access service provided to MANET nodes depends on the design quality of this facility in order for MANET nodes to enjoy their Internet connectivity anywhere and anytime without much disconnections. In this paper, we propose hierarchical architecture that uses group mobility and multihomed mobile gateways, and present and analyse different simulations results. A multihomed mobile gateway can simultaneously connect to multiple Mobile IP foreign agents, provided it is located within their overlapping coverage area. It runs updated versions of the destination‐sequenced distance vector (DSDV) and Mobile IP protocols, and is responsible for providing MANET nodes with wireless Internet access though they are multiple wireless hops away from the edge of the Internet. The rationale behind using multihoming is to increase reliability of the Internet access service and enhance performance of the integrated network. Copyright © 2006 John Wiley & Sons, Ltd.     

Performance Analysis of Hierarchical Mobile IPv6: Does it Improve Mobile IPv6 in Terms of Handover Speed?

There has been a rapid growth in the need to support mobile nodes in IPv6-based networks. IETF has completed to standardize Mobile IPv6 (MIPv6) and Hierarchical Mobile IPv6 (HMIPv6) for supporting IPv6 mobility. Even though existing literatures have asserted that HMIPv6 generally improves MIPv6 in terms of handover speed, they do not carefully consider the details of the whole handover procedures. In this paper, based on the current IETF standards of both MIPv6 and HMIPv6, we conduct a comprehensive study of all IP-level handover procedures: movement detection, duplicate address detection, and location registration. Based on this study, we provide a mathematical analysis on MIPv6 and HMIPv6 performance in terms of handover speed. From the analysis, we reveal that the average HMIPv6 handover latency is not always lower than the average MIPv6 handover latency. Furthermore, even the intra-domain handover latency of HMIPv6 is not reduced much compared with MIPv6 handover latency. A finding of our analysis is that optimization techniques for movement detection and duplicate address detection are essential to shortening HMIPv6 handover latency and increasing the benefit of HMIPv6.

移动IPv6分层管理费用的分析与自适应优化

为综合优化分层域内外以网络传输花费和带宽占用为代表的通信管理费用,论文对实施分层移动IPv6前后的费用变化进行了理论分析,得出了判决是否适宜使用分层移动管理的准则,并在此基础上提出一种允许移动节点动态地根据切换频度和流量强度等参数选择适宜的移动管理机制的自适应优化方案.仿真结果表明该方案能获得比静止使用某种移动管理机制更好的资源使用效率,可望具有较好的实际应用价值.     

Robust and flexible Internet connectivity for mobile ad hoc networks

An important challenge for the wider adoption of mobile ad hoc network (MANET) technologies is finding ways to efficiently interconnect them with the Internet. However, such interconnections prove difficult due to differences in mobility, addressing and routing between MANETs and existing IP networks.In this paper, we review the existing solutions to interconnect MANETs with the Internet, but find them lacking in robustness and flexibility. For instance, many solutions do not consider the presence of multiple gateways, and in such scenarios they either fail, or are less efficient due to the lack of multi-homing capabilities.A key insight of ours is that the reason for routing failure is usually an interconnection scheme’s inability to express indirection (i.e., a way to enforce routing through a certain gateway on the path toward a destination in the Internet). Another problem concerns state replication where a route update fails to replicate all the routing state needed to forward packets to an Internet gateway.We analyze the above problems and suggest a solution that provides robust and flexible Internet connectivity. With minor adaptions our solution works for any MANET routing protocol, and has support for multiple gateways and multi-homing. Simulations show that, when used in combination with AODV routing, our solution provides up to 20% delivery ratio improvement over one of the main alternatives. A prototype implementation illustrates the feasibility of our solution in the real world.     

On the characteristics of routing paths and the performance of routing protocols in vehicle‐formed mobile ad hoc networks on highways

Recently, intelligent transportation systems (ITS) is becoming an important research topic. One goal of ITS is to exchange information among vehicles in a timely and efficient manner. In the ITS research community, inter‐vehicle communications (IVC) is considered a way that may be able to achieve this goal. An information network built on the top of vehicles using IVC can be viewed as a type of mobile ad hoc networks (MANETs). In the past, several unicast routing protocols for MANET have been proposed. However, most of them are designed for general MANETs rather than for IVC networks. In this paper, we first used more realistic vehicle mobility traces generated by a microscopic traffic simulator (VISSIM) to understand the characteristics of routing paths in an IVC network. Based on the insights gained from the derived path characteristics, we designed and implemented an intelligent flooding‐based routing protocol for small‐scale IVC networks. Via several field trials conducted on highways, we compared the performance of ad hoc on‐demand distance vector (AODV) and our protocol. Our experimental results show that (1) our protocol outperforms AODV greatly in IVC networks and (2) our protocol can provide text, image, audio, and video services for small‐scale IVC networks (e.g., a platoon) quite well. Copyright © 2009 John Wiley & Sons, Ltd.     

A Scheme for Supporting Fast Handover in Hierarchical Mobile IPv6 Networks

This Letter proposes a scheme that supports a fast handover effectively in hierarchical mobile IPv6 networks (F‐HMIPv6) by optimizing the associated data and control flows during the handover. By NS‐2 simulation, we show that the proposed scheme can give better handover performance than a simple combination of existing schemes.     

A novel efficient power‐saving MAC protocol for multi‐hop MANETs

Following recent advances in the performance of ad hoc networks, the limited life of batteries in mobile devices poses a bottleneck in their development. Consequently, how to minimize power consumption in the Medium Access Control (MAC) layer of ad hoc networks is an essential issue. The power‐saving mode (PSM) of IEEE 802.11 involves the Timing Synchronization Function to reduce power consumption for single‐hop mobile ad hoc networks (MANETs). However, the IEEE 802.11 PSM is known to result in unnecessary energy consumption as well as the problems of overheating and back‐off time delay. Hence, this study presents an efficient power‐saving MAC protocol, called p‐MANET, based on a Multi‐hop Time Synchronization Protocol, which involves a hibernation mechanism, a beacon inhibition mechanism, and a low‐latency next‐hop selection mechanism for general‐purpose multi‐hop MANETs. The main purposes of the p‐MANET protocol are to reduce significantly the power consumption and the transmission latency. In the hibernation mechanism, each p‐MANET node needs only to wake up during one out of every N beacon interval, where N is the number of beacon intervals in a cycle. Thus, efficient power consumption is achieved. Furthermore, a beacon inhibition mechanism is proposed to prevent the beacon storm problem that is caused by synchronization and neighbor discovery messages. Finally, the low‐latency next‐hop selection mechanism is designed to yield low transmission latency. Each p‐MANET node is aware of the active beacon intervals of its neighbors by using a hash function, such that it can easily forward packets to a neighbor in active mode or with the least remaining time to wake up. As a consequence, upper‐layer routing protocols can cooperate with p‐MANET to select the next‐hop neighbor with the best forwarding delay. To verify the proposed design and demonstrate the favorable performance of the proposed p‐MANET, we present the theoretical analysis related to p‐MANET and also perform experimental simulations. The numerical results show that p‐MANET reduces power consumption and routing latency and performs well in extending lifetime with a small neighbor discovery time. Copyright © 2011 John Wiley & Sons, Ltd.     

An efficient anonymous communication protocol for peer-to-peer applications over mobile ad-hoc networks

An efficient anonymous communication protocol, called MANET Anonymous Peer-to-peer Communication Protocol (MAPCP), for P2P applications over mobile ad-hoc networks (MANETs) is proposed in this work. MAPCP employs broadcasts with probabilistic-based flooding control to establish multiple anonymous paths between communication peers. It requires no hop-by-hop encrypt ion/decryption along anonymous paths and, hence, demands lower computational complexity and power consumption than those MANET anonymous routing protocols. Since MAPCP builds multiple paths to multiple peers within a single query phase without using an extra route discovery process, it is more efficient in P2P applications. Through analysis and extensive simulations, we demonstrate that MAPCP always maintains a higher degree of anonymity than a MANET anonymous single-path routing protocol in a hostile environment. Simulation results also show that MAPCP is resilient to passive attacks     

MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast

As mobile ad hoc networks (MANETs) are emerging as important components in critical and large-scale applications, it is crucial to develop MANET routing mechanisms with provably low complexity. In this paper, we give a tutorial overview of the efficient use of elementary node clustering and route request broadcast mechanisms for low-complexity MANET routing. We explain these mechanisms with illustrative examples and discuss their theoretical performance characteristics. We demonstrate that node clustering with constant density and route request broadcasting with a doubling radius technique over the network of cluster leaders can be employed for MANET routing with theoretically proven low complexity. Moreover, we contrast these efficient elementary clustering and route request broadcast mechanisms with clustering and route information accumulation mechanisms in the widely studied AODV and DSR routing protocols and discuss the implications of these various mechanisms for scalable MANET routing.     

Developing multi-path routing protocol in MANET using hybrid SM-CSBO based on novel multi-objective function

One of the infrastructure-free networks is mobile ad hoc networks (MANETs) that are built with limited battery life using wireless mobile devices. This restricted battery capability in MANETs creates the necessity of considering the energy-awareness constraint in designing them. As routing protocols, the major aim of MANETs is to create the energy awareness in the network; it improves the network's lifetime through effectively utilizing the available restricted energy. Moreover, it creates some limitations like the mobility constraint, wireless link's sensitivity to environmental impacts, and restricted transmission range and residual energy of nodes that causes rapid modifications in the network topology and frequent link failure. By taking those problems, this paper plans to develop a new multipath routing protocol, where the hybrid optimization algorithm with the integration of cuckoo search optimization (CSO) and butterfly optimization algorithm (BOA) is proposed and named sensory modality-based cuckoo search butterfly optimization (SM-CSBO) for determining the optimal path between the source and destination. The main goal is to select the path with better link quality and more stable links to guarantee reliable data transmission. The multi-objective function is considered with the factors regarding distance, normalized energy, packet delivery ratio, and control overhead to develop an effective routing protocol in MANET. The proposed model of SM-CSBO algorithm has superior than 5.8%, 30.4%, 36.7%, and 39.3%, correspondingly maximized than PSO, SFO, CSO, and SFO algorithms while considering the number of nodes as 150. The simulation outcomes proved that it enhances network performance when compared with the other traditional protocols.     

A cross‐layer partner‐based fast handoff mechanism for IEEE 802.11 wireless networks

In wireless/mobile networks, users freely and frequently change their access points (APs) while they are communicating with other users. To support the mobility of mobile nodes (MNs), Mobile IPv6 (MIPv6) is used to inform the information of MN's home address and current care‐of‐address (CoA) to its home agent. MIPv6 suffers from a long delay latency and high packet losses (PLs) because MIPv6 does not support micromobility. A Hierarchical Mobile IPv6 (HMIPv6) is proposed which provides micromobility and macromobility to reduce handoff latency (HL) by employing a hierarchical network structure. In this paper, we propose a cross‐layer partner‐based fast handoff mechanism based on HMIPv6, called the PHMIPv6 protocol. Our PHMIPv6 protocol is a cross‐layer, layer‐2 + layer‐3, and cooperative approach. A cooperative node, called a partner node (PN), is adopted in the PHMIPv6 protocol. A new layer‐2 trigger scheme used in the PHMIPv6 protocol accurately predicts the next AP and then invites a cooperative PN in the area of the next AP. With the cooperation of the PN, the CoA can be pre‐acquired and duplicate address detection operation can be pre‐executed by the PN before the MN initializes the handoff request. The PHMIPv6 protocol significantly reduces the handoff delay time and PLs. In the mathematical analysis, we verified that our PHMIPv6 protocol offers a better HL than the MIPv6, HMIPv6, and SHMIPv6 protocols. Finally, the experimental results also illustrate that the PHMIPv6 protocol actually achieves performance improvements in the handoff delay time, PL rate, and handoff delay jitter. Copyright © 2009 John Wiley & Sons, Ltd.