IEICE TRANSACTIONS on Information
A Statistical Reputation Approach for Reliable Packet Routing in Ad-Hoc Sensor Networks
Summary :
In this study, we propose a statistical reputation approach for constructing a reliable packet route in ad-hoc sensor networks. The proposed method uses reputation as a measurement for router node selection through which a reliable data route is constructed for packet delivery. To refine the reputation, a transaction density is defined here to showcase the influence of node transaction frequency over the reputation. And to balance the energy consumption and avoid choosing repetitively the same node with high reputation, node remaining energy is also considered as a reputation factor in the selection process. Further, a shortest-path-tree routing protocol is designed so that data packets can reach the base station through the minimum intermediate nodes. Simulation tests illustrate the improvements in the packet delivery ratio and the energy utilization.
- Publication
- IEICE TRANSACTIONS on Information Vol.E102-D No.2 pp.396-401
- Publication Date
- 2019/02/01
- Publicized
- 2018/11/06
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2018EDL8152
- Type of Manuscript
- LETTER
- Category
- Information Network
Authors
Fang WANG
Civil Aviation Flight University of China
Zhe WEI
Civil Aviation Flight University of China
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
Fang WANG, Zhe WEI, "A Statistical Reputation Approach for Reliable Packet Routing in Ad-Hoc Sensor Networks" in IEICE TRANSACTIONS on Information,
vol. E102-D, no. 2, pp. 396-401, February 2019, doi: 10.1587/transinf.2018EDL8152.
Abstract: In this study, we propose a statistical reputation approach for constructing a reliable packet route in ad-hoc sensor networks. The proposed method uses reputation as a measurement for router node selection through which a reliable data route is constructed for packet delivery. To refine the reputation, a transaction density is defined here to showcase the influence of node transaction frequency over the reputation. And to balance the energy consumption and avoid choosing repetitively the same node with high reputation, node remaining energy is also considered as a reputation factor in the selection process. Further, a shortest-path-tree routing protocol is designed so that data packets can reach the base station through the minimum intermediate nodes. Simulation tests illustrate the improvements in the packet delivery ratio and the energy utilization.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2018EDL8152/_p
Copy
@ARTICLE{e102-d_2_396,
author={Fang WANG, Zhe WEI, },
journal={IEICE TRANSACTIONS on Information},
title={A Statistical Reputation Approach for Reliable Packet Routing in Ad-Hoc Sensor Networks},
year={2019},
volume={E102-D},
number={2},
pages={396-401},
abstract={In this study, we propose a statistical reputation approach for constructing a reliable packet route in ad-hoc sensor networks. The proposed method uses reputation as a measurement for router node selection through which a reliable data route is constructed for packet delivery. To refine the reputation, a transaction density is defined here to showcase the influence of node transaction frequency over the reputation. And to balance the energy consumption and avoid choosing repetitively the same node with high reputation, node remaining energy is also considered as a reputation factor in the selection process. Further, a shortest-path-tree routing protocol is designed so that data packets can reach the base station through the minimum intermediate nodes. Simulation tests illustrate the improvements in the packet delivery ratio and the energy utilization.},
keywords={},
doi={10.1587/transinf.2018EDL8152},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - A Statistical Reputation Approach for Reliable Packet Routing in Ad-Hoc Sensor Networks
T2 - IEICE TRANSACTIONS on Information
SP - 396
EP - 401
AU - Fang WANG
AU - Zhe WEI
PY - 2019
DO - 10.1587/transinf.2018EDL8152
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E102-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2019
AB - In this study, we propose a statistical reputation approach for constructing a reliable packet route in ad-hoc sensor networks. The proposed method uses reputation as a measurement for router node selection through which a reliable data route is constructed for packet delivery. To refine the reputation, a transaction density is defined here to showcase the influence of node transaction frequency over the reputation. And to balance the energy consumption and avoid choosing repetitively the same node with high reputation, node remaining energy is also considered as a reputation factor in the selection process. Further, a shortest-path-tree routing protocol is designed so that data packets can reach the base station through the minimum intermediate nodes. Simulation tests illustrate the improvements in the packet delivery ratio and the energy utilization.
ER -
English
