Pass-over problem in wireless sensor networks

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

doi:10.1109/WICOM.2010.5601093

Pass-over problem in wireless sensor networks

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

Department of Information Management

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

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.

Original language	English
Title of host publication	2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010
DOIs	https://doi.org/10.1109/WICOM.2010.5601093
Publication status	Published - 2010 Nov 25
Event	2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010 - Chengdu, China Duration: 2010 Sep 23 → 2010 Sep 25

Publication series

Name	2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010

Other

Other	2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010
Country	China
City	Chengdu
Period	10-09-23 → 10-09-25

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Communication

Access to Document

10.1109/WICOM.2010.5601093

Fingerprint Dive into the research topics of 'Pass-over problem in wireless sensor networks'. Together they form a unique fingerprint.

Cite this

Yu, C. W., Huang, C., Cheng, R. H., & Wu, T. K. (2010). Pass-over problem in wireless sensor networks. In 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010 [5601093] (2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010). https://doi.org/10.1109/WICOM.2010.5601093

@inproceedings{72f1a800093849ac9cbedcee1ed95f85,

title = "Pass-over problem in wireless sensor networks",

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.",

author = "Yu, {Chang Wu} and Chiming Huang and Cheng, {Rei Heng} and Wu, {Tung Kuang}",

year = "2010",

month = nov,

day = "25",

doi = "10.1109/WICOM.2010.5601093",

language = "English",

isbn = "9781424437092",

series = "2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010",

booktitle = "2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010",

note = "2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010 ; Conference date: 23-09-2010 Through 25-09-2010",

}

Yu, CW, Huang, C, Cheng, RH & Wu, TK 2010, Pass-over problem in wireless sensor networks. in 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010., 5601093, 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010, 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010, Chengdu, China, 10-09-23. https://doi.org/10.1109/WICOM.2010.5601093

Pass-over problem in wireless sensor networks. / Yu, Chang Wu; Huang, Chiming; Cheng, Rei Heng; Wu, Tung Kuang.

2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010. 2010. 5601093 (2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Pass-over problem in wireless sensor networks

AU - Yu, Chang Wu

AU - Huang, Chiming

AU - Cheng, Rei Heng

AU - Wu, Tung Kuang

PY - 2010/11/25

Y1 - 2010/11/25

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=78549292106&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78549292106&partnerID=8YFLogxK

U2 - 10.1109/WICOM.2010.5601093

DO - 10.1109/WICOM.2010.5601093

M3 - Conference contribution

AN - SCOPUS:78549292106

SN - 9781424437092

T3 - 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010

BT - 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010

T2 - 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010

Y2 - 23 September 2010 through 25 September 2010

ER -