Providing reliable and fault tolerant broadcast delivery in mobile ad‐hoc networks

Mobile adhoc networks are making a new class of mobile applications feasible. They benefit from the fast deployment and reconfiguration of the networks, are mainly characterized by the need to support manytomany interaction schema within groups of cooperating mobile hosts and are likely to use replication of data objects to achieve performances and high data availability. This strong group orientation requires specialized solutions that combine adaptation to the fully mobile environment and provide the adequate level of fault tolerance. In this paper, we present the reliable broadcast protocol that has been purposely designed for mobile adhoc networks. The reliable broadcast service ensures that all the hosts in the network deliver the same set of messages to the upper layer. It represents the building block to obtain higher broadcast and multicast services with stronger guarantees and is an efficient and reliable alternative to flooding. The protocol is constructed on top of the wireless MAC protocol, which in turn sits over the clustering protocol. It provides an exactly once message delivery semantics and tolerates communication failures and host mobility. Temporary disconnections and network partitions are also tolerated under the assumption that they are eventually repaired, as specified by a Liveness property. The termination of the protocol is proved and complexity and performance analyses are also provided.     

Topology control in constant rate mobile ad hoc networks

Topology control is the problem of assigning power levels to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the network nodes. While considerable theoretical attention has been given to the issue of topology control in wireless ad hoc networks, all of that prior work has concerned stationary networks. When the nodes are mobile, there is no algorithm that can guarantee a graph property (such as network connectivity) throughout the node movement. In this paper we study topology control in mobile wireless ad hoc networks (MANETs). We define a mobility model, namely the constant rate mobile network (CRMN) model, in which we assume that the speed and direction of each moving node are known. The goal of topology control under this model is to minimize the maximum power used by any network node in maintaining a specified monotone graph property. Network connectivity is one of the most fundamental monotone properties. Under the CRMN model, we develop general frameworks for solving both the decision version (i.e. for a given value p > 0, will a specified monotone property hold for the network induced by assigning the power value p to every node?) and the optimization version (i.e. find the minimum value p such that the specified monotone property holds for the network induced by assigning the power value p to every node) of the topology control problems. Efficient algorithms for specific monotone properties can be derived from these frameworks. For example, when the monotone property is network connectivity, our algorithms for the decision and optimization versions have running times of O(n ² log² n) and O(n ⁴ log² n), respectively. Our results represent a step towards the development of efficient and provably good distributed algorithms for topology control problems for MANETs.     

Simulation‐based performance evaluation of routing protocols for mobile ad hoc networks

In this paper we evaluate several routing protocols for mobile, wireless, ad hoc networks via packetlevel simulations. The ad hoc networks are multihop wireless networks with dynamically changing network connectivity owing to mobility. The protocol suite includes several routing protocols specifically designed for ad hoc routing, as well as more traditional protocols, such as link state and distance vector, used for dynamic networks. Performance is evaluated with respect to fraction of packets delivered, endtoend delay, and routing load for a given traffic and mobility model. Both small (30 nodes) and medium sized (60 nodes) networks are used. It is observed that the new generation of ondemand routing protocols use much lower routing load, especially with small number of peertopeer conversations. However, the traditional link state and distance vector protocols provide, in general, better packet delivery and endtoend delay performance.     

QoS provision in mobile ad hoc networks with an adaptive cross-layer architecture

Radio resource management and Quality of Service (QoS) provision in Mobile Ad hoc NETworks (MANETs) require the cooperation among different nodes and the design of distributed control mechanisms, imposed by the self-configuring and dynamic nature of these networks. In this context, in order to solve the tradeoff between QoS provision and efficient resource utilization, a distributed admission control is required. This article presents an adaptive admission procedure based on a cross-layer QoS Routing supported by an efficient end-to-end available bandwidth estimation. The proposed scheme has been designed to perform a flexible parameters configuration that allows to adapt the system response to the observed grade of mobility in the environment. The performance evaluation has shown the capability of the proposal to guarantee a soft-QoS provision thanks to a flexible resource management adapted to different scenarios.     

Composable ad hoc location‐based services for heterogeneous mobile clients

This paper introduces a comprehensive architecture that supports adapting a client device's functionality to new services it discovers as it moves into a new environment. Users wish to invoke services – such as controlling the lights, printing locally, gaining access to applicationspecific proxies, or reconfiguring the location of DNS servers – from their mobile devices. But a priori standardization of interfaces and methods for service invocation is infeasible. Thus, the challenge is to develop a new service architecture that supports heterogeneity in client devices and controlled objects while making minimal assumptions about standard interfaces and control protocols. Four capabilities are needed for a comprehensive solution to this problem: (1) allowing device mobility, (2) augmenting controllable objects to make them networkaccessible, (3) building an underlying discovery architecture, and (4) mapping between exported object interfaces and client device controls. We motivate the need for these capabilities by using an example scenario to derive the design requirements for our mobile services architecture. We then present a prototype implementation of elements of the architecture and some example services using it, including controls to audio/visual equipment, extensible mapping, server autoconfiguration, location tracking, and local printer access.     

Bit-per-joule performance of power saving ad hoc networks with a mobile backbone

Energy efficient MAC protocols have been developed for wireless sensor and mobile ad hoc networks so that inactive nodes can transition into sleep state to conserve energy. It has been recognized that maintaining a continuously awake connected dominating set (CDS) serves to reduce the route setup latency. Under the mobile backbone network (MBN) architecture introduced by Rubin et al., a mobile backbone (Bnet) is dynamically constructed to provide a topological covering of the network. The MBN employs a hybrid routing algorithm under which flows that travel a distance longer than a threshold are directed along routes across the Bnet. In turn, a limited span network-wide global route discovery process is applied for routing shorter distance flows. In this paper, we introduce and analyze an MBN based power saving protocol (MBN-PS) that employs this hybrid routing scheme. Under the MBN-PS scheme, dynamically elected backbone nodes are kept awake, while inactive non-backbone nodes can reside in sleep state. We analytically show that, when the number of network flows is above a minimal level, the throughput per watt efficiency attained in an ad hoc network under complete backbone coverage is better than that achieved by a corresponding network that does not form a backbone. We present a model for the calculation of the bit-per-joule performance of the network as a function of the distance threshold. We confirm the validity of our analytical approach through simulations. Using our method, a network designer is able to choose the optimal distance threshold to be used by this scheme, based on traffic loading conditions.     

ARMS-EGR—Adaptive ranking and mobile sink-enabled energy-efficient geographic routing protocol in flying ad hoc networks

Unmanned aerial vehicles (UAVs) have become widespread because of their involvement in a variety of applications. The task of designing the energy-efficient routing between UAVs has been considered a matter of great interest due to the inherent challenges of controlling the dynamics exhibited by UAVs. Energy limitations are considered the main limitations of UAVs. This research paper proposes a novel routing protocol, adaptive ranking and mobile sink (MS)-enabled energy-efficient geographic routing (ARMS-EGR) for flying ad hoc networks. In ARMS-EGR, the whole network is partitioned into cells. The cell contains cell members (CM) and cell heads (CHs). The CH works as a cluster head. Additionally, two MSs have been used to collect data captured by CM. Multihop communication on the network leads to an increase in traffic and consumes the energy of the UAVs located near the base station (BS). MSs are used for power distribution and load balancing across the network. Adaptive ranking of forwarder UAVs and CHs is performed during intracell and intercell multihop communication, respectively, using adaptive ranking. A cell with one-hop communication can directly send packets to the MS, but the ARMS-EGR routing protocol has been proposed for multihop communication. The proposed approach is simulated in NS-2.35 software. The results show that end-to-end latency and power consumption during packet transmission are greatly minimized. ARMS-EGR also demonstrates improvements in message success rates, number of alive nodes, and packet delivery ratio, making ARMS-EGR particularly suitable for flying ad hoc networks (FANETs).     

Scalable max–min fairness in wireless ad hoc networks

Our previous work proposes a macro model to perform flow and access control in wireless ad hoc networks. In this paper, we demonstrate specifically how to apply the model to achieve max–min fair rate allocation. Our proposed scheme is simple and scalable when comparing to other techniques in the literature. Moreover, it has the ability to provide stability in mobile environment. Simulation results show that our new method provides a good max–min fair flow assignment, and with that assignment, quality of service guarantees can be achieved for real-time applications.     

Fault-tolerant routing in adversarial mobile ad hoc networks: an efficient route estimation scheme for non-stationary environments

Designing routing schemes that would successfully operate in the presence of adversarial environments in Mobile Ad Hoc Networks (MANETs) is a challenging issue. In this paper, we discuss fault-tolerant routing schemes operating in a network with malfunctioning nodes. Most existing MANET protocols were postulated considering scenarios where all the mobile nodes in the ad hoc network function properly, and in an idealistic manner. However, adversarial environments are common in MANET environments, and misbehaving nodes certainly degrade the performance of these routing protocols. The need for fault tolerant routing protocols was identified to address routing in adversarial environments in the presence of faulty nodes by exploring redundancy-based strategies in networks. It turns out that since the nodes are mobile, the random variables encountered are non-stationary, implying that estimation methods for stationary variables are inadequate. Consequently, in this paper, we present a new fault-tolerant routing scheme that invokes a stochastic learning-based weak estimation procedure to enhance a route estimation phase, which, in turn, is then incorporated in a route selection phase. We are not aware of any reported method that utilizes non-traditional estimates to achieve the ranking of the possible paths. The scheme, which has been rigorously tested by simulation, has been shown to be superior to the existing algorithms.     

The research of cooperative routing algorithm in mobile Ad hoc networks

1 Introduction Ad hoc [1, 2] network is a dynamic-topological mobile self-organized network without any centralized access point. In such a network, each node acts as both host and router simultaneously, entering and departing from the network freely. How…     

Time-parallel simulation of wireless ad hoc networks

In this paper, we study time-parallel simulation of wireless networks based upon the concept of the perturbation induced by a networking event and present a layer-by-layer analysis of the impact of perturbations on the wireless network. This analysis allows us to propose several methods to improve the accuracy of time-parallel simulation. We describe an implementation based on the widely used ns-2 simulator and on the iterative extension of the warmup period. We introduce a method for initial state approximation which can improve the accuracy of the simulation for table-driven ad hoc routing protocols. A series of experiments show that on typical scenarios time-parallel simulation leads to a significant speedup while maintaining a high level of accuracy.     

Privacy preservation in secure group communications for?vehicular ad hoc networks

Secure communications for vehicular ad hoc networks (VANETs) have become an important research issue these years. Many protocols for secure vehicle-to-vehicle communications and vehicle-to-infrastructure communications have been proposed, yet fewer protocols are concerned with secure group communications for VANETs. Of those existing protocols for group communications, some of them form a group of vehicles based on geographical regions and provide broadcasting to the group members with or without message confidentiality. The others allow secure vehicle-to-vehicle communications within a group with session keys, but they do not preserve user privacy for communicating parties within the group. In this paper, we propose a novel group communication scheme for vehicular networks, in which a group is formed by a set of related vehicles of the same purpose, such as a platoon of recreational vehicles targeted for the same tourist spot. The scheme not only offers efficient and secure group communications but also provides privacy preservation for vehicle-to-vehicle communications within a group. Security analysis is given to demonstrate the robustness of the proposed scheme.     

Interference aware routing for mobile ad hoc networks based on node＇s sending and receiving capabilities

How to efficiently build routes among nodes is increasing important for mobile ad hoc networks （MANETs）. This paper puts forward an interference aware routing protocol called Interference aware cross layer routing protocol （IA-CLR） for MANETs based on the IEEE 802.11 medium access layer （MAC）. By defining the node＇s sending and receiving capabilities, IA-CLR can indicate the interference strength of the link in a real and comprehensive way. Further more, in order to choose the route with minimum bottleneck link interference, a new routing metric is proposed by combining the MAC layer and the network layer for cross layer design. Simulation results show that IA-CLR can significantly improve the performances of network such as the average end-to-end delay, the packets loss ratio and the throughput.     

Vehicular ad hoc networks (VANETS): status, results, and?challenges

Recent advances in hardware, software, and communication technologies are enabling the design and implementation of a whole range of different types of networks that are being deployed in various environments. One such network that has received a lot of interest in the last couple of years is the Vehicular Ad-Hoc Network (VANET). VANET has become an active area of research, standardization, and development because it has tremendous potential to improve vehicle and road safety, traffic efficiency, and convenience as well as comfort to both drivers and passengers. Recent research efforts have placed a strong emphasis on novel VANET design architectures and implementations. A?lot of VANET research work have focused on specific areas including routing, broadcasting, Quality of Service (QoS), and security. We survey some of the recent research results in these areas. We present a review of wireless access standards for VANETs, and describe some of the recent VANET trials and deployments in the US, Japan, and the European Union. In addition, we also briefly present some of the simulators currently available to VANET researchers for VANET simulations and we assess their benefits and limitations. Finally, we outline some of the VANET research challenges that still need to be addressed to enable the ubiquitous deployment and widespead adoption of scalable, reliable, robust, and secure VANET architectures, protocols, technologies, and services.     

Dynamic framework with adaptive contention window and multipath routing for video-streaming services over mobile ad hoc networks

The number of portable electronic devices capable of maintaining wireless communications increases day by day. Such mobile nodes may easily self-configure to form a Mobile Ad Hoc Network (MANET) without the help of any established infrastructure. As the number of mobile devices grows, the demand of multimedia services such as video-streaming from these networks is foreseen to increase as well. This paper presents a proposal which seeks to improve the experience of the end users in such environment. The proposal is called dCW-MMDSR (dynamic Contention Window-Multipath Multimedia Dynamic Source Routing), a cross-layer multipath routing protocol which includes techniques to achieve a dynamic assignment of the Contention Window of the IEEE 802.11e MAC level. In addition, it includes multipath routing suitable for layered coded video to improve the performance of the service. The operation is simple and suitable for low capacity wireless devices. Simulations show the benefits under different scenarios.     

EPCM – an efficient power controlled MAC protocol for mobile ad hoc network

To reduce interference and to save a significant amount of energy, a control of transmission power is employed in Mobile Ad hoc Network. Many researchers have reported numerous transmission power control schemes to achieve the objective. Some of those techniques use higher transmission power for control packets (Request To Send/Clear To Send) and lesser power for Data and ACK packets. These schemes, though save some amount of energy, achieve least aggregate throughput due to poor spatial reuse and hidden terminal interference. In this paper, an efficient Power Controlled Medium Access Control (EPCM) scheme is evinced, which uses uniform interference aware and minimum transmission power for both Control and Data packet. The performance of EPCM is evaluated and compared with three reported Medium Access Control protocols which are based on transmission power control schemes and is observed that the proposed protocol achieves better throughput and minimal energy consumption while avoiding the hidden terminal problem.     

Efficient traffic control and lifetime maximization in mobile ad hoc network by using PSO–BAT optimization

Recent developments in dynamic mobile ad-hoc network enhance the network speed and reliability. The nodes in the dynamic ad-hoc network are moving in nature. Due to the increased subscribers in this network, the network traffic has increased to manifold which in turn creating the challenge of maintaining the energy level. In path optimization process in mobile ad-hoc network consumes more energy and the draining of the energy is dependent on network reliability and connectivity. Further, the network also suffers by harmful attacks such as denial of service attack, black hole attack and warm hole attack. The primary focus of this paper is to prevent these attacks with the help of dynamic mobile ad-hoc network on demand protocol and hybrid meta-heuristics methodologies, and also to reduce the energy drain rate. This is achieved by estimating the velocity and fitness value of the nodes. Finally, the empirical simulation results of hybrid particle swarm optimization with bat algorithm (PSO–BAT) shows that the energy drain rate level is reduced 90% as 1 mJ/s than ad-hoc on demand vector. The end-to-end delay minimized to 50% than existing Ad hoc on-demand distance vector routing. The performance metrics routing overhead and execution time has been reduced and throughput is gradually increased in PSO–BAT optimization in dynamic mobile ad hoc network scenario.

     

How is the capacity of ad hoc networks improved with directional antennas?

The capacity of wireless ad hoc networks is constrained by the interference caused by the neighboring nodes. Gupta and Kumar have shown that the throughput for such networks is only Θ bits per second per node in a unit area domain when omnidirectional antennas are used [1]. In this paper we investigate the capacity of ad hoc wireless networks using directional antennas. Using directional antennas reduces the interference area caused by each node, thus increases the capacity of the network. We will give an expression for the capacity gain and we argue that in the limit, when the beam-width goes to zero the wireless network behaves like the wired network. In our analysis we consider both arbitrary networks and random networks where nodes are assumed to be static. We have also analyzed hybrid beamform patterns that are a mix of omnidirectional/directional and a better model of real directional antennas. Simulations are conducted for validation of our analytical results. Su Yi received the B.S. and M.S degrees in automation from Tsinghua University, China, in 1998 and 2001, respectively. She received her Ph.D. degree in electrical engineering from Rensselaer Polytechnic Institute, in December 2005. Her research interests include various topics in wireless ad hoc networks, including capacity of wireless networks, error control coding, and multimedia communications over wireless. Yong Pei is currently a tenure-track assistant professor in the Computer Science and Engineering Department, Wright State University, Dayton, OH. Previously he was a visiting assistant professor in the Electrical and Computer Engineering Department, University of Miami, Coral Gables, FL. He received his B.S. degree in electrical power engineering from Tsinghua University, Beijing, in 1996, and M.S. and Ph.D. degrees in electrical engineering from Rensselaer Polytechnic Institute, Troy, NY, in 1999 and 2002, respectively. His research interests include information theory, wireless communication systems and networks, and image/video compression and communications. He is a member of IEEE and ACM. Shivkumar Kalyanaraman is an Associate Professor at the Department of Electrical, Computer and Systems Engineering at Rensselaer Polytechnic Institute in Troy, NY. He received a B.Tech degree from the Indian institute of Technology, Madras, India in July 1993, followed by M.S. and Ph.D. degrees in computer and Information Sciences at the Ohio State University in 1994 and 1997 respectively. His research interests are in network traffic management topics such as congestion control, reliability, connectionless traffic engineering, quality of service (QoS), last-mile community wireless networks, low-cost free-space-optical networks, automated network management using online simulation, multicast, multimedia networking, and performance analysis. His special interest lies in developing the interdisciplinary connections between network architecture and fields like control theory, economics, scalable simulation technologies, video compression and optoelectronics. He is a member of ACM and IEEE. Babak Azimi-Sadjadi received his B.Sc. from Sharif University of Technology in 1989, his M.Sc. from Tehran University in 1992, and his Ph.D. from the University of Maryland at College Park in 2001 all in Electrical Engineering. He is currently with Intelligent Automation Inc. where he is a Senior Research Scientist He also has a joint appointment with the department of Electrical, Systems, and Computer Engineering of Rensselaer Polytechnic Institute where he is a research assistant professor. His research interests include, nonlinear filtering, networked control systems, and wireless networks.     

The hop count shift problem and its impacts on protocol design in wireless ad hoc networks

The hop count information has been exploited in the design of networking protocols in wireless ad hoc multi-hop networks. The hop count setup process normally assumes a perfect disk communication model and uses a simple controlled flooding approach. However, the practical communication model may not be such a disk communication model but time-varying and lossy. Sometimes transmissions can be successful beyond the nominal transmission range, i.e., the radius of such a disk model. The defacto hop count which are setup via time-varying and lossy radio channels may be different from the one based on the disk communication model. This paper introduces the hop count shift problem in realistic radio channels and investigates its impacts, via extensive simulations, on some representative hop count based protocols. Our simulation results suggest that these protocols’ performance generally suffers from the hop count shift problem, and the degradation is dependent on how the practical communication model deviates from the disk communication model. We also propose a strategy to combat the hop count shift problem and conduct simulations to show its effectiveness. The study of this paper necessitates reexaminations for the design of new hop count setup mechanism and the hop count based networking protocols.     

Routing Protocol with Optimal Location of Aggregation Point in Wireless Sensor Networks

1IntroductionAdvances in the miniaturization of MicroElectronicand Mechanical Structures(MEMS)haveledto batterypowered sensor nodes that have sensing,communica-tion,and processing capabilities[1~4].Sensor networkshave emerged as an indispensable and i mpo…