D<I>k</I>-hop: 一个有向<I>k</I>跳无线干扰模型

徐朝农; 黄长喜; 胡存钢; 刘勇

doi:10.3724/SP.J.1004.2012.01042

Dk-hop: 一个有向k跳无线干扰模型

doi: 10.3724/SP.J.1004.2012.01042

1.
中国石油大学(北京) 北京 102249;
2.
中国科学院计算机系统结构重点实验室北京 100190;
3.
合肥工业大学合肥 230009;
4.
海军装备研究院北京 100161

详细信息

通讯作者:
徐朝农,博士,中国石油大学(北京)计算机系讲师.主要研究方向为无线网络,嵌入式系统和分布式计算.

计量
- 文章访问数: 1831
- HTML全文浏览量: 89
- PDF下载量: 773
- 被引次数: 0
出版历程
- 收稿日期: 2010-12-21
- 修回日期: 2012-02-24
- 刊出日期: 2012-06-20

Dk-hop: A Directed k-hop Wireless Interference Model

1.
China University of Petroleum (Beijing), Beijing 102249;
2.
State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190;
3.
Hefei University of Technology, Hefei 230009;
4.
Naval Academy of Armament, Beijing 100161

摘要

摘要: 无线链路调度算法的性能直接受无线干扰模型准确性的影响. 尽管由于其简单性而被广泛采用, k跳干扰模型并不能准确建模真实的无线干扰特性, 从而导致链路调度算法的理论性能与实际性能之间存在很大差异. 本文考虑无线传输方向性因素对干扰的影响, 提出了Dk-hop无线干扰模型. 该模型有效排除了k跳隐藏链路, 从而更准确地对无线干扰进行了建模.理论分析表明, 当k值不超过IR+1时(IR为载波感知距离和传输距离之比), Dk-hop比k跳干扰模型更为准确, 且仍然保持了k跳干扰模型的简单性. 为与真实的无线干扰保持接近, k的合理取值范围应为[IR-2, IR+1].
- 无线干扰 /
- 链路调度 /
- 干扰模型 /
- 隐藏终端 /
- 暴露终端
Abstract: The performance of link scheduling algorithm is greatly influenced by the accuracy of wireless interference model. Despite its simplicity and popularity, the k-hop interference model can not model real interference accurately, which results in the great gap between theoretic and realistic performances of the link scheduling algorithm. Motivated by the fact that wireless interference has great relationship with transmission direction, this paper proposes the Dk-hop interference model. Excluding the k-hop hidden link, Dk-hop excludes the k-hop hidden link and is more realistic than the k-hop interference model, with its simplicity still being kept. Theoretical analysis reveals that Dk-hop is closer to reality than the k-hop interference model if k is no greater than IR+1, where IR is the ratio of carrier sensing range to transmission range. Furthermore, to keep close with the realistic wireless interference, valid range of the value of k for Dk-hop is deduced as [IR-2, IR+1].
- Wireless interference /
- link scheduling /
- interference model /
- hidden terminal /
- exposed terminal

HTML全文

参考文献(1)

[1]

Xu C N, Xu Y J, Wang Z G, Luo H Y. A topology-transparent MAC scheduling algorithm with guaranteed QoS for multihop wireless network. Journal of Control Theory and Applications, 2011, 9(1): 106-114[2] Fu L Q, Soung C L, Huang J W. Fast algorithms for joint power control and scheduling in wireless networks. IEEE Transactions on Wireless Communication, 2010, 9(3): 1186-1197[3] Qian L P, Zhang Y J. S-MAPEL: monotonic optimization for non-convex joint power control and scheduling problems. IEEE Transactions on Wireless Communications, 2010, 9(5): 1708-1719[4] Kong S L, Zhang H S, Zhang Z S, Zhang C H. Joint predictive control of power and rate for wireless networks. Acta Automatica Sinica, 2007, 33(7): 761-764[5] Wan P J, Frieder O, Jia X H, Yao F, Xu X H, Tang S J. Wireless link scheduling under physical interference model. In: Proceedings of the 30th IEEE International Conference on Computer Communications. Shanghai, China: IEEE, 2011. 838-845[6] Fabio M. Multi-channel power-controlled directional MAC for wireless mesh networks. Wireless Communications and Mobile Computing, 2011, 11(1): 90-107[7] Joo C, Lin X J, Shroff N B. Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks. IEEE/ACM Transactions on Networking, 2009, 17(4): 1132-1145[8] Sharma G, Mazumdar R R, Shroff N B. On the complexity of scheduling in wireless networks. In: Proceedings of the 12th International Conference on Mobile Computing and Networking. Los Angeles, USA: ACM, 2006. 227-238[9] Gu Lian-Hua, Chen Liang-Lun, Zhu Quan-Min. Aμ -MAC: an adaptive MAC protocol for wireless sensor networks. Acta Automatica Sinica, 2010, 36(1): 54-59(古连华, 程良伦, Zhu Quan-Min. Aμ -MAC: 一种自适应的无线传感器网络MAC协议. 自动化学报, 2010, 36(1): 54-59)[10] Tassiulas L, Ephremides A. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 1992, 37(12): 1936-1949[11] Joo C, Shroff N B. Local greedy approximation for scheduling in multihop wireless networks. IEEE Transactions on Mobile Computing, 2012, 11(3): 414-426[12] Yang L, Guan X P, Long C N, Luo X Y. Analysis and design of wireless networked control system utilizing adaptive coded modulation. Acta Automatica Sinica, 2009, 35(7): 911-918[13] Miao J F, Chen W, Sun Y R, Liu J Y. Adaptively robust phase lock loop for low C/N carrier tracking in a GPS software receiver. Acta Automatica Sinica, 2011, 37(1): 52-60[14] Ni J, Tan B, Srikant R. Q-CSMA: queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks. In: Proceedings of the 29th IEEE International Conference on Computer Communications. San Diego, USA: IEEE, 2010. 1-12[15] Grnkvist J, Hansson A. Comparison between graph-based and interference-based STDMA scheduling. In: Proceedings of the 2001 ACM Symposium on Mobile Ad Hoc Networking and Computing. Long Beach, USA: ACM, 2001. 255-258[16] Iyer A, Rosenberg C, Karnik A. What is the right model for wireless channel interference? IEEE Transactions on Wireless Communications, 2009, 8(5): 2662-2671[17] Rajeswaran A, Negi R. PHY-graph model for ad hoc wireless MAC. In: Proceedings of the 64th IEEE Vehicular Technology Conference. Montreal, Canada: IEEE, 2006. 1-5[18] Gandham S, Dawande M, Prakash R. Link scheduling in sensor networks: distributed edge coloring revisited. In: Proceedings of the 24th IEEE International Conference on Computer Communications. Miami, USA: IEEE, 2005. 2492-2501[19] Jain K, Padhye J, Padmanabhan V N, Qiu L L. Impact of interference on multi-hop wireless network performance. In: Proceedings of the 9th International Conference on Mobile Computing and Networking. San Diego, USA: ACM, 2003. 66-80[20] Wang W Z, Wang Y, Li X Y, Song W Z. Efficient interference-aware TDMA link scheduling for static wireless networks. In: Proceedings of the 12th International Conference on Mobile Computing and Networking. Los Angeles, USA, 2006. 262-273[21] Balakrishnan H, Barrett C L, Kumar V S A, Marathe M V, Thite S. The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks. IEEE Journal of Selected Areas in Communications, 2004, 22(6): 1069-1078[22] Yi Y, Chiang M. Wireless scheduling algorithms with O(1) overhead for M-hop interference model. In: Proceedings of the 2008 International Conference on Communications. Beijing, China: IEEE, 2008. 3105-3109[23] Behzad A, Rubin I. On the performance of graph-based scheduling algorithms for packet radio networks. In: Proceedings of the 2003 Global Telecommunications Conference. San Francisco, USA: IEEE, 2003. 3432-3436[24] Modiano E, Shah D, Zussman G. Maximizing throughput in wireless networks via gossiping. ACM Sigmetrics Performance Evaluation Review, 2006, 34(1): 27-38[25] Tan C W, Chiang M, Srikant R. Maximizing sum rate and minimizing MSE on multiuser downlink: optimality, fast algorithms and equivalence via max-min SINR. IEEE Transactions on Signal Processing, 2011, 59(12): 6127-6143

施引文献

资源附件(0)

访问统计