Node Aggregation Degree-Aware Random Routing for Non-uniform Wireless Sensor Networks
Summary :
Routing is still a challenging issue for wireless sensor networks (WSNs), in particular for WSNs with a non-uniform deployment of nodes. This paper introduces a Node Aggregation Degree-aware Random Routing (NADRR) algorithm for non-uniform WSNs with the help of two new concepts, namely the Local Vertical Aggregation Degree (LVAD) and Local Horizontal Aggregation Degree (LHAD). Our basic idea is to first apply the LVAD and LHAD to determine one size-proper forwarding region (rather than a fixed-size one as in uniform node deployment case) for each node participating in routing, then select the next hop node from the size-proper forwarding region in a probabilistic way, considering both the residual energy and distribution of nodes. In this way, a good adaptability to the non-uniform deployment of nodes can be guaranteed by the new routing algorithm. Extensive simulation results show that in comparison with other classical geographic position based routing algorithms, such as GPSR, TPGF and CR, the proposed NADRR algorithm can result in lower node energy consumption, better balance of node energy consumption, higher routing success rate and longer network lifetime.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E94-B No.1 pp.97-108
- Publication Date
- 2011/01/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E94.B.97
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Xiaoming WANG, Xiaohong JIANG, Tao YANG, Qiaoliang LI, Yingshu LI, "Node Aggregation Degree-Aware Random Routing for Non-uniform Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E94-B, no. 1, pp. 97-108, January 2011, doi: 10.1587/transcom.E94.B.97.
Abstract: Routing is still a challenging issue for wireless sensor networks (WSNs), in particular for WSNs with a non-uniform deployment of nodes. This paper introduces a Node Aggregation Degree-aware Random Routing (NADRR) algorithm for non-uniform WSNs with the help of two new concepts, namely the Local Vertical Aggregation Degree (LVAD) and Local Horizontal Aggregation Degree (LHAD). Our basic idea is to first apply the LVAD and LHAD to determine one size-proper forwarding region (rather than a fixed-size one as in uniform node deployment case) for each node participating in routing, then select the next hop node from the size-proper forwarding region in a probabilistic way, considering both the residual energy and distribution of nodes. In this way, a good adaptability to the non-uniform deployment of nodes can be guaranteed by the new routing algorithm. Extensive simulation results show that in comparison with other classical geographic position based routing algorithms, such as GPSR, TPGF and CR, the proposed NADRR algorithm can result in lower node energy consumption, better balance of node energy consumption, higher routing success rate and longer network lifetime.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.97/_p
Copy
@ARTICLE{e94-b_1_97,
author={Xiaoming WANG, Xiaohong JIANG, Tao YANG, Qiaoliang LI, Yingshu LI, },
journal={IEICE TRANSACTIONS on Communications},
title={Node Aggregation Degree-Aware Random Routing for Non-uniform Wireless Sensor Networks},
year={2011},
volume={E94-B},
number={1},
pages={97-108},
abstract={Routing is still a challenging issue for wireless sensor networks (WSNs), in particular for WSNs with a non-uniform deployment of nodes. This paper introduces a Node Aggregation Degree-aware Random Routing (NADRR) algorithm for non-uniform WSNs with the help of two new concepts, namely the Local Vertical Aggregation Degree (LVAD) and Local Horizontal Aggregation Degree (LHAD). Our basic idea is to first apply the LVAD and LHAD to determine one size-proper forwarding region (rather than a fixed-size one as in uniform node deployment case) for each node participating in routing, then select the next hop node from the size-proper forwarding region in a probabilistic way, considering both the residual energy and distribution of nodes. In this way, a good adaptability to the non-uniform deployment of nodes can be guaranteed by the new routing algorithm. Extensive simulation results show that in comparison with other classical geographic position based routing algorithms, such as GPSR, TPGF and CR, the proposed NADRR algorithm can result in lower node energy consumption, better balance of node energy consumption, higher routing success rate and longer network lifetime.},
keywords={},
doi={10.1587/transcom.E94.B.97},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - Node Aggregation Degree-Aware Random Routing for Non-uniform Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 97
EP - 108
AU - Xiaoming WANG
AU - Xiaohong JIANG
AU - Tao YANG
AU - Qiaoliang LI
AU - Yingshu LI
PY - 2011
DO - 10.1587/transcom.E94.B.97
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2011
AB - Routing is still a challenging issue for wireless sensor networks (WSNs), in particular for WSNs with a non-uniform deployment of nodes. This paper introduces a Node Aggregation Degree-aware Random Routing (NADRR) algorithm for non-uniform WSNs with the help of two new concepts, namely the Local Vertical Aggregation Degree (LVAD) and Local Horizontal Aggregation Degree (LHAD). Our basic idea is to first apply the LVAD and LHAD to determine one size-proper forwarding region (rather than a fixed-size one as in uniform node deployment case) for each node participating in routing, then select the next hop node from the size-proper forwarding region in a probabilistic way, considering both the residual energy and distribution of nodes. In this way, a good adaptability to the non-uniform deployment of nodes can be guaranteed by the new routing algorithm. Extensive simulation results show that in comparison with other classical geographic position based routing algorithms, such as GPSR, TPGF and CR, the proposed NADRR algorithm can result in lower node energy consumption, better balance of node energy consumption, higher routing success rate and longer network lifetime.
ER -
English
