Dynamic Spray and Wait Routing Algorithm with Quality of Node in Delay Tolerant Network

Wang, Guizhu; Wang, Bingting; Yong-zhi, Gao

doi:10.1109/cmc.2010.83

Cited by 46 publications

(26 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…QoN is measured from a number of neighbors that one node encounters in a time interval and is used as an indicator for a sender to decide to forward messages. From the result in [9], we find that Quality of Node Spray and Wait enhances delivery utility and reduces overhead. However, the overhead is still high.…”

Section: Related Workmentioning

confidence: 91%

See 1 more Smart Citation

DNH-SaW: The Different Neighbor-History Spray and wait routing scheme for Delay Tolerant Networks

Prueksasri

Intanagonwiwat

Rojviboonchai

2011

2011 International Symposium on Intelligent Signal Processing and Communications Systems (ISPACS)

View full text Add to dashboard Cite

In Delay Tolerant Networks (DTNs), network par titioning is likely to happen due to sparse and mobile nodes with limited transmission ranges. The network partitioning leads to the unavailability of fully connected paths from sources to destinations. To deal with this problem, many routing schemes are proposed such as Epidemic routing and Spray and Wait routing.These schemes obtain high delivery rate but incur high overhead.In this paper, we propose a Different Neighbor-History Spray and Wait (DNH-SaW) routing scheme. DNH-SaW calculates the number of data copies to forward based on the neighbor-history of each receiver. Our simulation result shows that DNH-SaW can reduce overhead up to 27% and increases delivery utility up to 21.68% while achieving comparable delivery probability with previous works.

show abstract

Section: Related Workmentioning

confidence: 91%

“…Recently, Quality of Node Spray and Wait [9] improves Binary Spray and Wait. In the Spray phase, a node forwards a number of message copies according to the Quality of Node (QoN).…”

Section: Related Workmentioning

confidence: 99%

DNH-SaW: The Different Neighbor-History Spray and wait routing scheme for Delay Tolerant Networks

Prueksasri

Intanagonwiwat

Rojviboonchai

2011

2011 International Symposium on Intelligent Signal Processing and Communications Systems (ISPACS)

View full text Add to dashboard Cite

show abstract

“…Wang et al [13] proposed the spray and wait algorithm based on the Epidemic algorithm. This algorithm consists of two phases, namely, spraying and waiting.…”

Section: Related Workmentioning

confidence: 99%

Information Transmission Probability and Cache Management Method in Opportunistic Networks

Chen

Zhao

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

In real network environment, nodes may acquire the communication destination during data transmission and find a suitable neighbor node to perform effective data classification transmission. This is similar to finding certain transmission targets during data transmission with mobile devices. However, the node cache space in networks is limited, and waiting for the destination node can also cause end-to-end delay. To improve the transmission environment, this study established Data Transmission Probability and Cache Management method. According to selection of high meeting probability node, cache space is reconstructed by node. It is good for nodes to improve delivery ratio and reduce delay. Through experiments and the comparison of opportunistic network algorithms, this method improves the cache utilization rate of nodes, reduces data transmission delay, and improves the overall network efficiency.

show abstract

“…Guizhu et al proposed Dynamic Spray and Wait Routing algorithm with Quality of Node in Delay Tolerant Network [13]. It introduces the notion of QoN (Quality of Nodes) to forward the number of message copies dynamically to avoid blind forwarding scheme in BSW.…”

Section: Other Workmentioning

confidence: 99%

Modified Different Neighbor History Spray and Wait using PROPHET in Delay Tolerant Network

Mehto¹,

Chawla²

2014

IJCA

View full text Add to dashboard Cite

Delay Tolerant Networks or Disruption Tolerant Networks are intermittent networks that may lack continuous connectivity as most of the time there does not exist a direct link between source and destination for message transmission. In this paper, Modified DNH (Different Neighbor-History) Spray and Wait using PROPHET is proposed. It improves the wait phase of Different Neighbor-History Spray and Wait. This protocol calculates number of message copies to be forwarded based on performance of receiver node in spray phase and in wait phase the waiting node uses probabilistic routing protocol using history of encounters and transitivity for transmission. Simulation results show that this method improves delivery probability and average latency of transmission as compared to Spray and Wait and also DNH-Spray and Wait routing scheme.

show abstract

Dynamic Spray and Wait Routing Algorithm with Quality of Node in Delay Tolerant Network

Cited by 46 publications

References 13 publications

DNH-SaW: The Different Neighbor-History Spray and wait routing scheme for Delay Tolerant Networks

DNH-SaW: The Different Neighbor-History Spray and wait routing scheme for Delay Tolerant Networks

Information Transmission Probability and Cache Management Method in Opportunistic Networks

Modified Different Neighbor History Spray and Wait using PROPHET in Delay Tolerant Network

Contact Info

Product

Resources

About