Anycast Routing Protocol for Forest Monitoring in Rechargeable Wireless Sensor Networks

In rechargeable wireless sensor networks (R-WSNs), sensors have to adjust their duty cycles continuously owing to sporadic availability of energy and operate in a very low duty cycle because of current energy conversion technical limitations. Even though the network lifetime is not the main problem,...

Full description

Bibliographic Details
Main Authors: Demin Gao, Yunfei Liu, Fuquan Zhang, Jun Song
Format: Article
Language:English
Published: SAGE Publishing 2013-12-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1155/2013/239860
id doaj-dd626c362e904969bad21c06e64d1bd4
record_format Article
spelling doaj-dd626c362e904969bad21c06e64d1bd42020-11-25T03:02:54ZengSAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772013-12-01910.1155/2013/239860239860Anycast Routing Protocol for Forest Monitoring in Rechargeable Wireless Sensor NetworksDemin GaoYunfei LiuFuquan ZhangJun SongIn rechargeable wireless sensor networks (R-WSNs), sensors have to adjust their duty cycles continuously owing to sporadic availability of energy and operate in a very low duty cycle because of current energy conversion technical limitations. Even though the network lifetime is not the main problem, packet delivery latency is critical because a sensor is in the dormant state most of the time in R-WSNs. These unique characteristics pose a new challenge for routing protocol design over traditional energy-static sensor networks. In this work, we introduce a routing protocol based on anycast communications technology, a novel design to minimize packet delivery latency for forest monitoring in R-WSNs. The key idea is to let a sender choose a closest neighbor to forward packets from forwarding candidates and a nearest sink node to accept the packet from all sinks. For multiple source nodes, we introduce an anycast technology based on Tabu search for each source establishing a minimal E2E delay routing path to reach anyone sinks. Through extensive simulation and experiments, we demonstrate that our anycast scheme based on Tabu search is efficient to provide smallest packets delivery latency in R-WSNs.https://doi.org/10.1155/2013/239860
collection DOAJ
language English
format Article
sources DOAJ
author Demin Gao
Yunfei Liu
Fuquan Zhang
Jun Song
spellingShingle Demin Gao
Yunfei Liu
Fuquan Zhang
Jun Song
Anycast Routing Protocol for Forest Monitoring in Rechargeable Wireless Sensor Networks
International Journal of Distributed Sensor Networks
author_facet Demin Gao
Yunfei Liu
Fuquan Zhang
Jun Song
author_sort Demin Gao
title Anycast Routing Protocol for Forest Monitoring in Rechargeable Wireless Sensor Networks
title_short Anycast Routing Protocol for Forest Monitoring in Rechargeable Wireless Sensor Networks
title_full Anycast Routing Protocol for Forest Monitoring in Rechargeable Wireless Sensor Networks
title_fullStr Anycast Routing Protocol for Forest Monitoring in Rechargeable Wireless Sensor Networks
title_full_unstemmed Anycast Routing Protocol for Forest Monitoring in Rechargeable Wireless Sensor Networks
title_sort anycast routing protocol for forest monitoring in rechargeable wireless sensor networks
publisher SAGE Publishing
series International Journal of Distributed Sensor Networks
issn 1550-1477
publishDate 2013-12-01
description In rechargeable wireless sensor networks (R-WSNs), sensors have to adjust their duty cycles continuously owing to sporadic availability of energy and operate in a very low duty cycle because of current energy conversion technical limitations. Even though the network lifetime is not the main problem, packet delivery latency is critical because a sensor is in the dormant state most of the time in R-WSNs. These unique characteristics pose a new challenge for routing protocol design over traditional energy-static sensor networks. In this work, we introduce a routing protocol based on anycast communications technology, a novel design to minimize packet delivery latency for forest monitoring in R-WSNs. The key idea is to let a sender choose a closest neighbor to forward packets from forwarding candidates and a nearest sink node to accept the packet from all sinks. For multiple source nodes, we introduce an anycast technology based on Tabu search for each source establishing a minimal E2E delay routing path to reach anyone sinks. Through extensive simulation and experiments, we demonstrate that our anycast scheme based on Tabu search is efficient to provide smallest packets delivery latency in R-WSNs.
url https://doi.org/10.1155/2013/239860
work_keys_str_mv AT demingao anycastroutingprotocolforforestmonitoringinrechargeablewirelesssensornetworks
AT yunfeiliu anycastroutingprotocolforforestmonitoringinrechargeablewirelesssensornetworks
AT fuquanzhang anycastroutingprotocolforforestmonitoringinrechargeablewirelesssensornetworks
AT junsong anycastroutingprotocolforforestmonitoringinrechargeablewirelesssensornetworks
_version_ 1724687807297880064