无线传感器网络公平性算法的分析  

Analysis of fairness-based algorithm in wireless sensor networks

作　　者：李庚[1] 范菁[1] 王万升[1] 向昌松 

机构地区：[1]云南民族大学云南省高校无线传感器网络重点实验室,云南昆明650500

出　　处：《云南民族大学学报（自然科学版）》2014年第6期400-403,428,共5页Journal of Yunnan Minzu University:Natural Sciences Edition

基　　金：国家自然科学基金(61163061;60963026);云南省应用基础研究计划项目(2011FZ174)

摘　　要：为了保证无线传感器网络具有较好的公平性,同时拥有较高的吞吐量,提出了一种基于公平性的多数据包发送调度算法.在该算法中,数据包是按照信源识别的方式来存放的.距离网关一跳范围外的节点,采用改进的最大最小公平性调度算法;距离网关一跳范围以内的节点,每次成功竞争信道后,若节点内各个堆栈都有数据包,则节点一次发送多个数据包,每个堆栈都发送一个.否则,节点等待空闲一段时间.通过对比仿真实验,网络具有较好的公平性以及较高的吞吐量.In order to guarantee good fairness and high throughput in wireless sensor networks, this research gives an analysis of the existing fairness scheduling algorithm and proposes a multiple packet - scheduling algorithm based on fairness. The node is within one hop to Gateway, after every successful getting the channel in the compe- tition with other nodes, each stack in the node has a packet, and the node will send multiple packets. Otherwise, the node will be waiting for a period of time. Through a simulationexperiment, the network has good fairness and high throughput.

关 键 词：无线传感器网络 调度算法 公平性 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]