TY - GEN
T1 - Near-optimal, reliable and self-organizing hierarchical topology in VANET
AU - Yair, Allouche
AU - Segal, Michael
PY - 2011/10/18
Y1 - 2011/10/18
N2 - In this paper we present the Distributed Construct Underlying Topology (D-CUT) algorithm, a self-organized algorithm aim to provide efficient, and reliable hierarchical topology by minimizing the interference between network participants. 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, the awareness of each vehicle to the composition of its own cluster, and the location of its members enables a very intuitive and straightforward scheme for organizing and coordinating the vehicular network to achieve congestion control and efficient medium access performance. We show theoretically provable bounds for the algorithm performance as well as simulation study that supports our results.
AB - In this paper we present the Distributed Construct Underlying Topology (D-CUT) algorithm, a self-organized algorithm aim to provide efficient, and reliable hierarchical topology by minimizing the interference between network participants. 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, the awareness of each vehicle to the composition of its own cluster, and the location of its members enables a very intuitive and straightforward scheme for organizing and coordinating the vehicular network to achieve congestion control and efficient medium access performance. We show theoretically provable bounds for the algorithm performance as well as simulation study that supports our results.
KW - Beacon dissemination
KW - Distributed algorithm
KW - Optimal clustering assignment
KW - Self-organizing topology
UR - http://www.scopus.com/inward/record.url?scp=80054025886&partnerID=8YFLogxK
U2 - https://doi.org/10.1145/2030698.2030712
DO - https://doi.org/10.1145/2030698.2030712
M3 - Conference contribution
SN - 9781450308694
T3 - Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM
SP - 79
EP - 80
BT - MobiCom'11 - Proceedings of the 17th Annual International Conference on Mobile Computing and Networking and Co-Located Workshops - VANET 2011 Workshop, VANET'11
T2 - 17th Annual International Conference on Mobile Computing and Networking, MobiCom'11 and Co-Located Workshops - 8th ACM International Workshop on Vehicular Inter-Networking, VANET'11
Y2 - 19 September 2011 through 23 September 2011
ER -