Mobile Smart Space web 2.0 migration using efficient road network

[Kalyan]

Mobile Smart Space web 2.0 migration using efficient road network

Vehicular networks are highly mobile and frequently disconnected. To address this issue,we adopt the idea of carry and forward, where a moving vehicle carries the packet until a new vehicle moves into its vicinity and forwards the packet. Different from existing carry and forward solutions, we make use of the predicable vehicle mobility, which is limited by the traffic pattern and the road layout.

Based on the existing traffic pattern, a vehicle can find the next road to forward the packet to reduce the delay. We propose several vehicle-assisted data delivery (VADD) protocols to forward the packet to the best road with the lowest data delivery delay. Experimental results are used to evaluate the proposed solutions.

Results show that the proposed VADD protocols outperform existing solutions in terms of packet delivery ratio, data packet delay and protocol overhead.

Among the proposed VADD protocols, the Hybrid Probe (HVADD) Protocol has much better performance. Over recent years, mobile Internet devices such as laptops, PDAs, smart phones etc, have become extremely popular and widespread. Once on board of a vehicle, these devices can automatically connect to the vehicle processor and thus greatly amplify the communications and processing capabilities available to the owner in a "pedestrian mode."

General Segment Connection Algorithm The general segment connection algorithm GSC captures the overall approach to road network modification. The idea is to iterate through all segments in the road network to be modified according to some specified ordering. During each iteration, the algorithm thus orders all available segments and then tries to extend the topmost, or current, segment with other segments.

To do this, the algorithm identifies all existing segments that start or end at the start or end of the current segment and extends the current segment with the most attractive such segment(s) according to some other specified ordering.

A current segment that has been extended is considered in the next iteration, but the segment(s) that were used for the extension are disregarded.

A current segment that has not been extended becomes part of the result and is not considered any further.