Buffer management and hybrid probability choice routing for packet delivery in opportunistic networks
type: Item
instance of: scholarly article
title: Buffer management and hybrid probability choice routing for packet delivery in opportunistic networks
zbMATH Open document ID: 1264.90034
DOI: 10.1155/2012/817528
author: Daru Pan
author: Wei Cao
author: Han Zhang
author: Mu Lin
published in: Mathematical Problems in Engineering
publication date: 2013-06-11T00:00:00Z
review text: Summary: Due to the features of long connection delays, frequent network partitions, and topology unsteadiness, the design of opportunistic networks faces the challenge of how to effectively deliver data based only on occasional encountering of nodes, where the conventional routing schemes do not work properly. This paper proposes a hybrid probability choice routing protocol with buffer management for opportunistic networks. A delivery probability function is set up based on continuous encounter duration time, which is used for selecting a better node to relay packets. By combining the buffer management utility and the delivery probability, a total utility is used to decide whether the packet should be kept in the buffer or be directly transmitted to the encountering node. Simulation results show that the proposed routing outperforms the existing one in terms of the delivery rate and the average delay.
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 6173603
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2012/817528
OpenAlex ID: W2074754643
Wikidata QID: Q58912086
cites work: InterPlaNetary Internet: State-of-the-art and research challenges.
cites work: Traffic dynamics on complex networks: a survey
cites work: Approximating ideal filters by systems of fractional order
description: scientific article; zbMATH DE number 6173603