Enhanced Buffer Management for Data Delivery to Multiple Destinations in DTNs

Hsu, Yu-Feng; Hu, Chih‐Lin

doi:10.1109/tvt.2015.2503431

Cited by 15 publications

(14 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, when a one-and two-hop relay does not qualify for receiving a message, a centrality metric value is used instead. Let the inter-contact between n i and n j follow an exponential distribution with a meeting rate λ i,j [27], where λ i,j is calculated by…”

Section: Casementioning

confidence: 99%

Enhanced Geographic Routing with One- and Two-Hop Movement Information in Opportunistic Ad Hoc Networks

Mir

Zhu

2022

Future Internet

Self Cite

View full text Add to dashboard Cite

Opportunistic ad hoc networks are characterized by intermittent and infrastructure-less connectivity among mobile nodes. Because of the lack of up-to-date network topology information and frequent link failures, geographic routing utilizes location information and adopts the store–carry–forward data delivery model to relay messages in a delay-tolerant manner. This paper proposes a message-forwarding policy based on movement patterns (MPMF). First, one- and two-hop location information in a geographic neighborhood is exploited to select relay nodes moving closer to a destination node. Message-forwarding decisions are made by referring to selected relay nodes’ weight values obtained by calculating the contact frequency of each node with the destination node. Second, when relays in the vicinity of a message-carrying node are not qualified due to the sparse node density and nodal motion status, the destination’s movement and the location information of a one-hop relay are jointly utilized to improve the message-forwarding decision. If the one-hop relay is not closer to the destination node or moving away from it, its centrality value in the network is used instead. Based on both synthetic and real mobility scenarios, the simulation results show that the proposed policy performs incomparable efforts to some typical routing policies, such as Epidemic, PRoPHETv2, temporal closeness and centrality-based (TCCB), transient community-based (TC), and geographic-based spray-and-relay (GSaR) routing policies.

show abstract

Section: Casementioning

confidence: 99%

Enhanced Geographic Routing with One- and Two-Hop Movement Information in Opportunistic Ad Hoc Networks

Mir

Zhu

2022

Future Internet

Self Cite

View full text Add to dashboard Cite

show abstract

“…The concerns of message scheduling and drop prioritization become critical from the point of view of maximizing system performance 30 . Prior research introduced many heuristic‐based 31–35 and optimal‐based policies in the OppNet community 8,9,11,36,37 . The heuristic policies used various statuses of messages to estimate the probability of a message being delivered to the destination.…”

Section: Related Workmentioning

confidence: 99%

Quota‐based routing and buffer management with heuristic strategies in opportunistic ad hoc networks

Mir

2022

Int J Communication

View full text Add to dashboard Cite

Summary Opportunistic ad hoc networks (OppNets) are characterized by intermittent and infrastructure‐less connectivity among mobile nodes with limited internode communication and buffer space. Without persistent end‐to‐end routing information, replication‐based routing techniques are often used to distribute duplicate messages in OppNets, which unfortunately leads to enormous costs of transmission, storage, and energy resources. Prior replication‐based routing schemes were mainly based on several premises, for example, the availability of global network knowledge, unlimited bandwidth capacity, and homogeneous contact patterns. In this paper, we propose a quota‐based routing scheme with finite buffer management, named QRBP, regardless of these weak premises. The QRBP scheme comprises two essential functions. First, only a portion of nodes with higher mobility are delegated to carry a certain quota of message replicas and disseminate those messages to nodes with lower mobility. The message traffic can be evenly diverted to relay nodes, which reduces the transmission overhead in the network. Second, nodes can manipulate message scheduling and dropping to improve the successful delivery rate according to heuristic strategies based on several measures of the quota value, remaining time‐to‐live, and contact rate with the destination. Furthermore, our study conducts extensive simulations under both synthetic and real mobility scenarios. In terms of transmission overhead ratio and successful delivery rate, the QRBP scheme performs better than Epidemic, Spray and Wait, and Temporal Closeness and Centrality‐Based (TCCB) routing schemes, as well as common buffer management policies like Drop Oldest, Drop Newest, Drop Random, and Space‐Time Drop.

show abstract

“…5) The first meeting time of any two nodes moving in the same fixed movement mode, starting from a random time, is exponentially distributed. This assumption is reasonable when R L c and R L [12], and has been extensively used in recent years [14], [23], [24], [27], [28], [29] 7) The delay of a message transmission, which corresponds to a short time, is negligible [10], [12], [19], [23], [24], [30], [31], [32], [33], [34], [35].…”

Section: Network Modelmentioning

confidence: 99%

Performance Modeling of Epidemic Routing in Mobile Social Networks with Emphasis on Scalability

Rashidi¹,

Dalili-Yazdi²,

Entezari‐Maleki³

et al. 2020

Preprint

View full text Add to dashboard Cite

This paper investigates the performance of epidemic routing in mobile social networks. It first analyzes the time taken for a node to meet the first node of a set of nodes restricted to move in a specific subarea. Afterwards, a monolithic Stochastic Reward Net (SRN) is proposed to evaluate the delivery delay and the average number of transmissions under epidemic routing by considering skewed location visiting preferences. This model is not scalable enough, in terms of the number of nodes and frequently visited locations. In order to achieve higher scalability, the folding technique is applied to the monolithic model, and an approximate folded SRN is proposed to evaluate performance of epidemic routing. Discrete-event simulation is used to validate the proposed models. Both SRN models show high accuracy in predicting the performance of epidemic routing. We also propose an Ordinary Differential Equation (ODE) model for epidemic routing and compare it with the folded model. Obtained results show that the folded model is more accurate than the ODE model. Moreover, it is proved that the number of transmissions by the time of delivery follows uniform distribution, in a general class of networks, where positions of nodes are always independent and identically distributed.

show abstract

Enhanced Buffer Management for Data Delivery to Multiple Destinations in DTNs

Cited by 15 publications

References 12 publications

Enhanced Geographic Routing with One- and Two-Hop Movement Information in Opportunistic Ad Hoc Networks

Enhanced Geographic Routing with One- and Two-Hop Movement Information in Opportunistic Ad Hoc Networks

Quota‐based routing and buffer management with heuristic strategies in opportunistic ad hoc networks

Performance Modeling of Epidemic Routing in Mobile Social Networks with Emphasis on Scalability

Contact Info

Product

Resources

About