Knowing vehicles location HELPS avoiding broadcast packets storm

This paper proposes HELP, a simple and distributed broadcast algorithm for warning delivery services in inter-vehicular ad hoc networks. Assuming that neighborhood location information is available from the routing layer, each node determines whether to re-broadcast the message based on i) the coverage zone of the received message and ii) the estimated position of its neighbors. Investigations are led using a popular microscopic traffic model, in order to ensure realism of the networking performance evaluation. Results show that the algorithm efficiently limits the number of broadcasted messages, which is very close to the optimal. Furthermore, robustness of the results in terms of the number of informed vehicles can also be achieved, provided that a safety error margin is considered in the position estimate

[1]  Werner Brilon,et al.  Evaluation of Cellular Automata for Traffic Flow Simulation on Freeway and Urban Streets , 1999 .

[2]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[3]  Tracy Camp,et al.  Comparison of broadcasting techniques for mobile ad hoc networks , 2002, MobiHoc '02.

[4]  Azim Eskandarian,et al.  Challenges of intervehicle ad hoc networks , 2004, IEEE Transactions on Intelligent Transportation Systems.

[5]  A. Schadschneider,et al.  Single-vehicle data of highway traffic: a statistical analysis. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[6]  Imrich Chlamtac,et al.  Geographic messaging in wireless ad hoc networks , 1999, 1999 IEEE 49th Vehicular Technology Conference (Cat. No.99CH36363).

[7]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[8]  B. Kerner Experimental features of the emergence of moving jams in free traffic flow , 2000 .

[9]  Michael Schreckenberg,et al.  A cellular automaton model for freeway traffic , 1992 .