• Article
  • | |
  • Metrics
  • |
  • Reference [19]
  • |
  • Related
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    Saving energy to prolong network life is a big challenge for WSNs (wireless sensor networks) research.In-Network query can reduce the number or size of packets through processing data in intermediate nodes so as to consume energy effectively. Present aggregation algorithms suppose all the sample data are correct. The existing outlier detection algorithms regard detection rate as the primary object and do not consider energy consumption and query characteristic. So the simple combination of the two aspects can not bring good performance. By analyzing the influence of faulty and outlier readings to aggregation results, this paper puts forward a robust aggregation algorithm RAA (robust aggregation algorithm). RAA improves traditional aggregation query using reading vector to judge whether a faulty or outlier has happened. RAA deletes faulty readings, aggregates normal readings and reports outliers. Thus, customers can know the networks condition clearly. Finally, this paper compares RAA and TAGVoting which uses tiny aggregation algorithm to complete aggregation and the Voting algorithm to realize outlier detection at the same time. Experimental results show that RAA outperforms TAGVoting in terms of both energy consumption and detection rate.

    Reference
    [1] Kahn JM, Katz RH, Pister KSJ. Next century challenges: mobile networking for “Smart Dust”. In: Proc. of the 5th Annual Int’l Conf. on Mobile Computing and Networks. New York: ACM Press, 1999. 271?278. http://bnrg.eecs.berkeley.edu/~randy/Papers/mobicom99.pdf
    [2] Ren FY, Huang HN, Lin C. Wireless sensor networks. Journal of Software, 2003,14(7):1282?1291 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/14/1282.htm
    [3] Li JZ, Li JB, Shi SF. Concepts, issues and advance of sensor networks and data management of sensor networks. Journal of Software, 2003,14(10):1717?1727 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/14/1717.htm
    [4] Akyildiz IF, Su WL, Sankarasubramaniam Y, Cayirci E. A survey on sensor networks. IEEE Communications Magazine,2002,40(8):102?114.
    [5] Krishnamachari B, Estrin D, Wicker S. The impact of data aggregation in wireless sensor networks. In: Proc. of the Int’l Workshop on Distributed Computing Systems. Washington: IEEE Press, 2002. 575?578. http://lecs.cs.ucla.edu/Publications/papers/krishnamacharib_aggregation.pdf
    [6] Liu X, Huang Q, Zhang Y. Combs, needles, haystacks: Balancing push and pull for discovery in large scale sensor networks. In:Proc. of the 2nd ACM Conf. on Embedded Networked Sensor Systems. New York: ACM Press, 2004. 183?194. http://www2.parc.com/spl/projects/ecca/pubs/comb.pdf
    [7] Chu D, Desphande A, Hellerstein J, Hong W. Approximate data collection in sensor networks using probabilistic models. In: Proc.of the Int’l Conf. on Data Engineering. Washington: IEEE Press, 2006. 48. http://www.cs.umd.edu/~amol/papers/icde06.pdf
    [8] Madden SR, Franklin MJ, Hellerstein JM, Hong W. TAG: A tiny aggregation service for ad-hoc sensor networks. In: Proc. of the ACM Symp. on Operating System Design and Implementation. New York: ACM Press, 2002. 131?146. http://www.cs.berkeley.edu/~franklin/Papers/madden_tag.pdf
    [9] Sharaf A, Beaver J, Labrinidis A, Chrysanthis P. Balancing energy efficiency and quality of aggregate data in sensor networks.VLDB Journal, 2004,13(4):384?403.
    [10] Yao Y, Gehrke J. The cougar approach to in-network query processing in sensor networks. SIGMOD Record, 2002,31(3):9?18.
    [11] Li Y, Ramakrishna MV, Loke SW. Approximate query answering in sensor networks with hierarchically distributed caching. In: Proc. of the 20th Int’l Conf. on Advanced Information Networking and Applications. Washington: IEEE Press, 2006. 281?285.http://portal.acm.org/citation.cfm?id=1129263
    [12] Elnahrawy E, Nath B. Online data cleaning in wireless sensor networks. In: Proc. of the Int’l Conf. on Embedded Networked Sensor Systems (SenSys). New York: ACM Press, 2003. 294?295. http://cens.ucla.edu/sensys03/proceedings/p294-elnahrawy.pdf
    [13] Ding M, Chen DC, Xian K, Cheng XZ. Localized fault-tolerant event boundary detection in sensor networks. In: Proc. of the IEEE INFOCOM. Washington: IEEE Press, 2005. 902?913. http://www.seas.gwu.edu/~cheng/Publication/PID48574.pdf
    [14] Branch J, Szymanski B, Giannella C, Wolff R. In-Network outlier detection in wireless sensor networks. In: Proc. of the 26th IEEE Int’l Conf. on Distributed Computing Systems. Washington: IEEE Press, 2006. 51. http://www.cs.technion.ac.il/~ranw/papers/wolff06icdcs.pdf
    [15] Krishnamachari B, Iyengar S. Distributed Bayesian algorithms for fault-tolerant event region detection in wireless sensor networks.IEEE Trans. on Computers, 2004,53(3):241?250.
    [16] Krasniewski MD, Varadharajan P, Rabeler B, Bagchi S, Hu YC. Tibft: Trust index based fault tolerance for arbitrary data faults in sensor networks. In: Proc. of the Int’l Conf. on Dependable Systems and Networks. Washington: IEEE Press, 2005. 672?681.http://cobweb.ecn.purdue.edu/~dcsl/publications/papers/2005/tibfit_DSN05.pdf
    [17] Intel Berkeley Research Laboratory. http://berkeley.intel-research.net/labdata/ 附中文参考文献:
    [2] 任丰原,黄海宁,林闯.无线传感器网络.软件学报,2003,14(7):1282?1291. http://www.jos.org.cn/1000-9825/14/1282.htm
    [3] 李建中,李金宝,石胜飞.传感器网络及其数据管理的概念、问题与进展.软件学报,2003,14(10):1717?1727. http://www.jos.org.cn/1000-9825/14/1717.htm
    Related
    Cited by
Get Citation

吴中博,张重生,陈 红,秦 航.传感器网络中健壮数据聚集算法.软件学报,2009,20(7):1885-1894

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:January 10,2008
  • Revised:February 04,2008
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063