This paper proposes a method for reducing redundant greedy-perimeter transitions in beacon-less geographic routing for wireless sensor networks (WSNs). Our method can be added to existing routing methods. Using a bloom filter, each node can detect a routing loop, and then the node stores the information as “failure history”. In the next forwarding the node can avoid such bad neighbors based on the failure history. Simulation results demonstrate the benefit of our method.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Takayuki FUJINO, Hiromi NISHIJIMA, "A Method for Reducing Perimeter Transitions in Beacon-Less Geographic Routing for Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E95-B, no. 1, pp. 283-288, January 2012, doi: 10.1587/transcom.E95.B.283.
Abstract: This paper proposes a method for reducing redundant greedy-perimeter transitions in beacon-less geographic routing for wireless sensor networks (WSNs). Our method can be added to existing routing methods. Using a bloom filter, each node can detect a routing loop, and then the node stores the information as “failure history”. In the next forwarding the node can avoid such bad neighbors based on the failure history. Simulation results demonstrate the benefit of our method.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.283/_p
Copy
@ARTICLE{e95-b_1_283,
author={Takayuki FUJINO, Hiromi NISHIJIMA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Method for Reducing Perimeter Transitions in Beacon-Less Geographic Routing for Wireless Sensor Networks},
year={2012},
volume={E95-B},
number={1},
pages={283-288},
abstract={This paper proposes a method for reducing redundant greedy-perimeter transitions in beacon-less geographic routing for wireless sensor networks (WSNs). Our method can be added to existing routing methods. Using a bloom filter, each node can detect a routing loop, and then the node stores the information as “failure history”. In the next forwarding the node can avoid such bad neighbors based on the failure history. Simulation results demonstrate the benefit of our method.},
keywords={},
doi={10.1587/transcom.E95.B.283},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - A Method for Reducing Perimeter Transitions in Beacon-Less Geographic Routing for Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 283
EP - 288
AU - Takayuki FUJINO
AU - Hiromi NISHIJIMA
PY - 2012
DO - 10.1587/transcom.E95.B.283
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2012
AB - This paper proposes a method for reducing redundant greedy-perimeter transitions in beacon-less geographic routing for wireless sensor networks (WSNs). Our method can be added to existing routing methods. Using a bloom filter, each node can detect a routing loop, and then the node stores the information as “failure history”. In the next forwarding the node can avoid such bad neighbors based on the failure history. Simulation results demonstrate the benefit of our method.
ER -