期刊文献+

一种无线多媒体传感器网络分区链路调度算法

Partitioned link scheduling for wireless multimedia sensor networks
下载PDF
导出
摘要 链路干扰是无线多媒体传感器网络实现大容量、实时、可靠传输的主要困难。为提高多跳传输模式下无线网络性能,基于MAC层的调度算法得到了广泛关注。调度算法为每条链路分配合理的传输时槽,降低了冲突和重传次数,能显著提高网络传输性能。但随着网络规模的增大,无论是集中式还是分布式调度算法,都存在调度开销增大和性能降低的问题。针对这一问题,根据节点分布密度和承载网络流量大小,将网络划分为密集区域和稀疏区域。稀疏区域的节点传输冲突较小,直接采用CSMA的协议。密集区域的节点传输冲突大,采用基于队列长度的分布式调度。分区调度能够有效降低网络规模扩大导致的调度算法复杂性增大的问题。仿真实验表明,分区调度算法无论是在队列长度,还是在延时性能上,较传统算法有明显改善。 Link scheduling is one of the main difficulties for large data, real-time and reliable transmission in wire- less multimedia sensor networks. To improve multi-hop transmission performance, MAC layer link scheduling algo- rithms have received extensive attention. These algorithms allocate slots for every data link. They can reduce the number of conflicts and retransmissions. However, as the network size increases, both centralized or distributed scheduling algorithms will encounter performance degradation problem. To overcome this problem, a novel schedul- ing algorithm based on network partition is proposed, which is suit for following 2 situations, in sparse region, the MAC layer switches to a simple 802.11 mode, in intensive region, the MAC layer switches to queue length based scheduling mode. Emulation results show that the proposed algorithm has a better performance in both terms of total queue length and average delay.
出处 《计算机工程与应用》 CSCD 2012年第26期1-4,10,共5页 Computer Engineering and Applications
基金 国家自然科学基金(No.61171154) 国防基础科研项目
关键词 链路调度 分布式算法 媒体访问控制(MAC)协议 无线多媒体传感器网络 link scheduling distributed algorithm Media Access Control (MAC) protocol Wireless MultimediaSensor Networks (WMSN)
  • 相关文献

参考文献11

  • 1Akyildiz I F,Melodia T,Chowdury K R.Wireless multi- media sensor networks: a survey[J].Wireless Communica- tions, IEEE, 2007, 14(6) :32-39.
  • 2Almeida J, Grilo A, Pereira P R.Multimedia data transport for wireless sensor networks[C]//Next Generation Intemet Networks, 2009:1-8.
  • 3Krishnaswamy D.Robust routing and scheduling in wireless mesh networks under dynamic traffic conditions[J].IEEETransactions on Mobile Computing, 2009,8 (12) : 1705-1717.
  • 4Avis D.A survey of heuristics for the weighted matching problem[J].Networks, 1983,13 (4) : 475 -493.
  • 5Preis R.Linear time 1/2-approximation algorithm for max- imum weighted matching in general graphs[C]//Symposium on Theoretical Aspects of Computer Science, 1999.
  • 6Hoepman J H.Simple distributed weighted matchings[Z]. 2004.
  • 7Dimakis A, Walrand J.Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits[J].Advances in Applied Probability, 2006,38 (2) :505-521.
  • 8Joo C, Shroff N B.Local greedy approximation for scheduling in multi-hop wireless networks[J].IEEE Transactions on Mobile Computing, 2011 : 1-14.
  • 9Riga N, Matta I, Bestavros A.DIP: density inference protocol for wireless sensor networks and its application to den- sity-unbiased statistics, BUCS-TR-2004-023[R].Boston: Boston University, 2004.
  • 10Gupta A, Lin X, Srikant R.Low-complexity distributed scheduling algorithms for wireless networks[J].Analysis, 2009, 17(6) : 1846-1859.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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