欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
公平性问题是拥塞控制中的重要级问题，目的是确保所有数据源共享同等的端到端网络带宽．为了适应传感器网络的特点，扩展了传统公平性的定义，提出了一种基于信息量的公平性定义，并基于该定义提出了一套公平性控制模型CFRC．与现有工作不同，CFRC不需要预先确定数据源，对路由结构没有限制，节点上也不需要维护任何数据流信息和全局状态信息，而是动态地实现公平性控制．CFRC使用一种基于感知面积的信息量计算算法，每个节点只需简单的本地计算而无需复杂的计算开销．在带宽分配上，提出了一种干扰源感知的带宽分配方法，以拥塞节点为中心找到所有干扰源，根据干扰源的信息量来分配信道带宽，充分实现公平性目标．模拟结果表明，CFRC能根据各数据源产生报文的信息量进行公平性控制，降低丢弃报文数目。
英文摘要：
Fairness is an important problem in congestion control, which is to ensure that all data sources have equal access to end-to-end network bandwidth. In wireless sensor network, nodes are always deployed randomly and redundantly, the effective amount of sensed information of different sensors may be different. In order to fit the characteristic of wireless sensor networks, the Ttraditional fairness definition is extended and a practical fairness control model CFRC is proposed. CFRC does not need knowledge of source distribution at prior, nor make restrictive assumptions on the routing structure, nor maintain any state information, instead, CFRC guarantees the fairness dynamically. In CFRC, a low-cost credit computation algorithm is proposed for each source node to compute its credit locally based on the sensed area of itself and its neighbors; Aggregation node computes the credit of aggregated packets using simple sum operation. Furthermore, an interferer aware fair rate allocation method is proposed in CFRC to allocate bandwidth among not only all upstream neighbors, but also congested node and its interferers based on the average credit. Simulation results show that CFRC can achieve fairness based on the credit of data sources, reduce the number of dropped packets and downgrade the reliability fairly and gracefully when congestion happens.
同期刊论文项目
同项目期刊论文
位置：