Recent research at the University of Central Florida addressing crashes on Interstate-4 in Orlando, Florida has led to the creation of new statistical models capable of calculating the crash risk on the freeway (Abdel-Aty et al., 2004; 2005, Pande and Abdel-Aty, 2006). These models yield the rear-end and lane-change crash risk along the freeway in real-time by using static information at various locations along the freeway as well as real-time traffic data that is obtained from the roadway. Because these models use the real-time traffic data, they are capable of calculating the respective crash risk values as the traffic flow changes along the freeway. The purpose of this study is to examine the potential of two Intelligent Transportation System strategies for reducing the crash risk along the freeway by changing the traffic flow parameters. The two ITS measures that are examined in this research are route diversion and ramp metering. Route diversion serves to change the traffic flow by keeping some vehicles from entering the freeway at one location and diverting them to another location where they may be more efficiently inserted into the freeway traffic stream. Ramp metering alters the traffic flow by delaying vehicles at the freeway on-ramps and only allowing a certain number of vehicles to enter at a time. The two strategies were tested by simulating a 36.25 mile section of the Interstate-4 network in the PARAMICS micro-simulation software. Various implementations of route diversion and ramp metering were then tested to determine not only the effects of each strategy but also how to best apply them to an urban freeway. Route diversion was found to decrease the overall rear-end and lane-change crash risk along the network at free-flow conditions to low levels of congestion. On average, the two crash risk measures were found to be reduced between the location where vehicles were diverted and the location where they were reinserted back into the network. However, a crash migration phenomenon was observed at higher levels of congestion as the crash risk would be greatly increased at the location where vehicles were reinserted back onto the network. Ramp metering in the downtown area was found to be beneficial during heavy congestion. Both coordinated and uncoordinated metering algorithms showed the potential to significantly decrease the crash risk at a network wide level. When the network is loaded with 100 percent of the vehicles the uncoordinated strategy performed the best at reducing the rear-end and lane-change crash risk values. The coordinated strategy was found to perform the best from a safety and operational perspective at moderate levels of congestion. Ramp metering also showed the potential for crash migration so care must be taken when implementing this strategy to ensure that drivers at certain locations are not put at unnecessary risk. When ramp metering is applied to the entire freeway network both the rear-end and lane-change crash risk is decreased further. ALINEA is found to be the best network-wide strategy at the 100 percent loading case while a combination of Zone and ALINEA provides the best safety results at the 90 percent loading case. It should also be noted that both route diversion and ramp metering were found to increase the overall network travel time. However, the best route diversion and ramp metering strategies were selected to ensure that the operational capabilities of the network were not sacrificed in order to increase the safety along the freeway. This was done by setting the maximum allowable travel time increase at 5% for any of the ITS strategies considered.

According to a Gartner Group (www.gartner.com) report in September 2008, the worldwide telecommunications market is on pace to reach $2 trillion in 2008. Gartner predicts that by 2012, the ratio of mobile to fixed connections will exceed 4-to-1. The North American mobile data market grew to 141.1 million connections in 2007, with a compound annual growth rate of 41.7 percent. It is believed that a large portion will be ad hoc and multi-hop connections, which will open many opportunities for Mobile Ad hoc NETwork (MANET) applications and Wireless Mesh Network (WMN) applications. A MANET is a self-organizing multi-hop wireless network where all nodes participate in the routing and data forwarding process. Such a network can be easily deployed in situations where no base station is available, and a network must be build spontaneously. In applications such as battlefield communications, national crises, disaster recovery, and sensor deployment, a wired network is not available and ad hoc networks provide the only feasible means of communications and information access. Ad hoc networks have also become commonplace for gaming, conferencing, electronic classrooms, and particularly vehicle-to-vehicle communications. A Wireless mash network (WMN) is collection of mesh clients and mesh nodes (routers), with mesh nodes forming the backbone of the network and providing connection to the Internet and other network. Their rapid deployment and ease of maintenance are suitable for on-demand network such as disaster recovery, homeland security, convention centers, hard-to-wire buildings and unfriendly terrains. One important problem with MANET is the routing protocol that needs to work well not just with a small network, but also sustain efficiency and scalability as the network gets expanded and the application transmits data in greater volume. In such an environment, mobility, channel error, and congestion are the main causes for packet loss. Due to mobility of mobile hosts, addressing frequent and unpredictable topology changes is fundamental to MANET research. Two general approaches have been considered: connection-oriented approach and connectionless-oriented approach. In the former, the emphasis is on how to reconnect quickly with low overhead when a broken link occurs. Examples of this approach includes includes [5], [9], [10], [16], [26], [28], [29], [34], [44], and [45]. In contrast, connectionless-oriented approach focuses on minimizing the occurrence of broken links. We proposed one such scheme called Connectionless Approach (CLA) and . In CLA, the network area is divided into non-overlapping grid cells, each serving as a virtual router. Any physical router (i.e., mobile host), currently inside a virtual router, can help forward the data packet to the next virtual router along the virtual link. This process is repeated until the packet reaches its final destination. Since a virtual link is based on virtual routers which do not move, it is much more robust than physical links used in the connection-oriented techniques. Simulation results in our previous works and , based on GloMoSim , indicate that CLA performs significantly better than connection-oriented techniques (i.e., AODV, DSR, LAR, GRID, TMNR, and GPSR). The contribution of this work consists of investigating and developing new Connectionless-Oriented Approach for Mobile Ad Hoc Network. Two of the greatest impacts of this research are as follows. First, the new approach is targeted towards robustly support high mobility and large scale environment which has been adapted for vehicle-to-vehicle environment in . Second, the detailed simulations which compare eight representative routing protocols, namely AODV, DSR, LAR, GRID, TMNR, GPSR, CBF, and CLA, under high-mobility environments. As many important emergent applications of the technology involved high-mobility nodes, very little is known about the existing routing methods perform relative to each other in high-mobility environments. The simulation results provide insight into ad hoc routing protocols and offer guidelines for mobile ad hoc network applications. Next, we enhanced and extend the connectionless-oriented approach. The current connectionless-oriented approach, however, may suffer from packet drops since traffic congestion is not considered in the packet forwarding policy. We address this weakness by considering the connectionless-oriented approach with a collision avoidance routing technique. After that, we investigate techniques to enforce collaboration among mobile devices in supporting the virtual router functionality. Many works have been published to combat such problem - misbehaving nodes are detected and a routing algorithm is employed to avoid and penalize misbehaving nodes. These techniques, however, cannot be applied to the connectionless-oriented approach since any node in the general direction towards the destination node can potentially help forward the data packets. To address the security and cooperation issues for connectionless-oriented approach, we introduce a cooperation enforcement technique called 3CE (3-Counter Enforcement). In addition, wireless mesh networks have become increasingly popular in recent years. Wireless mash network (WMNs) are collection of mesh clients and mesh nodes (routers), with mesh nodes forming the backbone of the network and providing connection to the Internet and other network. We propose a paradigm that combines virtual routers and mesh nodes to create a hybrid network call VR-Mesh Network. This hybrid network can reduce number of mesh node needed without decrease the performance of the network.