• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
He Peng, Yan Baoping, Li Zhi, Sun Limin. CM-MAC: A Cluster-Based Multi-Channel MAC Protocol for VANET[J]. Journal of Computer Research and Development, 2014, 51(3): 502-510.
Citation: He Peng, Yan Baoping, Li Zhi, Sun Limin. CM-MAC: A Cluster-Based Multi-Channel MAC Protocol for VANET[J]. Journal of Computer Research and Development, 2014, 51(3): 502-510.

CM-MAC: A Cluster-Based Multi-Channel MAC Protocol for VANET

More Information
  • Published Date: March 14, 2014
  • VANET (vehicular ad hoc network) is a new kind of MANET (mobile ad hoc network) for ITS (intelligent transportation system). With the development of vehicles and mobile ad hoc network technology, VANET has become an emerging field of research, which is envisioned to provide a variety of safety applications (such as collision avoidance and warning systems) that require high reliability and bounded delay and non-safety applications (such as Internet access and electronic commerce) that are throughput sensitive. This paper proposes a stable clustering algorithm according to VANET features. On the basis of this algorithm, according to DSRC (dedicated short range communication) allocation of CCH (control channel) and SCH (service channel), considering the wireless communication interference between vehicles and the QoS requirements for different applications, the paper also proposes a cluster-based multi-channel hybrid MAC protocol. The non-competition based TDMA scheme is taken for intra-cluster communications and the competition based CSMA/CA scheme is taken for inter-cluster communications. The different SCHs are allocated for neighbor clusters. Such a concept is attractive as it can be combined with cluster-based routing strategies. So the overhead introduced by the clustering process is beneficial not only on one layer, but for the whole communication process. Simulation experiments show that the protocol is superior to the current MAC protocol in the delay requirement of safety applications and the throughput of non-safety applications.
  • Related Articles

    [1]Zheng Wenping, Wu Zhikang, Yang Gui. A Novel Algorithm for Identifying Critical Nodes in Networks Based on Local Centrality[J]. Journal of Computer Research and Development, 2019, 56(9): 1872-1880. DOI: 10.7544/issn1000-1239.2019.20180831
    [2]Liu Haolin, Chi Jinlong, Deng Qingyong, Peng Xin, Pei Tingrui. Multi-Objective Evolutionary Sparse Recovery Approach Based on Adaptive Local Search[J]. Journal of Computer Research and Development, 2019, 56(7): 1420-1431. DOI: 10.7544/issn1000-1239.2019.20180557
    [3]Xu Zhengguo, Zheng Hui, He Liang, Yao Jiaqi. Self-Adaptive Clustering Based on Local Density by Descending Search[J]. Journal of Computer Research and Development, 2016, 53(8): 1719-1728. DOI: 10.7544/issn1000-1239.2016.20160136
    [4]Li Guilin, Yang Yuqi, Gao Xing, and Liao Minghong. Personalized Representation and Rank Algorithm for Enterprise Search Engines[J]. Journal of Computer Research and Development, 2014, 51(1): 206-214.
    [5]Li Shaohua, Feng Qilong, Wang Jianxin, and Chen Jianer. Kernelization for Weighted 3-Set Packing Problem[J]. Journal of Computer Research and Development, 2012, 49(8): 17811-786.
    [6]Li Wenjun, Wang Jianxin, and Chen Jianer. An Improved Parameterized Algorithm for Hyperplane-Cover Problem[J]. Journal of Computer Research and Development, 2012, 49(4): 804-811.
    [7]Wang Chuyang, Li Xiaoping, Wang Qian, Yuan Yingchun. A New Local Search Algorithm for No-Wait Fowshops with Setup Time[J]. Journal of Computer Research and Development, 2010, 47(4): 653-662.
    [8]Zhang Peng. Approximation Algorithms for Generalized Multicut in Trees[J]. Journal of Computer Research and Development, 2008, 45(7): 1195-1202.
    [9]Zeng Liping and Huang Wenqi. A New Local Search Algorithm for the Job Shop Scheduling Problem[J]. Journal of Computer Research and Development, 2005, 42(4): 582-587.
    [10]Yang Jinji, Su Kaile. Improvement of Local Research in SAT Problem[J]. Journal of Computer Research and Development, 2005, 42(1): 60-65.

Catalog

    Article views (1223) PDF downloads (912) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return