ROUTE RECOVERY ALGORITHM USING GEOINFORMATION DATA

Techniques for optimizing the transport network using an array of data obtained from sensors of the geoinformation system (GIS) are constantly being tested in practice in different countries. For freight transport, few data are available. The development of a transport planning model makes it possible to obtain maximum information from each dataset. Considering the modern realities of the development of methods, a visual presentation of the results of modeling with the support of GIS is required, with non-standard modeling practices

Assurance of Mobility in MANETS using Ensemble Route Recovery Process

Manet's are also called as mobile ad hoc networks. In Manet’s, most of the link breakages are happen frequently because of the nature of the network. This may cause the path failures and route discoveries. The basic feature of the manet is the overhead of a route discovery cannot be neglected. In the discovery of route, broadcasting plays a major role in basic and efficient data distribution techniques, because of manet’s node unseeingly shows the route which is received firstly to request packets when the route has the destination, this may cause the broadcast storm problem (BSP). In this paper, the Ensemble Route Recovery Process (ERRP) for reducing routing overhead in MANETs. Obtaining the routes dynamically for the nodes to transfer the data is done with this ERRP. The improvement of route overhead is more compare with various existing systems. The parameters shown in this system are accuracy and time taken for the data transfer and route discovery.

Improved DCFR protocol for path recovery in mobile ad-hoc networks

The mobile ad-hoc network is the decentralized type of network in which mobile nodes can move from one location to another. Due to random mobility of the mobile nodes route establishment, route maintenance is the major issues of mobile ad-hoc networks. This research paper, focus on the route establishment and route maintenance properties of mobile ad-hoc network. The DCFR protocol is the route establishment and route maintenance protocol in which broker route will be recovered on the basis of node connectivity. The node, which has maximum connectivity, is selected as the best node for route recovery in DCFR Protocol. In this research work, the DCFR protocol is further improved by adding buffer size parameter for route recovery which also maintains quality of service in the network. The proposed DCFR protocol simulation results perform well as compared to existing DCFR protocol in terms of certain parameters

Efficient Maintenance of AODV Routes in the Vehicular Communication Environment with Sparsely Placed Road Side Units

Thanks to the vehicular communication network, vehicles on the road can communicate with other vehicles or nodes in the global Internet. In this study, we propose an enhanced routing mechanism based on AODV so that road side units (RSUs) can provide continuous services such as video streaming services to vehicles which may be intermittently located outside of the coverage areas of RSUs. In the highway environment with sparsely placed RSUs, the communications between RSUs and vehicles are frequently disconnected due to high vehicular speeds. To resolve this problem, both V2I and V2V communications are utilized. In order to reduce the route recovery time and the number of route failures in the sparsely placed RSU environment, backup routes are established through the vehicles with longer direct communication duration with the RSU. The backup route substitutes the main route upon route disconnection. Also, for the efficient handover to the next RSU, the route shortening mechanism is proposed. For the performance evaluation of the proposed mechanism, we carried out the NS-3-based simulations.