Power Aware Routing in Mobile Ad Hoc Networks

In this paper, we present a novel packet delivery mechanism called Multi-Path and Multi-SPEED Routing Protocol (MMSPEED) for probabilistic QoS guarantee in wireless sensor networks. The QoS provisioning is performed in two quality domains, namely, timeliness and reliability. Multiple QoS levels are provided in the timeliness domain by guaranteeing multiple packet delivery speed options. In the reliability domain, various reliability requirements are supported by probabilistic multipath forwarding. These mechanisms for QoS provisioning are realized in a localized way without global network information by employing localized geographic packet forwarding augmented with dynamic compensation, which compensates for local decision inaccuracies as a packet travels towards its destination. This way, MMSPEED can guarantee end-to-end requirements in a localized way, which is desirable for scalability and adaptability to large scale dynamic sensor networks. Simulation results show that MMSPEED provides QoS differentiation in both reliability and timeliness domains and, as a result, significantly improves the effective capacity of a sensor network in terms of number of flows that meet both reliability and timeliness requirements up to 50 percent (12 flows versus 18 flows).

/pdf/mmspeed-multipath-multi-speed-protocol-for-qos-guarantee-of-qe6q7qybre.pdf

MMSPEED: multipath Multi-SPEED protocol for QoS guarantee of reliability and. Timeliness in wireless sensor networks

https://www.lk.cs.ucla.edu/data/files/Gerla/Vehicular%20networks%20by%20gerla%20and%20kleinrock%202011.pdf

Vehicular networks and the future of the mobile internet

Mobile ad hoc networks are autonomous, infrastructureless networks that support multihop communication through IP routing. This paper examines the use of mobile IP in order to provide global Internet connectivity to ad hoc networks that use an on-demand routing protocol. We present a hybrid scheme that uses techniques such as TTL scoping of agent advertisements, eavesdropping and caching agent and advertisements to combine the advantages of proactive and reactive approaches to providing connectivity. We present simulation results to show that our approach achieves excellent connectivity while keeping overhead costs low.

A hybrid approach to Internet connectivity for mobile ad hoc networks

Development in short-range wireless LAN (WLAN) and long-range wireless WAN (WWAN) technologies have motivated recent efforts to integrate the two. This creates new application scenarios that were not possible before. Vehicles with only WLAN radios can use other vehicles that have both WLAN and WWAN radios as mobile gateways and connect to the Internet while on the road. The most difficult challenge in the scenario is to deal with frequent route breakages due to dynamic mobility of vehicles on the road. Existing routing protocols that are widely used for mobile ad hoc networks are reactive in nature and wait until existing routes break before constructing new routes. The frequent route failures result in a significant amount of time needed for repairing existing routes or reconstructing new routes. In spite of the dynamic mobility, the motion of vehicles on highways is quite predictable compared to other mobility patterns for wireless ad hoc networks, with location and velocity information readily available. This can be exploited to predict how long a route will last between a vehicle requiring Internet connectivity and the gateway that provides a route to the Internet. Successful prediction of route lifetimes can significantly reduce the number of route failures. In this paper, we introduce a prediction-based routing (PBR) protocol that is specifically tailored to the mobile gateway scenario and takes advantage of the predictable mobility pattern of vehicles on highways. The protocol uses predicted route lifetimes to preemptively create new routes before existing ones fail. We study the performance of this protocol through simulation and demonstrate significant reductions in route failures compared to protocols that do not use preemptive routing. Moreover, we find that the overhead of preemptive routing is kept in check due to the ability of PBR to predict route lifetimes.

/pdf/prediction-based-routing-for-vehicular-ad-hoc-networks-4zm4j1j1j1.pdf

Prediction-Based Routing for Vehicular Ad Hoc Networks

The growing deployment rate of wireless LANs indicates that wireless networking is rapidly becoming a prevalent form of communication. As users become more accustomed to the use of mobile devices, they increasingly want the additional benefit of roaming. The Mobile IP protocol has been developed as a solution for allowing users to roam outside of their home networks while still retaining network connectivity. The problem with this solution, however, is that the deployment of foreign agents is expensive because their coverage areas are limited due to fading and interference. To reduce the number of foreign agents needed while still maintaining the same coverage, ad hoc network functionality can cooperate with Mobile IP such that multihop routes between mobile nodes and foreign agents can be utilized. In this work, we present a method for enabling the cooperation of Mobile IP and the Ad hoc On-Demand Distance Vector (AODV) routing protocol, such that mobile nodes that are not within direct transmission range of a foreign agent can still obtain Internet connectivity. In addition, we describe how duplicate address detection can be used in these networks to obtain a unique co-located care-of address when a foreign agent is not available.

Internet Connectivity for Ad Hoc Mobile Networks

Dynamic address assignment enables nodes in mobile ad hoc networks to obtain a routable address without the need for any explicit configuration. It provides a means for nodes to communicate without any centralized infrastructure and provides a mechanism for dynamic network membership. Recently, a considerable number of dynamic addressing protocols have been proposed. While these approaches bear some similarities to each other, they also differ in some important characteristics. To understand the benefits of these different approaches, it is necessary to test the protocols in a wide range of network conditions so that their performance and suitability can be predicted. This paper studies existing solutions by categorizing and qualitatively analyzing the scalability and other performance properties of the approaches. We also introduce a new addressing approach that provides both quick and efficient unique address assignment. We then compare selected protocols through quantitative analysis based on extensive simulations. Based on the simulation results, we point out the applicability of the protocols and offer suggestions to improve protocol performance. Copyright © 2004 John Wiley & Sons, Ltd.

https://www.onlinelibrary.wiley.com/doi/pdf/10.1002/wcm.215

A study of dynamic addressing techniques in mobile ad hoc networks

Performance evaluation and analysis of wireless networks is essential because testbed experiments facilitate a better understanding of network and application characteristics. This understanding of performance, in turn, results in robust protocol design. In this paper, we present an experimental study of multimedia traffic performance in mesh networks. We evaluate the performance of video and voice traffic through multi-hop wireless paths and study the capacity of the mesh network. We also investigate the impact of different traffic and network characteristics on application performance. The impact of different wireless network interface card configurations is examined, followed by our suggestions for how to improve performance. We believe our study is beneficial for both wireless network capacity planning and robust protocol design for wireless applications and services. Other researchers can also draw upon our traffic measurement experience for their own mesh testbed experiments.

/pdf/an-experimental-study-of-multimedia-traffic-performance-in-37m02tle6w.pdf

An experimental study of multimedia traffic performance in mesh networks

Hybrid wireless networks are a viable networking solution to combat the limitations of infrastructured wireless networks and provide Internet connectivity to ad hoc networks. This paper first analyzes the requirements for deployment of hybrid networks in different application scenarios. Then two routing schemes designed for different traffic patterns in hybrid networks are proposed to achieve optimal performance. Simulation results show that with a large percentage of short web-based traffic sessions, using a gateway as a default router results in better performance with lower latency, fewer routing table entries, and manageable control overhead. When traffic locality is high and Internet traffic is only an occasional occurrence, the reactive routing scheme results in better performance, yielding low control overhead and higher throughput.

/pdf/application-oriented-routing-in-hybrid-wireless-networks-47qpeg8fiz.pdf

Application-oriented routing in hybrid wireless networks

Ad hoc networks have been proposed for a variety of applications where support for real time, multimedia services may be necessary. This requires that the network is able to offer quality of service (QoS) appropriate for the latency and throughput bounds needed to meet the real time constraint. An important component for QoS provisioning is resource estimation and quality prediction. The paper describes a model-based resource prediction (MBRP) mechanism to support real time communication in multi-hop wireless networks. Specifically, we develop an analytical model for differentiated MAC scheduling protocols. The model can predict per-flow and system-wide throughput and delivery latency, thereby enabling admission control of the flows and providing an efficient network management utility. After describing the basic model, we propose enhanced MBRP (EMBRP) for realistic network environments. Our proposed quality prediction method is beneficial in the deployment of a real ad hoc network where knowledge of resource allocation and consumption is needed to meet the service requirements. Analytical and simulation results show that EMBRP provides accurate flow quality prediction. The results also demonstrate the effectiveness of EMBRP as an admission control solution in multi-hop ad hoc networks.

/pdf/model-based-resource-prediction-for-multi-hop-wireless-3rq0etw9in.pdf

Yuan Sun

Papers

Internet Connectivity for Ad Hoc Mobile Networks

A study of dynamic addressing techniques in mobile ad hoc networks

An experimental study of multimedia traffic performance in mesh networks

Application-oriented routing in hybrid wireless networks

Model-based resource prediction for multi-hop wireless networks