Acta Metallurgica Sinica(English letters) ›› 2013, Vol. 20 ›› Issue (1): 11-18.doi: 10.1016/S1005-8885(13)60002-3

• Networks • Previous Articles     Next Articles

Adaptive TDMA slot assignment protocol for vehicular ad-hoc networks


  1. 1. College of Information Science and Engineering, Henan University of Technology, Zhengzhou 450001, China 2. Software and Microelectronics, Peking University, Beijing 102600, China 3. State Key Laboratory of Information Security, Institute of Information Engineering, the Chinese Academy of Sciences, Beijing 100093, China
  • Received:2012-08-04 Revised:2012-09-21 Online:2013-02-28 Published:2013-02-28
  • Contact: Pan LI
  • Supported by:

    This work was supported by the National Natural Science Foundation of China (61202099, 61073180), the National Science and Technology Major Project (2010ZX03006-004), the Science and Technology Project of Henan province (102102210026), Ph.D. Programs Foundation of Henan University of Technology (2009BS021).


This paper proposes a novel adaptive time division multiple access (TDMA) slot assignment protocol (ATSA) for vehicular ad-hoc networks. ATSA divides different sets of time slots according to vehicles moving in opposite directions. When a node accesses the networks, it choices a frame length and competes a slot based on its direction and location to communication with the other nodes. Based on the binary tree algorithm, the frame length is dynamically doubled or shortened, and the ratio of two slot sets is adjusted to decrease the probability of transmission collisions. The theoretical analysis proves ATSA protocol can reduce the time delay at least 20% than the media access control protocol for vehicular ad-hoc networks (VeMAC) and 30% than the ad-hoc. The simulation experiment shows that ATSA has a good scalability and the collisions would be reduced about 50% than VeMAC, channel utilization is significantly improved than several existing protocols.

Key words:

media access control (MAC) protocol, TDMA, slot assignment, adaptive frame length, binary tree