Journal ArticleDOI
IntersectionCast: approximation algorithm for multi-directional broadcast storm in VANETs
Debasis Das,Rajiv Misra +1 more
Reads0
Chats0
TLDR
A mechanism for partitioning the graph of vehicles in an intersection into multiple bipartite directional sub-graphs, such that each sub- graph aggregates messages using short range communication and make one long range communication of aggregated message is proposed.Abstract:
We formulate a multi-directional broadcast (MDB) storm problem arising in dense vehicular ad-hoc networks (VANETs) when the multiple nodes (moving in multiple directions) forward broadcast packets meet at the road intersections, resulting in severe packet collisions inducing delays at medium access control. In this work, we have proposed a mechanism for partitioning the graph of vehicles in an intersection into multiple bipartite directional sub-graphs, such that each sub-graph aggregates messages using short range communication and make one long range communication of aggregated message. The k balanced graph partitioning problem contains partitions of size ≤ |V|/k nodes. For a graph G = (V, E), a partitioning P, is (k, 1 + e) balanced if V is partitioned into k disjoint subsets each containing at most (1 + e)n/k vertices. Our proposed approximation algorithm for intersection-cast problem uses a balanced partition with Θ (log^2 n) approximation for balance constant, v > 1. We have given simulation results for the performance analysis of our intersection-cast protocol compared to the existing competitive schemes and found improvement in terms of broadcast success rate, reachability and message overhead in the networks.read more
Citations
More filters
Journal ArticleDOI
A survey on security attacks in VANETs: Communication, applications and challenges
TL;DR: An extensive overview of the ITS and the evolution of ITS to VANets is provided, the details of VANETs are provided, and the privacy and security attacks in VANets with their applications and challenges are discussed.
Journal ArticleDOI
Service-based network selection in C-ITS vehicular networks
TL;DR: This work presents the SISS algorithm and compares its performance with the widely used TOPSIS algorithm to decide which network option is the best for each application, taking the service requirements into account.
References
More filters
Proceedings ArticleDOI
Co-clustering documents and words using bipartite spectral graph partitioning
TL;DR: A new spectral co-clustering algorithm is used that uses the second left and right singular vectors of an appropriately scaled word-document matrix to yield good bipartitionings and it can be shown that the singular vectors solve a real relaxation to the NP-complete graph bipartitionsing problem.
Journal ArticleDOI
Routing in vehicular ad hoc networks: A survey
TL;DR: The research challenge of routing in VANETs is discussed and recent routing protocols and related mobility models for VANets are surveyed.
Journal ArticleDOI
Broadcast storm mitigation techniques in vehicular ad hoc networks
TL;DR: Simulation results show that the proposed schemes can significantly reduce contention at the MAC layer by achieving up to 70 percent reduction in packet loss rate while keeping end-to-end delay at acceptable levels for most VANET applications.
Proceedings ArticleDOI
Urban multi-hop broadcast protocol for inter-vehicle communication systems
TL;DR: A new efficient IEEE 802.11 based multi-hop broadcast protocol (UMB) which is designed to address the broadcast storm, hidden node, and reliability problems of multi-Hop broadcast in urban areas.
Journal ArticleDOI
Balanced Graph Partitioning
Konstantin Andreev,Harald Räcke +1 more
TL;DR: A bicriteria approximation algorithm that for any constant ν > 1 runs in polynomial time and guarantees an approximation ratio of O(log1.5n) (for a precise statement of the main result see Theorem 6).
Related Papers (5)
A dominating set model for broadcast in all-port wormhole-routed 2D mesh networks
Yih-jia Tsai,Philip K. McKinley +1 more