A Statistical Reputation Approach for Reliable Packet Routing in Ad-Hoc Sensor Networks

Fang WANG  Zhe WEI  

IEICE TRANSACTIONS on Information and Systems   Vol.E102-D   No.2   pp.396-401
Publication Date: 2019/02/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2018EDL8152
Type of Manuscript: LETTER
Category: Information Network
statistical reputation,  reliable packet routing,  transaction density,  shortest-path-tree routing,  

Full Text: PDF(585.6KB)
>>Buy this Article

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.