无线传感器网络负载均衡GAF算法研究
|
摘要
无线传感器网络以数据为中心形成转发路径,由于节点能量和资源有限,对路由协议的设计提出了高能效、低时延、负载均衡等特殊要求,是无线传感器网络研究的热点。针对大规模节点的传感器网络,论文从无线传感器网络节点负载均衡的角度,提出了两种路由算法
(1)栅格错位的负载均衡GAF算法(GAFDG)
GAFDG算法是GAF算法基础上提出的。GAFDG算法与GAF算法相比,其最大的区别是对监测区域进行了栅格错位划分。GAFDG算法在各栅格中选择一个簇首,其簇首选择机制采用“最小能量消耗原则”。GAF算法的各簇首可以与上、下、左、右四个栅格的簇首进行通信；而GAFDG算法的各栅格与六个栅格相邻,其各簇首可以和六个相邻簇首进行通信。因此,由各簇首构建的无线传感器网络的骨干网络进行通信时,GAFDG算法在路由选择的方向性上优于GAF算法。理论证明,GAFDG算法的单跳信号覆盖范围比GAF算法扩大了12%。仿真测试结果也表明,GAFDG算法在能耗和网络生存时间等性能均优于GAF算法。
(2)层次蜂窝结构的负载均衡GAF算法(GAFHH)
GAFHH算法是在蜂窝结构的GAF算法(GAFH)的基础上提出的。GAFHH算法与GAFH算法的主要区别是：GAFH算法的每个蜂窝内的节点组成一簇,而GAFHH算法由几个相邻蜂窝内的节点组成一簇。GAFHH算法对监测区域进行蜂窝栅格划分,在节点单跳通信半径R的约束下,几个相邻的栅格内的节点组成一簇,各簇的栅格按照其在簇中的位置进行统一编号。选择在簇中间的栅格为活跃栅格,并按照“最大剩余能量原则”在活跃栅格中选择一个节点作为簇首,由各簇首构建无线传感器网络的骨干网络进行通信。在下一轮的开始,重新选择活跃栅格,并移动各簇的边界,使得活跃栅格始终位于其簇的中间位置。仿真测试中,GAFHH算法与GAFDG算法和GAFH算法进行对比。仿真结果表明,前者在网络负载均衡和网络吞吐量等性能优越后两者。因此,GAFHH算法的提出是有一定意义的。
论文提出的GAFDG和GAFHH两种算法,按照相应规则进行栅格划分及节点组织成簇,并根据各自特点,分别采用“最小能量消耗原则”和“最大剩余能量原则”选择簇首,由各簇首构建无线传感器网络的骨干网络进行通信,合理地从空间上调度了网络的能量资源,延长网络的生存期,达到了网络负载均衡的目的。论文最后阐述了无线传感器网络在煤田火区远程监测中的应用,其中的路由技术采用了类似GAFHH算法,目的是均衡各节点负载。
The network layer of wireless sensor network (WSN) forms the transmission path based on data-centric concept. As the node energy and resources are limited, the design of routing algorithm should meet energy-efficient, low latency, load balance and other special requirements which are hot issues in current WSN research. Two routing algorithms are respectively proposed for load balance in large scale sensor networks:
(1) the Load-balancing GAF Algorithm of Dislocated Grid for WSN (GAFDG)
GAFDG is proposed which based on the GAF. The biggest difference between GAFDG and GAF is that the grids in GAFDG are dislocated arrangement, but the grids in GAF are aligned arrangement. Nodes are selected as cluster heads according to "the principle of minimum energy consumption" in GAFDG. Each cluster head of GAF can communicate with four cluster heads which respective in the up, down, left, and right the four adjacent grids except the cluster head in the edge grid. While each grid has six adjacent grids in GAFDG. Therefore, each cluster head of GAFDG can communicate with six adjacent cluster heads. Therefore, when the backbone network of WSN, which is constructed by all cluster heads, is communicating, GAFDG is better than GAF in orientation of routing. Theoretically proofing, the single-hop coverage area of GAFDG is wider 12% than GAF. Simulation results also show that energy consumption and network lifetime of GAFDG are superior to GAF.
(2) the Load-balancing GAF Algorithm of Hierarchical Honeycomb Structure for WSN (GAFHH)
GAFHH is proposed which based on the GAF Algorithm of Honeycomb Structure for WSN (GAFH). The major difference between GAFHH and GAFH is:the nodes within the same honeycomb grid construct a cluster in GAFH, while the cluster in GAFHH is constructed by the nodes that belong to several adjacent honeycomb grids. The monitoring area is divided into honeycomb grids in GAFHH, and the nodes belong to several adjacent honeycomb grids construct a cluster which is restricted by single-hop communication radius R of node, and each grid is unified numbered according to its position in the cluster. Selecting a middle grid as a active grid in each cluster, and adopting "the principle of maximum residual energy" to select a active node as a cluster head in each active grid. And all cluster heads construct the backbone network of WSN is using of communicating. At the beginning of the next round, re-selecting the active grid, and moving the boundaries of each cluster to make the active grid is always in the center of the cluster. In the simulation, GAFHH compare with GAFDG and GAFH, and simulation results show that the load balancing and throughput of the former are superior to the latter two. Therefore, the proposing of GAFHH is a certain significance.
GAFDG and GAFHH are proposed in the paper, respectively dividing monitoring area into the dislocated square girds and honeycomb grids and making the nodes construct a cluster by the corresponding rules, and respectively adopting "the principle of minimum energy consumption" and "the principle of maximum residual energy" to select cluster heads, and the backbone network of WSN is constructed by all cluster heads. Reasonably dispatching the energy resources from the space, extending the network lifetime, and achieving the purpose of load balancing. Finally, the paper describes the application of WSN in remote monitoring system of Coal-field Fires, whose routing had adopted a similar GAFHH to balance the load of each node.
(1)栅格错位的负载均衡GAF算法(GAFDG)
GAFDG算法是GAF算法基础上提出的。GAFDG算法与GAF算法相比,其最大的区别是对监测区域进行了栅格错位划分。GAFDG算法在各栅格中选择一个簇首,其簇首选择机制采用“最小能量消耗原则”。GAF算法的各簇首可以与上、下、左、右四个栅格的簇首进行通信；而GAFDG算法的各栅格与六个栅格相邻,其各簇首可以和六个相邻簇首进行通信。因此,由各簇首构建的无线传感器网络的骨干网络进行通信时,GAFDG算法在路由选择的方向性上优于GAF算法。理论证明,GAFDG算法的单跳信号覆盖范围比GAF算法扩大了12%。仿真测试结果也表明,GAFDG算法在能耗和网络生存时间等性能均优于GAF算法。
(2)层次蜂窝结构的负载均衡GAF算法(GAFHH)
GAFHH算法是在蜂窝结构的GAF算法(GAFH)的基础上提出的。GAFHH算法与GAFH算法的主要区别是：GAFH算法的每个蜂窝内的节点组成一簇,而GAFHH算法由几个相邻蜂窝内的节点组成一簇。GAFHH算法对监测区域进行蜂窝栅格划分,在节点单跳通信半径R的约束下,几个相邻的栅格内的节点组成一簇,各簇的栅格按照其在簇中的位置进行统一编号。选择在簇中间的栅格为活跃栅格,并按照“最大剩余能量原则”在活跃栅格中选择一个节点作为簇首,由各簇首构建无线传感器网络的骨干网络进行通信。在下一轮的开始,重新选择活跃栅格,并移动各簇的边界,使得活跃栅格始终位于其簇的中间位置。仿真测试中,GAFHH算法与GAFDG算法和GAFH算法进行对比。仿真结果表明,前者在网络负载均衡和网络吞吐量等性能优越后两者。因此,GAFHH算法的提出是有一定意义的。
论文提出的GAFDG和GAFHH两种算法,按照相应规则进行栅格划分及节点组织成簇,并根据各自特点,分别采用“最小能量消耗原则”和“最大剩余能量原则”选择簇首,由各簇首构建无线传感器网络的骨干网络进行通信,合理地从空间上调度了网络的能量资源,延长网络的生存期,达到了网络负载均衡的目的。论文最后阐述了无线传感器网络在煤田火区远程监测中的应用,其中的路由技术采用了类似GAFHH算法,目的是均衡各节点负载。
The network layer of wireless sensor network (WSN) forms the transmission path based on data-centric concept. As the node energy and resources are limited, the design of routing algorithm should meet energy-efficient, low latency, load balance and other special requirements which are hot issues in current WSN research. Two routing algorithms are respectively proposed for load balance in large scale sensor networks:
(1) the Load-balancing GAF Algorithm of Dislocated Grid for WSN (GAFDG)
GAFDG is proposed which based on the GAF. The biggest difference between GAFDG and GAF is that the grids in GAFDG are dislocated arrangement, but the grids in GAF are aligned arrangement. Nodes are selected as cluster heads according to "the principle of minimum energy consumption" in GAFDG. Each cluster head of GAF can communicate with four cluster heads which respective in the up, down, left, and right the four adjacent grids except the cluster head in the edge grid. While each grid has six adjacent grids in GAFDG. Therefore, each cluster head of GAFDG can communicate with six adjacent cluster heads. Therefore, when the backbone network of WSN, which is constructed by all cluster heads, is communicating, GAFDG is better than GAF in orientation of routing. Theoretically proofing, the single-hop coverage area of GAFDG is wider 12% than GAF. Simulation results also show that energy consumption and network lifetime of GAFDG are superior to GAF.
(2) the Load-balancing GAF Algorithm of Hierarchical Honeycomb Structure for WSN (GAFHH)
GAFHH is proposed which based on the GAF Algorithm of Honeycomb Structure for WSN (GAFH). The major difference between GAFHH and GAFH is:the nodes within the same honeycomb grid construct a cluster in GAFH, while the cluster in GAFHH is constructed by the nodes that belong to several adjacent honeycomb grids. The monitoring area is divided into honeycomb grids in GAFHH, and the nodes belong to several adjacent honeycomb grids construct a cluster which is restricted by single-hop communication radius R of node, and each grid is unified numbered according to its position in the cluster. Selecting a middle grid as a active grid in each cluster, and adopting "the principle of maximum residual energy" to select a active node as a cluster head in each active grid. And all cluster heads construct the backbone network of WSN is using of communicating. At the beginning of the next round, re-selecting the active grid, and moving the boundaries of each cluster to make the active grid is always in the center of the cluster. In the simulation, GAFHH compare with GAFDG and GAFH, and simulation results show that the load balancing and throughput of the former are superior to the latter two. Therefore, the proposing of GAFHH is a certain significance.
GAFDG and GAFHH are proposed in the paper, respectively dividing monitoring area into the dislocated square girds and honeycomb grids and making the nodes construct a cluster by the corresponding rules, and respectively adopting "the principle of minimum energy consumption" and "the principle of maximum residual energy" to select cluster heads, and the backbone network of WSN is constructed by all cluster heads. Reasonably dispatching the energy resources from the space, extending the network lifetime, and achieving the purpose of load balancing. Finally, the paper describes the application of WSN in remote monitoring system of Coal-field Fires, whose routing had adopted a similar GAFHH to balance the load of each node.
引文
[1]Martin T. Wearable and ubiquitous computing. Pervasive Computing,2003,2(3):8-12.
[2]Akyildiz IF, Su W, Sankarasubramaniam Y, et al. A survey on sensor network. IEEE Communications Magazine,2002,40(8):102-114.
[3]Itziar Marin, EduardoArceredillo, Aitzol Zuloaga, Jagoba Arizs. Wireless sensor networks:A survey on ultra-low Power-aware design. Transactionson Engineering, Computing and Technology, October 2005:44-49.
[4]崔莉,鞠海玲,苗勇等.无线传感器网络研究进展[J].计算机研究与发展.2005,42(1)：163-174.
[5]于宏毅.无线移动自组织网.北京：人民邮电出版社,2005.
[6]Elizabeth M, Toh C K. A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Network. IEEE Personal Communications Magazine,1999(4):46-55.
[7]Estrin D, Govindan R, Heidemann J, ect., and Kumar S. Next century challenges: Scalablecoordination in sensor networks. In:Proceedings of the 5th annual ACM/IEEE international conference on Mobile Computing and Networkint (MobiCom'99),1999:263-270.
[8]任丰原,黄海宁,林闯.无线传感器网络.软件学报,2003,14(7)：1282-1291.
[9]Akyildiz IF, Su W, Sankarasubramaniam Y. Wireless sensor networks:a survey. Computer Networks, 2002,38(4):393-422.
[10]I. Stojmenovic, A.P. Ruhil, D.K. Lobiyal. Voronoi diagram and convex hull based geocasting and routing in wireless networks[J]. Wireless Communications & Mobile Computing,2006,6(2):247-258.
[11]1 H. Zhang, J.C. Hou. Maintaining Sensing Coverage and Connectivity in Large Sensor Networks[R]. In:Proceeding of the 2004 NSF International Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks,2004:251-262.
[12]R.C. Shah, J.M. Rabaey. Energy Aware Routing for Low Energy Ad hoc Sensor Networks[C]. In Proceeding of the IEEE Wireless Communications and Network Conference(WCNC'02), 2002:350-355.
[13]Dong X, Purl A. A DSDV-Based Multipath Routing Protocol for Ad-hoc Mobile Networks[DB/OL]. http://www.ece.queensu.ca/hpages/faculty/yeh/program.txt,2002.
[14]Marina M K, Das S R. On-demand Multipath Distance Vector Routing for Ad Hoc Networks[R]. In Proc of the International Conference for Network Protocols (ICNP), Riverside, USA,2001, pp.14-23.
[15]L. Wang, L. F. Zhang, Y T. Shu, M. Dong, and O. W. W. Yang, Multipath Source Routing in Wireless Ad Hoc Networks[R], In Proceedings of the IEEE CCECE,2000, PP.479-483.
[16]Wajahat Mateen, Saqib Raza, Zartash A. Uzmi and Shahab Baqai, Adaptive Multi-path On-Demand Routing in Mobile Ad Hoc Networks[R], In Proc of the 8th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05),2005, PP.237-244.
[17]A Nasipuri, SR Das. On-Demand Multipath Routing for Mobile Ad Hoc Networks[M]. Computer Communications and Networks,1999, pp.64-70.
[18]Deepak Ganesan, Ranmesh Govindan, Scott Shenker and Deborah Estrin. Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks[J]. Mobile Computing and Communication Review Vol.1(2), pp.3-5.
[19]Canfeng Chen, Weiling, WuZheng Li. Multipath Routing Modeling in Ad Hoc Networks, IEEE,2005, pp.2794-2798.
[20]Xiaoqing Zhu and B. Girod, A Distributed Algorithm for Congestion-Minimized Multi-Path routing over Ad Hoc Netwroks[R], IEEE International Conference on 2005, pp.1484-1487.
[21]E. Setton, X. Zhu, and B. Girod. Congestion-optimized multipath streaming of video over ad hoc wireless networks[R], International Conference on Multimedia and Expo(ICME-04),2004, PP.1619-1622.
[22]Kulik J. Heinzelman WR, Balakrishnan H. Negotiation based protocols for disseminating information in wireless sensor network. Wireless Networks,2002,8(2-3), pp.169-185.
[23]K. Akkaya, M. Younis. A survey on routing protocols for wireless sensor networks[DB/OL]. Ad Hoc Netwroks, http://www.cs.umbc.edu/～kemall/mypapers/Akkaya_Younis_JoAdHoc Revised.pdf, 2003.
[24]Intanagonwiwat C, Govindan R, Estrin D, Heidemann J. Directed diffusion for wireless sensor networking[J]. IEEE/ACM Trans on Networking,2003,11(1), pp.2-16.
[25]Niculescu D, Nath B. Trajectory based forwarding and its applications[R]. In:Proc. of the 9th Annual Int'l Conf. on Mobile Computing and Networking,2003, pp.260-272.
[26]Sohrabi K, Gao J, Ailawadhi V, Pottie GJ. Protocols for self-organizaiton of a wireless sensor network[J]. IEEE Personal Commuincations,2000,7(5), pp.16-27.
[27]V. D. Park and M. S. Corson, A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks[R], In Proc. of the IEEE INFOCOM'97.1997, pp.1405-1413.
[28]Wang, L. F. Zhang, Y. T. Shu, M. Dong, and O. W. W. Yang. Adaptive Multipath Source Routing in Wireless Ad Hoc Networks[R], IEEE ICC'98, Helsinki, Finland, June 2001, pp.867-871.
[29]Lee S J, Gerla M. Split Multipath Routing with Maximally Disjoint Paths in Ad hoc Networks[R]. IEEE ICC2001.
[30]Shah R C, Rabaey J M, Energy aware routing for low energy ad hoc sensor networks[R]. In Proc IEEE Wireless communications and Networking Conference(WCN'02), IEEE,2002, vol.1, pp.350-355.
[31]W.B. Heinzelman, A.P. Chandrakasan, H. Balakrishnan, et al. Application-Specific protocol architectures for wireless networks[D]. Boston:Massachusetts Institute of Technology,2000.
[32]1 O. Younis, S. Fahmy. Heed:A hybrid, energy-efficient, distributed clustering approach for ad-hoc sensor networks[J]. IEEE Trans. on Mobile Computing,2004,3(4):660-669.
[33]1 M. Ye, C.F. Li, G.H. Chen, et al. EECS:An energy efficient clustering scheme in wireless sensor networks[C]. In:Proc. of the IEEE Int'l Performance Computing and Communications Conf. New York:IEEE Press,2005:535-540.
[34]1 C.F. Li, G.H. Chen, M. Ye, et al. An Uneven Cluster-Based Routing Protocol for Wireless Sensor Networks[J]. Chinese Journal of Computers,2007,30(1):27-36.
[35]T.S. Chen, H.W. Tsai, C.P. Chu. Gathering-Load-Balanced Tree Protocol for Wireless Sensor Networks[C]. In Proceeding of 2006 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing,2006,2:8-13.
[36]1 H. Dai, R. Han. A node-centric load balancing algorithm for wireless sensor networks[C]. In:Proc. of the Global Telecommunications Conf. (GLOBECOM). San Francisco:IEEE Press,2003, pp.548-552.
[37]Chen Tzung-Shi, Tsai Hua-Wen, Chu Chih-Ping. Gathering-load-balanced Tree Protocol for Wireless Sensor Networks[C]//Proc. of IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing. [S.I.]:IEEE Press,2006. pp.8-13.
[38]Yang H, Ye F, Sikdar B. A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks[C]//Proc. of the IEEE Wireless Communications and Networking Conference. Atlanta, USA:IEEE Press,2004. pp.1715-1720.
[39]Zhang Chongqing, Li Minglu, Wu Minyou. An Approach for Constructing Load-balancing Networks for Data Gathering Wireless Sensor Networks[J]. Journal of Software,2007,18(5), pp.1110-1121.
[40]胡丹,李士宁,李志刚,沈晶晶.无线传感器网络动态负载均衡树路由算法,计算机工程,2009,35(23),91-94.
[41]龚本灿,李腊元,蒋廷耀,徐守志.基于生成树的无线传感器网络分布式路由协议,微电子学与计算机,2008,25(11),77-84.
[42]Arnab Chakrabarti, Ashutosh Sabharwal, Behnaam Aazhang. Using Predicable Observer Mobility for Power-Efficient Design of Sensor Networks[A]. The 2nd International Workshop on Information Processing in Sensor Networks(IPSN2003),2003, PP.22-23.
[43]W. Wang, V. Srinivasan, K.C. Chua. Using mobile relays to prolong the lifetime of wireless sensor networks[C]. Proc. of the 11th Annual Int'l Conf. on Mobile Computing and Networking, New York: ACM Press,2005:270-283.
[44]王勇,王万良.一种基于移动Sink的无线传感器网络路由算法,机电工程,2010,27(2),17-20.
[45]J. Luo, J.P. Hubaux. Joint mobility and routing for lifetime elongation in wireless sensor networks[C]. In:Proc. of the 24th IEEE INFOCOM. Washington:IEEE Computer Society,2005:1735-1746.
[46]1 S.R. Gandham, M. Dawande, R. Prakash, et al. Energy-Efficient schemes for wireless sensor networks with multiple mobile base stations[C]. In:Proc. of the IEEE GLOBECOM. Washington: IEEE Computer Society,2003:377-381.
[47]1 Z.M. Wang, S. Basagni, E. Melachrinoudis, et al. Exploiting sink mobility for maximizing sensor networks lifetime[C]. In:Proc. of the 38th Hawaii Int'l Conf. on System Sciences. Washington:IEEE Computer Society,2005:287-295.
[48]1 J. Polastre, R. Szewczyk, D. Culler. Telos:Enabling ultra-low power wireless research[C]. In Proc. Fourth International Conference on Information Processing in Sensor Networks:Special track on Platform Tools and Design Methods for Network Embedded Sensors (IPSN/SPOTS),2005.
[49]1 G.T. Shi, M.H. Liao. Movement-Assisted Data Gathering Scheme with Load-Balancing for Sensor Networks[J]. Journal of Software,2007,18(9):2235-2244.
[50]E. Sakhaee, N. Wakamiya, M. Murata. "GPS-free disaster-scale mapping and energy-efficient alerting scheme in a wireless sensor network," Second International Conference on Sensor Technologies and Applications,2008, pp.73-80.
[51]Y. Xu, J. Heidemann, D. Estrin. "Geogrph-informed energy conservation for Ad hoc routing," Proceedings-7th Annual International Conference on Mobile Computing and Networking,2001, PP.70-84.
[52]Blough D M, Snati P. Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc network[C]//In:Proc of 8th Annual Int'l Conf on Mobile Computing and Networking. Atlanta, GA, USA:ACM Press,2002:183-192.
[53]X. Liu, H. Yu, H. Hou and H. Hu. "Grid Routing Based Oil Link Reachable with Probability in Wireless Sensor Networks," Journal of Electronics&Information Technology, vol.30, no.9,2008, pp.2259-2262.
[54]Y. Shen, Q. Xu, Q. Pei and J. Ma. "Grid-based routing protocol in wireless sensor networks," Journal on Communications, vol.30, no.11A,2009, pp.96-100.
[55]C. Yun and P. Wang. "Virtual Grid based Routing Protocol for wireless sensor network," Computer Applications and Software, vol.6, no.9,2009, pp.200-203.
[56]Z. Yuan and J. Li. "Geographic routing algorithm based on virtual force for WSN," Application Research of Computem, vol.26, no.6,2009, pp.113-116.
[57]M. Zorzi and R. Rao. "Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Multihop performance," IEEE Transactions on Mobile Computing, vol.2, no.4,2003, pp.337-348.
[58]M. Zorzi, R. Rao. "Geographic random forwarding(GeRaF) for ad hoc and sensor networks:Energy and latency performance," IEEE Transactions on Mobile Computing, vol.2, no.4,2003, pp.349-365.
[59]S. Liu, L. Liu and J. Tao. "Improved GAF Algorithm with Hexagon-Based Virtual Infrastructure,' COMPLWER TECHNOLOGY AND DEVELOPMENT, vol.19, no.1,2009, pp.39-43.
[60]Y. Zhao and P. Cao. "Grid-based for Energy Conservation around Obstacles in Wireless Sensor Networks," Proceedings-5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009,2009, pp.1-4.
[61]T. Osawa et al. "Implementation of Hierarchical GAF, a Cooperative in Wireless Sensor Networks," Proc.Globecom'06,2006.
[62]Tseng Y C, Hsieh T Y. Fully Power-Aware and Location-Aware Protocols for wireless Multi-hop Ad hoc Networks[C]//Proc 11th Int'l Conf on Computer Communication and Netwroks. [s.l.]:IEEE Press, 2002:608-613.
[63]Blough D M, Santi P. Investigating Upper Bounds on Network Lifetime Extension for Cell-based Energy Conservation Techniques in Stationary Ad hoc Network[C]//Proc of 8th Annual Int'l Conf on Mobile Computing and Networking. Atlanta, GA, USA:ACM Press,2002:183-192.
[2]Akyildiz IF, Su W, Sankarasubramaniam Y, et al. A survey on sensor network. IEEE Communications Magazine,2002,40(8):102-114.
[3]Itziar Marin, EduardoArceredillo, Aitzol Zuloaga, Jagoba Arizs. Wireless sensor networks:A survey on ultra-low Power-aware design. Transactionson Engineering, Computing and Technology, October 2005:44-49.
[4]崔莉,鞠海玲,苗勇等.无线传感器网络研究进展[J].计算机研究与发展.2005,42(1)：163-174.
[5]于宏毅.无线移动自组织网.北京：人民邮电出版社,2005.
[6]Elizabeth M, Toh C K. A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Network. IEEE Personal Communications Magazine,1999(4):46-55.
[7]Estrin D, Govindan R, Heidemann J, ect., and Kumar S. Next century challenges: Scalablecoordination in sensor networks. In:Proceedings of the 5th annual ACM/IEEE international conference on Mobile Computing and Networkint (MobiCom'99),1999:263-270.
[8]任丰原,黄海宁,林闯.无线传感器网络.软件学报,2003,14(7)：1282-1291.
[9]Akyildiz IF, Su W, Sankarasubramaniam Y. Wireless sensor networks:a survey. Computer Networks, 2002,38(4):393-422.
[10]I. Stojmenovic, A.P. Ruhil, D.K. Lobiyal. Voronoi diagram and convex hull based geocasting and routing in wireless networks[J]. Wireless Communications & Mobile Computing,2006,6(2):247-258.
[11]1 H. Zhang, J.C. Hou. Maintaining Sensing Coverage and Connectivity in Large Sensor Networks[R]. In:Proceeding of the 2004 NSF International Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks,2004:251-262.
[12]R.C. Shah, J.M. Rabaey. Energy Aware Routing for Low Energy Ad hoc Sensor Networks[C]. In Proceeding of the IEEE Wireless Communications and Network Conference(WCNC'02), 2002:350-355.
[13]Dong X, Purl A. A DSDV-Based Multipath Routing Protocol for Ad-hoc Mobile Networks[DB/OL]. http://www.ece.queensu.ca/hpages/faculty/yeh/program.txt,2002.
[14]Marina M K, Das S R. On-demand Multipath Distance Vector Routing for Ad Hoc Networks[R]. In Proc of the International Conference for Network Protocols (ICNP), Riverside, USA,2001, pp.14-23.
[15]L. Wang, L. F. Zhang, Y T. Shu, M. Dong, and O. W. W. Yang, Multipath Source Routing in Wireless Ad Hoc Networks[R], In Proceedings of the IEEE CCECE,2000, PP.479-483.
[16]Wajahat Mateen, Saqib Raza, Zartash A. Uzmi and Shahab Baqai, Adaptive Multi-path On-Demand Routing in Mobile Ad Hoc Networks[R], In Proc of the 8th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05),2005, PP.237-244.
[17]A Nasipuri, SR Das. On-Demand Multipath Routing for Mobile Ad Hoc Networks[M]. Computer Communications and Networks,1999, pp.64-70.
[18]Deepak Ganesan, Ranmesh Govindan, Scott Shenker and Deborah Estrin. Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks[J]. Mobile Computing and Communication Review Vol.1(2), pp.3-5.
[19]Canfeng Chen, Weiling, WuZheng Li. Multipath Routing Modeling in Ad Hoc Networks, IEEE,2005, pp.2794-2798.
[20]Xiaoqing Zhu and B. Girod, A Distributed Algorithm for Congestion-Minimized Multi-Path routing over Ad Hoc Netwroks[R], IEEE International Conference on 2005, pp.1484-1487.
[21]E. Setton, X. Zhu, and B. Girod. Congestion-optimized multipath streaming of video over ad hoc wireless networks[R], International Conference on Multimedia and Expo(ICME-04),2004, PP.1619-1622.
[22]Kulik J. Heinzelman WR, Balakrishnan H. Negotiation based protocols for disseminating information in wireless sensor network. Wireless Networks,2002,8(2-3), pp.169-185.
[23]K. Akkaya, M. Younis. A survey on routing protocols for wireless sensor networks[DB/OL]. Ad Hoc Netwroks, http://www.cs.umbc.edu/～kemall/mypapers/Akkaya_Younis_JoAdHoc Revised.pdf, 2003.
[24]Intanagonwiwat C, Govindan R, Estrin D, Heidemann J. Directed diffusion for wireless sensor networking[J]. IEEE/ACM Trans on Networking,2003,11(1), pp.2-16.
[25]Niculescu D, Nath B. Trajectory based forwarding and its applications[R]. In:Proc. of the 9th Annual Int'l Conf. on Mobile Computing and Networking,2003, pp.260-272.
[26]Sohrabi K, Gao J, Ailawadhi V, Pottie GJ. Protocols for self-organizaiton of a wireless sensor network[J]. IEEE Personal Commuincations,2000,7(5), pp.16-27.
[27]V. D. Park and M. S. Corson, A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks[R], In Proc. of the IEEE INFOCOM'97.1997, pp.1405-1413.
[28]Wang, L. F. Zhang, Y. T. Shu, M. Dong, and O. W. W. Yang. Adaptive Multipath Source Routing in Wireless Ad Hoc Networks[R], IEEE ICC'98, Helsinki, Finland, June 2001, pp.867-871.
[29]Lee S J, Gerla M. Split Multipath Routing with Maximally Disjoint Paths in Ad hoc Networks[R]. IEEE ICC2001.
[30]Shah R C, Rabaey J M, Energy aware routing for low energy ad hoc sensor networks[R]. In Proc IEEE Wireless communications and Networking Conference(WCN'02), IEEE,2002, vol.1, pp.350-355.
[31]W.B. Heinzelman, A.P. Chandrakasan, H. Balakrishnan, et al. Application-Specific protocol architectures for wireless networks[D]. Boston:Massachusetts Institute of Technology,2000.
[32]1 O. Younis, S. Fahmy. Heed:A hybrid, energy-efficient, distributed clustering approach for ad-hoc sensor networks[J]. IEEE Trans. on Mobile Computing,2004,3(4):660-669.
[33]1 M. Ye, C.F. Li, G.H. Chen, et al. EECS:An energy efficient clustering scheme in wireless sensor networks[C]. In:Proc. of the IEEE Int'l Performance Computing and Communications Conf. New York:IEEE Press,2005:535-540.
[34]1 C.F. Li, G.H. Chen, M. Ye, et al. An Uneven Cluster-Based Routing Protocol for Wireless Sensor Networks[J]. Chinese Journal of Computers,2007,30(1):27-36.
[35]T.S. Chen, H.W. Tsai, C.P. Chu. Gathering-Load-Balanced Tree Protocol for Wireless Sensor Networks[C]. In Proceeding of 2006 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing,2006,2:8-13.
[36]1 H. Dai, R. Han. A node-centric load balancing algorithm for wireless sensor networks[C]. In:Proc. of the Global Telecommunications Conf. (GLOBECOM). San Francisco:IEEE Press,2003, pp.548-552.
[37]Chen Tzung-Shi, Tsai Hua-Wen, Chu Chih-Ping. Gathering-load-balanced Tree Protocol for Wireless Sensor Networks[C]//Proc. of IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing. [S.I.]:IEEE Press,2006. pp.8-13.
[38]Yang H, Ye F, Sikdar B. A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks[C]//Proc. of the IEEE Wireless Communications and Networking Conference. Atlanta, USA:IEEE Press,2004. pp.1715-1720.
[39]Zhang Chongqing, Li Minglu, Wu Minyou. An Approach for Constructing Load-balancing Networks for Data Gathering Wireless Sensor Networks[J]. Journal of Software,2007,18(5), pp.1110-1121.
[40]胡丹,李士宁,李志刚,沈晶晶.无线传感器网络动态负载均衡树路由算法,计算机工程,2009,35(23),91-94.
[41]龚本灿,李腊元,蒋廷耀,徐守志.基于生成树的无线传感器网络分布式路由协议,微电子学与计算机,2008,25(11),77-84.
[42]Arnab Chakrabarti, Ashutosh Sabharwal, Behnaam Aazhang. Using Predicable Observer Mobility for Power-Efficient Design of Sensor Networks[A]. The 2nd International Workshop on Information Processing in Sensor Networks(IPSN2003),2003, PP.22-23.
[43]W. Wang, V. Srinivasan, K.C. Chua. Using mobile relays to prolong the lifetime of wireless sensor networks[C]. Proc. of the 11th Annual Int'l Conf. on Mobile Computing and Networking, New York: ACM Press,2005:270-283.
[44]王勇,王万良.一种基于移动Sink的无线传感器网络路由算法,机电工程,2010,27(2),17-20.
[45]J. Luo, J.P. Hubaux. Joint mobility and routing for lifetime elongation in wireless sensor networks[C]. In:Proc. of the 24th IEEE INFOCOM. Washington:IEEE Computer Society,2005:1735-1746.
[46]1 S.R. Gandham, M. Dawande, R. Prakash, et al. Energy-Efficient schemes for wireless sensor networks with multiple mobile base stations[C]. In:Proc. of the IEEE GLOBECOM. Washington: IEEE Computer Society,2003:377-381.
[47]1 Z.M. Wang, S. Basagni, E. Melachrinoudis, et al. Exploiting sink mobility for maximizing sensor networks lifetime[C]. In:Proc. of the 38th Hawaii Int'l Conf. on System Sciences. Washington:IEEE Computer Society,2005:287-295.
[48]1 J. Polastre, R. Szewczyk, D. Culler. Telos:Enabling ultra-low power wireless research[C]. In Proc. Fourth International Conference on Information Processing in Sensor Networks:Special track on Platform Tools and Design Methods for Network Embedded Sensors (IPSN/SPOTS),2005.
[49]1 G.T. Shi, M.H. Liao. Movement-Assisted Data Gathering Scheme with Load-Balancing for Sensor Networks[J]. Journal of Software,2007,18(9):2235-2244.
[50]E. Sakhaee, N. Wakamiya, M. Murata. "GPS-free disaster-scale mapping and energy-efficient alerting scheme in a wireless sensor network," Second International Conference on Sensor Technologies and Applications,2008, pp.73-80.
[51]Y. Xu, J. Heidemann, D. Estrin. "Geogrph-informed energy conservation for Ad hoc routing," Proceedings-7th Annual International Conference on Mobile Computing and Networking,2001, PP.70-84.
[52]Blough D M, Snati P. Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc network[C]//In:Proc of 8th Annual Int'l Conf on Mobile Computing and Networking. Atlanta, GA, USA:ACM Press,2002:183-192.
[53]X. Liu, H. Yu, H. Hou and H. Hu. "Grid Routing Based Oil Link Reachable with Probability in Wireless Sensor Networks," Journal of Electronics&Information Technology, vol.30, no.9,2008, pp.2259-2262.
[54]Y. Shen, Q. Xu, Q. Pei and J. Ma. "Grid-based routing protocol in wireless sensor networks," Journal on Communications, vol.30, no.11A,2009, pp.96-100.
[55]C. Yun and P. Wang. "Virtual Grid based Routing Protocol for wireless sensor network," Computer Applications and Software, vol.6, no.9,2009, pp.200-203.
[56]Z. Yuan and J. Li. "Geographic routing algorithm based on virtual force for WSN," Application Research of Computem, vol.26, no.6,2009, pp.113-116.
[57]M. Zorzi and R. Rao. "Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Multihop performance," IEEE Transactions on Mobile Computing, vol.2, no.4,2003, pp.337-348.
[58]M. Zorzi, R. Rao. "Geographic random forwarding(GeRaF) for ad hoc and sensor networks:Energy and latency performance," IEEE Transactions on Mobile Computing, vol.2, no.4,2003, pp.349-365.
[59]S. Liu, L. Liu and J. Tao. "Improved GAF Algorithm with Hexagon-Based Virtual Infrastructure,' COMPLWER TECHNOLOGY AND DEVELOPMENT, vol.19, no.1,2009, pp.39-43.
[60]Y. Zhao and P. Cao. "Grid-based for Energy Conservation around Obstacles in Wireless Sensor Networks," Proceedings-5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009,2009, pp.1-4.
[61]T. Osawa et al. "Implementation of Hierarchical GAF, a Cooperative in Wireless Sensor Networks," Proc.Globecom'06,2006.
[62]Tseng Y C, Hsieh T Y. Fully Power-Aware and Location-Aware Protocols for wireless Multi-hop Ad hoc Networks[C]//Proc 11th Int'l Conf on Computer Communication and Netwroks. [s.l.]:IEEE Press, 2002:608-613.
[63]Blough D M, Santi P. Investigating Upper Bounds on Network Lifetime Extension for Cell-based Energy Conservation Techniques in Stationary Ad hoc Network[C]//Proc of 8th Annual Int'l Conf on Mobile Computing and Networking. Atlanta, GA, USA:ACM Press,2002:183-192.