A novel queue management policy for delay-tolerant networks

Iranmanesh, Saeid

doi:10.1186/s13638-016-0576-6

Cited by 15 publications

(10 citation statements)

References 64 publications

(129 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this results in the network with a high overhead [10,13]. In contrast, the quota-based protocols have a low overhead, but lower delivery ratio [14]. As we will show in our simulation studies (Section 5).…”

Section: Introductionmentioning

confidence: 91%

A Novel Data Forwarding Strategy for a Drone Delay Tolerant Network with Range Extension

Iranmanesh¹,

Raad

2019

Electronics

Self Cite

View full text Add to dashboard Cite

Amazon, Uber Eats, and United Parcel Service (UPS) are planning to launch drone delivery services in the near future. Indeed, recently, Google has received Federal Aviation Administration (FAA) approval for its Wings delivery platform. Amazon claims that a drone logistics network is more cost-efficient and quicker than a motor vehicle delivery network. In this paper, we propose a data delivery service by the drone network in addition to parcel delivery. We propose Heuristic Flight Path Planning (HFPP) that plans a drone’s flight path based on parcel delivery destination as well as data delivery destinations (waypoints). We further extend the solution to include drone charging stations for range extension. Our simulation studies show that our proposed method has delivered the data and consignments such that HFPP delivers up to 33% more data packets compared with Encounter-Based Routing (EBR), Epidemic, and a similar path planning method. Also, HFPP reduces the data delivery delays by up to 72% while the overhead ratio is low.

show abstract

Section: Introductionmentioning

confidence: 91%

A Novel Data Forwarding Strategy for a Drone Delay Tolerant Network with Range Extension

Iranmanesh¹,

Raad

2019

Electronics

Self Cite

View full text Add to dashboard Cite

show abstract

“…Because nodes in an opportunistic environment are buffer‐constrained, efficient utilization of resources (such as buffer, bandwidth, contact duration, etc.,) is necessary to achieve optimal routing performance. Even if, many of the researchers developed efficient buffer management schemes for opportunistic networks; they do not consider the selfish behaviour of the nodes in the network. Need for a new routing algorithm to address buffer‐aware selfishness …”

Section: Related Workmentioning

confidence: 99%

“…Because, autonomy of nodes is obvious in such an environment, the level of node cooperation is also important to achieve higher throughput. None of the existing algorithms are suitable for such smart opportunistic environment because of their unrealistic assumptions. Lack of real test‐bed analysis : Most of the existing algorithms evaluated their routing performance using synthetic traces and none of them conducted any test‐bed analysis in real‐life smart opportunistic network scenarios.…”

Section: Related Workmentioning

confidence: 99%

“…Most of the traditional opportunistic routing and data forwarding algorithms have weak assumptions about the resource constraints and selfish behaviour of buffer‐constrained nodes. Although some of the researchers developed buffer management policies, for optimal routing performance in opportunistic networks, they have ignored the selfish behaviour of nodes caused by resource constraints. So, an efficient routing algorithm has to be designed for an SoE, which should satisfy following four performance requirements—(1) High throughput, (2) Low delay, (3) Optimal resource utilization, and (4) Tolerance to node selfishness.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Addressing space‐constraint driven selfishness in smart opportunistic environment

Sobin¹,

Raychoudhury

Saha

2018

Int J Communication

View full text Add to dashboard Cite

A smart opportunistic environment is a physical space, which allows the smart physical objects to communicate in the presence of disruption in connectivity. Because, the objects in such an environment are buffer constrained, some of the objects will not participate in data forwarding, when there is scarcity of storage (buffer) space. In this paper, we focus on such selfish behavior of other's name/id but not their respective location. In such a case, S has to choose an intermediate node from a set of its neighbor nodes (eg, between R 1 and R 2 ), such that the interest on item will be eventually delivered to B, through multihop communication. Suppose, if R 1 is selected as relay, it may behave selfishly due to scarcity of its resources, and drop the interest. This type of selfish behaviour triggered by the resource-constraints in nodes is non-trivial to detect, as the nodes may suddenly start behaving selfishly when their resources fall below some threshold.Data forwarding in an SoE is quite challenging because of dynamic network topology, frequent network disruptions caused by node mobility, resource constraints, selfish behavior of nodes, etc. The aforementioned use case ( Figure 1) can be modeled with Opportunistic Networks or Delay Tolerant Networks (DTNs), where nodes store, carry and forward messages in the presence of intermittent network connectivity.The concept of the node selfishness is an important factor to be considered in DTN routing. Considering a variety of applications of DTNs such as crisis management, battlefield, wildlife monitoring, vehicular network, Pocket Switched Networks (PSN), etc., the nodes in those networks are having energy constraints (limited power) and resource constraints (limited buffer, bandwidth, etc.). So, nodes in such a network may not be ready to receive the messages destined for other nodes, as message reception and forwarding are both energy consuming and resource utilizing processes. Also, in some of the applications of DTNs, such as vehicular network and PSN, which are networks of mobile phones carried by humans, the behavioral properties of humans (such as selfishness, friendship, etc.) will influence the network characteristics. Recent research 1 suggests that humans are naturally selfish and they cooperate based on their selfish needs. So selfishness of the nodes have to be considered while designing DTN routing protocol.Most of the traditional opportunistic routing and data forwarding algorithms 2-14 have weak assumptions about the resource constraints and selfish behaviour of buffer-constrained nodes. Although some of the researchers developed buffer management policies, 15-19 for optimal routing performance in opportunistic networks, they have ignored the selfish behaviour of nodes caused by resource constraints. So, an efficient routing algorithm has to be designed for an SoE, which should satisfy following four performance requirements-(1) High throughput, (2) Low delay, (3) Optimal resource utilization, and (4) Tolerance to node selfishness.The present paper ...

show abstract

“…Yao et al [23] preferentially compute the utility value of caching data based on node interest and data transfer probability, and then design the overall cache management strategy including passive and proactive dropping policy, and scheduling policy. For instance, the author of [24] provides message priority information for the mobile vehicle by using the node encounter rate and context information, such as survival time, number of available copies and maximum number of forwarding message copies. However, this method is passive and nodes in the communication range can't initiatively select whether to receive the message from other nodes.…”

Section: Multiple Standardsmentioning

confidence: 99%

A Combinational Buffer Management Scheme in Mobile Opportunistic Network

Yuan

2017

Future Internet

View full text Add to dashboard Cite

Nodes in Mobile Opportunistic Network (MON) have to cache packets to deal with the intermittent connection. The buffer management strategy obviously impacts the performance of MON, and it attracts more attention recently. Due to the limited storage capacity of nodes, traditional buffer management strategies just drop messages based on the property of message, and they neglect the collaboration between neighbors, resulting in an ineffective performance improvement. Therefore, effective buffer management strategies are necessary to ensure that each node has enough buffer space to store the message when the node buffer is close to congestion. In this paper, we propose a buffer management strategy by integrating the characteristics of messages and nodes, and migrate the redundant messages to the neighbor to optimize the total utility, instead of deleting them. The simulation experiment results show that it can obviously improve the delivery ratio, the overhead ratio and the average delays, and reduce the amount of hops compared with the traditional ones.

show abstract

A novel queue management policy for delay-tolerant networks

Cited by 15 publications

References 64 publications

A Novel Data Forwarding Strategy for a Drone Delay Tolerant Network with Range Extension

A Novel Data Forwarding Strategy for a Drone Delay Tolerant Network with Range Extension

Addressing space‐constraint driven selfishness in smart opportunistic environment

A Combinational Buffer Management Scheme in Mobile Opportunistic Network

Contact Info

Product

Resources

About