Recent advances in wireless inter-vehicle communication systems enable the development of Vehicular Ad-Hoc Networks (VANET) and create significant opportunities for the deployment of a wide variety of vehicular applications and services. In this paper, we introduce the Vehicular Information Transfer Protocol (VITP), an application-layer communication protocol, which is designed to support the establishment of a distributed, ad-hoc service infrastructure over VANET. The VITP infrastructure can be used to provide locationbased, traffic-oriented services to drivers, using information retrieved from vehicular sensors and taking advantage of onboard GPS navigation systems. In this paper, we present the key design concepts of the protocol and the infrastructure, the protocol specification, simple examples of protocol interactions that support driver inquiries, and a simulation study of VITP performance properties.

Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with real radios, whose connectivity violates that assumption. In this paper, we describe the Cross-Link Detection Protocol (CLDP), which enables provably correct geographic routing on arbitrary graphs. Our simulations show that the protocol is practical: it incurs low overhead and exhibits low path stretch in wireless networks. 1

Abstract — Future large-scale networks, such as sensor networks, will consist of hundreds and even thousands of wirelessly connected sensor and actuator nodes. The nodes are typically highly resource-constrained (processor, memory, and power), have limited communication range, and are prone to failure. Furthermore, there is no global information about the exact location and connectivity of the nodes. Consequently, the explicit consideration of network and task constraints and objectives will be an important part of routing algorithms for these networks. In this paper, we present a distributed constraint-based routing approach that represents destination conditions as well as routing constraints and objectives explicitly. We further present an efficient routing algorithm, CB-LRTA*, that extends traditional Learning Real-Time A * (LRTA*) with back-propagation. We evaluate CB-LRTA * using simulation and demonstrate that it improves convergence to the optimal route over LRTA*. I.

Recent advances in wireless inter-vehicle communication systems enable the establishment of Vehicular Ad-hoc Networks (VANET) and create significant opportunities for the deployment of a wide variety of applications and services to vehicles. In this work, we investigate the problem of developing services that can provide car drivers with time-sensitive information about traffic conditions and roadside facilities. We introduce the Vehicular Information Transfer Protocol (VITP), a locationaware, application-layer, communication protocol designed to support a distributed service infrastructure over Vehicular Adhoc Networks. We describe the key design concepts of the VITP protocol and infrastructure. We provide an extensive simulation study of VITP performance on large-scale vehicular networks under realistic highway and city traffic conditions. Our results demonstrate the viability and effectiveness of VITP in providing location-aware services over VANETs.

Abstract—Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad hoc networks. However, location-based routing is difficult when there are holes in the network topology and nodes are mobile or frequently disconnected to save battery. Terminode routing, presented here, addresses these issues. It uses a combination of location-based routing (Terminode Remote Routing, TRR), used when the destination is far, and link state routing (Terminode Local Routing, TLR), used when the destination is close. TRR uses anchored paths, a list of geographic points (not nodes) used as loose source routing information. Anchored paths are discovered and managed by sources, using one of two low overhead protocols: Friend Assisted Path Discovery and Geographical Map-based Path Discovery. Our simulation results show that terminode routing performs well in networks of various sizes. In smaller networks, the performance is comparable to MANET routing protocols. In larger networks that are not uniformly populated with nodes, terminode routing outperforms existing location-based or MANET routing protocols. Index Terms—Restricted random waypoint, mobility model, ad hoc network, scalable routing, location-based routing method,

This paper considers the problem of routing in a wide area mobile ad-hoc network called Terminode Network. Our routing scheme is a combination of two protocols called Terminode Local Routing (TLR) and Terminode Remote Routing (TRR). TRR is activated when the destination is remote and uses location of the destination obtained either via location management or by location tracking. TLR acts when the packet gets close to the destination. The use of TRR results in a scalable solution that reduces dependence on the intermediate systems, while TLR allows to reduce problems due to location inaccuracy. The paper describes TLR and TRR protocols and presents some simulation results.

Mobile Ad hoc Network (MANET) is a multihop wireless network of mobile nodes without any fixed infrastructure. In the absence of dedicated routers, every node contributes towards the configuration and maintenance of the routing framework. Routing protocols need to consider inter-related factors like node mobility, bandwidth scarcity and energy constraints. This survey paper attempts to outline various unicast routing techniques for mobile ad hoc networks. It briefly describes a comparative analysis with respect to routing methodology and performance. 1.

Location-Aided Routing (LAR) [14] algorithm is an approach to utilize location information for mobile hosts, with the goal of decreasing routing-related overhead in mobile ad hoc networks. A number of optimizations are possible to improve performance of the basic LAR protocols. This paper mainly focuses how the basic operation of LAR can be improved by applying those optimization schemes. 1 Introduction The issue of developing efficient routing algorithms is a challenging problem in the area of mobile ad hoc networking (MANET). Many different protocols have been proposed to achieve a given level of routing performance for MANET [1, 2, 4, 5, 6, 8, 9, 14, 15, 18, 19, 20, 22, 23]. Among those protocols, Location-Aided Routing (LAR) algorithms we proposed [11, 12, 14] attempt to reduce routing discovery overhead incurred with some flooding based approaches, such as Dynamic Source Routing (DSR) [9, 10] and Ad hoc On demand Distance Vector routing Research reported is supported in part b...

The focus of this paper is routing in a wide area mobile ad hoc network referred to as a Terminode Network. Our routing scheme is a combination of two protocols: Terminode Local Routing (TLR) and Terminode Remote Routing (TRR). TRR is used for remote destinations. It utilizes the location of a destination obtained by the source using location management or location tracking. TLR acts when the packet gets close to the destination. The use of TRR results in a scalable solution that reduces dependence on the intermediate systems, while TLR reduces problems due to the destination location inaccuracy. This paper describes TLR and TRR and the interaction between them. Terminode routing is implemented and evaluated using GloMoSim simulator. For the purpose of more realistic routing evaluation we designed a new mobility model, the restricted random waypoint model, which represents more realistic mobility pattern in a large scale mobile ad hoc environment.

Abstract—Recently, it became apparent that group-oriented services are one of the primary application classes targeted by MANETs. As a result, several MANET-specific multicast routing protocols have been proposed. Although these protocols perform well under specific mobility scenarios, traffic loads, and network conditions, no single protocol has been shown to be optimal in all scenarios. The goal of this paper is to characterize the performance of multicast protocols over a wide range of MANET scenarios. To this end, we evaluate the performance of mesh and tree-based multicast routing schemes relative to flooding and recommend protocols most suitable for specific MANET scenarios. Based on the analysis and simulation results, we also propose two variations of flooding, scoped flooding and hyper flooding, as a means to reduce overhead and increase reliability, respectively. Another contribution of the paper is a simulation-based comparative study of the proposed flooding variations against plain flooding, mesh, and tree-based MANET routing. In our simulations, in addition to “synthetic ” scenarios, we also used more realistic MANET settings, such as conferencing and emergency response. Index Terms—Ad hoc networks, mobile computing, multicast, routing protocols, wireless. æ