A survey on congestion control for delay and disruption tolerant networks

Silva, Aloizio P.; Burleigh, Scott; Hirata, Celso Massaki; Obraczka, Katia

doi:10.1016/j.adhoc.2014.07.032

Cited by 97 publications

(41 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The routing protocol layer plays an important role in improving the performance of wireless sensor networks for fixed and mobile nodes in the network [9,10]. Forwarding an amount of data from one node to sink node through intermediate nodes leads to fast death of nodes, especially those nodes which are near to the sink node [3,[11][12][13][14]. This will increase the possibility of the whole network death.…”

Section: Introductionmentioning

confidence: 99%

Prolonging the Network Lifetime of WSN by using the Consumed Power Fairly Protocol

Ahmed¹,

Abdullah²

2017

ijacsa

View full text Add to dashboard Cite

Abstract-In wireless sensor networks (WSN), energy saving is always a key concern. Since nodes have limited power, some of them may use specific routes, thus leading to exhaustion of intermediate nodes. These nodes die, which results in routing holes in the network. Consequently, the overall throughput of the network may get reduced. Therefore, in this study, the mathematical proposed model is leaded to optimal route by depending on equal power consumption from whole nodes in the network. Moreover, a new routing protocol model was designed. The protocol is termed as Consumed Power Fairly (CPF). This protocol could achieve high power efficiency by distributing power consumption equally to all nodes in the network. Our proposed model works on finding the route to destination with high power availability after summation of the total power for all nodes from the source to the destination node, thus subtracting the power consumption for particular data required to send. In short, the proposal CPF protocol reduces the number of dead nodes and keeps the connectivity high, which increases prolonging the network lifetime.

show abstract

Section: Introductionmentioning

confidence: 99%

Prolonging the Network Lifetime of WSN by using the Consumed Power Fairly Protocol

Ahmed¹,

Abdullah²

2017

ijacsa

View full text Add to dashboard Cite

show abstract

“…Although the aforementioned policies are used to handle forward and drop bundles when congestion occurs, some other policies are also proposed to regulate congestion in the network [51]. For example, in [52], Coe and Rachavendra propose a token-based congestion control regulates the amount of traffic in the network based on network capacity.…”

Section: Global Knowledge Schemesmentioning

confidence: 99%

A novel queue management policy for delay-tolerant networks

Iranmanesh

2016

J Wireless Com Network

View full text Add to dashboard Cite

Delay-tolerant networks (DTNs) have attracted increasing attention from governments, academia and industries in recent years. They are designed to provide a communication channel that exploits the inherent mobility of trams, buses and cars. However, the resulting highly dynamic network suffers from frequent disconnections, thereby making node-to-node communications extremely challenging. Researchers have thus proposed many routing/forwarding strategies in order to achieve high delivery ratios and/or low latencies and/or low overheads. Their main idea is to have nodes store and carry information bundles until a forwarding opportunity arises. This, however, creates the following problems. Nodes may have short contacts and/or insufficient buffer space. Consequently, nodes need to determine (i) the delivery order of bundles at each forwarding opportunity and (ii) the bundles that should be dropped when their buffer is full. To this end, we propose an efficient scheduling and drop policy for use under quota-based protocols. In particular, we make use of the encounter rate of nodes and context information such as time to live, number of available replicas and maximum number of forwarded bundle replicas to derive a bundle's priority. Simulation results, over a service quality metric comprising of delivery, delay and overhead, show that the proposed policy achieves up to 80 % improvement when nodes have an infinite buffer and up to 35 % when nodes have a finite buffer over six popular queuing policies: Drop Oldest (DO), Last Input First Output (LIFO), First Input First Output (FIFO), Most FOrwarded first (MOFO), LEast PRobable first (LEPR) and drop bundles with the greatest hop-count (HOP-COUNT).

show abstract

“…For an incoming bundle that has to be stored in a full node's buffer, in the Random policy, as the name would suggest, the dropped bundle is chosen randomly among every stored bundle [3].…”

Section: ) Randommentioning

confidence: 99%

“…As several articles state ( [1]- [3]), Delay Tolerant Networks (DTN) were historically originated as a proposal for Inter Planetary Networks (IPN) to provide communications between satellites, planets and base stations. This was a scenario in which high delays and frequent disconnections were very common, so the network should be able to take all of this into account, and use proper mechanisms to optimally manage this type of links.…”

Section: Introductionmentioning

confidence: 99%