Efficient Broadcasting in Delay Tolerant Networks

Goundan, Appu; Coe, E.; Raghavendra, C.S.

doi:10.1109/glocom.2008.ecp.107

Cited by 13 publications

(16 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This simulator has been used to evaluate various DTN multicast, broadcast, routing and congestion control schemes [13]. The importance of using correct mobility models for MANET research has been pointed out by [14].…”

Section: Simulation Environmentmentioning

confidence: 99%

Token Based Congestion Control for DTNs

Coe

Raghavendra

2010

2010 IEEE Aerospace Conference

Self Cite

View full text Add to dashboard Cite

Delay tolerant networks (DTN) are characterized by intermittent connectivity, long delays and often constrained bandwidth. We consider mobile networks where node mobility and covert operation cause frequent disconnections. Nodes will see each other frequently but due to their movement, end-to-end paths do not remain stable long enough to complete a data transfer or even a simple data exchange, much less allow current congestion control protocols to react to these highly dynamic environments. To address the challenge of congestion control in DTNs we have implemented a novel congestion control mechanism based on the use of tokens. Network nodes must possess a token in order to inject messages into the network. Tokens are initially uniformly distributed but thereafter move randomly throughout the network. Using a discrete event simulator we show Token Based Congestion Control (TBCC) results in a reduction in the amount of dropped messages due to network congestion. In cases where drops are not allowed we add a constraint to the forwarding algorithm and show that network transit times are reduced by as much as 40% and total transit times, defined as the time from message generation until delivery to the destination, are reduced by 20%. We also show 36% reduction in the amount of intermediate network storage required. These results are significant since they show a reduction in both space (network storage) and time.

show abstract

Section: Simulation Environmentmentioning

confidence: 99%

Token Based Congestion Control for DTNs

Coe

Raghavendra

2010

2010 IEEE Aerospace Conference

Self Cite

View full text Add to dashboard Cite

show abstract

“…In this case, each node manages its own history of message forwardings and exchanges it by piggybacking it on transmitted message. The second option is to manage a holding message list, an approach used in [12], [13]. In this case, each node exchanges a list of messages it is holding on every contact.…”

Section: Operationmentioning

confidence: 99%

“…When susceptible node S enters the communication range of an infected node, the infected node sets Like the conventional mechanisms [13], [18], [19], in CD-BCAST, each node manages a neighbor node list by listening (broadcasted) beacon frames from other nodes. Each node broadcasts a beacon frame periodically.…”

Section: Operationmentioning

confidence: 99%

“…If a node cannot receive a beacon frame from node X during a period δ, the node X is removed from the neighbor node list. In this paper, we consider the simplest mechanism as in conventional mechanisms [13], [18], [19]. We can embed the position information, migration information, and so on into the beacon.…”

Section: Operationmentioning

confidence: 99%

“…Epidemic broadcasting mechanisms for improving the efficiency of DTNs have been proposed using this approach [12], [13]. In k-neighbor-BCAST (kCopyright c 2015 The Institute of Electronics, Information and Communication Engineers neighbor-BroadCAST) [13], which is a representative of the mechanisms that increase the number of simultaneous forwardings, an infected node forwards a message only when the following two conditions hold: (1) k nodes exist in the communication range and (2) at least one of these nodes is a susceptible node (i.e., a node that does not hold a message). Therefore, nodes can simultaneously deliver a message to multiple nodes by means of a single message forwarding by utilizing the characteristics of radio communication.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Contact Duration-Aware Epidemic Broadcasting in Delay/Disruption-Tolerant Networks

Watabe

Ohsaki

2015

IEICE Trans. Commun.

View full text Add to dashboard Cite

SUMMARY DTNs (Delay/Disruption-Tolerant Networks) composed of mobile nodes in low node-density environments have attracted considerable attention in recent years. In this paper, we propose a CD-BCAST (Contact Duration BroadCAST) mechanism that can reduce the number of message forwardings while maintaining short message delivery delays in DTNs composed of mobile nodes. The key idea behind CD-BCAST is to increase the probability of simultaneous forwarding by intentionally delaying message forwarding based on the contact duration distribution measured by each node. Through simulations, we show that CD-BCAST needs substantially less message forwardings than conventional mechanisms and it does not require parameter tuning under varieties of communication ranges and node densities.

show abstract

ADMB: Application‐driven multihop broadcast for vehicular networks

Liu

Wang

et al. 2017

Int J Communication

View full text Add to dashboard Cite

Considering the strong correlation between packet's dissemination range and its originating application's benefit in vehicular networks, this paper introduces 2 new concepts of distance-dependent application influence and time-dependent application accuracy, both of which comprise the application profit. Then, we propose an application-driven multihop broadcast (ADMB) method through hop-by-hop tradeoff between the application profit and network cost in deciding whether or not to relay the broadcast. The dynamic network states and elapsed broadcasting value are joined into the decision-making process, by such way ADMB enables the cross-layer joint optimization between application and network layers. Moreover, ADMB permits applications themselves to preferentially customize their desired dissemination distance and tolerant sensitivity to the time-lag effect, which are characterized by influence coefficient and accuracy coefficient, respectively. Every relaying participant also could customize its priority consideration about application influence and accuracy as well as selfish extent in making decision. We perform extensive numerical calculations and simulations to investigate the applicability and use of ADMB against various combinations of application requirements and network parameters. The results show that ADMB can behave superiorly over the traditional fixed-hop broadcast, fully use the restrictive network resources, and adaptively react to the time-varying network context. KEYWORDS application driven, joint optimization, multihop broadcast, vehicular network 1 Int J Commun Syst. 2017;30:e3306.wileyonlinelibrary.com/journal/dac

show abstract

Efficient Broadcasting in Delay Tolerant Networks

Cited by 13 publications

References 13 publications

Token Based Congestion Control for DTNs

Token Based Congestion Control for DTNs

Contact Duration-Aware Epidemic Broadcasting in Delay/Disruption-Tolerant Networks

ADMB: Application‐driven multihop broadcast for vehicular networks

Contact Info

Product

Resources

About