Landmark routing in ad hoc networks with mobile backbones
Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Fair sharing of bandwidth in VANETs
Proceedings of the 2nd ACM international workshop on Vehicular ad hoc networks
Emergency Broadcast Protocol for Inter-Vehicle Communications
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Efficient secure aggregation in VANETs
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Analysis of multi-hop emergency message propagation in vehicular ad hoc networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless access in vehicular environments
Route lifetime based optimal hop selection in VANETs on highway: an analytical viewpoint
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
A survey of clustering schemes for mobile ad hoc networks
IEEE Communications Surveys & Tutorials
A cluster based beaconing process for VANET
Proceeding of the tenth ACM international workshop on Vehicular inter-networking, systems, and applications
| Hi-index | 0.00 |
In this paper we will show a self-organizing hierarchical topology that can serve as infrastructure for efficient and reliable safety related communication aiming to minimize the interference between network participants. We will show how reliability, fairness, and efficiency can be achieved in our presented D-CUT algorithm. Our solution addresses these challenges in a local, distributed manner by exploiting the vehicle proximity map, needed from a safety point of view, as the building block for constructing the hierarchical topology. The D-CUT algorithm produces a geographically optimized clustering of the network, by grouping dense and consecutive nodes into clusters which are separated by maximally possible gaps. This type of clustering allows strong connections between cluster members and reduces the inter cluster interference. In addition, we present the primitives for interference aware communication system design, based on the awareness of vehicles to their surrounding vehicle proximity map partitioned into geographically optimized clusters. We present theoretically provable bounds demonstrating the ability of the algorithm to deal with dynamic nature of the VANET environment supported by simulation results.