Horst F. Wedde, Sebastian Lehnhoff, Bernhard van Bonn, Z. Bay, S. Becker, S. Boettcher, C. Brunner, A. Buescher, T. Fuerst, A. M. Lazarescu, E. Rotaru, S. Senge, B. Steinbach, F. Yilmaz und T. Zimmermann
Highly Dynamic and Scalable VANET Routing for Avoiding Traffic Congestions
VANET 2007 - Proceedings of the 4th ACM International Workshop on Vehicular Ad Hoc Networks, ACM Press, Montreal, Canada, 2007-09
Traffic congestions have become a major problem in metropolitan areas world-wide, within and between cities, in particular due to the highly dynamic character of congestion building and dissolving. Our earlier work on the novel multi-agent BeeHive routing algorithms [1,2,3] derived from the honey bee behavior exhibits high adaptability and flexibility, high throughput and fault tolerance at a so far unsurpassed degree. Part of the algorithm is concerned with dynamically updating the quality weights of the communication links which at the key feature for the probabilistic routing decisions. We integrated these algorithms into a distributed traffic control model where vehicles are directed under decentralized control at each road intersection. The result is the BeeJamA system.