检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]Institute of Computing Technology,Chinese Academy of Sciences
出 处:《China Communications》2011年第1期43-49,共7页中国通信(英文版)
基 金:supported by the National Basic Research Program of China(No.2011CB302702);the NationalNatural Science Foundation of China(Nos.60803140,60970133,61070187)
摘 要:In the Internet of things, it is of critical importance to fully utilize the potential capacity of the network with efficient medium access control (MAC) mechanisms. In this paper, we study the convergence property of the fixed point formulation of distributed coordination function (DCF), which is widely used for medium access control in wireless networks. We first Kind that the fixed point could be repelling, which means that it is impossible for an MAC system to converge at its fixed point. Next, we show the existence of periodic points to prove that the fixed point function will oscillate between two periodic points when the fixed point is repelling. We also find that the average of the two periodic points is a close approximation of the fixed point. Based on the findings, we propose an algorithm to compute the fixed point efficiently. Simulation results verify the accuracy and efficiency of our algorithm compared with the previous fixed point computing method.In the Internet of things, it is of critical importance to fully utilize the potential capacity of the network with efficient medium access control (MAC) mechanisms. In this paper, we study the convergence property of the fixed point formulation of distributed coordination function (DCF), which is widely used for medium access control in wireless networks. We first find that the fixed point could be repelling, which means that it is impossible for an MAC system to converge at its fixed point. Next, we show the existence of periodic points to prove that the fixed point function will oscillate between two periodic points when the fixed point is repelling. We also find that the average of the two periodic points is a close approximation of the fixed point. Based on the findings, we propose an algorithm to compute the fixed point efficiently. Simulation results verify the accuracy and efficiency of our algorithm compared with the previous fixed point computing method.
关 键 词:resource allocation in wireless networks DCF fixed point formulation convergence property
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.169