Buffer management and hybrid probability choice routing for packet delivery in opportunistic networks (Q1955228): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2012/817528 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2074754643 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58912086 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: InterPlaNetary Internet: State-of-the-art and research challenges. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Traffic dynamics on complex networks: a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximating ideal filters by systems of fractional order / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:02, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Buffer management and hybrid probability choice routing for packet delivery in opportunistic networks |
scientific article |
Statements
Buffer management and hybrid probability choice routing for packet delivery in opportunistic networks (English)
0 references
11 June 2013
0 references
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.
0 references