无线移动自组织网络的网络编码容量研究
|
摘要
近年来网络编码容量问题成为理论研究的热点,但现在网络编码容量的研究都假设网络是静止的,极少涉及到节点移动情况下的研究,因此本文主要从节点移动性角度来分析MANET的网络编码容量。
首先,本文研究了在不考虑噪声和干扰时MANET的网络编码容量。本文提出用权重随机几何图模型来模拟MANET,该模型用节点间的距离来判断两个节点是否连通,并通过Chernoff Bound定理来证明了网络编码容量的上下限值。最后在不同移动模型下和网络保持不同连通度情况下对网络编码容量进行了仿真。
然后,本文研究了在考虑噪声和干扰时MANET的网络编码容量。本文采用常用的SINR模型来判断两个节点是否连通,考虑到网络模型的变化,参考了文献[31]里的Coupling Methods得到了网络编码容量的上下限值,最后对不同移动模型下的网络编码容量进行了仿真。
Nowadays, the problem of network coding capacity has become a hot topic. Previous work on network coding capacity of wireless networks has focused on the assumption that the network is stationary. However, in this paper, network coding capacity is studied in dynamic network caused by the node’s mobility.
On the one hand, this paper first studies the network coding capacity of MANET without the consideration of noise and interference. The weighted random geometric model is used to model MANET; we judge the connection of two nodes by the distance between them and verify the concentration feature of network coding capacity with the help of Chernoff Bound Theorem. And then, we have simulated the network coding capacity under the condition of different mobility models and diverse network connectivity degrees.
On the other hand, this paper makes a research on the network coding capacity of MANET with the consideration of noise and interference. Here the most common SINR model is used to judge whether the two nodes are well connected. Considering the fact that the network model is changeable with noise and interference, network coding capacity’s concentration feature can be concluded from the reference [31] using the Coupling Methods. At last, we also apply the Ford-Fulkerson Method to simulate the MANET’s network coding capacity under the condition of different mobility models.
首先,本文研究了在不考虑噪声和干扰时MANET的网络编码容量。本文提出用权重随机几何图模型来模拟MANET,该模型用节点间的距离来判断两个节点是否连通,并通过Chernoff Bound定理来证明了网络编码容量的上下限值。最后在不同移动模型下和网络保持不同连通度情况下对网络编码容量进行了仿真。
然后,本文研究了在考虑噪声和干扰时MANET的网络编码容量。本文采用常用的SINR模型来判断两个节点是否连通,考虑到网络模型的变化,参考了文献[31]里的Coupling Methods得到了网络编码容量的上下限值,最后对不同移动模型下的网络编码容量进行了仿真。
Nowadays, the problem of network coding capacity has become a hot topic. Previous work on network coding capacity of wireless networks has focused on the assumption that the network is stationary. However, in this paper, network coding capacity is studied in dynamic network caused by the node’s mobility.
On the one hand, this paper first studies the network coding capacity of MANET without the consideration of noise and interference. The weighted random geometric model is used to model MANET; we judge the connection of two nodes by the distance between them and verify the concentration feature of network coding capacity with the help of Chernoff Bound Theorem. And then, we have simulated the network coding capacity under the condition of different mobility models and diverse network connectivity degrees.
On the other hand, this paper makes a research on the network coding capacity of MANET with the consideration of noise and interference. Here the most common SINR model is used to judge whether the two nodes are well connected. Considering the fact that the network model is changeable with noise and interference, network coding capacity’s concentration feature can be concluded from the reference [31] using the Coupling Methods. At last, we also apply the Ford-Fulkerson Method to simulate the MANET’s network coding capacity under the condition of different mobility models.
引文
[1] Ram Ramanathan and Jason Radi.“A Brief Overview of Ad Hoc Network: Challenges and Directions.”IEEE Communication Magazine, 50th Anniversary Commemorative Issue. May, 2002. pp. 20-22.
[2] R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung.“Network information flow.”IEEE Transactions on Information Theory. 2000, vol. 46. pp. 1204-1216.
[3] Lee, M. Medard, and K. Z. Haigh et al.“Minimum-Cost Subgraphs for Joint Distributed Source and Network Coding.”Third Workshop on Network Coding Theory and Applications (NetCod). San Diego, California. January 29, 2007.
[4] Christos Gkantsidis, Pablo Rodriguez, and Rodriguez.“Cooperative Security for Network Coding File Distribution.”25th IEEE INFOCOM Conference. 2006. pp. 1749-1761.
[5] S.-Y. R. Li, R. W. Yeung and N. Cai.“Linear network coding.”IEEE Transactions on Information Theory. 2003, vol. 49. pp. 371-381.
[6] P. A. Chou and Y. N Wu.“Network Coding for the Internet and Wireless Networks.”IEEE Signal Processing Magazine. Sept. 2007, vol. 24 (5). pp. 77-85.
[7] S. Katti, D. Katabi, W. Hu, and H. Rahul.“The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments.”In Proc. 43rd Allerton Conference on Communication, Control, and Computing. Monticello, IL. Sep. 2005.
[8] J. Widmer, C. Fragouli, and J. Y. LeBoudec.“Energy-efficient Broadcasting in Wireless Ad Hoc Networks.”NetCod, 2005. pp. 36-40.
[9] C. Fragouli, J. Widmer, and J. Y. LeBoudec.“A Network Coding Approach to Energy Efficient Broadcasting: From Theory to Practice.”Proc. of IEEE INFOCOM 2006. pp. 1-11.
[10] Salah A. Aly, Vishal Kapoor, and Jie Meng.“Bounds on the Network Coding Capacity for Wireless Random Networks,”2007 Information Theory and Applications Workshop. pp. 229-234.
[11] Hongzheng Wang, Pingyi Fan, and Khaled Ben Letaief.“Maximum Flow and Network Capacity of Network Coding for Ad-hoc Networks.”IEEE Trans. on Wireless Communications. vol.6, no. 12, Dec. 2007. pp. 4193-4197.
[12] Aditya Ramamoorthy, Jun Shi, Richard D. Wesel.“On the Capacity of Network Coding for Random Networks.”IEEE Tran. On Information Theory. vol. 51, no. 8, Aug 2005. pp. 2878-2885.
[13] C. Bettstetter, G. Resta, and P. Santi.“The node distribution of the random waypoint mobility model for wireless ad hoc networks.”IEEE Transactions on Mobile Computing. vol. 2, no. 1, 2003. pp. 25–39.
[14] Ali Eslami and Babak H. Khalaj.“Wireless Multicasting Using Network Coding.”WAMICON 2006. pp. 1-8.
[15]李建东,盛敏.“移动自组织网络技术方案论证报告.”西安电子科技大学.2001,11.
[16]田野.“无线Ad Hoc网络拓扑控制技术研究.”西安电子科技大学博士论文.导师:李建东.2008.
[17]杨林,郑刚,胡晓惠.“网络编码的研究进展.”计算机研究与发展.2002.
[18]彭木根,王月新,王文博.“无线自组织网络的编码技术.”中兴通讯技术.2007, 8. 13(4).
[19] C Peng, Q Zhang, M Zhao, et al.“On the Performance Analysis of Network Coded Cooperation in Wireless Networks.”The26th Annual IEEE Conf on Computer Communications (INFO2COM 2007). Anchorage, AK, USA, 2007. pp. 3090-3097.
[20] Douglas B. West.“Introduction to Graph Theory.”Second Edition, China Machine Press, Beijing, 2004.
[21] C. Bettstetter, G. Resta, and P. Santi.“The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks.”IEEE Transactions on Mobile Computing. 2003, vol. 2, no. 1. pp. 25–39.
[22] M. Penrose.“Random Geometric Graphs.”Oxford, U.K.: Oxford Univ.Press, 2003.
[23] Michael McGuire.“Stationary Distributions of Random Walk Mobility Models for Wireless Ad Hoc Networks.”ACM, MobiHoc’05. May 25–27, 2005. pp. 90-98.
[24] Dan Yu and Hui Li.“Influence of Mobility Models on Node Distribution in Ad Hoc Networks.”Proceedings of ICCT 2003. vol. 2, 2003. pp. 985-989.
[25]周恩惠.“无线Ad Hoc网络的连通性研究.”西安电子科技大学硕士论文,导师:盛敏. 2007.
[26] C.Bettstetter.“On the connectivity of Ad Hoc networks.”Computer Journal. July 2004, vol.47, no.4. pp. 432-447.
[27] N. Alon and J. Spencer.“The Probabilistic Methods.”New York: John Wiley. 2000.
[28] J. Proakis.“Digital Communications.”4th ed, MaGray Hill. 2000.
[29] D. Tse and P. Viswanath.“Fundamentals of Wireless Communication.”Cambridge University Press. 2005.
[30] T Rappaport.“Wireless Communications Principles and Practice.”2nd Edition. Prentice Hall. 2001.
[31] Zhenning Kong, Salah A. Aly and Emina Soljanin.“Network Coding Capacity of Random Wireless Networks under a SINR Model.”IEEE Transactions on Information Theory. 2007.
[32] P. Gupta and P. R. Kumar.“The Capacity of Wireless Networks.”IEEE Trans. on Information Theory. Mar.2000, vol. 46, no. 2. pp. 388–404.
[2] R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung.“Network information flow.”IEEE Transactions on Information Theory. 2000, vol. 46. pp. 1204-1216.
[3] Lee, M. Medard, and K. Z. Haigh et al.“Minimum-Cost Subgraphs for Joint Distributed Source and Network Coding.”Third Workshop on Network Coding Theory and Applications (NetCod). San Diego, California. January 29, 2007.
[4] Christos Gkantsidis, Pablo Rodriguez, and Rodriguez.“Cooperative Security for Network Coding File Distribution.”25th IEEE INFOCOM Conference. 2006. pp. 1749-1761.
[5] S.-Y. R. Li, R. W. Yeung and N. Cai.“Linear network coding.”IEEE Transactions on Information Theory. 2003, vol. 49. pp. 371-381.
[6] P. A. Chou and Y. N Wu.“Network Coding for the Internet and Wireless Networks.”IEEE Signal Processing Magazine. Sept. 2007, vol. 24 (5). pp. 77-85.
[7] S. Katti, D. Katabi, W. Hu, and H. Rahul.“The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments.”In Proc. 43rd Allerton Conference on Communication, Control, and Computing. Monticello, IL. Sep. 2005.
[8] J. Widmer, C. Fragouli, and J. Y. LeBoudec.“Energy-efficient Broadcasting in Wireless Ad Hoc Networks.”NetCod, 2005. pp. 36-40.
[9] C. Fragouli, J. Widmer, and J. Y. LeBoudec.“A Network Coding Approach to Energy Efficient Broadcasting: From Theory to Practice.”Proc. of IEEE INFOCOM 2006. pp. 1-11.
[10] Salah A. Aly, Vishal Kapoor, and Jie Meng.“Bounds on the Network Coding Capacity for Wireless Random Networks,”2007 Information Theory and Applications Workshop. pp. 229-234.
[11] Hongzheng Wang, Pingyi Fan, and Khaled Ben Letaief.“Maximum Flow and Network Capacity of Network Coding for Ad-hoc Networks.”IEEE Trans. on Wireless Communications. vol.6, no. 12, Dec. 2007. pp. 4193-4197.
[12] Aditya Ramamoorthy, Jun Shi, Richard D. Wesel.“On the Capacity of Network Coding for Random Networks.”IEEE Tran. On Information Theory. vol. 51, no. 8, Aug 2005. pp. 2878-2885.
[13] C. Bettstetter, G. Resta, and P. Santi.“The node distribution of the random waypoint mobility model for wireless ad hoc networks.”IEEE Transactions on Mobile Computing. vol. 2, no. 1, 2003. pp. 25–39.
[14] Ali Eslami and Babak H. Khalaj.“Wireless Multicasting Using Network Coding.”WAMICON 2006. pp. 1-8.
[15]李建东,盛敏.“移动自组织网络技术方案论证报告.”西安电子科技大学.2001,11.
[16]田野.“无线Ad Hoc网络拓扑控制技术研究.”西安电子科技大学博士论文.导师:李建东.2008.
[17]杨林,郑刚,胡晓惠.“网络编码的研究进展.”计算机研究与发展.2002.
[18]彭木根,王月新,王文博.“无线自组织网络的编码技术.”中兴通讯技术.2007, 8. 13(4).
[19] C Peng, Q Zhang, M Zhao, et al.“On the Performance Analysis of Network Coded Cooperation in Wireless Networks.”The26th Annual IEEE Conf on Computer Communications (INFO2COM 2007). Anchorage, AK, USA, 2007. pp. 3090-3097.
[20] Douglas B. West.“Introduction to Graph Theory.”Second Edition, China Machine Press, Beijing, 2004.
[21] C. Bettstetter, G. Resta, and P. Santi.“The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks.”IEEE Transactions on Mobile Computing. 2003, vol. 2, no. 1. pp. 25–39.
[22] M. Penrose.“Random Geometric Graphs.”Oxford, U.K.: Oxford Univ.Press, 2003.
[23] Michael McGuire.“Stationary Distributions of Random Walk Mobility Models for Wireless Ad Hoc Networks.”ACM, MobiHoc’05. May 25–27, 2005. pp. 90-98.
[24] Dan Yu and Hui Li.“Influence of Mobility Models on Node Distribution in Ad Hoc Networks.”Proceedings of ICCT 2003. vol. 2, 2003. pp. 985-989.
[25]周恩惠.“无线Ad Hoc网络的连通性研究.”西安电子科技大学硕士论文,导师:盛敏. 2007.
[26] C.Bettstetter.“On the connectivity of Ad Hoc networks.”Computer Journal. July 2004, vol.47, no.4. pp. 432-447.
[27] N. Alon and J. Spencer.“The Probabilistic Methods.”New York: John Wiley. 2000.
[28] J. Proakis.“Digital Communications.”4th ed, MaGray Hill. 2000.
[29] D. Tse and P. Viswanath.“Fundamentals of Wireless Communication.”Cambridge University Press. 2005.
[30] T Rappaport.“Wireless Communications Principles and Practice.”2nd Edition. Prentice Hall. 2001.
[31] Zhenning Kong, Salah A. Aly and Emina Soljanin.“Network Coding Capacity of Random Wireless Networks under a SINR Model.”IEEE Transactions on Information Theory. 2007.
[32] P. Gupta and P. R. Kumar.“The Capacity of Wireless Networks.”IEEE Trans. on Information Theory. Mar.2000, vol. 46, no. 2. pp. 388–404.