无线传感器网络中的信息压缩与路由技术研究
|
摘要
无线传感器网络诞生于大规模集成电路高速发展,无线通信技术逐步成熟和微电机技术日新月异的今天。由于其对传感器节点大小的苛求,导致了传感器节点供电系统的先天不足。这种能量的有限性使得所有着眼于无线传感器网络的研究都要首先考虑一个重要的问题,能量有效性。本文从两个方面来探讨实现无线传感器网络的能量有效性,对节点间传递信息的压缩和实现能量有效的路由算法。
由于无线传感器网络中节点的能量受限,因此在设计算法时要考虑尽量避免节点间的过多通信,所以分布式算法是一种适合于无线传感器网络的设计方法。根据仙农的信道编码定理可知,如果对多个信源进行联合压缩则多个信源的联合熵可以作为发送这些信息的总速率以实现无损译码。但是在无线传感器网络中,能否利用分布式压缩来实现信息的压缩呢?
分布式信源编码理论证明在具有相关性的信源间进行分布式无损压缩,仍然可以采用联合熵作为总的传输速率。本文首先介绍分布式信源编码定理,详细的介绍了Slepian-Wolf和Wyner-Ziv关于分布式信源编码的理论基础,然后介绍了一种利用伴随式和卷积码译码实现分布式信源编码的方法。通过对译码过程的分析,本文给出了这个译码算法的修正方法,并且通过对错误比特的分类统计详细地分析了改进算法的作用和它对错误比特的纠正。同时,本文实现了基于上述算法原理的二进制信道下的分布式信源编码方法,并对译码错误情况的仿真结果进行了分析,结果表明由于受到卷积码译码器性能的影响,如果需要获得较好的译码性能需要采用更加高效的信道编码系统。
然后本文介绍了近几年在信道编码领域引起高度重视的性能优异的LDPC编码算法,介绍了LDPC编码在分布式信源编码领域的应用,同时介绍了一种基于伴随式的LDPC码的分布式信源编码方法。在对这种方法进行分析时,本文没有力求表现出它的优异性能,而是从独特的视角进行分析。本文考察LDPC方法在不同码长下的性能,仿真的结果显示LDPC方法的译码性能随着码字长度的减少呈快速下降趋势,瀑布型的仿真曲线逐渐趋缓,因此基于LDPC编码的分布式信源编码方法适用于码字长度较长的应用环境。随后,我们提出了一种应用多进制LDPC编码实现多进制分布式信源编码的方案,与前人的工作不同,我们采用了更为普通的高斯信源作为输入信源,同时多进制LDPC编码方案也改进了基于卷积码的分布式信源编码方案的译码性能,仿真的结果表明在一定的压缩率下,这个方法可以获得非常好的译码结果。
路由是无线传感器网络中非常重要的技术之一,其中分簇式的路由协议由于其具有较强的鲁棒性,灵活性和能量有效性成为研究者关注的重点。本文并没有将研究的重点放在改进协议本身上,而是将其他技术与路由协议相结合来实现传感器网络的能量有效性。首先,通过对分簇路由算法能量模型的分析,我们提出利用本地信噪比这个指标有目的地选择簇内节点传输数据,从而避免了大量节点传递数据的能量消耗。仿真的结果表明该算法能够有效的平衡不同类型能量的消耗,节省节点的能量消耗,延长网络的生存期,并且不会对目标状态的判断造成较大的影响。为了克服无法准确判断目标与节点间的位置而影响目标跟踪的问题,我们提出了一种基于距离比例的方法来估计目标的位置。节点所估计的目标的状态大多与距离成一定的比例关系,因此本方法可以与状态估计相结合来判断目标的位置信息。仿真的结果表明这种方法描绘的目标路径比较贴近目标的真实路径,可以有效的估计目标的位置信息。
最后,本文给出了一个简单的架构将分布式信源编码与分簇式路由协议相结合。该方法利用簇头上的数据作为边信息来解码从簇内节点传送过来的压缩信息,仿真的结果表明利用两者结合可以较好的实现网络的能量有效性。
Nowadays, with the development of wireless communication and electronics, a new kind of network has become a hot research area, that is wireless sensor networks. Because of the needs for small size sensor nodes, the power supply of this kind of network is always limited. Thus, the most important factor of designing the protocols for wireless sensor networks is energy efficiency. In this paper, the energy efficiency of wireless sensor networks is discussed in two aspects, information compression and energy efficient routing protocols.
Due to the limitation of power supply, avoiding the unnecessary communication among sensors is preferred. One way that can achieve this goal is to adopt distributed algorithms. According to Shannon's theory, joint entropy is enough for transferring correlated sources when they can communicate with each other. But, if distributed compression is needed, the joint entropy can also be sufficient?
Distributed source coding theory demonstrates that the joint entropy limit can also be achieved by distributed compression. In this paper, distributed source coding theory is firstly introduced, especially Slepian-Wolf and Wnyer-Ziv's milestone theories. After that a distributed source coding method by using syndromes is presented. This paper explores the decoding process and gives the modification methods. After analyzing the classified decoding errors, the results demonstrate that the proposed methods can effectively improve the decoding performance. This method is also implemented under binary channels. The simulation results show that in order to obtain a better decoding performance, the powerful channel codes such as Turbo code and LDPC code must be adopted.
Next, the LDPC code which attracts much attention during these years in channel code field is introduced. And its applications in distributed source coding areas are also presented. A syndrome based method is presented and analyzed in a new view. The simulation does not focus on getting better performance, but on comparing the error probabilities under different code lengths. The results show that the decoding performance drops quickly with the decreasing of code length. It means that LDPC method should better be used in a larger code length circumstance. At the end, a non-binary LDPC method is proposed. As difference from others work, here, a more general source generating method is used. The simulation results show that this method achieves much better decoding performance under lower compression rate.
Routing is one of the most important techniques in wireless sensor networks. Because of its robustness, flexibility and energy efficiency, clustered routing protocols attract much attention. This paper does not focus on modifying the protocols, but on adopting other technologies to cooperate with routing protocols to realize energy efficiency. First, by analyzing the energy model of clustered routing protocols, a local SNR aid method is proposed. By choosing suitable inner cluster sensors for data transferring, it avoids consuming the energy on all sensors and save a large amount of energy. The simulation results show that this method can balance the different kinds of energy consumptions, save the power of sensor nodes, prolong network life time and do not affect the target state estimation results. Second, a target tracking method by using the proportion of distance is proposed. In some cases, it is hard to decide the distance between sensor nodes and the target, but the value of most target state estimation result is proportion to the distance between target and sensor nodes. So this proportion can be used to estimate the target position. The simulation results show that the locus of target drawn by this method is close to the original locus, so it can be used estimate the target location.
At last, a simple architecture to combine distributed source coding and clustered routing protocols is proposed. The information on cluster head can be used as side information and help decoding the compressed information transferred from inner cluster sensor nodes. The simulation results show that with the cooperation of these two technologies, it effectively realizes the energy efficiency.
由于无线传感器网络中节点的能量受限,因此在设计算法时要考虑尽量避免节点间的过多通信,所以分布式算法是一种适合于无线传感器网络的设计方法。根据仙农的信道编码定理可知,如果对多个信源进行联合压缩则多个信源的联合熵可以作为发送这些信息的总速率以实现无损译码。但是在无线传感器网络中,能否利用分布式压缩来实现信息的压缩呢?
分布式信源编码理论证明在具有相关性的信源间进行分布式无损压缩,仍然可以采用联合熵作为总的传输速率。本文首先介绍分布式信源编码定理,详细的介绍了Slepian-Wolf和Wyner-Ziv关于分布式信源编码的理论基础,然后介绍了一种利用伴随式和卷积码译码实现分布式信源编码的方法。通过对译码过程的分析,本文给出了这个译码算法的修正方法,并且通过对错误比特的分类统计详细地分析了改进算法的作用和它对错误比特的纠正。同时,本文实现了基于上述算法原理的二进制信道下的分布式信源编码方法,并对译码错误情况的仿真结果进行了分析,结果表明由于受到卷积码译码器性能的影响,如果需要获得较好的译码性能需要采用更加高效的信道编码系统。
然后本文介绍了近几年在信道编码领域引起高度重视的性能优异的LDPC编码算法,介绍了LDPC编码在分布式信源编码领域的应用,同时介绍了一种基于伴随式的LDPC码的分布式信源编码方法。在对这种方法进行分析时,本文没有力求表现出它的优异性能,而是从独特的视角进行分析。本文考察LDPC方法在不同码长下的性能,仿真的结果显示LDPC方法的译码性能随着码字长度的减少呈快速下降趋势,瀑布型的仿真曲线逐渐趋缓,因此基于LDPC编码的分布式信源编码方法适用于码字长度较长的应用环境。随后,我们提出了一种应用多进制LDPC编码实现多进制分布式信源编码的方案,与前人的工作不同,我们采用了更为普通的高斯信源作为输入信源,同时多进制LDPC编码方案也改进了基于卷积码的分布式信源编码方案的译码性能,仿真的结果表明在一定的压缩率下,这个方法可以获得非常好的译码结果。
路由是无线传感器网络中非常重要的技术之一,其中分簇式的路由协议由于其具有较强的鲁棒性,灵活性和能量有效性成为研究者关注的重点。本文并没有将研究的重点放在改进协议本身上,而是将其他技术与路由协议相结合来实现传感器网络的能量有效性。首先,通过对分簇路由算法能量模型的分析,我们提出利用本地信噪比这个指标有目的地选择簇内节点传输数据,从而避免了大量节点传递数据的能量消耗。仿真的结果表明该算法能够有效的平衡不同类型能量的消耗,节省节点的能量消耗,延长网络的生存期,并且不会对目标状态的判断造成较大的影响。为了克服无法准确判断目标与节点间的位置而影响目标跟踪的问题,我们提出了一种基于距离比例的方法来估计目标的位置。节点所估计的目标的状态大多与距离成一定的比例关系,因此本方法可以与状态估计相结合来判断目标的位置信息。仿真的结果表明这种方法描绘的目标路径比较贴近目标的真实路径,可以有效的估计目标的位置信息。
最后,本文给出了一个简单的架构将分布式信源编码与分簇式路由协议相结合。该方法利用簇头上的数据作为边信息来解码从簇内节点传送过来的压缩信息,仿真的结果表明利用两者结合可以较好的实现网络的能量有效性。
Nowadays, with the development of wireless communication and electronics, a new kind of network has become a hot research area, that is wireless sensor networks. Because of the needs for small size sensor nodes, the power supply of this kind of network is always limited. Thus, the most important factor of designing the protocols for wireless sensor networks is energy efficiency. In this paper, the energy efficiency of wireless sensor networks is discussed in two aspects, information compression and energy efficient routing protocols.
Due to the limitation of power supply, avoiding the unnecessary communication among sensors is preferred. One way that can achieve this goal is to adopt distributed algorithms. According to Shannon's theory, joint entropy is enough for transferring correlated sources when they can communicate with each other. But, if distributed compression is needed, the joint entropy can also be sufficient?
Distributed source coding theory demonstrates that the joint entropy limit can also be achieved by distributed compression. In this paper, distributed source coding theory is firstly introduced, especially Slepian-Wolf and Wnyer-Ziv's milestone theories. After that a distributed source coding method by using syndromes is presented. This paper explores the decoding process and gives the modification methods. After analyzing the classified decoding errors, the results demonstrate that the proposed methods can effectively improve the decoding performance. This method is also implemented under binary channels. The simulation results show that in order to obtain a better decoding performance, the powerful channel codes such as Turbo code and LDPC code must be adopted.
Next, the LDPC code which attracts much attention during these years in channel code field is introduced. And its applications in distributed source coding areas are also presented. A syndrome based method is presented and analyzed in a new view. The simulation does not focus on getting better performance, but on comparing the error probabilities under different code lengths. The results show that the decoding performance drops quickly with the decreasing of code length. It means that LDPC method should better be used in a larger code length circumstance. At the end, a non-binary LDPC method is proposed. As difference from others work, here, a more general source generating method is used. The simulation results show that this method achieves much better decoding performance under lower compression rate.
Routing is one of the most important techniques in wireless sensor networks. Because of its robustness, flexibility and energy efficiency, clustered routing protocols attract much attention. This paper does not focus on modifying the protocols, but on adopting other technologies to cooperate with routing protocols to realize energy efficiency. First, by analyzing the energy model of clustered routing protocols, a local SNR aid method is proposed. By choosing suitable inner cluster sensors for data transferring, it avoids consuming the energy on all sensors and save a large amount of energy. The simulation results show that this method can balance the different kinds of energy consumptions, save the power of sensor nodes, prolong network life time and do not affect the target state estimation results. Second, a target tracking method by using the proportion of distance is proposed. In some cases, it is hard to decide the distance between sensor nodes and the target, but the value of most target state estimation result is proportion to the distance between target and sensor nodes. So this proportion can be used to estimate the target position. The simulation results show that the locus of target drawn by this method is close to the original locus, so it can be used estimate the target location.
At last, a simple architecture to combine distributed source coding and clustered routing protocols is proposed. The information on cluster head can be used as side information and help decoding the compressed information transferred from inner cluster sensor nodes. The simulation results show that with the cooperation of these two technologies, it effectively realizes the energy efficiency.
引文
[1]Akyildiz IF,Su W,Sankarasubramaniam Y,Cayirci E:A survey on sensor networks[J],IEEE Communications Magazine,2002,40(8):102-114
[2]任丰原,黄海宁,林闯:无线传感器网络[J],软件学报,vol.14,no.8,2003:1281-1291
[3]Manges W:It's Time for Sensors to Go Wireless[J],Sensors Magazine,1999:4-5
[4]Kahn J.Next Century Challenges:Mobile Networking for "Smart Dust"[C],Conference on Mobile Computing and Networking,1999,.
[5]ALERT[OL].Flood warning technologies,2003.http://www.altersystem.org
[6]极地遥感研究[OL].http://www.irsa.ac.cn/cn/info/browse.jsp?id=899&column=461
[7]Noury N,Herve T,Rialle V,Virone G,Mercier E.Monitoring behavior in home using a smart fall sensor[C],In Proceedings of the IEEE-EMBS Special Topic Conference on Microtechnologies in Medicine and Biology.IEEE Computer Society,2000:607-610
[8]赵泽,崔莉:一种基于无线传感器网络的远程医疗监护系统[J],信息与控制,vol.35,no.2,2006:265-269
[9]CodeBlue:Wireless Sensor Networks for Medical Care[OL].www.eecs.harvard.edu/～mdw/proj/codeblue/.
[10]TinyOS[OL].http://www.tinyos.net
[11]Haas ZJ,Halpern JY,Li L:Gossip-Based ad-hoc routing[C],In Proceeding of the IEEE INFOCOM.New York:IEEE Communications Society,2002:1707-1716
[12]Kulik J,Heinzelman WR,Balakrishnan H:Negotiation based protocols for disseminating information in wireless sensor networks[J],Wireless Networks,vol.8,no.2-3,2002:169-185
[13]Intanagonwiwat C,Govindan R,Estrin D,Heidemann J:Directed diffusion for wireless sensor networking[J],IEEE/ACM Transaction on Networking,vol.11,no.1,2003:2-16
[14]Braginsky D,Estrin D:Rumor routing algorithm for sensor networks[C],In Proceeding of the 1st workshop on sensor networks and applications.Atlanta:ACM Press,2002:22-31
[15]Karp B,Kung H.GPSR:Greedy perimeter stateless routing for wireless networks[C],In Proceeding of the 6th Annual International Conference on Mobile Computing and Networking.Boston:ACM Press,2000:243-254
[16]Sohrabi K,Gao J,Ailawadhi V,Pottie GJ:Protocols for self-organization of a wireless sensor network[J].IEEE Personal Communications,vol.7,no.5,2000:16-27
[17] Heinzelman W, Chandrakasan A, Balakrishnan H.: Energy-efficient communication protocol for wireless microsensor networks [C], In Proceeding of the 33rd Annual Hawaii International Conference on System Sciences. Maui: IEEE Computer Society, 2000: 3005-3014
[18] Lindsey S, Raghavendra CS: PEGASIS: Power-efficient gathering in sensor information systems [C], In Proceeding of the IEEE Aerospace Conference Montana: IEEE Aerospace and Electronic Systems Society, 2002, 1125-1130
[19] Manjeshwar A, Agrawal DP: TEEN: A protocol for enhanced efficiency in wireless sensor networks [C], In International Proceeding of the 15th Parallel and Distributed Processing Symposia San Francisco: IEEE Computer Society, 2001: 2009-2015
[20] Zixiang Xiong, Angelos D. Livens, and Samuel Cheng: Distributed Source Coding for Sensor Networks, IEEE Signal Processing Magazine, vol. 19, Sep. 2004: 80-94
[1]F.Akyildiz,W.Su,Y.Sankarasubramaniam,and E.Cayirci:A survey on sensor networks[J].IEEE Communications Magazine,vol.40,no.8,August 2002:102-114.
[2]Zixiang Xiong,Angelos D.Liveris,and Samuel Cheng:Distributed Source Coding for Sensor Networks,IEEE Signal Processing Magazine,vol.19,Sep.2004:80-94.
[3]D.Slepian and J.K.Wolf:Noiseless coding of correlated information sources[J],IEEE Transaction of Information Theory,vol.19,no.4,1973:471-480.
[4] Wyner and J. Ziv: The rate-distortion function for source coding with side information at the decoder [J], IEEE Transaction of Information Theory, vol. 22, no. 1,1976: 1-10.
[5] T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
[6] Wyner: Recent results in the Shannon theory [J], IEEE Transaction of Information Theory, vol. 20, no. 1, 1974: 2-10.
[7] P. Mitran and J. Bajcsy: Coding for the Wyner-Ziv problem with turbolike codes [C], in Proceeding of ISIT'02, Lausanne, Switzerland, 2002: 91.
[8] A. Livens, Z. Xiong, and C. Georghiades: Compression of binary sources with side information at the decoder using LDPC codes [J], IEEE Communication Letters, vol. 6, no. 10,2002: 440-442.
[9] P. Tan, and J. Li: Slepian-Wolf Coding Using Parity Approach and Syndrome Approach [C], Proceeding of Conference of Information Sciences and Systems (CISS), John Hopkins, MD , March, 2007 : 708-713.
[10] R. Zamir, S. Shamai, and U. Erez: Nested linear/lattice codes for structured multiterminal binning [J], IEEE Transaction of Information Theory, vol. 48, no. 6,2002: 1250-1276.
[11] S. Pradhan and K. Ramchandran: Distributed source coding using syndromes (DISCUS): Design and construction [J], IEEE Transaction of Information Theory, vol. 49, Mar. 2003: 626-643.
[12] A. Gersho and R. M. Gray, Vector Quantization and Signal Compression. Norwell, MA: Kluwer, 1992.
[13] U. Wachsmann, R. F. H. Fischer, and J. B. Huber: Multilevel codes: Theoretical concepts and practical design rules [J], IEEE Transaction of Information Theory, vol. 45, July 1999: 1361-1391.
[14] R. Garello and S. Benedetto: Multilevel construction of block and trellis group codes [J], IEEE Transaction of Information Theory, vol. 41, Sept. 1995: 1257-1264.
[15] J. Chou, D. Petrovi'c, and K. Ramchandran: A distributed and adaptive signal processing approach to reducing energy consumption in sensor networks [C]], in Proceeding of INFOCOM 2003, San Francisco, CA, 2003: 1054-1062.
[16] S. Pradhan and K. Ramchandran: Distributed source coding: Symmetric rates and applications to sensor networks [C], in Proceeding of DCC'00, Snowbird, UT, 2000: 363-372.
[17] V. Stankovic, A. Livens, Z. Xiong, and C. Georghiades: Design of Slepian-Wolf codes by channel code partitioning [C], in Proceeding of DCC'04, Snowbird, UT, 2004: 302-311.
[18] Y. Yang, V. Stankovi'c, Z. Xiong, and W. Zhao: Asymmetric code design for remote multiterminal source coding [C], in Proceeding of DCC'04, Snowbird, UT, 2004: 572.
[19] Sartipi, M., Fekri, F.: Distributed source coding in wireless sensor networks using LDPC coding: the entire Slepian-Wolf rate region [C],in Proceeding of IEEE Wireless Communications and Networking Conference, Mar. 2005: 1939-1944.
[20] Sartipi, M., Fekri, F.: Distributed Source Coding Using Short to Moderate Length Rate-Compatible LDPC Codes: The Entire Slepian-Wolf Rate Region [J], IEEE transactions on communications, vol.56, no.3, Mar. 2008: 400-411.
[21] S. Pradhan, J. Kusuma, and K. Ramchandran: Distributed compression in a dense microsensor network [J], IEEE Signal Processing Magazine, vol. 19, Mar. 2002: 51-60.
[22] R. Barron, B. Chen, and G. Wornell: The duality between information embedding and source coding with side information and some applications [J], IEEE Transaction of Information Theory, vol. 49, May 2003: 1159-1180.
[23] T. Berger, Z. Zhang, and H. Viswanathan: The CEO problem [multiterminal source coding] [J]," IEEE Transaction of Information Theory, vol. 42, May 1996: 887-902.
[24] S. Cheng and Z. Xiong: Successive refinement for the Wyner-Ziv problem and layered code design [C], in Proceeding of DCC'04, Snowbird, UT, 2004: 531.
[25] Frank Oldewurtel, Junaid Ansari and Petri Mahonen: Cross-Layer Design for Distributed Source Coding in Wireless Sensor Networks [C], in proceeding of Sensor Technologies and Applications, SENSORCOMM '08, Second International Conference on, Aug. 2008: 435-443.
[26] Honggang Wang Dongming Peng Wei Wang Sharif, H. Hsiao-hwa Chen: Cross-layer routing optimization in multirate wireless sensor networks for distributed source coding based applications [J], Wireless Communications, IEEE Transactions on, vol.7, October 2008: 3999-4009.
[1]C.E.Shannon:A mathematical theory of communication.Bell System Technology Journal[J],27,July/Oct.1948:379-423/623-656.
[2]王新梅,肖国镇.纠错码原理与方法.西安电子科技大学出版社,1991.
[3]R.W.Hamming:Error Detecting and Error Correcting Codes.Bell System Technology Journal[J],Vol.29,1950:147-160.
[4]R.C.Bose and D.K.Ray-Chaudhuri:On a class of error correcting binary codes[J].Information Control,vol.3,March 1960:68-79.
[5]P.A.Hocquenghem.Codes correcteurs d'erreurs.Chiffres[J],vol.2,1959:147-156.
[6]G.D.Forney.Concatenated Codes.PHD thesis[D],MIT,1996.
[7]C.Berrou and A.Glavieux:Near optimum error correcting coding and decoding:turbo-codes[J].IEEE Transaction of Communications,vol.44,no.10,Oct.1996:1261-1271.
[8]R.G.Gallager.Low density parity-check codes.Cambridge,MA:MIT Press,1963.
[9]G.D.Forney,Jr:Codes on graphs:normal realizations[J],IEEE Transaction of Information Theory,vol47,no2,Feb.2001:520-548.
[10]R.M.Tanner:A recursive approach to low complexity codes[J].IEEE Transaction of Information Theory,vol.27,Sept.1981:533-547.
[11]D.J.C.MacKay and R.M.Neal:Near Shannon limit performance of low-density parity check codes[J].Electronic Letters,vol.32,Aug.1996:1645-1646.
[12]M.C.Davey and D.J.C.Mackay:Low density parity check codes GF(q)[J].IEEE Communication Letters,vol.2,no.6,June 1998:165-167.
[13]T.J.Richardson,M,A.Shokrollahi,and R.L.Urbanke:Design of capacity-approaching irregular low-density parity-check codes[J].IEEE Transaction of Information Theory,vol.47,no.2,Feb.2001:619-637.
[14]S.-Y.Chung,T.J.Richardson,and R.L.Urbanke:Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation[J].IEEE Transation of Information Theory,vol.47,no.2,Feb.2001:657-670.
[15]S.-Y.Chung,G.D.Forney,Jr.,T.J.Richardson,and R.Urbanke:On the design of low-density parity-check codes within 0.0045dB of the Shannon limit[C].IEEE Communication Letters,vol.5,no.2,Feb.2001:58-60.
[16]袁东风,张海刚等.LDPC码理论与应用.人民邮电出版社,2008.
[17]D.J.C.MacKay:Good error correcting codes based on very sparse matrices[J].IEEE Transaction of Information Theory,vol.45,no.2,1999:399-431.
[18]Jorge Campello,D.S.Modha,and S.Rajagopalan:Designing LDPC Codes Using Bit-filling[C].ICC 2001,no.1,June 2001
[19]N.Wiberg,H.-A.Loeliger,and R.K(o|¨)etter:Codes and iterative decoding on general graphs[J].European Transaction of Telecommunications,vol.6,1995:513-525.
[20]S.Pradhan and K.Ramchandran:Distributed source coding using syndromes(DISCUS):Design and construction [J],IEEE Transaction of Information Theory,vol.49,Mar.2003:626-643.
[21]T.Murayama:Statistical mechanics of linear compression codes in network communication[J],Europhysics Letters,2001.
[22]A.Liveris,Z.Xiong,and C.Georghiades:Compression of binary sources with side information at the decoder using LDPC codes,IEEE Communication Letters,vol.6,no.10,2002:440-442.
[23]J.Garcia-Frias and W.Zhong:LDPC codes for compression of multiterminal sources with hidden Markov correlation[J],IEEE Communication Letters,vol.7,no.3,2003:115-117.
[24]Ying Zhao and J.Garcia-Frias:Turbo compression/joint source-channel coding of correlated binary sources with hidden Markov correlation[J],Signal Processing Special section:Distributed source coding,vol.86,no.11,2006:3115-3122.
[25]P.Tan,and J.Li:Slepian-Wolf Coding Using Parity Approach and Syndrome Approach[C],Proceeding of Conference of Information Sciences and Systems(CISS),John Hopkins,MD,March,2007:708-713.
[26]Sartipi,M.,Fekri,F:Distributed source coding in wireless sensor networks using LDPC coding:the entire Slepian-Wolf rate region[C],in Proceeding of IEEE Wireless Communications and Networking Conference,Mar.2005:1939-1944.
[27]Sartipi,M.,Fekri,F.:Distributed Source Coding Using Short to Moderate Length Rate-Compatible LDPC Codes:The Entire Slepian-Wolf Rate Region[J],IEEE transactions on communications,vol.56,no.3,Mar.2008:400-411.
[28]Hu X Y,Eleftherious E,Arnold D M.Regular and Irregular Progressive Edge-Growth Tanner Graphs[J].IEEE Transaction of Information Theory, vol.51,2005: 386-398.
[29] Madhurima Potluri, Suma Chilumuru, Sumakanth Kambhampati and Namuduri K.R.: Distributed Source Coding using non-binary LDPC codes for sensor network applications [C], Information Theory, 2007. CWIT 10th Canadian Workshop on, June, 2007:105 -109.
[30] Wang, Zunliang; Li, Xueming; Zhao, Min: Distributed Coding of Gaussian Correlated Sources Using Non-binary LDPC, Image and Signal Processing, 2008. vol. 2, May 2008:214-218.
[31] A. Gersho and R. M. Gray, Vector Quantization and Signal Compression Norwell, MA: Kluwer, 1992.
[1]马祖长,孙怡宁,梅涛.无线传感器网络综述[J],通信学报,vol.25,no.4,2004:114-124.
[2]Haas ZJ,Halpern JY,Li L.Gossip-Based ad-hoc routing[C].In:Proceeding of the IEEE INFOCOM.New York:IEEE Communications Society,2002:1707-1716.
[3]Kulik J,Heinzelman WR,Balakrishnan H.Negotiation based protocols for disseminating information in wireless sensor networks.Wireless Networks[J],vol.8,no.2-3,2002:169-185
[4]Intanagonwiwat C,Govindan R,Estrin D,Heidemann J.Directed diffusion for wireless sensor networking[J].IEEE/ACM Transaction on Networking,vol.11,no.1,2003:2-16.
[5]Braginsky D,Estrin D.Rumor routing algorithm for sensor networks.In:Proc.of the 1st workshop on sensor networks and applications[J].Atlanta:ACM Press,200:22-31.
[6]Yu Y,Govindan R,Estrin D.Geographical and Energy Aware Routing:A Recursive Data Dissemination Protocol for Wireless Sensor Networks[R].UCLA Computer Science Department Technical Report UCLA/CSD-TR-01-0023,May 2001.
[7]Karp B,Kung H.GPSR:Greedy perimeter stateless routing for wireless networks[C].In Proceeding of the 6th Annual International Conference on Mobile Computing and Networking.Boston:ACM Press,2000:243-254.
[8]W.Heinzelman.Application specific protocol architectures for wireless networks[D],PhD Thesis.MIT,2000
[9]Murata T,Ishibuchi H.Performance evaluation of genetic algorithms for flowshop scheduling problems[C].In:Proceeding of the 1st IEEE Conference on Evolutionary Computation.Orlando:IEEE Press,1994:812-817.
[10]W.B.Heinzelman,A.P.Chandrakasan,and H.Balakrishnan:An Application-Specific Protocol Architecture for Wireless Microsensor Networks[J].IEEE Trans.Wireless Communication,vol.4,no.1,2002:660-670.
[11]Younis O,Fahmy S.Heed:A hybrid,energy-efficient,distributed clustering approach for ad-hoc sensor networks [J].IEEE Transaction On Mobile Computing,vol.3,no.4,2004:660-669.
[12]Lindsey S,Raghavendra CS.PEGASIS:Power-Efficient gathering in sensor information systems[C].In Proceeding of the IEEE Aerospace Conference Montana:IEEE Aerospace and Electronic Systems Society,2002:1125-1130.
[13]Manjeshwar A,Grawal DP.TEEN:A protocol for enhanced efficiency in wireless sensor networks[C].In Proceeding of the 15th Parallel and Distributed Processing Symposia San Francisco:IEEE Computer Society,2001:2009-2015.
[14]Manjeshwar A,Agrawal DP.APTEEN:A hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks[C].In Proceeding of the 2nd International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing.IEEE Computer Society,2002:195-202.
[15]Juan.Liu,Reich,J.E.,Feng,Zhao:Collaborative in-network processing for target tracking[J].EURASIP,J of Applied Signal Processing,vol.23,no.4,2003:378-391.
[16]Yu Liu,Yumei Wang,Lin Zhang,Chan-hyun Youn.Information-Driven Sensor Selection Algorithm for Kalman Filtering in Sensor Networks[C]:proceedings of the The 3th International Conference on Ubiquitous Intelligence and Computing,Wu Han,2006.
[17]Spanos,D.P.,Olfati-Saber,R.,Murray,R.M.:Approximate distributed kalman filtering in sensor networks with quantifiable performance[C],Information Processing in Sensor Networks,2005.IPSN 2005.Fourth nternational Symposium on 15 April 2005:133-139.
[18]Feng Zhao;Jaewon Shin;Reich,J.:Information-driven dynamic sensor collaboration[J],Signal Processing Magazine,IEEE Volume 19,Issue 2,March 2002:61-72.
[19]Y.C.Ho and R.C.K.Lee:A bayesian approach to problems in stochastic estimation and control[J],IEEE Transaction Automatic Control,vol.9,,1964:333-339.
[20]M.Chu,H.Haussecker,and F.Zhao:Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks[J],International Journal High-Performance Computer Application,vol.16,no.3,2002:293-313.
[21]T.M.Cover and J.A.Thomas:Elements of Information Theory.New York:Wiley,1991.
[22]J.Liu,J.E.Reich,and F.Zhao:Collaborative in-network processing for target tracking[J],EURASIP,Journal Application Signal Process.,vol.2003,Mar.2003:378-391.
[23]Emre Ertin,John W.Fisher,and Lee C.Potter:Maximum mutual information principle for dynamic sensor query problems[C],Information Processing in Sensor Networks,2003.IPSN 2003.Second International Symposium on,26-27 April 2003:405-416.
[24]Jin-Jun Xiao,Alejandro Ribeiro,Zhi-Quan Luo,and Georgios B.Giannakis:Distributed Compression-Estimation Using Wireless Sensor Networks[J], IEEE Signal Processing Magazine, July 2006: 27-41.
[25] Wei-Peng Chen, Jennifer C. Hou , Lui Sha. : Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks[C], Proceedings of the 11th IEEE International Conference on Network Protocols, 2003: 284-289.
[26] D.P. Bertsekas.: Nonlinear Programming, second ed. Belmont, Mass. Athena Scientific, 1999.
[27] A. Gersho and R. M. Gray, Vector Quantization and Signal Compression Norwell, MA: Kluwer, 1992.
[2]任丰原,黄海宁,林闯:无线传感器网络[J],软件学报,vol.14,no.8,2003:1281-1291
[3]Manges W:It's Time for Sensors to Go Wireless[J],Sensors Magazine,1999:4-5
[4]Kahn J.Next Century Challenges:Mobile Networking for "Smart Dust"[C],Conference on Mobile Computing and Networking,1999,.
[5]ALERT[OL].Flood warning technologies,2003.http://www.altersystem.org
[6]极地遥感研究[OL].http://www.irsa.ac.cn/cn/info/browse.jsp?id=899&column=461
[7]Noury N,Herve T,Rialle V,Virone G,Mercier E.Monitoring behavior in home using a smart fall sensor[C],In Proceedings of the IEEE-EMBS Special Topic Conference on Microtechnologies in Medicine and Biology.IEEE Computer Society,2000:607-610
[8]赵泽,崔莉:一种基于无线传感器网络的远程医疗监护系统[J],信息与控制,vol.35,no.2,2006:265-269
[9]CodeBlue:Wireless Sensor Networks for Medical Care[OL].www.eecs.harvard.edu/～mdw/proj/codeblue/.
[10]TinyOS[OL].http://www.tinyos.net
[11]Haas ZJ,Halpern JY,Li L:Gossip-Based ad-hoc routing[C],In Proceeding of the IEEE INFOCOM.New York:IEEE Communications Society,2002:1707-1716
[12]Kulik J,Heinzelman WR,Balakrishnan H:Negotiation based protocols for disseminating information in wireless sensor networks[J],Wireless Networks,vol.8,no.2-3,2002:169-185
[13]Intanagonwiwat C,Govindan R,Estrin D,Heidemann J:Directed diffusion for wireless sensor networking[J],IEEE/ACM Transaction on Networking,vol.11,no.1,2003:2-16
[14]Braginsky D,Estrin D:Rumor routing algorithm for sensor networks[C],In Proceeding of the 1st workshop on sensor networks and applications.Atlanta:ACM Press,2002:22-31
[15]Karp B,Kung H.GPSR:Greedy perimeter stateless routing for wireless networks[C],In Proceeding of the 6th Annual International Conference on Mobile Computing and Networking.Boston:ACM Press,2000:243-254
[16]Sohrabi K,Gao J,Ailawadhi V,Pottie GJ:Protocols for self-organization of a wireless sensor network[J].IEEE Personal Communications,vol.7,no.5,2000:16-27
[17] Heinzelman W, Chandrakasan A, Balakrishnan H.: Energy-efficient communication protocol for wireless microsensor networks [C], In Proceeding of the 33rd Annual Hawaii International Conference on System Sciences. Maui: IEEE Computer Society, 2000: 3005-3014
[18] Lindsey S, Raghavendra CS: PEGASIS: Power-efficient gathering in sensor information systems [C], In Proceeding of the IEEE Aerospace Conference Montana: IEEE Aerospace and Electronic Systems Society, 2002, 1125-1130
[19] Manjeshwar A, Agrawal DP: TEEN: A protocol for enhanced efficiency in wireless sensor networks [C], In International Proceeding of the 15th Parallel and Distributed Processing Symposia San Francisco: IEEE Computer Society, 2001: 2009-2015
[20] Zixiang Xiong, Angelos D. Livens, and Samuel Cheng: Distributed Source Coding for Sensor Networks, IEEE Signal Processing Magazine, vol. 19, Sep. 2004: 80-94
[1]F.Akyildiz,W.Su,Y.Sankarasubramaniam,and E.Cayirci:A survey on sensor networks[J].IEEE Communications Magazine,vol.40,no.8,August 2002:102-114.
[2]Zixiang Xiong,Angelos D.Liveris,and Samuel Cheng:Distributed Source Coding for Sensor Networks,IEEE Signal Processing Magazine,vol.19,Sep.2004:80-94.
[3]D.Slepian and J.K.Wolf:Noiseless coding of correlated information sources[J],IEEE Transaction of Information Theory,vol.19,no.4,1973:471-480.
[4] Wyner and J. Ziv: The rate-distortion function for source coding with side information at the decoder [J], IEEE Transaction of Information Theory, vol. 22, no. 1,1976: 1-10.
[5] T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
[6] Wyner: Recent results in the Shannon theory [J], IEEE Transaction of Information Theory, vol. 20, no. 1, 1974: 2-10.
[7] P. Mitran and J. Bajcsy: Coding for the Wyner-Ziv problem with turbolike codes [C], in Proceeding of ISIT'02, Lausanne, Switzerland, 2002: 91.
[8] A. Livens, Z. Xiong, and C. Georghiades: Compression of binary sources with side information at the decoder using LDPC codes [J], IEEE Communication Letters, vol. 6, no. 10,2002: 440-442.
[9] P. Tan, and J. Li: Slepian-Wolf Coding Using Parity Approach and Syndrome Approach [C], Proceeding of Conference of Information Sciences and Systems (CISS), John Hopkins, MD , March, 2007 : 708-713.
[10] R. Zamir, S. Shamai, and U. Erez: Nested linear/lattice codes for structured multiterminal binning [J], IEEE Transaction of Information Theory, vol. 48, no. 6,2002: 1250-1276.
[11] S. Pradhan and K. Ramchandran: Distributed source coding using syndromes (DISCUS): Design and construction [J], IEEE Transaction of Information Theory, vol. 49, Mar. 2003: 626-643.
[12] A. Gersho and R. M. Gray, Vector Quantization and Signal Compression. Norwell, MA: Kluwer, 1992.
[13] U. Wachsmann, R. F. H. Fischer, and J. B. Huber: Multilevel codes: Theoretical concepts and practical design rules [J], IEEE Transaction of Information Theory, vol. 45, July 1999: 1361-1391.
[14] R. Garello and S. Benedetto: Multilevel construction of block and trellis group codes [J], IEEE Transaction of Information Theory, vol. 41, Sept. 1995: 1257-1264.
[15] J. Chou, D. Petrovi'c, and K. Ramchandran: A distributed and adaptive signal processing approach to reducing energy consumption in sensor networks [C]], in Proceeding of INFOCOM 2003, San Francisco, CA, 2003: 1054-1062.
[16] S. Pradhan and K. Ramchandran: Distributed source coding: Symmetric rates and applications to sensor networks [C], in Proceeding of DCC'00, Snowbird, UT, 2000: 363-372.
[17] V. Stankovic, A. Livens, Z. Xiong, and C. Georghiades: Design of Slepian-Wolf codes by channel code partitioning [C], in Proceeding of DCC'04, Snowbird, UT, 2004: 302-311.
[18] Y. Yang, V. Stankovi'c, Z. Xiong, and W. Zhao: Asymmetric code design for remote multiterminal source coding [C], in Proceeding of DCC'04, Snowbird, UT, 2004: 572.
[19] Sartipi, M., Fekri, F.: Distributed source coding in wireless sensor networks using LDPC coding: the entire Slepian-Wolf rate region [C],in Proceeding of IEEE Wireless Communications and Networking Conference, Mar. 2005: 1939-1944.
[20] Sartipi, M., Fekri, F.: Distributed Source Coding Using Short to Moderate Length Rate-Compatible LDPC Codes: The Entire Slepian-Wolf Rate Region [J], IEEE transactions on communications, vol.56, no.3, Mar. 2008: 400-411.
[21] S. Pradhan, J. Kusuma, and K. Ramchandran: Distributed compression in a dense microsensor network [J], IEEE Signal Processing Magazine, vol. 19, Mar. 2002: 51-60.
[22] R. Barron, B. Chen, and G. Wornell: The duality between information embedding and source coding with side information and some applications [J], IEEE Transaction of Information Theory, vol. 49, May 2003: 1159-1180.
[23] T. Berger, Z. Zhang, and H. Viswanathan: The CEO problem [multiterminal source coding] [J]," IEEE Transaction of Information Theory, vol. 42, May 1996: 887-902.
[24] S. Cheng and Z. Xiong: Successive refinement for the Wyner-Ziv problem and layered code design [C], in Proceeding of DCC'04, Snowbird, UT, 2004: 531.
[25] Frank Oldewurtel, Junaid Ansari and Petri Mahonen: Cross-Layer Design for Distributed Source Coding in Wireless Sensor Networks [C], in proceeding of Sensor Technologies and Applications, SENSORCOMM '08, Second International Conference on, Aug. 2008: 435-443.
[26] Honggang Wang Dongming Peng Wei Wang Sharif, H. Hsiao-hwa Chen: Cross-layer routing optimization in multirate wireless sensor networks for distributed source coding based applications [J], Wireless Communications, IEEE Transactions on, vol.7, October 2008: 3999-4009.
[1]C.E.Shannon:A mathematical theory of communication.Bell System Technology Journal[J],27,July/Oct.1948:379-423/623-656.
[2]王新梅,肖国镇.纠错码原理与方法.西安电子科技大学出版社,1991.
[3]R.W.Hamming:Error Detecting and Error Correcting Codes.Bell System Technology Journal[J],Vol.29,1950:147-160.
[4]R.C.Bose and D.K.Ray-Chaudhuri:On a class of error correcting binary codes[J].Information Control,vol.3,March 1960:68-79.
[5]P.A.Hocquenghem.Codes correcteurs d'erreurs.Chiffres[J],vol.2,1959:147-156.
[6]G.D.Forney.Concatenated Codes.PHD thesis[D],MIT,1996.
[7]C.Berrou and A.Glavieux:Near optimum error correcting coding and decoding:turbo-codes[J].IEEE Transaction of Communications,vol.44,no.10,Oct.1996:1261-1271.
[8]R.G.Gallager.Low density parity-check codes.Cambridge,MA:MIT Press,1963.
[9]G.D.Forney,Jr:Codes on graphs:normal realizations[J],IEEE Transaction of Information Theory,vol47,no2,Feb.2001:520-548.
[10]R.M.Tanner:A recursive approach to low complexity codes[J].IEEE Transaction of Information Theory,vol.27,Sept.1981:533-547.
[11]D.J.C.MacKay and R.M.Neal:Near Shannon limit performance of low-density parity check codes[J].Electronic Letters,vol.32,Aug.1996:1645-1646.
[12]M.C.Davey and D.J.C.Mackay:Low density parity check codes GF(q)[J].IEEE Communication Letters,vol.2,no.6,June 1998:165-167.
[13]T.J.Richardson,M,A.Shokrollahi,and R.L.Urbanke:Design of capacity-approaching irregular low-density parity-check codes[J].IEEE Transaction of Information Theory,vol.47,no.2,Feb.2001:619-637.
[14]S.-Y.Chung,T.J.Richardson,and R.L.Urbanke:Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation[J].IEEE Transation of Information Theory,vol.47,no.2,Feb.2001:657-670.
[15]S.-Y.Chung,G.D.Forney,Jr.,T.J.Richardson,and R.Urbanke:On the design of low-density parity-check codes within 0.0045dB of the Shannon limit[C].IEEE Communication Letters,vol.5,no.2,Feb.2001:58-60.
[16]袁东风,张海刚等.LDPC码理论与应用.人民邮电出版社,2008.
[17]D.J.C.MacKay:Good error correcting codes based on very sparse matrices[J].IEEE Transaction of Information Theory,vol.45,no.2,1999:399-431.
[18]Jorge Campello,D.S.Modha,and S.Rajagopalan:Designing LDPC Codes Using Bit-filling[C].ICC 2001,no.1,June 2001
[19]N.Wiberg,H.-A.Loeliger,and R.K(o|¨)etter:Codes and iterative decoding on general graphs[J].European Transaction of Telecommunications,vol.6,1995:513-525.
[20]S.Pradhan and K.Ramchandran:Distributed source coding using syndromes(DISCUS):Design and construction [J],IEEE Transaction of Information Theory,vol.49,Mar.2003:626-643.
[21]T.Murayama:Statistical mechanics of linear compression codes in network communication[J],Europhysics Letters,2001.
[22]A.Liveris,Z.Xiong,and C.Georghiades:Compression of binary sources with side information at the decoder using LDPC codes,IEEE Communication Letters,vol.6,no.10,2002:440-442.
[23]J.Garcia-Frias and W.Zhong:LDPC codes for compression of multiterminal sources with hidden Markov correlation[J],IEEE Communication Letters,vol.7,no.3,2003:115-117.
[24]Ying Zhao and J.Garcia-Frias:Turbo compression/joint source-channel coding of correlated binary sources with hidden Markov correlation[J],Signal Processing Special section:Distributed source coding,vol.86,no.11,2006:3115-3122.
[25]P.Tan,and J.Li:Slepian-Wolf Coding Using Parity Approach and Syndrome Approach[C],Proceeding of Conference of Information Sciences and Systems(CISS),John Hopkins,MD,March,2007:708-713.
[26]Sartipi,M.,Fekri,F:Distributed source coding in wireless sensor networks using LDPC coding:the entire Slepian-Wolf rate region[C],in Proceeding of IEEE Wireless Communications and Networking Conference,Mar.2005:1939-1944.
[27]Sartipi,M.,Fekri,F.:Distributed Source Coding Using Short to Moderate Length Rate-Compatible LDPC Codes:The Entire Slepian-Wolf Rate Region[J],IEEE transactions on communications,vol.56,no.3,Mar.2008:400-411.
[28]Hu X Y,Eleftherious E,Arnold D M.Regular and Irregular Progressive Edge-Growth Tanner Graphs[J].IEEE Transaction of Information Theory, vol.51,2005: 386-398.
[29] Madhurima Potluri, Suma Chilumuru, Sumakanth Kambhampati and Namuduri K.R.: Distributed Source Coding using non-binary LDPC codes for sensor network applications [C], Information Theory, 2007. CWIT 10th Canadian Workshop on, June, 2007:105 -109.
[30] Wang, Zunliang; Li, Xueming; Zhao, Min: Distributed Coding of Gaussian Correlated Sources Using Non-binary LDPC, Image and Signal Processing, 2008. vol. 2, May 2008:214-218.
[31] A. Gersho and R. M. Gray, Vector Quantization and Signal Compression Norwell, MA: Kluwer, 1992.
[1]马祖长,孙怡宁,梅涛.无线传感器网络综述[J],通信学报,vol.25,no.4,2004:114-124.
[2]Haas ZJ,Halpern JY,Li L.Gossip-Based ad-hoc routing[C].In:Proceeding of the IEEE INFOCOM.New York:IEEE Communications Society,2002:1707-1716.
[3]Kulik J,Heinzelman WR,Balakrishnan H.Negotiation based protocols for disseminating information in wireless sensor networks.Wireless Networks[J],vol.8,no.2-3,2002:169-185
[4]Intanagonwiwat C,Govindan R,Estrin D,Heidemann J.Directed diffusion for wireless sensor networking[J].IEEE/ACM Transaction on Networking,vol.11,no.1,2003:2-16.
[5]Braginsky D,Estrin D.Rumor routing algorithm for sensor networks.In:Proc.of the 1st workshop on sensor networks and applications[J].Atlanta:ACM Press,200:22-31.
[6]Yu Y,Govindan R,Estrin D.Geographical and Energy Aware Routing:A Recursive Data Dissemination Protocol for Wireless Sensor Networks[R].UCLA Computer Science Department Technical Report UCLA/CSD-TR-01-0023,May 2001.
[7]Karp B,Kung H.GPSR:Greedy perimeter stateless routing for wireless networks[C].In Proceeding of the 6th Annual International Conference on Mobile Computing and Networking.Boston:ACM Press,2000:243-254.
[8]W.Heinzelman.Application specific protocol architectures for wireless networks[D],PhD Thesis.MIT,2000
[9]Murata T,Ishibuchi H.Performance evaluation of genetic algorithms for flowshop scheduling problems[C].In:Proceeding of the 1st IEEE Conference on Evolutionary Computation.Orlando:IEEE Press,1994:812-817.
[10]W.B.Heinzelman,A.P.Chandrakasan,and H.Balakrishnan:An Application-Specific Protocol Architecture for Wireless Microsensor Networks[J].IEEE Trans.Wireless Communication,vol.4,no.1,2002:660-670.
[11]Younis O,Fahmy S.Heed:A hybrid,energy-efficient,distributed clustering approach for ad-hoc sensor networks [J].IEEE Transaction On Mobile Computing,vol.3,no.4,2004:660-669.
[12]Lindsey S,Raghavendra CS.PEGASIS:Power-Efficient gathering in sensor information systems[C].In Proceeding of the IEEE Aerospace Conference Montana:IEEE Aerospace and Electronic Systems Society,2002:1125-1130.
[13]Manjeshwar A,Grawal DP.TEEN:A protocol for enhanced efficiency in wireless sensor networks[C].In Proceeding of the 15th Parallel and Distributed Processing Symposia San Francisco:IEEE Computer Society,2001:2009-2015.
[14]Manjeshwar A,Agrawal DP.APTEEN:A hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks[C].In Proceeding of the 2nd International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing.IEEE Computer Society,2002:195-202.
[15]Juan.Liu,Reich,J.E.,Feng,Zhao:Collaborative in-network processing for target tracking[J].EURASIP,J of Applied Signal Processing,vol.23,no.4,2003:378-391.
[16]Yu Liu,Yumei Wang,Lin Zhang,Chan-hyun Youn.Information-Driven Sensor Selection Algorithm for Kalman Filtering in Sensor Networks[C]:proceedings of the The 3th International Conference on Ubiquitous Intelligence and Computing,Wu Han,2006.
[17]Spanos,D.P.,Olfati-Saber,R.,Murray,R.M.:Approximate distributed kalman filtering in sensor networks with quantifiable performance[C],Information Processing in Sensor Networks,2005.IPSN 2005.Fourth nternational Symposium on 15 April 2005:133-139.
[18]Feng Zhao;Jaewon Shin;Reich,J.:Information-driven dynamic sensor collaboration[J],Signal Processing Magazine,IEEE Volume 19,Issue 2,March 2002:61-72.
[19]Y.C.Ho and R.C.K.Lee:A bayesian approach to problems in stochastic estimation and control[J],IEEE Transaction Automatic Control,vol.9,,1964:333-339.
[20]M.Chu,H.Haussecker,and F.Zhao:Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks[J],International Journal High-Performance Computer Application,vol.16,no.3,2002:293-313.
[21]T.M.Cover and J.A.Thomas:Elements of Information Theory.New York:Wiley,1991.
[22]J.Liu,J.E.Reich,and F.Zhao:Collaborative in-network processing for target tracking[J],EURASIP,Journal Application Signal Process.,vol.2003,Mar.2003:378-391.
[23]Emre Ertin,John W.Fisher,and Lee C.Potter:Maximum mutual information principle for dynamic sensor query problems[C],Information Processing in Sensor Networks,2003.IPSN 2003.Second International Symposium on,26-27 April 2003:405-416.
[24]Jin-Jun Xiao,Alejandro Ribeiro,Zhi-Quan Luo,and Georgios B.Giannakis:Distributed Compression-Estimation Using Wireless Sensor Networks[J], IEEE Signal Processing Magazine, July 2006: 27-41.
[25] Wei-Peng Chen, Jennifer C. Hou , Lui Sha. : Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks[C], Proceedings of the 11th IEEE International Conference on Network Protocols, 2003: 284-289.
[26] D.P. Bertsekas.: Nonlinear Programming, second ed. Belmont, Mass. Athena Scientific, 1999.
[27] A. Gersho and R. M. Gray, Vector Quantization and Signal Compression Norwell, MA: Kluwer, 1992.