We propose to use Vehicular ad hoc networks (VANET) as the infrastructure for an urban cyber-physical system for gathering up-to-date data about a city, like traffic conditions or environmental parameters. In this context, it is critical to design a data collection protocol that enables retrieving the data from the vehicles in almost real-time in an efficient way for urban scenarios. We propose Back off-based Per-hop Forwarding (BPF), a broadcast-based receiver-oriented protocol that uses the destination location information to select the forwarding order among the nodes receiving the packet. BFP does not require nodes to exchange periodic messages with their neighbors communicating their locations to keep a low management message overhead. It uses geographic information about the final destination node in the header of each data packet to route it in a hop-by-hop basis. It takes advantage of redundant forwarding to increase packet delivery to a destination, what is more critical in an urban scenario than in a highway, where the road topology does not represent a challenge for forwarding. We evaluate the performance of the BPF protocol using ns-3 and a Manhattan grid topology and compare it with well-known broadcast suppression techniques. Our results show that BPF achieves significantly higher packet delivery rates at a reduced redundancy cost.
This paper describes a self-organizing, multihop, mobile radio network which relies on a code-division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled, and are dynamically reconfigured as the nodes move. This network architecture has three main advantages. First, it provides spatial reuse of the bandwidth due to node clustering. Second, bandwidth can be shared or reserved in a controlled fashion in each cluster. Finally, the cluster algorithm is robust in the face of topological changes caused by node motion, node failure, and node insertion removal. Simulation shows that this architecture provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network.  The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines unicast routes to destinations within the ad hoc network. It uses destination sequence numbers to ensure loop freedom at all times (even in the face of anomalous delivery of routing control messages), avoiding problems (such as "counting to infinity") associated with classical distance vector protocols. An IVC (Inter-vehicle communication) network is a type of mobile ad hoc networks (MANET) in which high-speed vehicles send, receive, and forward packets via other vehicles on the roads. An IVC network can provide useful applications in future Intelligent Transportation Systems. However, due to frequent network topology changes, a routing path in an IVC network breaks easily. As such, a routing protocol proposed for general MANET (e.g., AODV) performs poorly in IVC networks. To address this problem, we designed and implemented an intelligent flooding-based routing protocol and conducted several field trials to evaluate its performance on the roads. Results obtained from field trials show that (1) our protocol outperforms AODV significantly on IVC networks, and (2) our protocol can make many useful services such as email, ftp, web, video conferencing, and video broadcasting applicable on IVC networks for vehicle users. Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we propose a simple and efficient distributed algorithm for calculating connected dominating set in ad hoc wireless networks, where connections of nodes are determined by their geographical distances. We also propose an update recalculation algorithm for the connected dominating set when the topology of the ad hoc wireless network changes dynamically. Our simulation results show that the proposed approach outperforms a classical algorithm in terms of finding a small connected dominating set and doing so quickly. Our approach can be potentially used in designing efficient routing algorithms based on a connected dominating set. Development in Wireless LAN and Cellular technologies has motivated recent efforts to integrate the two. This creates new application scenarios that were not possible before. Vehicles with Wireless LAN radios can use other vehicles with both Wireless LAN and Cellular radios as mobile gateways and connect to the outside world. We aim to study the feasibility of such global connectivity from the road through simulation of the underlying connectivity characteristics for varying traffic and gateway densities. The connectivity results suggest that each vehicle should be able to connect to at least one gateway for a majority of time. The average path lifetimes are found to be good enough many traditional Internet applications like FTP and HTTP. The effectiveness of the AODV wireless ad-hoc routing protocol over this scenario is evaluated and shown to perform well for the densities considered. However, the routes created by AODV can break very frequently due to the dynamic nature of mobility involved. We introduce a couple of prediction based routing protocols to minimize these route breakages and thus improve performance. These protocols take advantage of some deterministic characteristics of the mobility model to better predict route breakages and take preemptive action.