局部多色算法:在常数时间内计算近似最优TDMA调度
Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time
摘要:
所描述的多色问题在无线自组织和传感器网络的上下文中有直接的应用。为了协调对共享无线介质的访问,这种网络的节点需要采用某种介质访问控制(MAC)协议。典型的MAC协议通过时间(TDMA)、频率(FDMA)或码分多址(CDMA)方案来控制对共享信道的接入。许多信道接入方案向网络的节点分配固定的时隙、频率或(正交)码集合,使得彼此干扰的节点接收不相交的时隙、频率或码集合。因此,找到时隙、频率或码的有效分配直接对应于计算图$G$的多色。在ad hoc和传感器网络中,带宽、能量和计算资源的稀缺性,以及这些网络的经常高度动态的性质,要求可以基于尽可能少和尽可能本地的信息来计算多色。
英文摘要:
The described multicoloring problem has direct applications in the context of wireless ad hoc and sensor networks. In order to coordinate the access to the shared wireless medium, the nodes of such a network need to employ some medium access control (MAC) protocol. Typical MAC protocols control the access to the shared channel by time (TDMA), frequency (FDMA), or code division multiple access (CDMA) schemes. Many channel access schemes assign a fixed set of time slots, frequencies, or (orthogonal) codes to the nodes of a network such that nodes that interfere with each other receive disjoint sets of time slots, frequencies, or code sets. Finding a valid assignment of time slots, frequencies, or codes hence directly corresponds to computing a multicoloring of a graph $G$. The scarcity of bandwidth, energy, and computing resources in ad hoc and sensor networks, as well as the often highly dynamic nature of these networks require that the multicoloring can be computed based on as little and as local information as possible.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。