TY - GEN
T1 - Opportunistic routing protocol with grid-based relay slot selection in Energy Harvesting WSNs
AU - Negishi, Ryota
AU - Toyoda, Kentaroh
AU - Sasase, Iwao
PY - 2015/4/22
Y1 - 2015/4/22
N2 - Energy Harvesting (EH) technologies are getting attractive to realize the battery-less wireless sensing networks (WSNs). In EH-WSNs, opportunistic routing that the intermediate nodes relay packets is preferred due to the extremely constrained energy. However, in the conventional scheme, intermediate nodes rigidly determine its relaying slot by calculating distances between a source and a destination and this causes heavy computation for nodes. In this paper, we propose a lightweight grid-based relay slot selection scheme in EH-WSNs. In our scheme, we use square-shaped grid and divide the network virtually to give each node primitive coordination and each intermediate node decides its relaying slot by calculating the differential of grid-index between a sender and a receiver. Based on grid-based coordination, our scheme turns multiplications into lightweight subtractions and this reduces the computational complexity and required memory. In addition, we also propose a probabilistic relaying scheme to reduce collisions in each relaying slot. We evaluate the conventional and proposed schemes through the computer simulation and show that our scheme reduces the computational complexity and achieves comparable throughput to the conventional scheme.
AB - Energy Harvesting (EH) technologies are getting attractive to realize the battery-less wireless sensing networks (WSNs). In EH-WSNs, opportunistic routing that the intermediate nodes relay packets is preferred due to the extremely constrained energy. However, in the conventional scheme, intermediate nodes rigidly determine its relaying slot by calculating distances between a source and a destination and this causes heavy computation for nodes. In this paper, we propose a lightweight grid-based relay slot selection scheme in EH-WSNs. In our scheme, we use square-shaped grid and divide the network virtually to give each node primitive coordination and each intermediate node decides its relaying slot by calculating the differential of grid-index between a sender and a receiver. Based on grid-based coordination, our scheme turns multiplications into lightweight subtractions and this reduces the computational complexity and required memory. In addition, we also propose a probabilistic relaying scheme to reduce collisions in each relaying slot. We evaluate the conventional and proposed schemes through the computer simulation and show that our scheme reduces the computational complexity and achieves comparable throughput to the conventional scheme.
UR - http://www.scopus.com/inward/record.url?scp=84929447880&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84929447880&partnerID=8YFLogxK
U2 - 10.1109/APCC.2014.7092847
DO - 10.1109/APCC.2014.7092847
M3 - Conference contribution
AN - SCOPUS:84929447880
T3 - Proceedings of the 20th Asia-Pacific Conference on Communication, APCC 2014
SP - 412
EP - 416
BT - Proceedings of the 20th Asia-Pacific Conference on Communication, APCC 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 20th Asia-Pacific Conference on Communication, APCC 2014
Y2 - 1 October 2014 through 3 October 2014
ER -