无线多媒体传感器网络最优化资源分配与传输技术研究
|
摘要
无线多媒体传感器网络集成了传感器技术、多媒体信息技术、无线通信技术和分布式信息处理技术等，是一种新兴的网络技术。与传统的传感器网络相比，无线多媒体传感器网络能提供信息量丰富、全面的服务。在敌对和恶劣的网络应用环境中，如战场的生存性应用、恶劣环境的监测应用、安全相关的应用以及灾难管理等，无线多媒体传感器网络都显示了巨大的应用价值。本论文重点对无线多媒体传感器网络的生命周期、网络效用最大化（NUM）、联合机会网络编码的机会路由协议等网络性能优化问题进行了深入探讨和研究。
针对网络生存周期最大化问题，系统地建立了包括视频压缩编码、视频接收与发送，以及网络传输差错控制的传感器节点功率消耗数学模型。在此基础上，提出了联合传感器节点功率分配、流量控制和视频质量失真的无线传感器网络生命周期凸优化模型，采用拉格朗日对偶理论和次梯度算法，实现了信源速率、链路速率、视频编码功率联合优化的分布式网络生存期优化求解算法，并通过仿真实验验证了该算法的有效性。
传统的FEC差错编码需要采用多个编码/解码结构来应对无线信道实时变化，这种方式在实际应用中复杂性和成本过高。本文提出了一种混合随机网络编码和自动请求重传（ARQ）技术的差错控制机制，根据ACK和NACK所反馈的当前信道状态，自适应地调整网络编码数据包的发送个数，以提高无线网络的传输鲁棒性。仿真实验结果表明在传输效率、功率消耗和传输时延方面较传统ARQ和FEC编码方式均有所提高。
为了同时提高网络的吞吐量和传输可靠性，本文提出了基于网络编码的机会路由方式，该方式引入拥塞代价指标来衡量无线网络链路质量，以最小拥塞代价作为路由转发节点的选择度量。考虑到组播间网络编码并非都能带来网络吞吐量的提升，提出了基于吞吐量增益的组间网络编码决策机制。网络中继节点通过比较存储转发获得的传输增益和进行组播间网络编码获得的传输增益的大小，判断是否需要进行组播间网络编码。
最后，本文提出了一种联合机会网络编码的机会路由算法，改进了之前研究的基于网络编码路由协议，定义网络编码带来的编码增益为路由选择的准则，通过增加网络编码的可能，进一步提高网络的吞吐量。对资源有限的无线多媒体传感器网络来说，尽可能充分利用有限资源传输最大信息量。仿真结果同样也显示了主动进行网络编码带来的网络吞吐量增加。
Wireless Multimedia Sensor Network (WMSN) is a special kind of wireless sensornetwork, which is integrated with sensor technology, multimedia information techniques,wireless communication technology and distributed information processing technology.Comparing with the conventional wireless sensor networks, WMSNs are being deployedfor some practical applications, including military sensing and tracking, environmentand security monitoring, equipment and human monitoring and tracking. Thus, it hasreceived considerable attention and become a hotspot in research area. This paper in-vestigates the hotspots of the research on the lifetime of wireless multimedia sensornetworks, network utility maximum, opportunities routing protocol joint with networkcoding.
This paper addresses the performance optimization of network lifetime and re-source allocation for wireless video sensor networks. First, we construct a power con-sumption model for video sensors, in which video encoding, data communication anderror-control behavior are completely considered. Second, we propose a joint optimiza-tion of video coding rate, aggregate power consumption and flow control to maximizethe network lifetime and meet video quality requirements. Last, using Lagrange dualand subgradient approach, we solve the target convex optimization problem in a fullydecentralized manner, and evaluate its performance in a large-scale random topology aswell as in a small static network.
Reliable communication over time-varying and error prone wireless channels cur-rently is still challenging. In most FEC-based schemes, the maximum error control re-dundancy is upper-bounded by the FEC-code symbol size, However, diferent encod-ing/decoding structures are required for various redundancy levels. Therefore, the im-plementation complexity is too high to be applicable to real systems. To combat packetloss over wireless channels, a hybrid error-control scheme integrating network codingand ARQ protocol is introduced. It adaptively adjusts the number of redundant codedpackets according to ARQ feedbacks with a fixed code structure and decoding algorithm.
This paper also studies the problem of data gathering framework in wireless sensornetworks and formulates it as a network utility maximization problem. And an oppor-tunistic routing scheme, based on the optimization problem, is proposed to contribute adistributed framework for data gathering. We propose a new local metric for forward-ing selection and coordination. Moreover, this paper proposes a dynamic coding policywhich allows network coding applied across sessions and develops a necessary condi-tion for coding policy by denoting the flow gaining from coding. With the coding policy,intermediate nodes can independently judge whether the coding operation is appropri-ate and easily decide which packet to transmit among the incoming flows. To make thenetwork coding feasible in practical, a control mechanism for an intermediate node ispresented, which illustrates the operations for the incoming packet flows.
This paper also studies the problem of correlated data gathering in wirelesssensor networks. An opportunistic routing protocol joint with opportunistic networkcoding is proposed for correlated sources. In order to reduce the total transmission,the expected number of coded transmission (ECTX) is introduced as metric for therouting selection. Moreover, the coding gain is defined for the network nodes to countthe coding opportunistic, with which the throughput of the wireless sensor network isfurther increased.
针对网络生存周期最大化问题，系统地建立了包括视频压缩编码、视频接收与发送，以及网络传输差错控制的传感器节点功率消耗数学模型。在此基础上，提出了联合传感器节点功率分配、流量控制和视频质量失真的无线传感器网络生命周期凸优化模型，采用拉格朗日对偶理论和次梯度算法，实现了信源速率、链路速率、视频编码功率联合优化的分布式网络生存期优化求解算法，并通过仿真实验验证了该算法的有效性。
传统的FEC差错编码需要采用多个编码/解码结构来应对无线信道实时变化，这种方式在实际应用中复杂性和成本过高。本文提出了一种混合随机网络编码和自动请求重传（ARQ）技术的差错控制机制，根据ACK和NACK所反馈的当前信道状态，自适应地调整网络编码数据包的发送个数，以提高无线网络的传输鲁棒性。仿真实验结果表明在传输效率、功率消耗和传输时延方面较传统ARQ和FEC编码方式均有所提高。
为了同时提高网络的吞吐量和传输可靠性，本文提出了基于网络编码的机会路由方式，该方式引入拥塞代价指标来衡量无线网络链路质量，以最小拥塞代价作为路由转发节点的选择度量。考虑到组播间网络编码并非都能带来网络吞吐量的提升，提出了基于吞吐量增益的组间网络编码决策机制。网络中继节点通过比较存储转发获得的传输增益和进行组播间网络编码获得的传输增益的大小，判断是否需要进行组播间网络编码。
最后，本文提出了一种联合机会网络编码的机会路由算法，改进了之前研究的基于网络编码路由协议，定义网络编码带来的编码增益为路由选择的准则，通过增加网络编码的可能，进一步提高网络的吞吐量。对资源有限的无线多媒体传感器网络来说，尽可能充分利用有限资源传输最大信息量。仿真结果同样也显示了主动进行网络编码带来的网络吞吐量增加。
Wireless Multimedia Sensor Network (WMSN) is a special kind of wireless sensornetwork, which is integrated with sensor technology, multimedia information techniques,wireless communication technology and distributed information processing technology.Comparing with the conventional wireless sensor networks, WMSNs are being deployedfor some practical applications, including military sensing and tracking, environmentand security monitoring, equipment and human monitoring and tracking. Thus, it hasreceived considerable attention and become a hotspot in research area. This paper in-vestigates the hotspots of the research on the lifetime of wireless multimedia sensornetworks, network utility maximum, opportunities routing protocol joint with networkcoding.
This paper addresses the performance optimization of network lifetime and re-source allocation for wireless video sensor networks. First, we construct a power con-sumption model for video sensors, in which video encoding, data communication anderror-control behavior are completely considered. Second, we propose a joint optimiza-tion of video coding rate, aggregate power consumption and flow control to maximizethe network lifetime and meet video quality requirements. Last, using Lagrange dualand subgradient approach, we solve the target convex optimization problem in a fullydecentralized manner, and evaluate its performance in a large-scale random topology aswell as in a small static network.
Reliable communication over time-varying and error prone wireless channels cur-rently is still challenging. In most FEC-based schemes, the maximum error control re-dundancy is upper-bounded by the FEC-code symbol size, However, diferent encod-ing/decoding structures are required for various redundancy levels. Therefore, the im-plementation complexity is too high to be applicable to real systems. To combat packetloss over wireless channels, a hybrid error-control scheme integrating network codingand ARQ protocol is introduced. It adaptively adjusts the number of redundant codedpackets according to ARQ feedbacks with a fixed code structure and decoding algorithm.
This paper also studies the problem of data gathering framework in wireless sensornetworks and formulates it as a network utility maximization problem. And an oppor-tunistic routing scheme, based on the optimization problem, is proposed to contribute adistributed framework for data gathering. We propose a new local metric for forward-ing selection and coordination. Moreover, this paper proposes a dynamic coding policywhich allows network coding applied across sessions and develops a necessary condi-tion for coding policy by denoting the flow gaining from coding. With the coding policy,intermediate nodes can independently judge whether the coding operation is appropri-ate and easily decide which packet to transmit among the incoming flows. To make thenetwork coding feasible in practical, a control mechanism for an intermediate node ispresented, which illustrates the operations for the incoming packet flows.
This paper also studies the problem of correlated data gathering in wirelesssensor networks. An opportunistic routing protocol joint with opportunistic networkcoding is proposed for correlated sources. In order to reduce the total transmission,the expected number of coded transmission (ECTX) is introduced as metric for therouting selection. Moreover, the coding gain is defined for the network nodes to countthe coding opportunistic, with which the throughput of the wireless sensor network isfurther increased.
引文
[1] T. Cui, L. J. Chen, H. Tracey,“Energy efcient opportunistic network coding for wireless net-work [C],” Proc. of the27th International Conference on Computer Communication,2008,pp.1022-1030.
[2] A. J. Byrne,“Ideas for21st Century [J],” Business Week,1999, vol.8, pp:78-167.
[3] I. F. Akyildiz, T. Melodia, K. R. Chowdhury,“A survey on wireless multimedia sensor networks[J],” Computer Networks, Mar.2007, vol.51, no.4, pp:921-960.
[4] C. K. Chang, J. Huang,“Video surveillance for hazardous conditions using sensor networks
[C],” Proc. of the2004IEEE International Conference on Networking, Sensing and Control,Taiwan, Mar.2004, pp:1008-1013.
[5] R. Holman, J. Stanley, T. Ozkan-Haller,“Applying video sensor networks to nearshore environ-ment monitoring [J],” IEEE Pervasive Computing, Ooc.2003, vol.2, no.4, pp:14-21.
[6] I. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci,“Wireless sensor networks: a survey[J],” Computer Networks,2002, vol.38, no.4, pp:393-422.
[7] J. M. Kahn, R. H. Katz, R. S. J. Pister,“Next century challenge: mobile networking for smartdust [C],” Proc. of ACM MobiCom, Aug.1999, Seattle, WA, pp:271-278.
[8] Y. Zhou, Y. Fang, Y. Zhang,“Securing wireless sensor networks: survey, communications,surveys and tutorials [C],” IEEE Third Quarter,2008,vol.10, no.3, pp:6-28.
[9] S. Stanislava, H. Wendi,“A survey of visual sensor networks,” Advances in Multimedia,vol.2009,2009.
[10] L. Chen, T. Ho, S. Low, Steven H.1, M. Chiang, J. C. Doyle,“Optimization based on rate controlfor multicast with network coding [C],” Proc. of the26th IEEE International Conference onComputer Communication [C], May2007, pp:1163-1171.
[11] D. S. Lun, N. Ratnakar, M. Médard, R. Koetter, D. Karger, T. Ho, E. Ahmed, F. Zhao,“Minimum-cost multicast over coded packet networks [J],” IEEE Transcation on InformationTheory, Jun.2006, vol.52, no.6, pp:2608-2623.
[12] Y. Wu, V. Stankovic, Z. Xiong, S. Kung,“On practical design for joint distributed source andnetwork coding [J],” IEEE Transcation on Information Theory,2009, vol.55, no.4, pp:1709-1720.
[13] Y. He, I. Lee, L. Guan,“Distributed algorithms for network lifetime maximization in wirelessvisual sensor networks [J],” IEEE Transcation on Circuits and Systems for Video Technology,May2009, vol.19, no.5, pp:704-718.
[14] S. Biswas, R. Morris,“Opportunistic routing in multi-hop wireless networks [C],” ComputerCommunication Review, New York, Oct.2005, pp:133-144.
[15] S. Chachulski, M. Jenning, S. Katti, D. Katabi,“Trading structure for randomness in wirelessopportunistic routing [C],” Proc. of ACM SIGCOMM’07, Aug.2007, pp:169-180.
[16] M. M. Lu, F. Li, J. Wu,“Efcient opportunistic routing in utility-based Ad Hoc networks [J],”IEEE Transcation on Reliability,2009, vol.58, no.3, pp:485-495.
[17] X. Y. Zhang, B. C. Li,“Optimized multipath network coding in lossy wireless networks [J],”IEEE Journal on Selected Areas in Communications,2009, vol.27, no.5,pp:622-634.
[18] D. Palomar, M. Chiang,“Alternative distributed algorithms for network utility maximization:framework and applications [J],” IEEE Transactions on Automatic Control, Dec.2007, vol.52,no.12, pp:2254-2269.
[19] D. S. Lun, N. Ratnakar, R. Koetter, M. Médard, E. Ahmed, H. Lee,“Achieving minimum-costmulticast: a decentralized approach based on network coding [C],” Proc. of the24th AnnualJoint Conference of the IEEE Computer and Communications Societies,2005, pp:1607-1617.
[20] L. Chen, T. Ho, S. Low, M. Chiang, J. C. Doyle,“Optimization based rate control for multi-cast with network coding [C],” Proc. of the26th IEEE International Conference on ComputerCommunications, May2007,Anchorage, AK, United states, pp:1163-1171.
[21] S. H. Low, D. E. Lapsley,“Optimization flow control, I: basic algorithm and convergence [J],”IEEE/ACM Transactions on Networking, Dec.1999, vol.7, no.6, pp:861-874.
[22] K. Kar, S. Sarkar, L. Tassiulas,“A scalable low-overhead rate control algorithm for multiratemulticast sessions [J],” IEEE Journal on selected Areas in Communications, Oct.2002, vol.20,no.8, pp:1541-1557.
[23] Y. Jane, H. Peter,“A survey of clustering schemes for mobile ad hoc network [J],” IEEE Com-munications Magazine,2005, vo.7, no.2, pp:32-48.
[24] C. Liu, J.Kaiser,“A survey of mobile Ad hoc network routing protocols,” Technical report,2005, University of Ulm Tech. Report Series, Nr.2003-08.
[25] L. Chittaro, D. Nadalutti,“A mobile RFID-based system for supporting evacuation of buildings
[C],” Lecture Notes In Computer Science, May2009, Bonn, Germany, pp:22-31.
[26] CyLab,2004, www.cylab.cmu.edu/default.aspx?id=2000.
[27] A.O. Erean, D. B. R. Yang, A. EI Gamal, L. J. Guibas,“Optimal placement and selection ofcamera network nodes for target localization [J],” Lecture Notes in Computer Science, Jun.2006, vol.4026, pp:389-404.
[28] Video Sensor Network Laboratory at UCR Receives Federal Funding.2006.httP://wwww.newsroom.ucr/edu/cgi-bin/display.cgi?id=1298.
[29] A. Czarlinska, D. Kundur,“Reliable event-detection in wireless visual sensor networks throughscalar collaboration and game theoretic consideration [J],” IEEE Transactions on MultimediaSpecial Issue on Multimedia Applications in Mobile/Wireless Context, Aug.2008, vol.5, pp:675-690.
[30] Z. He, W. Cheng, X. Chen,“Energy minimization of portable video communication devicesbased on power-rate-distortion optimization [J],” IEEE Transactions on Circuits and Systemsfor Video Technology, May2008, vol.18, no.5, pp596-608.
[31] R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung,“Network information flow [J],” IEEE Trans-actions on Information Theory, July2000, vol.46, no.4, pp:1204-1216.
[32] S. Y. R. Li, R. W. Yeung, and N. Cai,“Linear Network Coding [J],” IEEE Transactions onInformation Theory, Feb.2003, vol.49, no.2, pp:371-381.
[33] T. Ho, R. Koetter, M. Medard, D. R. Karger, M. Efros,“The benefits of coding over routingin a randomized setting [C],” Proc. of IEEE International Symposium on Information Theory,ISIT’2003, July2003, Yokohama, Japan.
[34] C. Fragouli, J. L. Boudec, J. Widmer,“Network coding: an instant primer,” network codingtechnical report, presented on http://www.ifp.uiuc.edu/koetter/NWC/index.html.
[35] Y. Wu, P. A. Chou, K. Jain,“A comparison of network coding and tree packing [C],” Proc. ofIEEE International Symposium on Information Theory, ISIT’2004, July2004.
[36] S. Boyd, L. Vandenberghe,“Convex optimization [M],” Cambridge: Cambridge UniverstiyPress,2004.
[37] W. Ding, B. Liu,“Rate control of MPEG video coding and recording by rate-quantization mod-eling [J],” IEEE Transactions on Circuits System and Video Technolog, Feb.1996, vol.6, no.1,pp:12-20.
[38] Z. He, S. K. Mitra,“A linear source model and a unified rate control algorithm for DCT videocoding [J],” IEEE Transactions on Circuits System and Video Technolog, Nov.2002, vol.12,no.11, pp:970-982.
[39] Z. He, J. Cai, C. W. Chen,“Joint source channel rate-distortion analysis for adaptive modeselection and rate control in wireless video coding [J],” IEEE Transaction on Circuits Systemand Video Technolog, Special Issue on Wireless Video, Jun.2002, vol.12, no.6, pp:511-523.
[40] S. He, J. Chen, Y. Sun, D.K.Y. Yau, Y. K. Nung,“On optimal information capture by energy-constrained mobile sensors [J],” IEEE Transactions on Vehicular Technology, Jun.2010, vol.59,no.5, pp:2472-2484.
[41] R. Cristescu, B. Beferull-Lozano, M. Vetterli,“Networked Slepian–Wolf: theory and algo-rithms [C],” Proc. of Europe Workshop Wireless Senser Network,2004, pp:44-59.
[42] D. Slepian, J. K. Wolf,“Noiseless coding of correlated information sources [J],” IEEE Transac-tions on Information Theory, Jul1973, vol.IT-19, no.4, pp:471-480.
[43] Z. He, D. Wu,“Resource allocation and performance analysis of wireless video sensors [J],”IEEE Transactions on Circuits and Systems for Video Technology, May2006, vol.16, no.5,pp:590-599.
[44] Y. Yang, I. F. Mirela, C. Mihaela,“Improving network lifetime with mobile wireless sensornetworks [J],” Computer Communications, Mar.2010, vol.33, no.4, pp:409-419.
[45] T. Zhao, Q. Zhao,“Lifetime maximization based on coverage and connectivity in wireless sensornetworks [J],” Journal of Signal Processing Systems, Dec.2009, vol.57, no.3, pp:385-400.
[46] M. Javier, A. Carles,“Opportunistic power allocation schemes for the maximization of net-work lifetime in wireless sensor networks [C],” Proc. of the IEEE International Conference onAcoustics, Speech and Signal Processing,2008, pp:2273-2276.
[47] R. Madan, S. Lall, A. Goldsmith,“Cross-layer design for lifetime maximization in interference-limited wireless sensor networks sensor networks [C],” Proc. of the24th Annual Joint Confer-ence of the IEEE Computer and Communications Societies, Mar.2005, vol.3, pp:1964-1975,.
[48] H. Wang, Y, Yang, M, Ma, J, He, X, Wang,“Network lifetime maximization with cross-layerdesign in wireless sensor networks [J],” IEEE Transactions on Wireless Communications, Oct.2008, vol.7, no.10, pp:3759-3768.
[49] Y. He, I. Lee, L. Guan,“Network lifetime maximization in wireless visual sensor networks usinga distributed algorithm [C],” Proc. of the2007IEEE International Conference on Multimediaand Expo,2007, pp:2174-2177.
[50] P. Farkas, A. Yassine, V. P. Tran,“Hybrid ARQ error control for broadcast or multicast inwireless networks [C],” Proc. of the15th International Conference on Systems, Signals andImage Processing,2008, pp:373-376.
[51] Z. Zhang, V. O.K. Li,“Network-supported layered multicast transport control for streamingmedia [J],” IEEE Transactions on Parallel and Distributed Systems, Sept.2007, vol.18, no.9,pp:1332-1344.
[52] C. Huitema,“The case for packet level FEC [C],”Proc. of IFIP Protocols for High-SpeedNetworks,1996, pp:109-120.
[53] X. Yu, J. W. Modestino, I. V. Bajic,“Performance analysis of the efcacy of packet level FECin improving video transport over networks [C],” Proc. of International Conference on ImageProcessing, ICIP,2005, vol.2, pp:177-180.
[54] R. Koetter, M. Medard,“An algebraic approach to network coding [J],” IEEE/ACM Transactionson Networking,, Oct.2003, vol.11, no.5, pp:782-795.
[55] R. Bruno, M. Nurchis,“Survey on diversity-based routing in wireless mesh networks: chal-lenges and solutions [J],” Computer Communications, Feb.2010, vol.33, no.3, pp:269-282.
[56] P. A. Chou, T.Wu, K. Jain,“Practical network coding [C]”, Proc.of the51st Allerton Conf.Communication, Control and Computing, Oct.2003.
[57] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, J. Crowcroft,“XORs in the Air: PracticalWireless Network Coding [J],” IEEE/ACM Transactions on Networking,2008, vol.16, no.3,pp:497-510.
[58] K. Yuen, B. Liang, B. Li,“A Distributed Framework for Correlated Data Gathering in SensorNetworks [J],” IEEE Transactions on Vehicular Technology, Jan.2008, vol.57, no.1, pp:578-593.
[59] A. Swaroop, G. Manish, R. S. Naresh, L. J. Douglas, R. Kannan, T. Ran,“Total system energyminimization for wireless image transmission [J],” Journal of VLSI Signal Processing Systems,Feb.2001, vol.27, no.1, pp:99-117.
[60] E.J. Candes, T. Tao,“Decoding by linear programming [J]”,IEEE Transactions on InformationTheory, Dec.2005, vol.51, no.12, pp:4203-4215.
[61] F. Kelly, A. Maulloo, D. Tan,“Rate control in communication networks: shadow prices, pro-portional fairness and stability [J],” Journal of the Operational Research Society,1998, vol.49,pp:237-252.
[62] R. Madan, Z. Luo, S. Lall,“A distributed algorithm with linear convergence for maximumlifetime routing in wireless sensor networks [C],” Proc. of the ACCCC, Sep.2005, pp:896-905.
[63] C. Luo, F. Wu, J. Sun, C. Chen,“Compressive data gathering for large-scale wireless sensornetworks [C],” Proc. of the15th annual international conference on Mobile computing andnetworking MobiCom’09,2009, pp:145-156.
[64] T. Ho, M. Medard, R. Koetter, D.R. Karger, M. Efros, S. Jun, B. Leong,“A random linearnetwork coding approach to multicast [J],” IEEE Transactions on Information Theory, Oct.2006, vol.52, no.10, pp:4413-4430.
[65] T. Ho, M. Medard, J. Shi, M. Efros, D. R. Karger,“On randomized network coding [C],” Proc.of the41st Allerton Conf. Communication, Control and Computing, Monticello, IL, Sept.2003.
[66] J. Widmer, J. L. Boudec,“Network coding for efcient communication in extreme networks
[C],” Proc. of the2005ACM SIGCOMM workshop on Delay-tolerant networking,2005, pp:284-291.
[67] A. Eryilmaz,“Control for inter-session network coding [C],” Proc. of Workshop on NetworkCoding, Theory and Applications,2007.
[68] T. Cui, L. Chen, T. Ho,“On distributed distortion optimization for correlated sources with net-work coding [C],” Proc. of IEEE International Symposium on Information Theory, ISIT2007.
[69] C. Li, J. Zou, H. Xiong,“Joint coding/routing optimization for correlated sources in wirelessvisual sensor networks [C],” Proc. of IEEE Global Communications Conference GLOBECOM2009, Dec.2009, USA.
[70] A. Dunkels, F. Osterlind, Z. He,“An adaptive communication architecture for wireless sensornetworks [C],” Proc. of the5th ACM Conference on Embedded Networked Sensor Systems,2007, pp:335-349.
[71] S. Katti, S. Gollakota, D. Katabi,“Embracing wireless interference: analog network coding
[C],” Proc. of ACM SIGCOMM2007: Conference on Computer Communications,2007, pp:397-408.
[72] D. P. Palomar, M. Chiang,“A tutorial on decomposition methods for network utility maxi-mization [J],” IEEE Journal on Selected Areas in Communications, Aug.2006, vol.24, no.8,pp:1439-1451.
[73] F. P. Kelly, A. K. Maulloo, D. K. H. Tan,“Rate control for communication networks: Shadowprices, proportional fairness and stability [J],” Journal of the Operational Research Society,1998, vol.49, no.3, pp:237-252.
[74] S. Katti, D. Katabi, W. Hu, H. S. Rahul, M. Medard,“The importance of being opportunis-tic practical network coding for wireless environments [C],” Proc. of Allerton Conference onCommunication, Control and Computing,2005.
[75] J. Nocedal, S. J. Wright,“Numerical optimization [M],” New York, NY: Springer,1999.
[76] M. Chiang, S. H. Low, A. R. Calderbank, J. C. Doyle,“Layering as optimization decomposition:A mathematical theory of network architectures [J],” Proceedings of the IEEE, Jan.2007, vol.95,no.1, pp:255-312.
[77] S. Kunniyur, R. Srikant,“End-to-end congestion control schemes: Utility functions, randomlosses and ECN marks [J],” IEEE/ACM Transactions on Networking, Oct.2003, vol.11, no.5,pp:689-702.
[78] W. Chen, K. Letaief, Z. Cao,“Opportunistic network coding for wireless networks [C],” Proc.of IEEE International Conference on Communications ICC’07, June2007, Glasgow, Scotland,United kingdom, pp:4634-4639.
[79] T. Cui, L. Chen, T. Ho,“SlideOR: Online opportunistic network coding in wireless mesh net-works [C],” Proc. of International Conference on Computer Communications INFOCOM’10,Mar.2010, San Diego, CA, United states.
[80] S. Sengupta, S. Rayanchu, and S. Banerjee,“An analysis of wireless network coding for unicastsessions: the case for coding-aware routing [C],” Proc. of International Conference on ComputerCommunications INFOCOM’07, May2007, Anchorage, AK, pp:1028-1036.
[81] B. Ni, N. Santhapuri, Z. Zhong, S. Nelakuditi,“Routing with opportunistically coded ex-changes in wireless mesh networks [C],” Proc. of The2nd IEEE Workshop on Wireless MeshNetworks WiMesh’06, Sept.2006, Reston, VA, pp:157-59.
[82] M. Kim, M. Medard, U. M. O’Reilly, D. Traskov,“An evolutionary approach to inter-sessionnetwork coding [C],” Proc. of International Conference on Computer Communications INFO-COM’09, Apr.2009, pp:450-458.
[83] Z. Zhong, S. Nelakuditi,“On the efcacy of opportunistic routing [C],” Proc. of the4th AnnualIEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications andNetworks, SECON,2007, pp:441-450.
[84] Y. Yan, B. Zhang, J. Zheng, J. Ma,“CORE: a coding-aware opportunistic routing mechanism forwireless mesh networks [J],” IEEE Wireless Communications, Jun.2010, vol.17, no.3, pp:96-103.
[85] K. Zeng, W. Lou, H. Zhai,“Capacity of opportunistic routing in multi-rate and multi-hop wire-less networks [J],” IEEE Transcastion on wireless communications, Dec.2008, vol.7no.12,pp:5118-5128.
[86] C. Gkantsidis, P.R. Rodriguez,“Network coding for large scale content distribution [C],” Proc.of the24th Annual Joint Conference of the IEEE Computer and Communications Societies, Mar.2005, Atlanta, GA, USA, vol.4, pp:2235-2245.
[87] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, J. Crowcroft,“Xors in the air: practicalwireless network coding [J],” Computer Communication Review,2006, vol.36, no.4, pp:243-254.
[88] Y. Wu, P.A. Chou, S.Y. Kung,“Information exchange in wireless networks with network codingand physical layer broadcast,” Microsoft Corporation,2004, Redmond, WA, Technical Report.
[89] C. Fragouli, D. Katabi, A. Markopoulou, M. Medard, H. Rahul,“Wireless network coding: op-portunities and challenges [C],” Proc. of the IEEE Military Communications Conference MIL-COM’07, Oct.2007, pp:1-8.
[90] T. Ho, J. Q. Jin, H. Viswanathan,“On network coding and routing in dynamic wireless mul-ticast networks [C],” Proc. of the workshop on information theory and its applications,2006,SanDiego(UCSD): University of California, pp:1-4.
[91] M. Abolhasan, T. Wysocki, E. Dutkiewicz,“A review of routing protocols for mobile ad hocnetworks [J],” Ad Hoc Networks,2004, vol.2, no.1, pp:1-22.
[92] E. M. Royer, C. K. Toh,“A review of current routing protocols for ad hoc mobile wirelessnetworks [J],” IEEE Personal Communications,1999, vol.6, no.2, pp:46-55.
[93] P. Wang, C. Li, J. Zheng,“Distributed data aggregation using clustered Slepian-Wolf codingin wireless sensor networks [C],” Proc. of IEEE International Conference on Communica-tions(ICC’07),2007, pp:3616-3622.
[94] K. Akkaya, M. Younis,“A survey on routing protocols for wireless sensor networks [J],” AdHoc Networks,2005, vol.3, no.3, pp:325-349.
[95] R. Asokan,“A review of quality of service (QoS) routing protocols for mobile ad hoc net-works [C],” Proc. of International conference on wireless communication and sensor computing(ICWCSC’10), Jan.2010, pp:1-6.
[96] A. H. Hashim, M. M. Qabajeh, O. Khalifa, L. Qabajeh,“Review of multicast QoS routing pro-tocols for mobile ad hoc networks [J],” International Journal of Computer Science and NetworkSecurity,2008, vol.8, no.12, pp:108-117.
[97] R. C. Shah, S. Wietholter, A. Wolisz, J. M. Rabaey,“When does opportunistic routing makesense?[C],” Proc. of3rd IEEE International Conference on Pervasive Computing and Com-munications Workshops, PerCom2005, vol.2005, pp:350-356.
[98] H. Liu, B. Zhang, H. T. Mouftah, X. Shen, J. Ma,“Opportunistic routing for wireless ad hocand sensor networks: present and future directions [J],” IEEE Communications Magazine,2009,vol.47, no.12, pp:103-109.
[99] E. Rozner, J. Seshadri, Y. Mehta, L. Qiu,“SOAR: simple opportunistic adaptive routing protocolfor wireless mesh networks [J],” IEEE Transactions on Mobile Computing, Dec.2009, vol.8,no.12, pp:48-54.
[100] Y. Yang, C. Zhong, Y. Sun, J. Yang,“Network coding based reliable disjoint and braidedmultipath routing for sensor networks [J],” Journal of Network and Computer Applications,2010, vol.33, no.4, pp:422-432.
[101] D. Koutsonikolas, C. C. Wang, Y. C. Hu,“CCACK: efcient network coding based opportunis-tic routing through cumulative coded acknowledgments [C],” Proc. of the IEEE INFOCOM,Mar.2010, pp:2919-2927.
[102] Y. J. Lin, C. C. Huang, J. L. Huang,“PipelineOR: a pipelined opportunistic routing protocolwith network coding in wireless mesh networks [C],” Proc. of the71st IEEE vehicular technol-ogy conference (VTC’10), May2010, pp:1-5.
[103] X. Zhang, B. Li,“Optimized multi-path network coding in lossy wireless networks [J],” IEEEJournalon Selected Areas in Communications,2009, vol.27, no.5, pp:622-634.
[104] S. Sengupta, S. Rayanchu, S. Banerjee,“Network coding-aware routing in wireless networks[J],” IEEE/ACM Transactions on Networking, Aug.2010, vol.18, no.4, pp:1158-1170.
[2] A. J. Byrne,“Ideas for21st Century [J],” Business Week,1999, vol.8, pp:78-167.
[3] I. F. Akyildiz, T. Melodia, K. R. Chowdhury,“A survey on wireless multimedia sensor networks[J],” Computer Networks, Mar.2007, vol.51, no.4, pp:921-960.
[4] C. K. Chang, J. Huang,“Video surveillance for hazardous conditions using sensor networks
[C],” Proc. of the2004IEEE International Conference on Networking, Sensing and Control,Taiwan, Mar.2004, pp:1008-1013.
[5] R. Holman, J. Stanley, T. Ozkan-Haller,“Applying video sensor networks to nearshore environ-ment monitoring [J],” IEEE Pervasive Computing, Ooc.2003, vol.2, no.4, pp:14-21.
[6] I. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci,“Wireless sensor networks: a survey[J],” Computer Networks,2002, vol.38, no.4, pp:393-422.
[7] J. M. Kahn, R. H. Katz, R. S. J. Pister,“Next century challenge: mobile networking for smartdust [C],” Proc. of ACM MobiCom, Aug.1999, Seattle, WA, pp:271-278.
[8] Y. Zhou, Y. Fang, Y. Zhang,“Securing wireless sensor networks: survey, communications,surveys and tutorials [C],” IEEE Third Quarter,2008,vol.10, no.3, pp:6-28.
[9] S. Stanislava, H. Wendi,“A survey of visual sensor networks,” Advances in Multimedia,vol.2009,2009.
[10] L. Chen, T. Ho, S. Low, Steven H.1, M. Chiang, J. C. Doyle,“Optimization based on rate controlfor multicast with network coding [C],” Proc. of the26th IEEE International Conference onComputer Communication [C], May2007, pp:1163-1171.
[11] D. S. Lun, N. Ratnakar, M. Médard, R. Koetter, D. Karger, T. Ho, E. Ahmed, F. Zhao,“Minimum-cost multicast over coded packet networks [J],” IEEE Transcation on InformationTheory, Jun.2006, vol.52, no.6, pp:2608-2623.
[12] Y. Wu, V. Stankovic, Z. Xiong, S. Kung,“On practical design for joint distributed source andnetwork coding [J],” IEEE Transcation on Information Theory,2009, vol.55, no.4, pp:1709-1720.
[13] Y. He, I. Lee, L. Guan,“Distributed algorithms for network lifetime maximization in wirelessvisual sensor networks [J],” IEEE Transcation on Circuits and Systems for Video Technology,May2009, vol.19, no.5, pp:704-718.
[14] S. Biswas, R. Morris,“Opportunistic routing in multi-hop wireless networks [C],” ComputerCommunication Review, New York, Oct.2005, pp:133-144.
[15] S. Chachulski, M. Jenning, S. Katti, D. Katabi,“Trading structure for randomness in wirelessopportunistic routing [C],” Proc. of ACM SIGCOMM’07, Aug.2007, pp:169-180.
[16] M. M. Lu, F. Li, J. Wu,“Efcient opportunistic routing in utility-based Ad Hoc networks [J],”IEEE Transcation on Reliability,2009, vol.58, no.3, pp:485-495.
[17] X. Y. Zhang, B. C. Li,“Optimized multipath network coding in lossy wireless networks [J],”IEEE Journal on Selected Areas in Communications,2009, vol.27, no.5,pp:622-634.
[18] D. Palomar, M. Chiang,“Alternative distributed algorithms for network utility maximization:framework and applications [J],” IEEE Transactions on Automatic Control, Dec.2007, vol.52,no.12, pp:2254-2269.
[19] D. S. Lun, N. Ratnakar, R. Koetter, M. Médard, E. Ahmed, H. Lee,“Achieving minimum-costmulticast: a decentralized approach based on network coding [C],” Proc. of the24th AnnualJoint Conference of the IEEE Computer and Communications Societies,2005, pp:1607-1617.
[20] L. Chen, T. Ho, S. Low, M. Chiang, J. C. Doyle,“Optimization based rate control for multi-cast with network coding [C],” Proc. of the26th IEEE International Conference on ComputerCommunications, May2007,Anchorage, AK, United states, pp:1163-1171.
[21] S. H. Low, D. E. Lapsley,“Optimization flow control, I: basic algorithm and convergence [J],”IEEE/ACM Transactions on Networking, Dec.1999, vol.7, no.6, pp:861-874.
[22] K. Kar, S. Sarkar, L. Tassiulas,“A scalable low-overhead rate control algorithm for multiratemulticast sessions [J],” IEEE Journal on selected Areas in Communications, Oct.2002, vol.20,no.8, pp:1541-1557.
[23] Y. Jane, H. Peter,“A survey of clustering schemes for mobile ad hoc network [J],” IEEE Com-munications Magazine,2005, vo.7, no.2, pp:32-48.
[24] C. Liu, J.Kaiser,“A survey of mobile Ad hoc network routing protocols,” Technical report,2005, University of Ulm Tech. Report Series, Nr.2003-08.
[25] L. Chittaro, D. Nadalutti,“A mobile RFID-based system for supporting evacuation of buildings
[C],” Lecture Notes In Computer Science, May2009, Bonn, Germany, pp:22-31.
[26] CyLab,2004, www.cylab.cmu.edu/default.aspx?id=2000.
[27] A.O. Erean, D. B. R. Yang, A. EI Gamal, L. J. Guibas,“Optimal placement and selection ofcamera network nodes for target localization [J],” Lecture Notes in Computer Science, Jun.2006, vol.4026, pp:389-404.
[28] Video Sensor Network Laboratory at UCR Receives Federal Funding.2006.httP://wwww.newsroom.ucr/edu/cgi-bin/display.cgi?id=1298.
[29] A. Czarlinska, D. Kundur,“Reliable event-detection in wireless visual sensor networks throughscalar collaboration and game theoretic consideration [J],” IEEE Transactions on MultimediaSpecial Issue on Multimedia Applications in Mobile/Wireless Context, Aug.2008, vol.5, pp:675-690.
[30] Z. He, W. Cheng, X. Chen,“Energy minimization of portable video communication devicesbased on power-rate-distortion optimization [J],” IEEE Transactions on Circuits and Systemsfor Video Technology, May2008, vol.18, no.5, pp596-608.
[31] R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung,“Network information flow [J],” IEEE Trans-actions on Information Theory, July2000, vol.46, no.4, pp:1204-1216.
[32] S. Y. R. Li, R. W. Yeung, and N. Cai,“Linear Network Coding [J],” IEEE Transactions onInformation Theory, Feb.2003, vol.49, no.2, pp:371-381.
[33] T. Ho, R. Koetter, M. Medard, D. R. Karger, M. Efros,“The benefits of coding over routingin a randomized setting [C],” Proc. of IEEE International Symposium on Information Theory,ISIT’2003, July2003, Yokohama, Japan.
[34] C. Fragouli, J. L. Boudec, J. Widmer,“Network coding: an instant primer,” network codingtechnical report, presented on http://www.ifp.uiuc.edu/koetter/NWC/index.html.
[35] Y. Wu, P. A. Chou, K. Jain,“A comparison of network coding and tree packing [C],” Proc. ofIEEE International Symposium on Information Theory, ISIT’2004, July2004.
[36] S. Boyd, L. Vandenberghe,“Convex optimization [M],” Cambridge: Cambridge UniverstiyPress,2004.
[37] W. Ding, B. Liu,“Rate control of MPEG video coding and recording by rate-quantization mod-eling [J],” IEEE Transactions on Circuits System and Video Technolog, Feb.1996, vol.6, no.1,pp:12-20.
[38] Z. He, S. K. Mitra,“A linear source model and a unified rate control algorithm for DCT videocoding [J],” IEEE Transactions on Circuits System and Video Technolog, Nov.2002, vol.12,no.11, pp:970-982.
[39] Z. He, J. Cai, C. W. Chen,“Joint source channel rate-distortion analysis for adaptive modeselection and rate control in wireless video coding [J],” IEEE Transaction on Circuits Systemand Video Technolog, Special Issue on Wireless Video, Jun.2002, vol.12, no.6, pp:511-523.
[40] S. He, J. Chen, Y. Sun, D.K.Y. Yau, Y. K. Nung,“On optimal information capture by energy-constrained mobile sensors [J],” IEEE Transactions on Vehicular Technology, Jun.2010, vol.59,no.5, pp:2472-2484.
[41] R. Cristescu, B. Beferull-Lozano, M. Vetterli,“Networked Slepian–Wolf: theory and algo-rithms [C],” Proc. of Europe Workshop Wireless Senser Network,2004, pp:44-59.
[42] D. Slepian, J. K. Wolf,“Noiseless coding of correlated information sources [J],” IEEE Transac-tions on Information Theory, Jul1973, vol.IT-19, no.4, pp:471-480.
[43] Z. He, D. Wu,“Resource allocation and performance analysis of wireless video sensors [J],”IEEE Transactions on Circuits and Systems for Video Technology, May2006, vol.16, no.5,pp:590-599.
[44] Y. Yang, I. F. Mirela, C. Mihaela,“Improving network lifetime with mobile wireless sensornetworks [J],” Computer Communications, Mar.2010, vol.33, no.4, pp:409-419.
[45] T. Zhao, Q. Zhao,“Lifetime maximization based on coverage and connectivity in wireless sensornetworks [J],” Journal of Signal Processing Systems, Dec.2009, vol.57, no.3, pp:385-400.
[46] M. Javier, A. Carles,“Opportunistic power allocation schemes for the maximization of net-work lifetime in wireless sensor networks [C],” Proc. of the IEEE International Conference onAcoustics, Speech and Signal Processing,2008, pp:2273-2276.
[47] R. Madan, S. Lall, A. Goldsmith,“Cross-layer design for lifetime maximization in interference-limited wireless sensor networks sensor networks [C],” Proc. of the24th Annual Joint Confer-ence of the IEEE Computer and Communications Societies, Mar.2005, vol.3, pp:1964-1975,.
[48] H. Wang, Y, Yang, M, Ma, J, He, X, Wang,“Network lifetime maximization with cross-layerdesign in wireless sensor networks [J],” IEEE Transactions on Wireless Communications, Oct.2008, vol.7, no.10, pp:3759-3768.
[49] Y. He, I. Lee, L. Guan,“Network lifetime maximization in wireless visual sensor networks usinga distributed algorithm [C],” Proc. of the2007IEEE International Conference on Multimediaand Expo,2007, pp:2174-2177.
[50] P. Farkas, A. Yassine, V. P. Tran,“Hybrid ARQ error control for broadcast or multicast inwireless networks [C],” Proc. of the15th International Conference on Systems, Signals andImage Processing,2008, pp:373-376.
[51] Z. Zhang, V. O.K. Li,“Network-supported layered multicast transport control for streamingmedia [J],” IEEE Transactions on Parallel and Distributed Systems, Sept.2007, vol.18, no.9,pp:1332-1344.
[52] C. Huitema,“The case for packet level FEC [C],”Proc. of IFIP Protocols for High-SpeedNetworks,1996, pp:109-120.
[53] X. Yu, J. W. Modestino, I. V. Bajic,“Performance analysis of the efcacy of packet level FECin improving video transport over networks [C],” Proc. of International Conference on ImageProcessing, ICIP,2005, vol.2, pp:177-180.
[54] R. Koetter, M. Medard,“An algebraic approach to network coding [J],” IEEE/ACM Transactionson Networking,, Oct.2003, vol.11, no.5, pp:782-795.
[55] R. Bruno, M. Nurchis,“Survey on diversity-based routing in wireless mesh networks: chal-lenges and solutions [J],” Computer Communications, Feb.2010, vol.33, no.3, pp:269-282.
[56] P. A. Chou, T.Wu, K. Jain,“Practical network coding [C]”, Proc.of the51st Allerton Conf.Communication, Control and Computing, Oct.2003.
[57] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, J. Crowcroft,“XORs in the Air: PracticalWireless Network Coding [J],” IEEE/ACM Transactions on Networking,2008, vol.16, no.3,pp:497-510.
[58] K. Yuen, B. Liang, B. Li,“A Distributed Framework for Correlated Data Gathering in SensorNetworks [J],” IEEE Transactions on Vehicular Technology, Jan.2008, vol.57, no.1, pp:578-593.
[59] A. Swaroop, G. Manish, R. S. Naresh, L. J. Douglas, R. Kannan, T. Ran,“Total system energyminimization for wireless image transmission [J],” Journal of VLSI Signal Processing Systems,Feb.2001, vol.27, no.1, pp:99-117.
[60] E.J. Candes, T. Tao,“Decoding by linear programming [J]”,IEEE Transactions on InformationTheory, Dec.2005, vol.51, no.12, pp:4203-4215.
[61] F. Kelly, A. Maulloo, D. Tan,“Rate control in communication networks: shadow prices, pro-portional fairness and stability [J],” Journal of the Operational Research Society,1998, vol.49,pp:237-252.
[62] R. Madan, Z. Luo, S. Lall,“A distributed algorithm with linear convergence for maximumlifetime routing in wireless sensor networks [C],” Proc. of the ACCCC, Sep.2005, pp:896-905.
[63] C. Luo, F. Wu, J. Sun, C. Chen,“Compressive data gathering for large-scale wireless sensornetworks [C],” Proc. of the15th annual international conference on Mobile computing andnetworking MobiCom’09,2009, pp:145-156.
[64] T. Ho, M. Medard, R. Koetter, D.R. Karger, M. Efros, S. Jun, B. Leong,“A random linearnetwork coding approach to multicast [J],” IEEE Transactions on Information Theory, Oct.2006, vol.52, no.10, pp:4413-4430.
[65] T. Ho, M. Medard, J. Shi, M. Efros, D. R. Karger,“On randomized network coding [C],” Proc.of the41st Allerton Conf. Communication, Control and Computing, Monticello, IL, Sept.2003.
[66] J. Widmer, J. L. Boudec,“Network coding for efcient communication in extreme networks
[C],” Proc. of the2005ACM SIGCOMM workshop on Delay-tolerant networking,2005, pp:284-291.
[67] A. Eryilmaz,“Control for inter-session network coding [C],” Proc. of Workshop on NetworkCoding, Theory and Applications,2007.
[68] T. Cui, L. Chen, T. Ho,“On distributed distortion optimization for correlated sources with net-work coding [C],” Proc. of IEEE International Symposium on Information Theory, ISIT2007.
[69] C. Li, J. Zou, H. Xiong,“Joint coding/routing optimization for correlated sources in wirelessvisual sensor networks [C],” Proc. of IEEE Global Communications Conference GLOBECOM2009, Dec.2009, USA.
[70] A. Dunkels, F. Osterlind, Z. He,“An adaptive communication architecture for wireless sensornetworks [C],” Proc. of the5th ACM Conference on Embedded Networked Sensor Systems,2007, pp:335-349.
[71] S. Katti, S. Gollakota, D. Katabi,“Embracing wireless interference: analog network coding
[C],” Proc. of ACM SIGCOMM2007: Conference on Computer Communications,2007, pp:397-408.
[72] D. P. Palomar, M. Chiang,“A tutorial on decomposition methods for network utility maxi-mization [J],” IEEE Journal on Selected Areas in Communications, Aug.2006, vol.24, no.8,pp:1439-1451.
[73] F. P. Kelly, A. K. Maulloo, D. K. H. Tan,“Rate control for communication networks: Shadowprices, proportional fairness and stability [J],” Journal of the Operational Research Society,1998, vol.49, no.3, pp:237-252.
[74] S. Katti, D. Katabi, W. Hu, H. S. Rahul, M. Medard,“The importance of being opportunis-tic practical network coding for wireless environments [C],” Proc. of Allerton Conference onCommunication, Control and Computing,2005.
[75] J. Nocedal, S. J. Wright,“Numerical optimization [M],” New York, NY: Springer,1999.
[76] M. Chiang, S. H. Low, A. R. Calderbank, J. C. Doyle,“Layering as optimization decomposition:A mathematical theory of network architectures [J],” Proceedings of the IEEE, Jan.2007, vol.95,no.1, pp:255-312.
[77] S. Kunniyur, R. Srikant,“End-to-end congestion control schemes: Utility functions, randomlosses and ECN marks [J],” IEEE/ACM Transactions on Networking, Oct.2003, vol.11, no.5,pp:689-702.
[78] W. Chen, K. Letaief, Z. Cao,“Opportunistic network coding for wireless networks [C],” Proc.of IEEE International Conference on Communications ICC’07, June2007, Glasgow, Scotland,United kingdom, pp:4634-4639.
[79] T. Cui, L. Chen, T. Ho,“SlideOR: Online opportunistic network coding in wireless mesh net-works [C],” Proc. of International Conference on Computer Communications INFOCOM’10,Mar.2010, San Diego, CA, United states.
[80] S. Sengupta, S. Rayanchu, and S. Banerjee,“An analysis of wireless network coding for unicastsessions: the case for coding-aware routing [C],” Proc. of International Conference on ComputerCommunications INFOCOM’07, May2007, Anchorage, AK, pp:1028-1036.
[81] B. Ni, N. Santhapuri, Z. Zhong, S. Nelakuditi,“Routing with opportunistically coded ex-changes in wireless mesh networks [C],” Proc. of The2nd IEEE Workshop on Wireless MeshNetworks WiMesh’06, Sept.2006, Reston, VA, pp:157-59.
[82] M. Kim, M. Medard, U. M. O’Reilly, D. Traskov,“An evolutionary approach to inter-sessionnetwork coding [C],” Proc. of International Conference on Computer Communications INFO-COM’09, Apr.2009, pp:450-458.
[83] Z. Zhong, S. Nelakuditi,“On the efcacy of opportunistic routing [C],” Proc. of the4th AnnualIEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications andNetworks, SECON,2007, pp:441-450.
[84] Y. Yan, B. Zhang, J. Zheng, J. Ma,“CORE: a coding-aware opportunistic routing mechanism forwireless mesh networks [J],” IEEE Wireless Communications, Jun.2010, vol.17, no.3, pp:96-103.
[85] K. Zeng, W. Lou, H. Zhai,“Capacity of opportunistic routing in multi-rate and multi-hop wire-less networks [J],” IEEE Transcastion on wireless communications, Dec.2008, vol.7no.12,pp:5118-5128.
[86] C. Gkantsidis, P.R. Rodriguez,“Network coding for large scale content distribution [C],” Proc.of the24th Annual Joint Conference of the IEEE Computer and Communications Societies, Mar.2005, Atlanta, GA, USA, vol.4, pp:2235-2245.
[87] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, J. Crowcroft,“Xors in the air: practicalwireless network coding [J],” Computer Communication Review,2006, vol.36, no.4, pp:243-254.
[88] Y. Wu, P.A. Chou, S.Y. Kung,“Information exchange in wireless networks with network codingand physical layer broadcast,” Microsoft Corporation,2004, Redmond, WA, Technical Report.
[89] C. Fragouli, D. Katabi, A. Markopoulou, M. Medard, H. Rahul,“Wireless network coding: op-portunities and challenges [C],” Proc. of the IEEE Military Communications Conference MIL-COM’07, Oct.2007, pp:1-8.
[90] T. Ho, J. Q. Jin, H. Viswanathan,“On network coding and routing in dynamic wireless mul-ticast networks [C],” Proc. of the workshop on information theory and its applications,2006,SanDiego(UCSD): University of California, pp:1-4.
[91] M. Abolhasan, T. Wysocki, E. Dutkiewicz,“A review of routing protocols for mobile ad hocnetworks [J],” Ad Hoc Networks,2004, vol.2, no.1, pp:1-22.
[92] E. M. Royer, C. K. Toh,“A review of current routing protocols for ad hoc mobile wirelessnetworks [J],” IEEE Personal Communications,1999, vol.6, no.2, pp:46-55.
[93] P. Wang, C. Li, J. Zheng,“Distributed data aggregation using clustered Slepian-Wolf codingin wireless sensor networks [C],” Proc. of IEEE International Conference on Communica-tions(ICC’07),2007, pp:3616-3622.
[94] K. Akkaya, M. Younis,“A survey on routing protocols for wireless sensor networks [J],” AdHoc Networks,2005, vol.3, no.3, pp:325-349.
[95] R. Asokan,“A review of quality of service (QoS) routing protocols for mobile ad hoc net-works [C],” Proc. of International conference on wireless communication and sensor computing(ICWCSC’10), Jan.2010, pp:1-6.
[96] A. H. Hashim, M. M. Qabajeh, O. Khalifa, L. Qabajeh,“Review of multicast QoS routing pro-tocols for mobile ad hoc networks [J],” International Journal of Computer Science and NetworkSecurity,2008, vol.8, no.12, pp:108-117.
[97] R. C. Shah, S. Wietholter, A. Wolisz, J. M. Rabaey,“When does opportunistic routing makesense?[C],” Proc. of3rd IEEE International Conference on Pervasive Computing and Com-munications Workshops, PerCom2005, vol.2005, pp:350-356.
[98] H. Liu, B. Zhang, H. T. Mouftah, X. Shen, J. Ma,“Opportunistic routing for wireless ad hocand sensor networks: present and future directions [J],” IEEE Communications Magazine,2009,vol.47, no.12, pp:103-109.
[99] E. Rozner, J. Seshadri, Y. Mehta, L. Qiu,“SOAR: simple opportunistic adaptive routing protocolfor wireless mesh networks [J],” IEEE Transactions on Mobile Computing, Dec.2009, vol.8,no.12, pp:48-54.
[100] Y. Yang, C. Zhong, Y. Sun, J. Yang,“Network coding based reliable disjoint and braidedmultipath routing for sensor networks [J],” Journal of Network and Computer Applications,2010, vol.33, no.4, pp:422-432.
[101] D. Koutsonikolas, C. C. Wang, Y. C. Hu,“CCACK: efcient network coding based opportunis-tic routing through cumulative coded acknowledgments [C],” Proc. of the IEEE INFOCOM,Mar.2010, pp:2919-2927.
[102] Y. J. Lin, C. C. Huang, J. L. Huang,“PipelineOR: a pipelined opportunistic routing protocolwith network coding in wireless mesh networks [C],” Proc. of the71st IEEE vehicular technol-ogy conference (VTC’10), May2010, pp:1-5.
[103] X. Zhang, B. Li,“Optimized multi-path network coding in lossy wireless networks [J],” IEEEJournalon Selected Areas in Communications,2009, vol.27, no.5, pp:622-634.
[104] S. Sengupta, S. Rayanchu, S. Banerjee,“Network coding-aware routing in wireless networks[J],” IEEE/ACM Transactions on Networking, Aug.2010, vol.18, no.4, pp:1158-1170.