Traffic Aware Routing Protocol Research Articles

A new routing scheme to reduce traffic in large scale mobile ad-hoc networks through selective on-demand method

Wireless ad-hoc networks have many different characteristics from previous centralized networks. While the infrastructure based networks usually employ the simple routing protocol because every node can reach the coordinator in a single hop, some specific situations, i.e., unplanned dynamic links and multi hop environment, were required in ad-hoc networks. In mobile ad-hoc network, all nodes engaging in communication under the ad-hoc networks should be operated as a router. For this, two routing approaches are previously designed for ad-hoc networks; proactive and reactive routing, and they differently have pros and cons from each other. Moreover, to integrate their advantages in case by case, hybrid approach is consistently researched, and Zone Routing Protocol (ZRP) was motivating many recent hybrid protocols. In ZRP, a node uses proactive routing if it is located within the zone defined by the specific number of hops, but it uses reactive routing in otherwise case. However, ZRP always forms the proactive zone considering only the number of hops, regardless of whether real data communication occurred frequently or not. In this paper, we propose a new routing scheme called Traffic Aware Dynamic Zone Routing (TA-DZR) protocol which employs the zone method but forms customized zone using traffic load, by a new decision method named Dynamic Zone Decision (DZD). The DZD selects nodes that are good to use proactive routing based on the traffic load and forms the proactive zone with them. By considering traffic awareness, TA-DZR can decrease the number of transmissions and can reduce the total energy consumption. After the description of TA-DZR, the performance is demonstrated with simulation results which show that the number of transmissions decreases in overall network, and that the energy consumption is also reduced. Additionally, we validate that the end-to-end delivery delay is reduced and that the packet delivery ratio is improved. These enhancements are caused by reducing overall network congestion.

Traffic-aware and low-overhead routing protocol for mobile ad hoc networks

In this paper, a new routing protocol for mobile ad hoc networks, called traffic-aware and low-overhead routing protocol TALORP is proposed. TALORP uses backup routes to mitigate the flooding problem that is frequently used to repair link failures. It also accounts for the traffic flows on different paths towards the destination in order to select the shortest and the least-congested path. The simulation results demonstrated that TALORP achieves better performance compared to similar protocols under a wide range of traffic conditions in terms of packet delivery ratio, end-to-end delay, and the average number of hops used but at the cost of increasing the routing overhead under certain traffic conditions.

Intersection-Based Routing Protocol for VANETs

Vehicular ad hoc network (VANET) is an emerging wireless communications technology that is capable of enhancing driving safety and velocity by exchanging real-time transportation information. In VANETs, the carry-and-forward strategy has been adopted to overcome uneven distribution of vehicles. If the next vehicle located is in transmission range, then the vehicle forwards the packets; if not, then it carries the packets until meeting. The carry mostly occurs on sparsely populated road segments, with long carry distances having long end-to-end packet delays. Similarly, the dense condition could have long delays, due to queuing delays. The proposed intersection-based routing protocol finds a minimum delay routing path in various vehicle densities. Moreover, vehicles reroute each packet according to real-time road conditions in each intersection, and the packet routing at the intersections is dependent on the moving direction of the next vehicle. Finally, the simulation results show that the proposed Intersection-Based Routing (IBR) protocol has less end-to-end delay compared to vehicle-assisted data delivery (VADD) and greedy traffic aware routing protocol (GyTAR) protcols.

Traffic-aware routing protocol for wireless sensor networks

In wireless sensor networks, when a sensor node detects events in the surrounding environment, the sensing period for learning detailed information is likely to be short. However, the short sensing cycle increases the data traffic of the sensor nodes in a routing path. Since the high traffic load causes a data queue overflow in the sensor nodes, important information about urgent events could be lost. In addition, since the battery energy of the sensor nodes is quickly exhausted, the entire lifetime of wireless sensor networks would be shortened. In this paper, to address these problem issues, a new routing protocol is proposed based on a lightweight genetic algorithm. In the proposed method, the sensor nodes are aware of the data traffic rate to monitor the network congestion. In addition, the fitness function is designed from both the average and the standard deviation of the traffic rates of sensor nodes. Based on dominant gene sets in a genetic algorithm, the proposed method selects suitable data forwarding sensor nodes to avoid heavy traffic congestion. In experiments, the proposed method demonstrates efficient data transmission due to much less queue overflow and supports fair data transmission for all sensor nodes. From the results, it is evident that the proposed method not only enhances the reliability of data transmission but also distributes the energy consumption across wireless sensor networks.

Towards Efficient Geographic Routing in Urban Vehicular Networks

Vehicular ad hoc networks (VANETs) have received considerable attention in recent times. Multihop data delivery between vehicles is an important aspect for the support of VANET-based applications. Although data dissemination and routing have extensively been addressed, many unique characteristics of VANETs, together with the diversity in promising applications, offer newer research challenges. This paper introduces the improved greedy traffic-aware routing protocol (GyTAR), which is an intersection-based geographical routing protocol that is capable of finding robust and optimal routes within urban environments. The main principle behind GyTAR is the dynamic and in-sequence selection of intersections through which data packets are forwarded to the destinations. The intersections are chosen considering parameters such as the remaining distance to the destination and the variation in vehicular traffic. Data forwarding between intersections in GyTAR adopts an improved greedy carry-and-forward mechanism. Evaluation of the proposed routing protocol shows significant performance improvement in comparison with other existing routing approaches. With the aid of extensive simulations, we also validate the optimality and sensitivity of significant GyTAR parameters.