微信服务号

微信订阅号

2025-4-24- 22
Home > Archive>Volume 22, Issue zk1, 2011 >93-101
PDF HTML XML Export Cite reminder
Trade Randomness for Structure in Double Blind Data Discovery in Wireless Sensor Networks
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [21]
    • |
  • Related
    • | | |
  • Comments
    Abstract:

    Enabling anytime and anywhere random data access for the mobile sinks is an important solution to the problem in the large scale wireless sensor networks.However,the data discovery in large scale sensor networks faces a non-trivial challenge because of the double blindness between the data and the sinks.The existing schemes are not able to provide the high success rate and consume less energy at the same time.In this paper,the tradeoff between randomness and structure is explored.Based on random line walk scheme,three scalable and efficient data discovery methods are presented to solve the double-blindness.These methods utilize simple geometric property to construct the path of data cache and query and can work well without location.The extensive simulations,using ns-2 and theoretical analysis,have proven the efficient trade off between randomness and structure.

    Reference
    [1] Intanagonwiwat C,Govindan R,Estrin D.Directed diffusion:A scalable and robust communication paradigm for sensor networks. In:Johnson DB,ed.Proc.of the ACM MobiCom.Boston:ACM Press,2000.56-67.
    [2] Heinzelman W,Chandrakasan A,Balakrishnan H.Energy-Efficient communication protocol for wireless microsensor networks.In: Proc.of the 33rd Annual Hawaii Int’l Conf.on System Sciences.Maui:IEEE Computer Society,2000.3005-3014..
    [3] Chang N,Liu M.Revisiting the TTL-based controlled flooding search:Optimality and randomization.In:Haas ZJ,ed.Proc.of the 10th Annual Int’l Conf.on Mobile Computing and Networks(MobiCom 2004).New York:ACM Press,2004.85-99.
    [4] Krishnamachari B,Ahn J.Optimizing data replication for expanding ring-based queries in wireless sensor networks.In:Noubir G, ed.Proc.of the Int’l Symp.on Modeling and Optimization in Mobile,Ad Hoc,and Wireless Networks(WiOpt 2006).Washington: IEEE CS Press,2006.361-370.
    [5] Braginsky D,Estrin D.Rumor routing algorithm for sensor networks.In:Proc.of the 1st workshop on sensor networks and applications.Atlanta:ACM Press,2002.22-31.
    [6] Liu X,Huang Q,Zhang Y.Combs,needles,haystacks:Balancing push and pull for discovery in large-scale sensor networks.In Proceedings of the 2nd international conference on embedded networked sensor systems.ACM Press,2004.122-133.
    [7] Luo YH,Cheng J,Lu S,Zhang L.A two-tier data dissemination model for large-scale wireless sensor networks.In:Akyildiz IF,ed. Proc.of the 8th Annual Int’l Conf.on Mobile Computing and Networking.New York:ACM Press,2002.148-159.
    [8] Ratnasamy S,Karp B,Shenker S,Estrin D,Govindan R,Yin L,Yu F.Data-Centric storage in sensornets with GHT,a geographic hash table.Mobile Networks and Applications(MONET),2003,8(4):427-442.
    [9] Lin L,Wu HL.Artery:A data-centric architecture for wireless sensor networks.In:Ferrer J,ed.Proc.of the Int'l Conf.on Computer,Communication and Control Technologies.2003.123-128.
    [10] Kim SK,Abdelzaher TF,Kwon WH.Minimum-Energy asynchronous dissemination to mobile sinks in wireless sensor networks In: Proc.of the 1st Int’l Conf.on Embedded Networked Sensor Systems.2003.193-204.
    [11] Sarkar R,Zhu X,Gao J.Double rulings for information brokerage in sensor networks.In:Petrioli C,Ramjee R,eds.Proc.of the 12th Int’l Annual Conf.on Mobile Computing and Networking.2006.286-297.
    [12] Fang Q,Gao J,Guibas LJ.Landmark-Based information storage and retrieval in sensor networks.In:Proc.of the 25th Conf.of the IEEE Communication Society(INFOCOM 2006).2006.
    [13] Shi GT,Liao MH.An energy-efficient data dissemination protocol in large-scale sensor networks.Journal of Software, 2006,17(8):1785-1795(in Chinese with English abstract).http://www.jos.org.cn/1000-9825/17/1785.htm[doi:10.1360/jos 171785]
    [14] Solomon H.Geometric probability.In:Proc.of the CBMS-NSF Regional Conference Series in Applied Mathematics,Society for Industrial and Applied Mathematics.1987.
    [15] Zhou DP,Gao J.Opportunistic processing and query of motion trajectories in wireless sensor networks.In:Proc.of the 28th Annual IEEE Conf.on Computer Communications(INFOCOM 2009).2009.1197-1205.
    [16] Cheng BN,Yuksel M,Kalyanaraman S.Orthogonal rendezvous routing protocol for wireless mesh networks.IEEE/ACM Trans.on Networking,2009,17(2):542-555.
    [17] Feller W.An Introduction to Probability Theory and its Applications.Vol I,3ed.,Wiley,1968.
    [18] Bejerano Y.Simple and efficient k-coverage verification without location information.In:Proc.of the 27th Conf.on Computer Communications.IEEE(INFOCOM 2008),2008.291-295.
    [19] Kuchel PW,Vaughan RJ.Average lengths of chords in a square.Mathematics Magazine,1981,54(5):261-269.
    [20] Shokrzadeh H,Haghighat AT,Nayebi A.New routing framework base on rumor routing in wireless sensor networks.Computer Communications,2009,32(1):86-93.
    [21] Shi GT,Zheng J,Yang JF,Zhao ZH.Double cross:A double-blind data discovery scheme for large-scale wireless sensor networks. In:Proc.of the 2011 IEEE Int’l Conf.on Communications(ICC).2011.
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

杨金峰,石高涛,赵增华.无线传感器网络随机性与结构化折衷的双盲数据发现方法.软件学报,2011,22(zk1):93-101

Copy
Share
Article Metrics
  • Abstract:3690
  • PDF: 5174
  • HTML: 0
  • Cited by: 0
History
  • Received:May 02,2011
  • Revised:July 29,2011
  • Online: January 02,2012
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2038312Visitors
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