摘要
图染色问题一直是图论中十分活跃的研究课题,目前已经有着深刻而丰富理论结果,但是在实际中还没得到广泛的应用。无线传感网络(wireless sensor networks)由于它易于部署、成本低廉、自组织自适应等优点,近年来一直是国内外研究的热点之一。该文将基于图染色问题中的加权图染色,设计出新型无线传感网络的调度算法。建立起无线传感网络的结构特性与图染色之间的联系,从而使用新型的广播调度算法确定出帧中最少时序数和最优息道利用率。
Graph coloring problem has been a very active topic in graph theory.Nowadays,there have been many deeply theoretical results,but it has not been used in practice widely.Wireless sensor network(WSN),because of the advantages of easy-to-deploy、low cost、selforganizing and self-adapting it has been one of the researching hotspots of domestic and foreign int recent years.This article will design a new scheduling algorithm in wireless sensor network based on the weighted graph coloring problem of graph coloring.Establish the link between the structural characteristics of the wireless sensor network and graph coloring.Using new broadcast scheduling algorithm to determine the shortest activation time and the best utilization of channel.
出处
《电脑知识与技术（过刊）》
2010年第29期8339-8340,8342,共3页
Computer Knowledge and Technology
关键词
图染色
无线传感网络
加权图染色
时分复用
广播调度
graph coloring
wireless sensor network
weighted graph coloring
TDM
broadcast scheduling
