GloMoSim: a library for parallel simulation of large-scale wireless networks
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Flooding for reliable multicast in multi-hop ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Multicast tree construction and flooding in wireless ad hoc networks
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Urban multi-hop broadcast protocol for inter-vehicle communication systems
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Scalable location services for hierarchically organized mobile ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Emergency Broadcast Protocol for Inter-Vehicle Communications
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
A connectionless approach to mobile ad hoc networks
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
A novel broadcast technique for high-density ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
On Reducing Communication Cost for Distributed Moving Query Monitoring Systems
MDM '08 Proceedings of the The Ninth International Conference on Mobile Data Management
| Hi-index | 0.00 |
A vehicular network is a promising application of mobile ad hoc networks. In this paper, we introduce a near-optimal broadcast technique, called CB-S (Cell Broadcastfor Streets), for vehicular networks. In this environment, the road network is fragmented into cells such that nodes in a cell can communicate with any node within a two cell distance. Each mobile node is equipped with a GPS (Global Positioning System) unit and a map of the cells. The cell map has information about the cells including their identifier and the coordinates of the upper-right and lower-left corner of each cell. CB-S has the following desirable property. Broadcast of a message is performed by rebroadcasting the message from every other cell in the terrain. This characteristic allows CB-S to achieve near optimal performance. Our simulation results indicate that data can always reach all nodes in the wireless network. This perfect coverage is achieved with minimal overhead. That is, CB-S uses a near optimal (minimum) number of nodes to disseminate the data packets. This optimality gives it the advantage of minimum delay. To show these benefits, we give simulations results to compare CB-S with four other broadcast techniques. In practice, CB-S can be used for information dissemination, or to reduce the high cost of destination discovery in routing protocols. We also present in this paper a CB-SD (Cell Broadcast for Street Dissemination) variant that has all the advantages of CB-S, with the additional benefit of supporting partial broadcast. This scheme is more efficient when broadcast to a subset of the nodes is desirable.