Resolving pass-over problem in wireless sensor networks

Chang Wu Yu, Rei Heng Chen, Tung-Kuang Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this work, we address the pass-over issue in wireless sensor network routing. Pass-over occurs when a query agent passes over an event agent even though the two lines cross each other, which may potentially prevent a query from finding the event. Even if the query and event agents eventually meet, the number of hop count may add up as a result of that. We tackle the problem with a variation of the Small-World Routing protocol (SWRP). The SWRP finds paths between the queries and events through recurrent propagations of weak and strong links. The operation of the protocol is simple and does not require much computational power. It turns out that by maximizing the number of weak link of the SWRP within a controlled area, we may be able to reduce the possibility of pass-over. In fact, according to our simulations the pass-over can be completely excluded from occurring. Accordingly, the proposed solution not only cut the number of hop-count, but also achieve better successful rate in finding a route between the query and event. The corresponding wireless sensor network with the proposed routing protocol is thus more power conservative and lasts longer.

Original languageEnglish
Title of host publication6th International Conference on Information Technology and Applications, ICITA 2009
Pages234-238
Number of pages5
Publication statusPublished - 2009 Dec 1
Event6th International Conference on Information Technology and Applications, ICITA 2009 - Hanoi, Viet Nam
Duration: 2009 Nov 92009 Nov 12

Publication series

Name6th International Conference on Information Technology and Applications, ICITA 2009

Other

Other6th International Conference on Information Technology and Applications, ICITA 2009
CountryViet Nam
CityHanoi
Period09-11-0909-11-12

Fingerprint

Routing protocols
Wireless sensor networks
Network routing
Network protocols

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications
  • Information Systems
  • Software

Cite this

Yu, C. W., Chen, R. H., & Wu, T-K. (2009). Resolving pass-over problem in wireless sensor networks. In 6th International Conference on Information Technology and Applications, ICITA 2009 (pp. 234-238). (6th International Conference on Information Technology and Applications, ICITA 2009).
Yu, Chang Wu ; Chen, Rei Heng ; Wu, Tung-Kuang. / Resolving pass-over problem in wireless sensor networks. 6th International Conference on Information Technology and Applications, ICITA 2009. 2009. pp. 234-238 (6th International Conference on Information Technology and Applications, ICITA 2009).
@inproceedings{67d4f227ee8143c1b6fa21e1f0f78b3c,
title = "Resolving pass-over problem in wireless sensor networks",
abstract = "In this work, we address the pass-over issue in wireless sensor network routing. Pass-over occurs when a query agent passes over an event agent even though the two lines cross each other, which may potentially prevent a query from finding the event. Even if the query and event agents eventually meet, the number of hop count may add up as a result of that. We tackle the problem with a variation of the Small-World Routing protocol (SWRP). The SWRP finds paths between the queries and events through recurrent propagations of weak and strong links. The operation of the protocol is simple and does not require much computational power. It turns out that by maximizing the number of weak link of the SWRP within a controlled area, we may be able to reduce the possibility of pass-over. In fact, according to our simulations the pass-over can be completely excluded from occurring. Accordingly, the proposed solution not only cut the number of hop-count, but also achieve better successful rate in finding a route between the query and event. The corresponding wireless sensor network with the proposed routing protocol is thus more power conservative and lasts longer.",
author = "Yu, {Chang Wu} and Chen, {Rei Heng} and Tung-Kuang Wu",
year = "2009",
month = "12",
day = "1",
language = "English",
isbn = "9789810830298",
series = "6th International Conference on Information Technology and Applications, ICITA 2009",
pages = "234--238",
booktitle = "6th International Conference on Information Technology and Applications, ICITA 2009",

}

Yu, CW, Chen, RH & Wu, T-K 2009, Resolving pass-over problem in wireless sensor networks. in 6th International Conference on Information Technology and Applications, ICITA 2009. 6th International Conference on Information Technology and Applications, ICITA 2009, pp. 234-238, 6th International Conference on Information Technology and Applications, ICITA 2009, Hanoi, Viet Nam, 09-11-09.

Resolving pass-over problem in wireless sensor networks. / Yu, Chang Wu; Chen, Rei Heng; Wu, Tung-Kuang.

6th International Conference on Information Technology and Applications, ICITA 2009. 2009. p. 234-238 (6th International Conference on Information Technology and Applications, ICITA 2009).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Resolving pass-over problem in wireless sensor networks

AU - Yu, Chang Wu

AU - Chen, Rei Heng

AU - Wu, Tung-Kuang

PY - 2009/12/1

Y1 - 2009/12/1

N2 - In this work, we address the pass-over issue in wireless sensor network routing. Pass-over occurs when a query agent passes over an event agent even though the two lines cross each other, which may potentially prevent a query from finding the event. Even if the query and event agents eventually meet, the number of hop count may add up as a result of that. We tackle the problem with a variation of the Small-World Routing protocol (SWRP). The SWRP finds paths between the queries and events through recurrent propagations of weak and strong links. The operation of the protocol is simple and does not require much computational power. It turns out that by maximizing the number of weak link of the SWRP within a controlled area, we may be able to reduce the possibility of pass-over. In fact, according to our simulations the pass-over can be completely excluded from occurring. Accordingly, the proposed solution not only cut the number of hop-count, but also achieve better successful rate in finding a route between the query and event. The corresponding wireless sensor network with the proposed routing protocol is thus more power conservative and lasts longer.

AB - In this work, we address the pass-over issue in wireless sensor network routing. Pass-over occurs when a query agent passes over an event agent even though the two lines cross each other, which may potentially prevent a query from finding the event. Even if the query and event agents eventually meet, the number of hop count may add up as a result of that. We tackle the problem with a variation of the Small-World Routing protocol (SWRP). The SWRP finds paths between the queries and events through recurrent propagations of weak and strong links. The operation of the protocol is simple and does not require much computational power. It turns out that by maximizing the number of weak link of the SWRP within a controlled area, we may be able to reduce the possibility of pass-over. In fact, according to our simulations the pass-over can be completely excluded from occurring. Accordingly, the proposed solution not only cut the number of hop-count, but also achieve better successful rate in finding a route between the query and event. The corresponding wireless sensor network with the proposed routing protocol is thus more power conservative and lasts longer.

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

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

M3 - Conference contribution

AN - SCOPUS:77953990214

SN - 9789810830298

T3 - 6th International Conference on Information Technology and Applications, ICITA 2009

SP - 234

EP - 238

BT - 6th International Conference on Information Technology and Applications, ICITA 2009

ER -

Yu CW, Chen RH, Wu T-K. Resolving pass-over problem in wireless sensor networks. In 6th International Conference on Information Technology and Applications, ICITA 2009. 2009. p. 234-238. (6th International Conference on Information Technology and Applications, ICITA 2009).