Ad hoc wireless distribution service

About: Ad hoc wireless distribution service is a research topic. Over the lifetime, 17734 publications have been published within this topic receiving 488205 citations.

Caching strategies in on-demand routing protocols for wireless ad hoc networks

Abstract: An on-demand routing protocol for wireless and hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a data packet addressed to that node. In order to avoid the need for such a route discovery to be performed before each data packet is sent, such routing protocols must cache routes previously discovered. This paper presents an analysis of the effects of different design choices for this caching in on-demand routing protocols in wireless ad hoc networks, dividing the problem into choices of cache structure, cache capacity, and cache timeout. Our analysis is based on the Dynamic Source Routing protocol (DSR), which operates entirely on-demand. Using detailed simulations of wireless ad hoc networks of 50 mobile nodes, we studied a large number of different caching algorithms that utilize a range of design choices, and simulated each cache primarily over a set of 50 different movement scenarios drawn from 5 different types of mobility models. We also define a set of new mobility metrics that allow accurate characterization of the relative difficulty that a given movement scenario presents to an ad hoc network routing protocol, and we analyze each mobility metric's ability to predict the actual difficulty in terms of routing overhead experienced by the routing protocol across the scenarios in our study.

Survey of Routing Protocols in Vehicular Ad Hoc Networks

Abstract: The chapter provides a survey of routing protocols in vehicular ad hoc networks. The routing protocols fall into two major categories of topology-based and position-based routing. The chapter discusses the advantages and disadvantages of these routing protocols, explores the motivation behind their design and trace the evolution of these routing protocols. Finally, it concludes the chapter by pointing out some open issues and possible direction of future research related to VANET routing. INTRODUCTION With the sharp increase of vehicles on roads in the recent years, driving has not stopped from being more challenging and dangerous. Roads are saturated, safety distance and reasonable speeds are hardly respected, and drivers often lack enough attention. Without a clear signal of improvement in the near future, leading car manufacturers decided to jointly work with national government agencies to develop solutions aimed at helping drivers on the roads by anticipating hazardous events or avoiding bad traffic areas. One of the outcomes has been a novel type of wireless access called Wireless Access for Vehicular Environment (WAVE) dedicated to vehicle-to-vehicle and vehicle-to-roadside communications. While the major objective has clearly been to improve the overall safety of vehicular traffic, promising traffic management solutions and on-board entertainment applications are also expected by the different bodies (C2CCC, VII, CALM) and projects (VICS (Yamada, 1996), CarTALK 2000 (Reichardt D, 2002), NOW, CarNet (Morris R, 2000), FleetNet (Franz, 2001)) involved in this field. When equipped with WAVE communication devices, cars and roadside units form a highly dynamic network called a Vehicular Ad Hoc Network (VANET), a special kind of Mobile AdHoc Networks (MANETs). While safety applications mostly need local broadcast connectivity, it is expected that some emerging scenarios (Lee, 2009) developed for intelligent transportation systems (ITS) would benefit from unicast communication over a multi-hop connectivity. Moreover, it is conceivable that applications that deliver contents and disseminate useful information can flourish with the support of multi-hop connectivity in VANETs. Although countless numbers of routing protocols (Mauve, 2001; Mehran, 2004) have been developed in MANETs, many do not apply well to VANETs. VANETs represent a particularly challenging class of MANETs. They are distributed, self-organizing communication networks formed by moving vehicles, and are thus characterized by very high node mobility and limited degrees of freedom in mobility patterns. As shown in Figure 1, there are two categories of routing protocols: topology-based and geographic routing. Topology-based routing uses the information about links that exist in the network to perform packet forwarding. Geographic routing uses neighboring location information to perform packet forwarding. Since link information changes in a regular basis, topology-based routing suffers from routing route breaks. Car 2 Car Communication Consortium, http://www.car‐to‐car.org The Vehicle Infrastructure Integration (VII) Initiative, http://www.vehicle‐infrastructure.org Continuous Air Interface for Long and Medium Interface (CALM), http://www.calm.hu Vehicle Information and Communication System Network On Wheels, www.network‐on‐wheels.de Figure 1: Taxonomy of Various Routing Protocols in VANET Despite many surveys already published on routing protocols in MANETs (Mauve, 2001; Mehran, 2004Giordano, 2003; Stojemnovic, 2004), a survey of newly developed routing protocols specific to VANETs has long been overdue. Li et al. (2007) have made an effort to introduce VANET routing protocols, yet there is still deficiency in a thorough and comprehensive treatment on this subject. A discussion of VANET topics and applications is incomplete without detailed coverage of relevant routing protocols and their impact on overall VANET architecture. In this book chapter, we seek to provide the missing building blocks by detailing the advances in VANET routing protocols. Section III describes the VANET architecture and its characteristics. Section IV presents a survey of these protocols experimented on or tailored to VANET and their advantages and disadvantages. It will explore the motivation behind their design and trace the evolution of these routing protocols. Finally, Section V will point out some open issues and possible direction of future research, and then conclude the book chapter.

Connectivity of wireless multihop networks in a shadow fading environment

Abstract: This article analyzes the connectivity of multihop radio networks in a log-normal shadow fading environment. Assuming the nodes have equal transmission capabilities and are randomly distributed according to a homogeneous Poisson process, we give a tight lower bound for the minimum node density that is necessary to obtain an almost surely connected subnetwork on a bounded area of given size. We derive an explicit expression for this bound, compute it in a variety of scenarios, and verify its tightness by simulation. The numerical results can be used for the practical design and simulation of wireless sensor and ad hoc networks. In addition, they give insight into how fading affects the topology of multihop networks. It is explained why a high fading variance helps the network to become connected.