无线传感器网络路由协议若干关键问题研究
|
摘要
低功耗无线通信、微型传感器设计与制造、自组织组网、普适计算与分布式信号处理等技术的发展,促进了一种新型信息采集网络——无线传感器网络(Wireless Sensor Networks, WSN)的产生和迅速发展。WSN通过大量微型无线传感器节点以自组织协同的方式构成网络,实现对目标(或区域)自动地信息采集、处理与传输。路由协议是支撑WSN信息传输、节点间协同工作的关键技术。
由于WSN在网络特点、业务特点和需求等方面与传统无线网络存在显著差别,WSN的路由协议设计面临一系列新的挑战。本文对WSN路由协议的能量有效性问题、带宽资源高效利用问题和数据传输可靠性问题进行深入研究,主要研究成果和创新点如下：
1.提出了一种基于协作通信的网络寿命最大化路由策略ORRCR (Optimal Relay Ratio based Cooperative Routing),通过采用中继、协作混合传输模式,克服WSN在衰落信道、多对一通信模式下能耗不均的缺陷。通过定量分析混合传输模式下网络寿命和节点中继概率的关系,将网络寿命最大化问题转化为中继概率的最优化问题。该问题属于非线性优化、难以直接求解,通过深入分析“网络寿命最大化”和“各节点能耗相等”的关系,得到了“网络寿命最大化时,所有节点或部分节点能耗相等”等重要结论,简化了中继概率的求解。基于最优中继概率设计了DORRCR (Distributed ORRCR)协议,有效延长了网络寿命。
2.提出了一种带宽资源高效的协同QoS路由策略CQR (Collaborative QoS Routing)其核心是通过对多数据流路由的联合优化,克服单数据流路由优化方法易产生带宽资源碎片的缺陷。把多数据流路由的联合优化归结为多商品流问题。针对无线信道中多数据流路由选择具有空间耦合特性、难以利用经典算法求解的问题,提出一种基于干扰链路集的资源分解方法,将多数据流联合路由优化转化为资源分解矢量的优化问题,并采用次梯度优化的方法求得CQR的最优解。针对集中式算法复杂度高、难以直接应用的问题,设计了基于本地流量转移的分布式协同路由协议LTM_CQR(Local Traffic Migration based CQR),通过定量分析本地拓扑知识半径和流量转移成功概率的关系,优化了协议重要参数,在分布式条件下求得CQR的次优解,提高了带宽资源利用率。
3.针对Alice-Bob网络编码结构,证明了两数据流的路径构成编码结构的条件,以及一条路径上相邻编码结构的串联性质；设计了一种尽力耦合的集中式路由算法NCBCR (Network Coding based Best effort Coupling Routing),利用上述结论,对多数据流的路径进行联合调整,构造尽可能多的编码结构,减少了数据流的端到端传输次数。
4.设计了一种基于虚拟多路径的可靠路由协议VMR (Virtual Multipath Reliable routing)。该协议不专门发送探测分组,而是利用发送的数据分组收集路径可靠性信息,通过区间估计评估各可行路径的可靠性,并通过差路径过滤的方法实现在数据传输过程中路由选择的逐步优化。仿真结果表明,VMR在能量效率、分组递交率方面优于典型的可靠路由协议AODV_ETX。
In recent years, the rapid development in low power wireless communication, microsensor, in conjunction with the significant progress in distributed signal processing, ad hoc networks protocols, and pervasive computing have made wireless sensor networks (WSNs) a new technological vision. WSN is formed by large amounts of micro sensor nodes networking in ad hoc manner which collaboratively gather and deliver information from the objective area automatically. Routing protocol is the key technology of WSN for information gathering and collaboration among sensors.
Routing protocol design differs from that in traditional wireless networks because of the limitation of network resource as well as the spectial traffic characteristics and various user demands in WSN. In this thesis, key problems in WSN routing protocol design are investigated including energy efficiency, bandwidth efficiency and transmission reliability. Main research fruits are summarized as follows:
1. An Optimal Relay Ratio based Cooperative Routing (ORRCR) strategy is proposed to maximize the network lifetime of WSN in fading channel and under many-to-one traffic pattern which combins forwarding and cooperative transmission modes together. By quantitative analysis of the relationship of network lifetime and relay ratio, network lifetime maximization problem is transformed to relay ratio optimization. High nonlinear characteristic of this problem makes it difficult to obtain optimal solution directly. Through analysis on relationship between network lifetime maximization and equal energy consumption between nodes, important conclusions are reached that "network lifetime is maximized with all nodes and some nodes have equal energy consumption" which simplify the above optimization problem greatly. Distributed routing protocol DORRCR is proposed based on optimal relay ratio. It achieves longer network lifetime.
2. A bandwidth resource efficient Collaborative QoS Rouing (CQR) strategy is proposed. The key of CQR is to jointly optimize path selections of multiple flows so as to overcome the bandwidth fragment problem resulted from path optimization focusing on one data flow. The problem is summarized as multi-commodity problem. But because of space coupling characteristic of path selection within multiple flows in wireless channel, classical algorithms can't work. Interfered Link Set oriented bandwidth resource decomposition is proposed to transform the routing optimization of multiple flows to optimization of resource decomposition vector and the optimal solution is obtained in centralized manner with subgradient optimization method. Because the centralized algorithm is of high computation complexity and is hard to be directly used in WSN, Local Traffic Migration based CQR protocol is proposed; through quantitative analysis of relationship of topology knowledge and local traffic migration success probability, key parameter is optimized. LTM_CQR achieves higher bandwidth efficiency comparing to existed protocol.
3. Alice-Bob coding structure is studied in network coding aware routing algorithm. The condition under which paths of different traffics form Alice-Bob coding structures (AB condition, for short) is analyzed and series characteristic of two neighboring coding structure along one path is proved; A centralized Network Coding based Best effort Coupling Routing (NCBCR) algorithm is proposed, which adjusts paths of different data flows based on the AB condition and series characteristic to form as many as possible coding structures. NCBCR outperforms traditional aloghrithms by reducing end to end transmissions.
4. A Virtual Multipath Reliable routing protocol is proposed. VMR doesn't send specialized probing packet for reliability information of wireless link; instead, it sends data packets along possible paths and gather path reliability information at the same time. Interval estimation is used to evaluate quality of the paths and bad path filter method is proposed to dynamically choose the optimal path(s). Simulation shows that VMR outperforms reliable routing protocol AODV_ETX in both energy efficiency and reliability.
由于WSN在网络特点、业务特点和需求等方面与传统无线网络存在显著差别,WSN的路由协议设计面临一系列新的挑战。本文对WSN路由协议的能量有效性问题、带宽资源高效利用问题和数据传输可靠性问题进行深入研究,主要研究成果和创新点如下：
1.提出了一种基于协作通信的网络寿命最大化路由策略ORRCR (Optimal Relay Ratio based Cooperative Routing),通过采用中继、协作混合传输模式,克服WSN在衰落信道、多对一通信模式下能耗不均的缺陷。通过定量分析混合传输模式下网络寿命和节点中继概率的关系,将网络寿命最大化问题转化为中继概率的最优化问题。该问题属于非线性优化、难以直接求解,通过深入分析“网络寿命最大化”和“各节点能耗相等”的关系,得到了“网络寿命最大化时,所有节点或部分节点能耗相等”等重要结论,简化了中继概率的求解。基于最优中继概率设计了DORRCR (Distributed ORRCR)协议,有效延长了网络寿命。
2.提出了一种带宽资源高效的协同QoS路由策略CQR (Collaborative QoS Routing)其核心是通过对多数据流路由的联合优化,克服单数据流路由优化方法易产生带宽资源碎片的缺陷。把多数据流路由的联合优化归结为多商品流问题。针对无线信道中多数据流路由选择具有空间耦合特性、难以利用经典算法求解的问题,提出一种基于干扰链路集的资源分解方法,将多数据流联合路由优化转化为资源分解矢量的优化问题,并采用次梯度优化的方法求得CQR的最优解。针对集中式算法复杂度高、难以直接应用的问题,设计了基于本地流量转移的分布式协同路由协议LTM_CQR(Local Traffic Migration based CQR),通过定量分析本地拓扑知识半径和流量转移成功概率的关系,优化了协议重要参数,在分布式条件下求得CQR的次优解,提高了带宽资源利用率。
3.针对Alice-Bob网络编码结构,证明了两数据流的路径构成编码结构的条件,以及一条路径上相邻编码结构的串联性质；设计了一种尽力耦合的集中式路由算法NCBCR (Network Coding based Best effort Coupling Routing),利用上述结论,对多数据流的路径进行联合调整,构造尽可能多的编码结构,减少了数据流的端到端传输次数。
4.设计了一种基于虚拟多路径的可靠路由协议VMR (Virtual Multipath Reliable routing)。该协议不专门发送探测分组,而是利用发送的数据分组收集路径可靠性信息,通过区间估计评估各可行路径的可靠性,并通过差路径过滤的方法实现在数据传输过程中路由选择的逐步优化。仿真结果表明,VMR在能量效率、分组递交率方面优于典型的可靠路由协议AODV_ETX。
In recent years, the rapid development in low power wireless communication, microsensor, in conjunction with the significant progress in distributed signal processing, ad hoc networks protocols, and pervasive computing have made wireless sensor networks (WSNs) a new technological vision. WSN is formed by large amounts of micro sensor nodes networking in ad hoc manner which collaboratively gather and deliver information from the objective area automatically. Routing protocol is the key technology of WSN for information gathering and collaboration among sensors.
Routing protocol design differs from that in traditional wireless networks because of the limitation of network resource as well as the spectial traffic characteristics and various user demands in WSN. In this thesis, key problems in WSN routing protocol design are investigated including energy efficiency, bandwidth efficiency and transmission reliability. Main research fruits are summarized as follows:
1. An Optimal Relay Ratio based Cooperative Routing (ORRCR) strategy is proposed to maximize the network lifetime of WSN in fading channel and under many-to-one traffic pattern which combins forwarding and cooperative transmission modes together. By quantitative analysis of the relationship of network lifetime and relay ratio, network lifetime maximization problem is transformed to relay ratio optimization. High nonlinear characteristic of this problem makes it difficult to obtain optimal solution directly. Through analysis on relationship between network lifetime maximization and equal energy consumption between nodes, important conclusions are reached that "network lifetime is maximized with all nodes and some nodes have equal energy consumption" which simplify the above optimization problem greatly. Distributed routing protocol DORRCR is proposed based on optimal relay ratio. It achieves longer network lifetime.
2. A bandwidth resource efficient Collaborative QoS Rouing (CQR) strategy is proposed. The key of CQR is to jointly optimize path selections of multiple flows so as to overcome the bandwidth fragment problem resulted from path optimization focusing on one data flow. The problem is summarized as multi-commodity problem. But because of space coupling characteristic of path selection within multiple flows in wireless channel, classical algorithms can't work. Interfered Link Set oriented bandwidth resource decomposition is proposed to transform the routing optimization of multiple flows to optimization of resource decomposition vector and the optimal solution is obtained in centralized manner with subgradient optimization method. Because the centralized algorithm is of high computation complexity and is hard to be directly used in WSN, Local Traffic Migration based CQR protocol is proposed; through quantitative analysis of relationship of topology knowledge and local traffic migration success probability, key parameter is optimized. LTM_CQR achieves higher bandwidth efficiency comparing to existed protocol.
3. Alice-Bob coding structure is studied in network coding aware routing algorithm. The condition under which paths of different traffics form Alice-Bob coding structures (AB condition, for short) is analyzed and series characteristic of two neighboring coding structure along one path is proved; A centralized Network Coding based Best effort Coupling Routing (NCBCR) algorithm is proposed, which adjusts paths of different data flows based on the AB condition and series characteristic to form as many as possible coding structures. NCBCR outperforms traditional aloghrithms by reducing end to end transmissions.
4. A Virtual Multipath Reliable routing protocol is proposed. VMR doesn't send specialized probing packet for reliability information of wireless link; instead, it sends data packets along possible paths and gather path reliability information at the same time. Interval estimation is used to evaluate quality of the paths and bad path filter method is proposed to dynamically choose the optimal path(s). Simulation shows that VMR outperforms reliable routing protocol AODV_ETX in both energy efficiency and reliability.
引文
[1]Alberto Cerpa, Jeremy Elson, Michael Hamilton, Jerry Zhao, Deborah Estrin, Lewis Girod. Habitat monitoring:application driver for wireless communications technology [A]. Proceedings of the ACM SIGCOM Workshop on Data communication in Latin America and the Caribbean [C]. San Jose, Costa Rica,2001:20-41.
[2]Akyildiz I F, Su W, Sankarasubramaniam Y. A survey on sensor networks [J]. IEEE Communications Magazine,2002,40(8):102-114.
[3]任丰原,黄海宁,林闯.无线传感器网络[J].软件学报,2003.1：1283-1291.
[4]孙利民,李建中,陈渝.无线传感器网络[M].北京：清华大学出版社,2005：1-5.
[5]Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar. Next century challenges:scalable coordination in sensor networks [A]. Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking[C]. Seattle, Washington, United States,1999:263-270.
[6]谷有臣,孔英.传感器技术的发展和趋势综述[J].物理实验,2002,22(12)：40-42.
[7]于海斌,曾鹏.智能无线传感器网络系统[M].北京：科学出版社,2006：1-5.
[8]Chong Chee-Yee, Srikanta P.Kumar. Sensor networks:evolution, opportunities and challenges [A]. Proceedings of the IEEE[C].US:IEEE press,2003:1247-1256.
[9]Callaway E H. Wireless Sensor Networks:Architecture and Protocols [M]. US:CRC Press John Wiley & Sons,2003:1-10.
[10]于宏毅等.无线传感器网络技术发展报告[R].郑州：信息工程大学,2005.8.
[11]Alan Mainwaring, David Culler, Joseph Polastre. Wireless sensor networks for habitat monitoring [A]. Proc.of the 1st ACM international workshop on Wireless sensor networks and applications[C]. Atlanta, Georgia:ACM Press,2002:88-97.
[12]E. I. Oyman and C. Ersoy. Multiple sink network design problem in large scale wireless sensor networks [A]. Proc. of IEEE ICC [C]. France:IEEE Press,2004:3663-3667.
[13]P. Thulasiraman, S. Ramasubramanian, and M. Krunz, Disjoint multipath routing to two distinct drains in a multi-drain sensor network [A]. Proc. of IEEE INFOCOM [C]. Anchorage:IEEE Press,2007:643-651.
[14]V. Shah-Mansouri and V. W. S. Wong. Bounds for lifetime maximization with multiple sinks in wireless sensor networks [A]. Proc. of IEEE Pacific Rim Conference on Communications, Computers and Signal Processing [C]. Victoria, Canada:IEEE Press, 2007:82-85.
[15]Vivek Mhatre Catherine Rosenberg. Design Guidelines for Wireless Sensor Networks: Communication, Clustering and Aggregation [J]. Ad Hoc Networks,2004.2(1),2004: 45-63.
[16]F. Hu, S. Kumar. Multimedia query with QoS considerations for wireless sensor networks in telemedicine [A]. Proc.of Society of Photo-Optical Instrumentation Engineers Intl. Conf. on Internet Multimedia Management Systems [C]. Orlando, FL:IEEE Press,2003.
[17]Tilak S, Abu-Ghazaleh S, and Heinzelman W. Taxonomy of wireless micro-sensor network models. Mobile Computing and Communications Review,2002,1(2):28-36.
[18]沈杰,姚道远,黄河清,刘海涛.野外地表无线传感器网信道传播模型的测定与分析[J].光学精密工程2008.1 141-149.
[19]谢金星,邢文训.网络优化[M]北京：清华大学出版社,2000：120-121.
[20]Dijkstra E. A note on two problems in connexion with graphs [J]. Numeriche Mathematics, 1:269-271.
[21]Ahuja R K, Magnanti T L, Orlin J B. Network Flows:Theory, Algorithms and Applications [M]. New Jersey:Prentice Hall,1993:133-134.
[22]Ford, L.R., and D.R. Fulkerson. Maximal flow through a network [J]. Canadian Journal of Mathematics,1956.8:399-404.
[23]Bellman, R. On a routing problem [J]. Quarterly of Applied Mathematics,1985.16:87-90.
[24]Implementation and efficiency of Moore-algorithms for shortest path problem. Mathematical Programming 1974.7:212-222
[25]Floyd, R.W. Algorithm 97. Shortest path[A]. Communications of ACM[C]. Los Angeles: ACM Press,1962.5:345.
[26]卢开澄.图论及其应用[M]北京：清华大学出版社,1981：25-31.
[27]Ford, L.R., and D.R. Fulkerson. Maximal flow through a network [J]. Canadian Journal of Mathematics 8,1956:399-404.
[28]Edmonds, J., R.M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems [J]. Journal of ACM,1972.19:248-264.
[29]Ahuja, R.K., T.L, Magnanti, and J.B. Orlin. Some recent advances in network flows [J]. SIAM Review,1991.33:175-219.
[30]Karzanov, A.V. Determining the maximal flow in a network by the method of preflows [J]. Soviet Mathematics Doklady,1974.15:434-437.
[31]Goldberg, A.V. A new max-flow algorithm[R]. Cambridge, MA:Laboratory for Computer Science, MIT,1985.
[32]Goldberg, A.V., and R.E. Tarjan. A new approach to the maximum flow problem [A]. Proceedings of 18th ACM symposium on the Theory of Computing [C]. Los Angeles: ACM Press,1986:136-146.
[33]Ahuja, R.K., J.B. Orlin, and R.E. Tarjan. Improved time bounds for maximum flow problem [J]. SIAM Journal on Computing,1989.18:939-954.
[34]田丰,马仲蕃.图与网络流理论[M].北京：科学出版社,1987：34-36.
[35]Klein, M. A primal method for minimal cost flows with application to the assignment and transportation problems [J]. Management Science,1967.14:205-220.
[36]Goldberg, A.V, R.E. Tarjan. Finding minimum-cost circulations by canceling negative cycles [A]. Proceedings of the 20th ACM symposium on the Theory of Computing[C]. Los Angeles:ACM Press,1988:388-397.
[37]Jewell, W.S. Optimal flow through networks [R]. Cambridge, MA:Operations Research Center, MIT,1958.
[38]Ahuja R K, Magnanti T L, Orlin J B. Network Flows:Theory, Algorithms and Applications[M]. Englewood Cliffs, New Jersey:Prentice Hall,1993:674-678.
[39]Cremeans J. E., R. A. Smith, G.R. Tyndall Optimal multicommodity network flow with resource allocation [J]. Naval Research Logistics Quarterly,1970.17:269-280.
[40]Kennington J L, M ShalabyAn effective sub gradient procedure fro minimal cost multicommodity flow problem[R]. Dallas TX:Southern Methodist University,1977.
[41]Graves, G.W., R.D. Mcbride The factorization approach of to large scale linear programming [J]. Mathematical Programming,1976.10:91-110.
[42]Dimitri Bertsekas and Robert Gallager. Data Networks (Second Edition)[M]. Englewood Cliffs (NJ):Prentice-Hall,1992:256-258.
[43]Charles E Perkins, Elizabeth M Royer. Ad hoc On Demand Distance Vector Routing [A]. In Proceedings of the 2nd IEEE Workshop on Mobile Systems and Applications, the 2nd IEEE Workshop on Mobile Systems and Applications [C]. New Orleans:IEEE,1999: 90-100.
[44]Charles E Perkins, Pravin Bhagwat. Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers [A]. Proceedings of SIGCOMM'94, ACM SIGCOMM'94 CONFERENCE Communications Architectures, Protocols and Applications [C]. London, UK:ACM Press,1994:234-244.
[45]Douglas E Comer.林瑶,蒋慧,杜蔚轩译.用TCP/IP进行网际互联,第一卷：原理、协议和体系结构(第3版)[M].北京：电子工业出版社,2001：150-152.
[46]RFC 3626-2003. Optimized Link State Routing Protocol (OLSR) [S].
[47]RFC 3684-2004. Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) [S].
[48]Pei Guangyu, Gerla Mario, Chen Tsu-Wei. Fisheye State Routing in Mobile Ad hoc Networks [A]. Proceedings of ICC'2000 [C], Taiwan:IEEE Press,2000:71-78.
[49]J.Hill D.Culler. MICA:A Wireless Platform for Deeply Embedded Networks [J]. IEEE Micro 2002.6:12-24.
[50]D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin and S. Wicker. Complex Behavior at Scale:An Experimental Study of Low-Power Wireless Sensor Networks [R]. Los Angeles:UCLA CS,2002.
[51]Ian F. Akyildiz, Tommaso Melodia, Kaushik R. Chowdhury. A survey on wireless multimedia sensor networks [J]. Computer networks,2007.4:921-960.
[52]FanYe, Zhong Gary, Cheng J, Lu Songwu, Zhang Lixia. PEAS:A Robust Energy Conserving Protocol for Long-lived Sensor Networks [A]. The 23rd International Conference on Distributed Computing Systems (ICDCS) [C]. US:IEEE Press,2003: 1-10.
[53]李建中,李金宝,石胜飞.传感器网络及其数据管理的概念、问题与进展[J].软件学报,2003.10：1717-1727.
[54]Olariu S, Stojmenovic I. Design guidelines for maximizing lifetime and avoiding energy holes in sensor networks with uniform distribution and uniform reporting [A]. Proceedings of the IEEE INFoCoM[C]. Barcelona, Spain:IEEE Press,2006:1-12.
[55]Li J, Mohapatra P. An analytical model for the energy hole problem in many-to-one sensor networks [A]. Proceedings of the IEEE Vehicular Technology Conference[C]. Dallas, TX:IEEE Press,2005:2721-2725.
[56]李宏,于宏毅支持QoS的无线传感器网络数据聚合技术研究计算机应用研究,2008.1：1-6.
[57]Heinzelman W. Chandrakasan A. Balakrishnan H. Energy-efficient communication protocol for wireless microsensor networks [A]. Proceedings of the 33rd Annual Hawaii int'l Conf. on System Sciences[C]. Maui, IEEE Computer Society,2002:3005-3014
[58]Bhardwaj M, Garnett T, Chandrakasan A P. Upper bounds on the lifetime of sensor networks [A]. IEEE International Conference on Communications (ICC'01) [C]. Helsinki, Finland:IEEE Press,2001:785-790.
[59]Stojmenovic I and Lin X. Power-aware localized routing in wireless networks [A]. Proc. Of 14th International Parallel and Distributed Processing Symposium[C].2000:371-376
[60]侯惠峰,刘湘雯,于宏毅,胡捍英.一种基于地理位置信息的无线传感器网最小能耗路由算法[J],电子与信息学报,2007,29(1)：177-181
[61]Dong-Wook Lee, Jai-Hoon Kim, Young-Bae Ko. An energy balanced data dissemination scheme for lifetime extension in wireless sensor networks [A]. Proc. of WNET 2005[C]. Banff, Alberta, Canada:ACTA Press.2005.
[62]Chang J-H, Tassiulas, L.. Energy conserving routing in wireless Ad-hoc networks [A]. Proc. of IEEE Infocom 2000[C], Tel Aviv,2000:22-31.
[63]Yu Y, Govindan R, Estrin D. Geographical and energy aware routing:a recursive data dissemination protocol for wireless sensor networks[R]. Los Angeles:UCLA,2001.
[64]Lian J, Naik K, Agnew G. Data capacity improvement of wireless sensor networks using nonuniform sensor distribution [J]. International Journal of Distributed Sensor Networks, 2006,2(2):121-145.
[65]Lian J, Chen L, Naik K, Otzu T, Agnew G. Modeling and enhancing the data capacity of wireless sensor networks [A]. Phoha S, La Porta T F, Griffin C eds. IEEE Monograph on Sensor Network Operations [C]. US:IEEE Press,2004:91-183.
[66]吴小兵、陈贵海.无线传感器网络中节点非均匀分布的能量空洞问题[J].计算机学报,2008.2：253-261.
[67]Wang W, Srinivasan V, Chua K. Using mobile relays to prolong the lifetime of wireless sensor networks [A]. Proceedings of the ACM MobiCom [C]. Cologne, Germany:ACM Press,2005:270-283.
[68]Luo J, Hubaux J P. Joint mobility and routing for lifetime elongation in wireless sensor networks [A]. Proceedings of the IEEE INFoCoM [C]. Seattle, WA:IEEE Press,2005: 819-830.
[69]Mhatre V and Rosenberg C. Design guidelines for wireless sensor networks: communication, clustering and aggregation [J]. Ad Hoc Networks,2004, (2):45-63.
[70]孙勇景博张宗麟张劫.分簇路由的无线传感器网络通信模式与能量有效性研究[J].电子与信息学报2007.9：2262-2264.
[71]I. Howitt, J. Wang. Energy balanced chain in wireless sensor networks. Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), US:IEEE Press, 2004.
[72]Perillo M, Cheng z, Heinzelman W. On the problem of unbalanced load distribution in wireless sensor networks [A]. Proceedings of the IEEE GLOBECOM Workshops on Wireless Ad Hoc and Sensor Networks [C]. Dallas, TX:IEEE Press,2004:74-79.
[73]J.N. Laneman. Cooperative Diversity in Wireless Networks Algorithms and Architectures [D]. Cambridge, MA:Massachusetts Institute of Technology,2002.
[74]Cui Shu-guang, Goldsmith A J, Bahai A. Energy-efficiency of MIMO and cooperative MIMO techniques in sensor networks [J]. IEEE Journal on Selected Areas of Communications,2004,22 (6):1089-1098.
[75]Khandani A., Abounadi J., Modiano E. and Zheng L. Cooperative Routing in Wireless Networks [A]. Proc. of. Allerton Conf. on Comm., Control, and Computing [C].2003: 1270-1279.
[76]Li, F.; Wu, K.; Lippman. Energy-efficient cooperative routing in multi-hop wireless ad hoc networks [A]. Performance, Computing, and Communications Conference 2006[C], 2006:215-222.
[77]Li X, Chen M, Liu W. Application of STBC-Encoded Cooperative Transmissions in Wireless Sensor Networks [J]. IEEE Signal Processing Letters,2005,12(2):134-137.
[78]D. Kotz, C. Newport and C. Elliott. The mistaken axioms of wireless network research [R]. Devonshire:Dartmouth College,2003.
[79]J. Zhao and R. Govindan. Understanding Packet Delivery Performance in Dense Wireless Sensor Networks [J]. ACM Sensys,2003:1-13.
[80]Zuniga, M. Krishnamachari, B. Analyzing the transitional region in low power wireless links [J]. IEEE SECON,2004:517-526.
[81]D. S. J. De Couto, D. Aguayo, J. Bicket and R. Morris. A High-Throughput Path Metric for Multi-Hop Wireless Routing [J]. ACM MobiCom,2003.9:134-146.
[82]B.Deb, S. Bhatnagar B.Nath. Information assurance in Wireless Sensor Networks [A]. Proc. of 2nd ACM International Workshop on Wireless Sensor Networks and Applications (WSNA) [C], San Diego, CA:ACM Press,2003:5-15.
[83]Alec Woo, David Culler. Evaluation of Efficient Link Reliability Estimators for Low-Power Wireless Networks [R]. Berkeley:UC BERKELEY,2003.
[84]Deb B, Bhatnagar S, Nath B. ReInForM. Reliable Information Forwarding using Multiple Paths in Sensor Networks [A]. Proceedings of 28th Annual IEEE Conf on Local Computer Networks (LCN'03) [C]. US:IEEE Press,2003:406-415.
[85]Ganesan D, Govindan R, Shenker S, and Estrin D. Highly Resilient, Energy Efficient Multipath Routing in wireless Sensor Networks [J]. ACM SGMOBILE Mobile Computing and Communications Review (MC2R),2002.4(5):11-25.
[86]D. Chen and P. K. Varshney, QoS support in wireless sensor networks:a survey [A]. Proc. International Conference on Wireless Networks (ICWN'04) [C]. Las Vegas, Nev, IEEE Press,2004:227-233.
[87]Mohamed Younis, Kemal Akkaya, Mohamed Eltoweissy, Ashraf Wadaa. On handling QoS traffic in wireless sensor networks [A]. Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) [C]. Hawaii:IEEE Press,2004:10-20.
[88]Yanjun Li, Chung Shue Chen, Ye-Qiong Song, Zhi Wang. Real-time QoS support in wireless sensor networks:a survey [A]. Proceedings of 7th IFAC International Conference on Fieldbuses & Networks in Industrial & Embedded Systems-FET'2007 [C].2007.
[89]Chenxi Zhu. Medium Access Control and Quality-of-Service Routing for Mobile Ad Hoc Networks [D]. College Park:University of Maryland,2001.
[90]C.R. Lin, J. Liu, QoS routing in ad hoc wireless networks [J]. IEEE Journal on Selected Areas in Communications,1999.8(17):1426-1438.
[91]C.R. Lin. On-demand QoS routing in multihop mobile networks [A]. Proceedings of IEEE INFOCOM [C]. US:IEEE Press,2001:1735-1744.
[92]Y. Chen, Y. Tseng, J. Sheu, P. Kuo. On-demand link state multi-path QoS routing in a wireless mobile ad-hoc network [A]. Proceedings of European Wireless [C].2002: 135-141.
[93]He, T., J.A. Stankovic, C. Lu and T. Abdelzaher. SPEED:a stateless protocol for real-time communication in sensor networks [A]. Proc. ICDCS 2003 [C].2003:46-55.
[94]Felemban, E., C.G. Lee and E. Ekici (2006). MM-SPEED:Multipath multi-speed protocol for QoS guarantee of reliability and timeliness in wireless sensor network [J]. IEEE Trans. Mobile Comput.5(6):738-754.
[95]Bo Hong and Viktor K. Prasanna. Optimizing system lifetime for data gathering in networked sensor systems [A]. AlgorithmS for Wireless and Ad-hoc Networks (A-SWAN) (Held in conjunction with MobiQuitous 2004)[C],US:IEEE Press,2004:48-63.
[96]R. Madan and S. Lall. Distributed algorithms for maximum lifetime routing in wireless sensor networks [A]. In IEEE Global Telecommunications Conference[C].US:IEEE Press, 2004:748-753.
[97]J. H. Chang and L. Tassiulas. Routing for maximum system lifetime in wireless ad hoc networks [A]. In 37th Annual Allerton Conf. Communication, Control, and Computing[C], September 1999.
[98]Charles Pandana, W. Pam Siriwongpairat, Thanongsak Himsoon, and K. J. Ray Liu Distributed Cooperative Routing Algorithms for Maximizing Network Lifetime[A]. Proc. of WCNC 2006[C].US:IEEE Press,2006:451-456.
[99]Wan-Jen Huang, Yao-Win Hong C.-C. Jay Kuo. Lifetime Maximization for Amplify-and-Forward Cooperative Networks [A]. Proc. of WCNC2007 [C].US:IEEE Press,2007:1-10.
[100]Zhu Han, H. Vincent Poor. Lifetime Improvement of Wireless Sensor Networks by Collaborative Beamforming and Cooperative Transmission [A]. Proc. of ICC 2007[C]. Glasgow:IEEE Press,2007:3954-3958.
[101]Thanongsak Himsoon, W. Pam Siriwongpairat, Zhu Han, K. J. Ray Liu Lifetime Maximization via Cooperative Nodes and Relay Deployment in Wireless Networks[J] IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS,2007.2(25): 306-317.
[102]樊昌信,张甫翊等,通信原理(第5版)[M].北京：国防工业出版社,2001.5：156-159.
[103]郭金淮.广义协作通信若干关键问题研究[D].郑州：信息工程大学,2008.
[104]Hou C., Bhaskar Krishnamachari. Localized topology generation mechanisms for wireless sensor networks [A] Proc. of Globecom 2003[C]. San Francisco, CA:IEEE Press,2003: 1269-1273.
[105]史琰,刘增基,盛敏.一种高效的分布式QoS路由算法的研究[J].电子与信息学报,2005.4：634-637.
[106]Sohrabi K, Gao J, Ailawadhi V, Pottie GJ. Protocols for self-organization of a wireless sensor networks [J]. IEEE Personal Communications,2000.7(5):16-27.
[107]Akkaya, K.; Younis, M. An energy-aware QoS routing protocol for wireless sensor networks [A]. Proceedings of 23rd International Conference on Distributed Computing Systems Workshops [C]. US:IEEE Press,2003:710-715.
[108]Carlson, E. Prehofer, C. Bettstetter et al. A Distributed End-to-End Reservation Protocol for IEEE 802.11-Based Wireless Mesh Networks [J]. IEEE Journal on Selected Areas in Communications,2006.11:2018-2027.
[109]Gepffrion A M, G W Graves. Multicommodity distribution system design by Benders decomposition [J]. Management Science 1974,20:822-844.
[110]张建中,许绍吉线性规划[M].北京：科学出版社,1997：140-141.
[111]胡运权,郭耀煌运筹学教程[M].北京：清华大学出版社,2007：48-74.
[112]Shaprio J F. Mathematical Programming:Structures and Algorithms [M]. New York: Wiley Press,1979:298-302.
[113]Kennington J L, M Shalaby An effective sub gradient procedure for minimal cost multicommodity flow problem[R]. Dallas TX:Southern Methodist University,1990.
[114]Buragohain, C.; Agrawal, D., Suri, S. Search-quality Tradeoffs for Routing in Non-ideal Wireless Networks [A]. Proc. of SECON 2006[C]. Reston, VA, USA:IEEE Press,2006: 10-19.
[115]张霞,于宏毅,杨锦亚.基于AODV的自组网QoS路由协议[J].电子与信息学报,2005.3：355-358.
[116]R. Ahlswede, N. Cai, S. R. Li, R. W. Yeung. Network Information Flow [J]. IEEE Transactions on Information Theory,2000.7(46):1204-1216.
[117]S. R. Li, R. W. Yeung, and N. Cai. Linear network coding [J]. IEEE Transactions on Information Theory,2003.2(49):371-381.
[118]S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, J. Crowcroft. XORs in the air:Practical wireless network coding [A]. ACM SIGCOMM 2006 [C]. Los Angeles:ACM Press, 2006:243-254.
[119]Jingyao Zhang, Pingyi Fan, K.B. Letaief, Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks[J]. IEEE Transactions on Communication,2008.4:598-607.
[120]S. Katti and D. Katabi. Mixit:The network meets the wireless channel. MIT-CSAIL-TR-2007-046[R],2007.9.
[121]S. Katti, D. Katabi, W. Hu, H. S. Rahul, and M. M'edard. The importance of being opportunistic:Practical network coding for wireless environments [A]. Proceedings of 43rd Allerton Conference on Communication, Control, and Computing[C],2005.
[122]David B Johnson, David A Maltz, Hu Yih-Chun. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR) [S]. Draft-ietf-manet-dsr-09.txt,2003.
[123]Bin Ni Santhapuri, Zifei Zhong Nelakuditi.Routing with opportunistically coded exchanges in wireless mesh networks[C]. Proc. of WiMesh 2006. Reston, VA:IEEE Press, 2005:157-159.
[124]Yunnan Wu Das, S.M. Chandra, Routing with a Markovian Metric to Promote Local Mixing [A]. Proc of INFOCOM 2007[C], Anchorage, AK:IEEE Press,2007:2381-2385.
[125]Qunfeng Dong, Jianming Wu, Wenjun Hu, Jon Crowcroft. Practical Network Coding in Wireless Networks [A]. Proc. of MobiCom'07[C], Montreal, Quebec, Canada:IEEE Press, 2007:306-309.
[126]Chin K W, John J, Aidan W, et al. Implementation experience with MANET routing protocols [J]. ACM Computer Communications Review,2002.32(5):49-59.
[127]Abtin K, Elif U B, Falk H, et al. Energy-efficient Link Assessment in Wireless Sensor Networks[C].Proceeding of IEEE Infocom 2004.Hong Kong:IEEE Press, 2004:1751-1761.
[128]Arati M, Dharma P, Agrawal. APTEEN:A Hybrid Protocol for Efficient Routing and Comprehensive Information Retrieval in Wireless Sensor Networks [A] Proc. of IPDPS 2002[C]. Florida:IEEE,2002:195-202.
[129]张贤达,保铮.通信信号处理[M].北京：国防工业出版社,2000：54-55.
[130]Amit P, Jardosh, Elizabeth M, et al. Real-World Environment Models for Mobile Network Evaluation [J]. IEEE Journal on Selected Areas in Communications,2005.3(23):622-632.
[131]UCN/LBL/VINT. The network simulator NS-2[DB/OL]. http://www.isi.edu/nsnam.
[2]Akyildiz I F, Su W, Sankarasubramaniam Y. A survey on sensor networks [J]. IEEE Communications Magazine,2002,40(8):102-114.
[3]任丰原,黄海宁,林闯.无线传感器网络[J].软件学报,2003.1：1283-1291.
[4]孙利民,李建中,陈渝.无线传感器网络[M].北京：清华大学出版社,2005：1-5.
[5]Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar. Next century challenges:scalable coordination in sensor networks [A]. Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking[C]. Seattle, Washington, United States,1999:263-270.
[6]谷有臣,孔英.传感器技术的发展和趋势综述[J].物理实验,2002,22(12)：40-42.
[7]于海斌,曾鹏.智能无线传感器网络系统[M].北京：科学出版社,2006：1-5.
[8]Chong Chee-Yee, Srikanta P.Kumar. Sensor networks:evolution, opportunities and challenges [A]. Proceedings of the IEEE[C].US:IEEE press,2003:1247-1256.
[9]Callaway E H. Wireless Sensor Networks:Architecture and Protocols [M]. US:CRC Press John Wiley & Sons,2003:1-10.
[10]于宏毅等.无线传感器网络技术发展报告[R].郑州：信息工程大学,2005.8.
[11]Alan Mainwaring, David Culler, Joseph Polastre. Wireless sensor networks for habitat monitoring [A]. Proc.of the 1st ACM international workshop on Wireless sensor networks and applications[C]. Atlanta, Georgia:ACM Press,2002:88-97.
[12]E. I. Oyman and C. Ersoy. Multiple sink network design problem in large scale wireless sensor networks [A]. Proc. of IEEE ICC [C]. France:IEEE Press,2004:3663-3667.
[13]P. Thulasiraman, S. Ramasubramanian, and M. Krunz, Disjoint multipath routing to two distinct drains in a multi-drain sensor network [A]. Proc. of IEEE INFOCOM [C]. Anchorage:IEEE Press,2007:643-651.
[14]V. Shah-Mansouri and V. W. S. Wong. Bounds for lifetime maximization with multiple sinks in wireless sensor networks [A]. Proc. of IEEE Pacific Rim Conference on Communications, Computers and Signal Processing [C]. Victoria, Canada:IEEE Press, 2007:82-85.
[15]Vivek Mhatre Catherine Rosenberg. Design Guidelines for Wireless Sensor Networks: Communication, Clustering and Aggregation [J]. Ad Hoc Networks,2004.2(1),2004: 45-63.
[16]F. Hu, S. Kumar. Multimedia query with QoS considerations for wireless sensor networks in telemedicine [A]. Proc.of Society of Photo-Optical Instrumentation Engineers Intl. Conf. on Internet Multimedia Management Systems [C]. Orlando, FL:IEEE Press,2003.
[17]Tilak S, Abu-Ghazaleh S, and Heinzelman W. Taxonomy of wireless micro-sensor network models. Mobile Computing and Communications Review,2002,1(2):28-36.
[18]沈杰,姚道远,黄河清,刘海涛.野外地表无线传感器网信道传播模型的测定与分析[J].光学精密工程2008.1 141-149.
[19]谢金星,邢文训.网络优化[M]北京：清华大学出版社,2000：120-121.
[20]Dijkstra E. A note on two problems in connexion with graphs [J]. Numeriche Mathematics, 1:269-271.
[21]Ahuja R K, Magnanti T L, Orlin J B. Network Flows:Theory, Algorithms and Applications [M]. New Jersey:Prentice Hall,1993:133-134.
[22]Ford, L.R., and D.R. Fulkerson. Maximal flow through a network [J]. Canadian Journal of Mathematics,1956.8:399-404.
[23]Bellman, R. On a routing problem [J]. Quarterly of Applied Mathematics,1985.16:87-90.
[24]Implementation and efficiency of Moore-algorithms for shortest path problem. Mathematical Programming 1974.7:212-222
[25]Floyd, R.W. Algorithm 97. Shortest path[A]. Communications of ACM[C]. Los Angeles: ACM Press,1962.5:345.
[26]卢开澄.图论及其应用[M]北京：清华大学出版社,1981：25-31.
[27]Ford, L.R., and D.R. Fulkerson. Maximal flow through a network [J]. Canadian Journal of Mathematics 8,1956:399-404.
[28]Edmonds, J., R.M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems [J]. Journal of ACM,1972.19:248-264.
[29]Ahuja, R.K., T.L, Magnanti, and J.B. Orlin. Some recent advances in network flows [J]. SIAM Review,1991.33:175-219.
[30]Karzanov, A.V. Determining the maximal flow in a network by the method of preflows [J]. Soviet Mathematics Doklady,1974.15:434-437.
[31]Goldberg, A.V. A new max-flow algorithm[R]. Cambridge, MA:Laboratory for Computer Science, MIT,1985.
[32]Goldberg, A.V., and R.E. Tarjan. A new approach to the maximum flow problem [A]. Proceedings of 18th ACM symposium on the Theory of Computing [C]. Los Angeles: ACM Press,1986:136-146.
[33]Ahuja, R.K., J.B. Orlin, and R.E. Tarjan. Improved time bounds for maximum flow problem [J]. SIAM Journal on Computing,1989.18:939-954.
[34]田丰,马仲蕃.图与网络流理论[M].北京：科学出版社,1987：34-36.
[35]Klein, M. A primal method for minimal cost flows with application to the assignment and transportation problems [J]. Management Science,1967.14:205-220.
[36]Goldberg, A.V, R.E. Tarjan. Finding minimum-cost circulations by canceling negative cycles [A]. Proceedings of the 20th ACM symposium on the Theory of Computing[C]. Los Angeles:ACM Press,1988:388-397.
[37]Jewell, W.S. Optimal flow through networks [R]. Cambridge, MA:Operations Research Center, MIT,1958.
[38]Ahuja R K, Magnanti T L, Orlin J B. Network Flows:Theory, Algorithms and Applications[M]. Englewood Cliffs, New Jersey:Prentice Hall,1993:674-678.
[39]Cremeans J. E., R. A. Smith, G.R. Tyndall Optimal multicommodity network flow with resource allocation [J]. Naval Research Logistics Quarterly,1970.17:269-280.
[40]Kennington J L, M ShalabyAn effective sub gradient procedure fro minimal cost multicommodity flow problem[R]. Dallas TX:Southern Methodist University,1977.
[41]Graves, G.W., R.D. Mcbride The factorization approach of to large scale linear programming [J]. Mathematical Programming,1976.10:91-110.
[42]Dimitri Bertsekas and Robert Gallager. Data Networks (Second Edition)[M]. Englewood Cliffs (NJ):Prentice-Hall,1992:256-258.
[43]Charles E Perkins, Elizabeth M Royer. Ad hoc On Demand Distance Vector Routing [A]. In Proceedings of the 2nd IEEE Workshop on Mobile Systems and Applications, the 2nd IEEE Workshop on Mobile Systems and Applications [C]. New Orleans:IEEE,1999: 90-100.
[44]Charles E Perkins, Pravin Bhagwat. Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers [A]. Proceedings of SIGCOMM'94, ACM SIGCOMM'94 CONFERENCE Communications Architectures, Protocols and Applications [C]. London, UK:ACM Press,1994:234-244.
[45]Douglas E Comer.林瑶,蒋慧,杜蔚轩译.用TCP/IP进行网际互联,第一卷：原理、协议和体系结构(第3版)[M].北京：电子工业出版社,2001：150-152.
[46]RFC 3626-2003. Optimized Link State Routing Protocol (OLSR) [S].
[47]RFC 3684-2004. Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) [S].
[48]Pei Guangyu, Gerla Mario, Chen Tsu-Wei. Fisheye State Routing in Mobile Ad hoc Networks [A]. Proceedings of ICC'2000 [C], Taiwan:IEEE Press,2000:71-78.
[49]J.Hill D.Culler. MICA:A Wireless Platform for Deeply Embedded Networks [J]. IEEE Micro 2002.6:12-24.
[50]D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin and S. Wicker. Complex Behavior at Scale:An Experimental Study of Low-Power Wireless Sensor Networks [R]. Los Angeles:UCLA CS,2002.
[51]Ian F. Akyildiz, Tommaso Melodia, Kaushik R. Chowdhury. A survey on wireless multimedia sensor networks [J]. Computer networks,2007.4:921-960.
[52]FanYe, Zhong Gary, Cheng J, Lu Songwu, Zhang Lixia. PEAS:A Robust Energy Conserving Protocol for Long-lived Sensor Networks [A]. The 23rd International Conference on Distributed Computing Systems (ICDCS) [C]. US:IEEE Press,2003: 1-10.
[53]李建中,李金宝,石胜飞.传感器网络及其数据管理的概念、问题与进展[J].软件学报,2003.10：1717-1727.
[54]Olariu S, Stojmenovic I. Design guidelines for maximizing lifetime and avoiding energy holes in sensor networks with uniform distribution and uniform reporting [A]. Proceedings of the IEEE INFoCoM[C]. Barcelona, Spain:IEEE Press,2006:1-12.
[55]Li J, Mohapatra P. An analytical model for the energy hole problem in many-to-one sensor networks [A]. Proceedings of the IEEE Vehicular Technology Conference[C]. Dallas, TX:IEEE Press,2005:2721-2725.
[56]李宏,于宏毅支持QoS的无线传感器网络数据聚合技术研究计算机应用研究,2008.1：1-6.
[57]Heinzelman W. Chandrakasan A. Balakrishnan H. Energy-efficient communication protocol for wireless microsensor networks [A]. Proceedings of the 33rd Annual Hawaii int'l Conf. on System Sciences[C]. Maui, IEEE Computer Society,2002:3005-3014
[58]Bhardwaj M, Garnett T, Chandrakasan A P. Upper bounds on the lifetime of sensor networks [A]. IEEE International Conference on Communications (ICC'01) [C]. Helsinki, Finland:IEEE Press,2001:785-790.
[59]Stojmenovic I and Lin X. Power-aware localized routing in wireless networks [A]. Proc. Of 14th International Parallel and Distributed Processing Symposium[C].2000:371-376
[60]侯惠峰,刘湘雯,于宏毅,胡捍英.一种基于地理位置信息的无线传感器网最小能耗路由算法[J],电子与信息学报,2007,29(1)：177-181
[61]Dong-Wook Lee, Jai-Hoon Kim, Young-Bae Ko. An energy balanced data dissemination scheme for lifetime extension in wireless sensor networks [A]. Proc. of WNET 2005[C]. Banff, Alberta, Canada:ACTA Press.2005.
[62]Chang J-H, Tassiulas, L.. Energy conserving routing in wireless Ad-hoc networks [A]. Proc. of IEEE Infocom 2000[C], Tel Aviv,2000:22-31.
[63]Yu Y, Govindan R, Estrin D. Geographical and energy aware routing:a recursive data dissemination protocol for wireless sensor networks[R]. Los Angeles:UCLA,2001.
[64]Lian J, Naik K, Agnew G. Data capacity improvement of wireless sensor networks using nonuniform sensor distribution [J]. International Journal of Distributed Sensor Networks, 2006,2(2):121-145.
[65]Lian J, Chen L, Naik K, Otzu T, Agnew G. Modeling and enhancing the data capacity of wireless sensor networks [A]. Phoha S, La Porta T F, Griffin C eds. IEEE Monograph on Sensor Network Operations [C]. US:IEEE Press,2004:91-183.
[66]吴小兵、陈贵海.无线传感器网络中节点非均匀分布的能量空洞问题[J].计算机学报,2008.2：253-261.
[67]Wang W, Srinivasan V, Chua K. Using mobile relays to prolong the lifetime of wireless sensor networks [A]. Proceedings of the ACM MobiCom [C]. Cologne, Germany:ACM Press,2005:270-283.
[68]Luo J, Hubaux J P. Joint mobility and routing for lifetime elongation in wireless sensor networks [A]. Proceedings of the IEEE INFoCoM [C]. Seattle, WA:IEEE Press,2005: 819-830.
[69]Mhatre V and Rosenberg C. Design guidelines for wireless sensor networks: communication, clustering and aggregation [J]. Ad Hoc Networks,2004, (2):45-63.
[70]孙勇景博张宗麟张劫.分簇路由的无线传感器网络通信模式与能量有效性研究[J].电子与信息学报2007.9：2262-2264.
[71]I. Howitt, J. Wang. Energy balanced chain in wireless sensor networks. Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), US:IEEE Press, 2004.
[72]Perillo M, Cheng z, Heinzelman W. On the problem of unbalanced load distribution in wireless sensor networks [A]. Proceedings of the IEEE GLOBECOM Workshops on Wireless Ad Hoc and Sensor Networks [C]. Dallas, TX:IEEE Press,2004:74-79.
[73]J.N. Laneman. Cooperative Diversity in Wireless Networks Algorithms and Architectures [D]. Cambridge, MA:Massachusetts Institute of Technology,2002.
[74]Cui Shu-guang, Goldsmith A J, Bahai A. Energy-efficiency of MIMO and cooperative MIMO techniques in sensor networks [J]. IEEE Journal on Selected Areas of Communications,2004,22 (6):1089-1098.
[75]Khandani A., Abounadi J., Modiano E. and Zheng L. Cooperative Routing in Wireless Networks [A]. Proc. of. Allerton Conf. on Comm., Control, and Computing [C].2003: 1270-1279.
[76]Li, F.; Wu, K.; Lippman. Energy-efficient cooperative routing in multi-hop wireless ad hoc networks [A]. Performance, Computing, and Communications Conference 2006[C], 2006:215-222.
[77]Li X, Chen M, Liu W. Application of STBC-Encoded Cooperative Transmissions in Wireless Sensor Networks [J]. IEEE Signal Processing Letters,2005,12(2):134-137.
[78]D. Kotz, C. Newport and C. Elliott. The mistaken axioms of wireless network research [R]. Devonshire:Dartmouth College,2003.
[79]J. Zhao and R. Govindan. Understanding Packet Delivery Performance in Dense Wireless Sensor Networks [J]. ACM Sensys,2003:1-13.
[80]Zuniga, M. Krishnamachari, B. Analyzing the transitional region in low power wireless links [J]. IEEE SECON,2004:517-526.
[81]D. S. J. De Couto, D. Aguayo, J. Bicket and R. Morris. A High-Throughput Path Metric for Multi-Hop Wireless Routing [J]. ACM MobiCom,2003.9:134-146.
[82]B.Deb, S. Bhatnagar B.Nath. Information assurance in Wireless Sensor Networks [A]. Proc. of 2nd ACM International Workshop on Wireless Sensor Networks and Applications (WSNA) [C], San Diego, CA:ACM Press,2003:5-15.
[83]Alec Woo, David Culler. Evaluation of Efficient Link Reliability Estimators for Low-Power Wireless Networks [R]. Berkeley:UC BERKELEY,2003.
[84]Deb B, Bhatnagar S, Nath B. ReInForM. Reliable Information Forwarding using Multiple Paths in Sensor Networks [A]. Proceedings of 28th Annual IEEE Conf on Local Computer Networks (LCN'03) [C]. US:IEEE Press,2003:406-415.
[85]Ganesan D, Govindan R, Shenker S, and Estrin D. Highly Resilient, Energy Efficient Multipath Routing in wireless Sensor Networks [J]. ACM SGMOBILE Mobile Computing and Communications Review (MC2R),2002.4(5):11-25.
[86]D. Chen and P. K. Varshney, QoS support in wireless sensor networks:a survey [A]. Proc. International Conference on Wireless Networks (ICWN'04) [C]. Las Vegas, Nev, IEEE Press,2004:227-233.
[87]Mohamed Younis, Kemal Akkaya, Mohamed Eltoweissy, Ashraf Wadaa. On handling QoS traffic in wireless sensor networks [A]. Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) [C]. Hawaii:IEEE Press,2004:10-20.
[88]Yanjun Li, Chung Shue Chen, Ye-Qiong Song, Zhi Wang. Real-time QoS support in wireless sensor networks:a survey [A]. Proceedings of 7th IFAC International Conference on Fieldbuses & Networks in Industrial & Embedded Systems-FET'2007 [C].2007.
[89]Chenxi Zhu. Medium Access Control and Quality-of-Service Routing for Mobile Ad Hoc Networks [D]. College Park:University of Maryland,2001.
[90]C.R. Lin, J. Liu, QoS routing in ad hoc wireless networks [J]. IEEE Journal on Selected Areas in Communications,1999.8(17):1426-1438.
[91]C.R. Lin. On-demand QoS routing in multihop mobile networks [A]. Proceedings of IEEE INFOCOM [C]. US:IEEE Press,2001:1735-1744.
[92]Y. Chen, Y. Tseng, J. Sheu, P. Kuo. On-demand link state multi-path QoS routing in a wireless mobile ad-hoc network [A]. Proceedings of European Wireless [C].2002: 135-141.
[93]He, T., J.A. Stankovic, C. Lu and T. Abdelzaher. SPEED:a stateless protocol for real-time communication in sensor networks [A]. Proc. ICDCS 2003 [C].2003:46-55.
[94]Felemban, E., C.G. Lee and E. Ekici (2006). MM-SPEED:Multipath multi-speed protocol for QoS guarantee of reliability and timeliness in wireless sensor network [J]. IEEE Trans. Mobile Comput.5(6):738-754.
[95]Bo Hong and Viktor K. Prasanna. Optimizing system lifetime for data gathering in networked sensor systems [A]. AlgorithmS for Wireless and Ad-hoc Networks (A-SWAN) (Held in conjunction with MobiQuitous 2004)[C],US:IEEE Press,2004:48-63.
[96]R. Madan and S. Lall. Distributed algorithms for maximum lifetime routing in wireless sensor networks [A]. In IEEE Global Telecommunications Conference[C].US:IEEE Press, 2004:748-753.
[97]J. H. Chang and L. Tassiulas. Routing for maximum system lifetime in wireless ad hoc networks [A]. In 37th Annual Allerton Conf. Communication, Control, and Computing[C], September 1999.
[98]Charles Pandana, W. Pam Siriwongpairat, Thanongsak Himsoon, and K. J. Ray Liu Distributed Cooperative Routing Algorithms for Maximizing Network Lifetime[A]. Proc. of WCNC 2006[C].US:IEEE Press,2006:451-456.
[99]Wan-Jen Huang, Yao-Win Hong C.-C. Jay Kuo. Lifetime Maximization for Amplify-and-Forward Cooperative Networks [A]. Proc. of WCNC2007 [C].US:IEEE Press,2007:1-10.
[100]Zhu Han, H. Vincent Poor. Lifetime Improvement of Wireless Sensor Networks by Collaborative Beamforming and Cooperative Transmission [A]. Proc. of ICC 2007[C]. Glasgow:IEEE Press,2007:3954-3958.
[101]Thanongsak Himsoon, W. Pam Siriwongpairat, Zhu Han, K. J. Ray Liu Lifetime Maximization via Cooperative Nodes and Relay Deployment in Wireless Networks[J] IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS,2007.2(25): 306-317.
[102]樊昌信,张甫翊等,通信原理(第5版)[M].北京：国防工业出版社,2001.5：156-159.
[103]郭金淮.广义协作通信若干关键问题研究[D].郑州：信息工程大学,2008.
[104]Hou C., Bhaskar Krishnamachari. Localized topology generation mechanisms for wireless sensor networks [A] Proc. of Globecom 2003[C]. San Francisco, CA:IEEE Press,2003: 1269-1273.
[105]史琰,刘增基,盛敏.一种高效的分布式QoS路由算法的研究[J].电子与信息学报,2005.4：634-637.
[106]Sohrabi K, Gao J, Ailawadhi V, Pottie GJ. Protocols for self-organization of a wireless sensor networks [J]. IEEE Personal Communications,2000.7(5):16-27.
[107]Akkaya, K.; Younis, M. An energy-aware QoS routing protocol for wireless sensor networks [A]. Proceedings of 23rd International Conference on Distributed Computing Systems Workshops [C]. US:IEEE Press,2003:710-715.
[108]Carlson, E. Prehofer, C. Bettstetter et al. A Distributed End-to-End Reservation Protocol for IEEE 802.11-Based Wireless Mesh Networks [J]. IEEE Journal on Selected Areas in Communications,2006.11:2018-2027.
[109]Gepffrion A M, G W Graves. Multicommodity distribution system design by Benders decomposition [J]. Management Science 1974,20:822-844.
[110]张建中,许绍吉线性规划[M].北京：科学出版社,1997：140-141.
[111]胡运权,郭耀煌运筹学教程[M].北京：清华大学出版社,2007：48-74.
[112]Shaprio J F. Mathematical Programming:Structures and Algorithms [M]. New York: Wiley Press,1979:298-302.
[113]Kennington J L, M Shalaby An effective sub gradient procedure for minimal cost multicommodity flow problem[R]. Dallas TX:Southern Methodist University,1990.
[114]Buragohain, C.; Agrawal, D., Suri, S. Search-quality Tradeoffs for Routing in Non-ideal Wireless Networks [A]. Proc. of SECON 2006[C]. Reston, VA, USA:IEEE Press,2006: 10-19.
[115]张霞,于宏毅,杨锦亚.基于AODV的自组网QoS路由协议[J].电子与信息学报,2005.3：355-358.
[116]R. Ahlswede, N. Cai, S. R. Li, R. W. Yeung. Network Information Flow [J]. IEEE Transactions on Information Theory,2000.7(46):1204-1216.
[117]S. R. Li, R. W. Yeung, and N. Cai. Linear network coding [J]. IEEE Transactions on Information Theory,2003.2(49):371-381.
[118]S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, J. Crowcroft. XORs in the air:Practical wireless network coding [A]. ACM SIGCOMM 2006 [C]. Los Angeles:ACM Press, 2006:243-254.
[119]Jingyao Zhang, Pingyi Fan, K.B. Letaief, Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks[J]. IEEE Transactions on Communication,2008.4:598-607.
[120]S. Katti and D. Katabi. Mixit:The network meets the wireless channel. MIT-CSAIL-TR-2007-046[R],2007.9.
[121]S. Katti, D. Katabi, W. Hu, H. S. Rahul, and M. M'edard. The importance of being opportunistic:Practical network coding for wireless environments [A]. Proceedings of 43rd Allerton Conference on Communication, Control, and Computing[C],2005.
[122]David B Johnson, David A Maltz, Hu Yih-Chun. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR) [S]. Draft-ietf-manet-dsr-09.txt,2003.
[123]Bin Ni Santhapuri, Zifei Zhong Nelakuditi.Routing with opportunistically coded exchanges in wireless mesh networks[C]. Proc. of WiMesh 2006. Reston, VA:IEEE Press, 2005:157-159.
[124]Yunnan Wu Das, S.M. Chandra, Routing with a Markovian Metric to Promote Local Mixing [A]. Proc of INFOCOM 2007[C], Anchorage, AK:IEEE Press,2007:2381-2385.
[125]Qunfeng Dong, Jianming Wu, Wenjun Hu, Jon Crowcroft. Practical Network Coding in Wireless Networks [A]. Proc. of MobiCom'07[C], Montreal, Quebec, Canada:IEEE Press, 2007:306-309.
[126]Chin K W, John J, Aidan W, et al. Implementation experience with MANET routing protocols [J]. ACM Computer Communications Review,2002.32(5):49-59.
[127]Abtin K, Elif U B, Falk H, et al. Energy-efficient Link Assessment in Wireless Sensor Networks[C].Proceeding of IEEE Infocom 2004.Hong Kong:IEEE Press, 2004:1751-1761.
[128]Arati M, Dharma P, Agrawal. APTEEN:A Hybrid Protocol for Efficient Routing and Comprehensive Information Retrieval in Wireless Sensor Networks [A] Proc. of IPDPS 2002[C]. Florida:IEEE,2002:195-202.
[129]张贤达,保铮.通信信号处理[M].北京：国防工业出版社,2000：54-55.
[130]Amit P, Jardosh, Elizabeth M, et al. Real-World Environment Models for Mobile Network Evaluation [J]. IEEE Journal on Selected Areas in Communications,2005.3(23):622-632.
[131]UCN/LBL/VINT. The network simulator NS-2[DB/OL]. http://www.isi.edu/nsnam.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |