检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:YANG Wei-dong LI Pan LIU yan ZHU Hong-song
机构地区:[1]College of Information Science and Engineering, Henan University of Technology [2]State Key Laboratory of Information Security, Institute of Information Engineering, the Chinese Academy of Sciences [3]Software and Microelectronics, Peking University
出 处:《The Journal of China Universities of Posts and Telecommunications》2013年第1期11-18,25,共9页中国邮电高校学报(英文版)
基 金: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 vehicular ad-hoc networks. ATSA divides different sets multiple access (TDMA) slot assignment protocol (ATSA) for 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.This paper proposes a novel adaptive time division vehicular ad-hoc networks. ATSA divides different sets multiple access (TDMA) slot assignment protocol (ATSA) for 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.
关 键 词:media access control (MAC) protocol TDMA slot assignment adaptive frame length binary tree
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147