• DocumentCode
    2562390
  • Title

    Pass-Over Problem in Wireless Sensor Networks

  • Author

    Yu, Chang Wu ; Huang, Chiming ; Cheng, Rei-Heng ; Wu, Tung-Kuang

  • Author_Institution
    Dept. of Comput. Sci. & Inf. Eng., Chung Hua Univ., Hsinchu, Taiwan
  • fYear
    2010
  • fDate
    23-25 Sept. 2010
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    Pass-over in wireless sensor network routing occurs when a query agent passes over an event agent without discovering each other. Even if the two agents eventually meet, the number of hop count may add up as a result of that. In this paper we examine the pass-over problem extensively through numerical analysis and simulations. Numerical analyses (and simulation results) reveal that probability of pass- over in the context of rumor routing can be as high as 97.5% (and 92%). The outcomes indicate the seriousness of pass-over and should not be overlooked. Technique is proposed to resolve the issue. By integrating the proposed technique into rumor routing, pass-over occurrences can be eliminated completely according to our simulations, which then results in higher routing success rate and shorter routing paths.
  • Keywords
    probability; routing protocols; wireless sensor networks; pass-over problem; probability; query agent; rumor routing; wireless sensor network routing; wireless sensor networks; Computational modeling; Numerical analysis; Numerical models; Routing; Routing protocols; Simulation; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications Networking and Mobile Computing (WiCOM), 2010 6th International Conference on
  • Conference_Location
    Chengdu
  • Print_ISBN
    978-1-4244-3708-5
  • Electronic_ISBN
    978-1-4244-3709-2
  • Type

    conf

  • DOI
    10.1109/WICOM.2010.5601093
  • Filename
    5601093