期刊文献+

一种能量有效的无线传感器网络轮询接入控制协议 被引量:3

An energy-efficiency polling access control protocol for wireless sensor networks
下载PDF
导出
摘要 周期性休眠的PCF机制虽然较好地解决了无线传感器网络的能耗问题,但没有考虑节点的负载状态,降低了系统性能,也增加了系统的查询能耗.以限定(K=1)服务为基础,提出了一种改进的PCF轮询控制协议,即具有混合服务策略的无线传感器网络轮询接入控制协议PCF-SS.该协议在保障公平性的前提下,能够根据节点状态动态调整优先级并改变服务K值,中心服务器AP则根据各节点的服务K值在每轮服务时对节点的下一轮服务时间进行预估计,并采用统一的服务时间表唤醒节点,达到节能的效果.仿真实验表明系统的平均等待时间、平均排队队长等性能指标比周期性休眠的PCF机制要好,能量的有效利用率更高,具有更长的生命周期,适合作为无线传感器网络的MAC控制协议. Although the energy waste is well controlled on the medium access control(MAC) layer under the periodic sleeping point coordination function(PCF) scheme in wireless sensor networks(WSN),the system performance declined and the system query energy cost increased because the node loads were ignored.Based on the limited service(K=1),an improved PCF polling control protocol,which is known as the point coordination function by the site status(PCF-SS) for WSN,was proposed.The priority of a node was variable by its status and the service K was correspondingly changed using this protocol.Therefore,the service time of the next turn could be assigned dynamically according to its status when the AP server came to service a node.Also,the nodes were awakened by a uniform service time table which was used to save their power.The experimental results indicate that the performances,such as the mean value of queue length and message waiting time,are better than when using the periodic sleeping PCF scheme.The energy usage is more efficient and the lifecycle is longer,making it suitable for the MAC protocol of WSN.
出处 《智能系统学报》 北大核心 2012年第3期265-270,共6页 CAAI Transactions on Intelligent Systems
基金 国家自然科学基金资助项目(61072079) 云南省教育厅科学研究基金资助项目(09y0042)
关键词 无线传感器网络 PCF 能量有效 轮询服务 接入控制 轮询接入控制 wireless sensor networks(WSN) point coordination function(PCF) energy efficiency polling service access control polling access controll
  • 相关文献

参考文献10

二级参考文献92

共引文献47

同被引文献36

  • 1赵东风,李必海,郑苏民.周期查询式限定服务排队系统研究[J].电子科学学刊,1997,19(1):44-49. 被引量:37
  • 2Keshav Demers S, Shenker S. Design and analysis of a fair queuing algorithm. Proceedings of ACM SICCOMM, Austin, September, 1989, 1-12.
  • 3Bennett J C R, Zhang H. WF2Q: Worst-case fair weighted fair queueing. Proceedings of IEEE INFOCOM, San Francisco, CA, March 1996: 120-128.
  • 4Zhang L. Virtual clock: A new traffic control algorithm for packet switching networks. Proceed- ings of ACM SIGCOMM, Philadelphia, September, 1990, 19-29.
  • 5Golestani S J. A self-clocked fair queuing scheme for broadband applications. Proceedings of IEEE INFOCOM'94, Toronto, June, 1994, 636-646.
  • 6Goyal P, Vin H M, Cheng H. Start-time fair queueing; A scheduling algorithm for integrated services packet switched networks. IEEE Transactions on Networking, 1997, 5: 690-704.
  • 7Chaskar Hemant M, Upananyu Madhow. Fair scheduling with tunable latency: A round robin approach. IEEE/ACM Transactions on Networking, 2003, 11(4): 592-601.
  • 8Shreedhar M, George Varghese. Efficient fair queueing Using deficit round-robin. IEEE Transac- tions on Networking, 1996, 4(3): 375-385.
  • 9GUO C. SRR: An O(1) time complexity packet scheduler for flows in multi-service packet net- works. Proceedings of the 2001 SIGCOMM Conference (S0146-4833), 2001, 31(4): 211-222.
  • 10Chen H T, Gao M, Wang W M. Performance research and analysis of ForCES TML based DP- WRR algorithm, 2012 8th International Conference on Computing and Networking Technology (ICCNT), August, 2012, 5-9.

引证文献3

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部