工业无线层次传感器网络的动态TDMA算法(英文)

• 作 者: 杨彦红 张晓彤 罗琼 李文超
• 机 构: School of Computer and Communication Engineering, University of Science and Technology Beijing,Depar
• 出 处: 中国通信
• 发表日期: 2013年05期
• 关键词: 传感器网络 assignment throughput networking utilized router hierarchical topology sch

Industrial wireless sensor networks adopt a hierarchical structure with large numbers of sensors and routers. Time Division Multiple Access (TDMA) is regarded as an efficient method to reduce the probability of confliction. In the intra-cluster part, the random color selection method is effective in reducing the retry times in an application. In the inter-cluster part, a quick assign algorithm and a dynamic maximum link algorithm are proposed to meet the quick networking or minimum frame size requirements. In the simulation, the dynamic maximum link algorithm produces higher reductions in the frame length than the quick assign algorithm. When the number of routers is 140, the total number of time slots is reduced by 25%. However, the first algorithm needs more control messages, and the average difference in the number of control messages is 3 410. Consequently, the dynamic maximum link algorithm is utilized for adjusting the link schedule to the minimum delay with a relatively high throughput rate, and the quick assign algorithm is utilized for speeding up the networking process.

Industrial wireless sensor networks adopt a hierarchical structure with large numbers of sensors and routers. Time Division Multiple Access (TDMA) is deemed as an efficient method to reduce the probability of conflicting. In the intra-cluster part, the random color selection method is effective in reducing the retry times in an application. In the inter-cluster part, a quick assign algorithm and a dynamic maximum link algorithm are proposed to meet the quick networking or minimum frame size requirements. In the simulation, the dynamic maximum link algorithm produces higher reductions in the frame length than the quick assign algorithm. When the number of routers is 140, the total number of time slots is reduced by 25%. However, the first algorithm needs more control messages, and the average difference in the number of control messages is 3 410. programmed, the dynamic maximum link algorithm is utilized for adjusting the link schedule to the minimum delay with a relatively high thr oughput rate, and the quick assign algorithm is utilized for speeding up the networking process.