Delivery Probability Aware Data Forwarding Mechanism in Opportunistic Networks

Author

Liu Qiao-Shou ; Liu Jia ; Wang Yan-Yan

Author_Institution

Broadband Ubiquitous Network Res. Lab., Chongqing Univ. of Posts & Telecommun., Chongqing, China

fYear

2014

fDate

7-9 April 2014

Firstpage

151

Lastpage

155

Abstract

According to the store-carry-forward method in Opportunistic Networks, the status on data transmitting has the relationship with the selection of relay node, and the distributed estimating results can make the assistance on the designing on effective data forwarding mechanism. A novel method to estimate delivery probability of data is proposed in our paper. First, we estimate the chance of meeting among nodes with direct and indirect meeting probability, and then the relay nodes are selected based on the meeting probability. Results show the proposed estimating method is accurate, and the performance of delivery ratio and delivery cost can be improved.

Keywords

estimation theory; mobile ad hoc networks; probability; telecommunication network routing; data forwarding mechanism; delivery probability; delivery ratio; indirect meeting probability; opportunistic networks; relay node selection; store-carry-forward method; Ad hoc networks; Delays; History; Mobile communication; Mobile computing; Relays; Routing; data forwarding; dynamic sensing delivery Ratio; indirect encounter probability; opportunistic networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Systems and Network Technologies (CSNT), 2014 Fourth International Conference on

Conference_Location

Bhopal

Print_ISBN

978-1-4799-3069-2

Type

conf

DOI

10.1109/CSNT.2014.39

Filename

6821376