2015
DOI: 10.1007/978-3-319-15582-1_8
|View full text |Cite
|
Sign up to set email alerts
|

A Knapsack-Based Message Scheduling and Drop Strategy for Delay-Tolerant Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 15 publications
0
6
0
Order By: Relevance
“…However, the two strategies ignore the impact of contact duration on message delivery with the assumption that all messages are of the same size or that the bandwidth is infinite. Wang et al [Wang, Yang and Wu (2015); Liu, Wang, Zhang et al (2011)] calculate the utility value of each message based on the dissemination state of message copies, and then make the discard decision. However, they assume homogeneous node mobility, that is, all nodes have the same contact rates, the pair-wise inter-contact rates between nodes are subject to a uniform exponential distribution, which is uncommon in practice.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…However, the two strategies ignore the impact of contact duration on message delivery with the assumption that all messages are of the same size or that the bandwidth is infinite. Wang et al [Wang, Yang and Wu (2015); Liu, Wang, Zhang et al (2011)] calculate the utility value of each message based on the dissemination state of message copies, and then make the discard decision. However, they assume homogeneous node mobility, that is, all nodes have the same contact rates, the pair-wise inter-contact rates between nodes are subject to a uniform exponential distribution, which is uncommon in practice.…”
Section: Related Workmentioning
confidence: 99%
“…These strategies cannot achieve good performance as they do not utilize global network information [Liu and Bai (2015); Silva, Obraczka, Burleigh et al (2015)]. Krifa et al [Krifa, Barakat and Spyropoulos (2012); Wang, Wang, Feng et al (2017); Wang, Yang and Wu (2015)] have made some improvements by exploiting network-wide information such as node mobility model and the number of existing copies of each message in the network. However, these works neglect the limited contact duration and the heterogeneous mobility of nodes.…”
Section: Introductionmentioning
confidence: 99%
“…In the same year, Rashid et al [10] also introduce a variety of existing buffer management policies and performance evaluation indicators, and propose a Drop Largest (DLA) sorting strategy that drops large-size messages when the node buffer becomes congested. Wang et al propose a knapsack-based message scheduling and drop strategy for DTN in [20], and calculate utility values of those messages by quantifying the impact of replicating or dropping them. Based on the result of [20], the work in [21] further decides which message should be deleted based on the backpack problem when the buffer overflows, so as to maximize the utility of network resources.…”
Section: Single Standardmentioning
confidence: 99%
“…Wang et al propose a knapsack-based message scheduling and drop strategy for DTN in [20], and calculate utility values of those messages by quantifying the impact of replicating or dropping them. Based on the result of [20], the work in [21] further decides which message should be deleted based on the backpack problem when the buffer overflows, so as to maximize the utility of network resources. Similarly, Yong et al [22] propose an optimal adaptive buffer management scheme in the situations where the bandwidth is limited and messages vary in size.…”
Section: Single Standardmentioning
confidence: 99%
“…However, the proposed routing protocols seek to improve delivery ratio through increasing the number of message copies, and store the message until it finds an available link to use. The overhead in restricted bandwidth and the overflowing in limited buffer space are often neglected [14]. Especially in the realistic network environment, the congestion problem becomes more obvious.…”
Section: Introductionmentioning
confidence: 99%