A randomized distributed algorithm for total scheduling problem

摘要：

In multihop radio network, total scheduling occurs when stations communicate one-to-one and broadcast simultaneously. In this paper, we prove a global upper bound for total scheduling by a simple construction method; A randomized distributed algorithm is also presented.

作者: Lan Xiao Guiying Yan Wei Ren Xu Li

作者单位: Academy of Mathematics and Systems Science,Chinese Academy of Sciences, Beijing, P.R. China, 100190 Beijing Jiaotong University, Beijing, P.R. China, 100044

会议类型: 国际会议

会议名称: The Seventh International Symposium(ISORA08)(第七届国际效力研究及其应用学术会议)

会议地点: 云南丽江

会议语种:英文

页码: 311-316

在线出版日期: 2008-10-31（万方平台首次上网日期，不代表论文的发表时间）