Abstract
In this work, we propose a new routing protocol-the Small-World Routing protocol. With the idea originating from the small-world theory, the proposed protocol 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. We evaluate the performance of the proposed protocol through extensive simulations. The results indicate that the proposed protocol, when compared to rumor routing protocol, can find much shorter paths (and thus lower power consumption during data delivery) with much higher successful rate.
| Original language | English |
|---|---|
| Title of host publication | 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008 |
| DOIs | |
| Publication status | Published - 2008 Dec 31 |
| Event | 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008 - Dalian, China Duration: 2008 Oct 12 → 2008 Oct 14 |
Other
| Other | 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008 |
|---|---|
| Country | China |
| City | Dalian |
| Period | 08-10-12 → 08-10-14 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Software
- Electrical and Electronic Engineering
Cite this
}
A small-world routing protocol for wireless sensor networks. / Yu, Chang Wu; Wu, Tung-Kuang; Chen, Rei Heng; Jin, Fang Wei.
2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008. 2008. 4678803.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - A small-world routing protocol for wireless sensor networks
AU - Yu, Chang Wu
AU - Wu, Tung-Kuang
AU - Chen, Rei Heng
AU - Jin, Fang Wei
PY - 2008/12/31
Y1 - 2008/12/31
N2 - In this work, we propose a new routing protocol-the Small-World Routing protocol. With the idea originating from the small-world theory, the proposed protocol 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. We evaluate the performance of the proposed protocol through extensive simulations. The results indicate that the proposed protocol, when compared to rumor routing protocol, can find much shorter paths (and thus lower power consumption during data delivery) with much higher successful rate.
AB - In this work, we propose a new routing protocol-the Small-World Routing protocol. With the idea originating from the small-world theory, the proposed protocol 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. We evaluate the performance of the proposed protocol through extensive simulations. The results indicate that the proposed protocol, when compared to rumor routing protocol, can find much shorter paths (and thus lower power consumption during data delivery) with much higher successful rate.
UR - http://www.scopus.com/inward/record.url?scp=58049106675&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=58049106675&partnerID=8YFLogxK
U2 - 10.1109/WiCom.2008.895
DO - 10.1109/WiCom.2008.895
M3 - Conference contribution
SN - 9781424421084
BT - 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008
ER -