IEICE TRANSACTIONS on Information
Geographic Routing Algorithm with Location Errors
Summary :
Geographic routing uses the geographical location information provided by nodes to make routing decisions. However, the nodes can not obtain accurate location information due to the effect of measurement error. A new routing strategy using maximum expected distance and angle (MEDA) algorithm is proposed to improve the performance and promote the successive transmission rate. We firstly introduce the expected distance and angle, and then we employ the principal component analysis to construct the object function for selecting the next hop node. We compare the proposed algorithm with maximum expectation within transmission range (MER) and greedy routing scheme (GRS) algorithms. Simulation results show that the proposed MEDA algorithm outperforms the MER and GRS algorithms with higher successive transmission rate.
- Publication
- IEICE TRANSACTIONS on Information Vol.E95-D No.12 pp.3092-3096
- Publication Date
- 2012/12/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E95.D.3092
- Type of Manuscript
- LETTER
- Category
- Information 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
Yuanwei JING, Yan WANG, "Geographic Routing Algorithm with Location Errors" in IEICE TRANSACTIONS on Information,
vol. E95-D, no. 12, pp. 3092-3096, December 2012, doi: 10.1587/transinf.E95.D.3092.
Abstract: Geographic routing uses the geographical location information provided by nodes to make routing decisions. However, the nodes can not obtain accurate location information due to the effect of measurement error. A new routing strategy using maximum expected distance and angle (MEDA) algorithm is proposed to improve the performance and promote the successive transmission rate. We firstly introduce the expected distance and angle, and then we employ the principal component analysis to construct the object function for selecting the next hop node. We compare the proposed algorithm with maximum expectation within transmission range (MER) and greedy routing scheme (GRS) algorithms. Simulation results show that the proposed MEDA algorithm outperforms the MER and GRS algorithms with higher successive transmission rate.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E95.D.3092/_p
Copy
@ARTICLE{e95-d_12_3092,
author={Yuanwei JING, Yan WANG, },
journal={IEICE TRANSACTIONS on Information},
title={Geographic Routing Algorithm with Location Errors},
year={2012},
volume={E95-D},
number={12},
pages={3092-3096},
abstract={Geographic routing uses the geographical location information provided by nodes to make routing decisions. However, the nodes can not obtain accurate location information due to the effect of measurement error. A new routing strategy using maximum expected distance and angle (MEDA) algorithm is proposed to improve the performance and promote the successive transmission rate. We firstly introduce the expected distance and angle, and then we employ the principal component analysis to construct the object function for selecting the next hop node. We compare the proposed algorithm with maximum expectation within transmission range (MER) and greedy routing scheme (GRS) algorithms. Simulation results show that the proposed MEDA algorithm outperforms the MER and GRS algorithms with higher successive transmission rate.},
keywords={},
doi={10.1587/transinf.E95.D.3092},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - Geographic Routing Algorithm with Location Errors
T2 - IEICE TRANSACTIONS on Information
SP - 3092
EP - 3096
AU - Yuanwei JING
AU - Yan WANG
PY - 2012
DO - 10.1587/transinf.E95.D.3092
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E95-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2012
AB - Geographic routing uses the geographical location information provided by nodes to make routing decisions. However, the nodes can not obtain accurate location information due to the effect of measurement error. A new routing strategy using maximum expected distance and angle (MEDA) algorithm is proposed to improve the performance and promote the successive transmission rate. We firstly introduce the expected distance and angle, and then we employ the principal component analysis to construct the object function for selecting the next hop node. We compare the proposed algorithm with maximum expectation within transmission range (MER) and greedy routing scheme (GRS) algorithms. Simulation results show that the proposed MEDA algorithm outperforms the MER and GRS algorithms with higher successive transmission rate.
ER -
English
