为了实现超密集网络中的绿色通信,提出一种基于能效最优的资源分配算法。首先,在考虑用户服务质量(quality of service,QoS)需求和干扰容限的情况下,建立最大化网络能效的优化问题。其次,为了降低求解原问题的计算复杂度,采用柯西不等...为了实现超密集网络中的绿色通信,提出一种基于能效最优的资源分配算法。首先,在考虑用户服务质量(quality of service,QoS)需求和干扰容限的情况下,建立最大化网络能效的优化问题。其次,为了降低求解原问题的计算复杂度,采用柯西不等式将原优化问题进行松弛,从而转化为非合作博弈问题。进而,在满足最大最小公平(max-min fairness,MMF)准则的情况下,提出一种分布式能效最优算法(distributed EE maximization algorithm,DEMA)。仿真结果表明,所提算法较传统算法可以更好地兼顾系统的能效和吞吐量性能。展开更多
Efficient broadcasting protocols based on Connected Dominating Set (CDS) are frequently used;hence the entire broadcast domain is restricted to nodes in the CDS. This letter proves that a node must be a CDS node, if i...Efficient broadcasting protocols based on Connected Dominating Set (CDS) are frequently used;hence the entire broadcast domain is restricted to nodes in the CDS. This letter proves that a node must be a CDS node, if its neighbors with larger keys cannot cover it together.Then a simple distributed CDS construction algorithm is proposed, which is more effective than the existing algorithms in reducing the dominating set size and the computation complexity at the same time. Simulation results also confirm this, especially in relatively dense networks.展开更多
文摘为了实现超密集网络中的绿色通信,提出一种基于能效最优的资源分配算法。首先,在考虑用户服务质量(quality of service,QoS)需求和干扰容限的情况下,建立最大化网络能效的优化问题。其次,为了降低求解原问题的计算复杂度,采用柯西不等式将原优化问题进行松弛,从而转化为非合作博弈问题。进而,在满足最大最小公平(max-min fairness,MMF)准则的情况下,提出一种分布式能效最优算法(distributed EE maximization algorithm,DEMA)。仿真结果表明,所提算法较传统算法可以更好地兼顾系统的能效和吞吐量性能。
基金Supported by the National Natural Science Foundation of China (No.60202005).
文摘Efficient broadcasting protocols based on Connected Dominating Set (CDS) are frequently used;hence the entire broadcast domain is restricted to nodes in the CDS. This letter proves that a node must be a CDS node, if its neighbors with larger keys cannot cover it together.Then a simple distributed CDS construction algorithm is proposed, which is more effective than the existing algorithms in reducing the dominating set size and the computation complexity at the same time. Simulation results also confirm this, especially in relatively dense networks.
