Spray And Wait Research Articles

Markov Chain-based Mobility Prediction and Relay-node Selection for QoS Provisioned Routing in Opportunistic Wireless Network

In the fields of networking and communication, wireless sensor networks are a commonly used technology. Although Mobility in Wireless Networks or Mobile Ad hoc Networks (MANETs) were developed to solve most critical problems in a disaster scenario. However, data transmission in a disaster area is a difficult operation due to irregular connections between sensing devices and the sink. Opportunistic network-based MANETs are utilized to overcome this problem. There are many routing issues such as communication overhead ratio, packet loss, and packet delivery ratio at mobile nodes. There are several traditional approaches used in opportunistic networks for node localization and routing. The drawback of these traditional routing methods is their poor reliability. A Markov chain-based opportunistic routing protocol is proposed in this paper. A Markov chain model is used to predict the node mobility for the random mobility model, and a neighbor table-based relay node selection procedure is proposed. A Markov prediction model uses the history of a node’s movement without requiring additional information. By analyzing simulation metrics including delay, overhead rate, packet drop, and packet delivery rate, the proposed routing protocol is evaluated and verified based on the Packet Delivery Ratio (PDR) in an opportunistic network environment (ONE) simulator. In addition, existing routing protocols such as Spray and Wait (SNW), Epidemic, Prophet, and MaxPro differ from the proposed routing protocol in terms of buffer size, node count, and message generation rate. Corresponding result analysis demonstrates the superior performance of the proposed routing protocol over existing protocols.

Evaluation of Spray Based Routing Approaches in Delay Tolerant Networks

Delay Tolerant Networks (DTN) are mobile ad-hoc networks in which connections are often disruptive or discontinuous. Data forwarding using an appropriate routing strategy is a highly confronting issue in such networks. The traditional ad-hoc routing protocols which require end-to-end connectivity fail to function here due to frequent occurrences of network partitions. Spray and Wait (SaW) routing algorithm is a popular controlled replication based DTN protocol which provides a better delivery performance balancing the average delay and overhead ratio. An empirical analysis of various spray based approaches that have been proposed for DTN has been performed in this paper to compare and evaluate the basic Spray and Wait algorithms (Source Spray and Wait and Binary Sprayand Wait) with some of its major improvements (Spray andFocus, Average Delivery Probability Binary Spray and Wait and Composite methods to improve Spray and Wait). The main aim of this comparative study is to verify the effect of utility metrics in spray based routing protocols over simple spray based approaches. The ONE simulator has been used to provide a simulation environment to evaluate these algorithms and generate results. The performance metrics used are delivery ratio (DR), overhead ratio (OR) and average latency (ALat). The simulation results show that in terms of delivery ratio and average latency, Composite methods to improve Spray and Wait which incorporates delivery predictability metric in the wait phase and also acknowledgements to delete already deliveredmessages from a node’s buffer, outperforms all the other variants compared.

A Survey of Spray-and-Wait Routing Protocol in Pocket Switched Network

Store-Carry-Forward (SCF) approach provides a new paradigm to route messages in Pocket Switched Network (PSN). In this approach, a router node will store and carry the messages while roaming from one place to another place. Whenever the node meets a destination node, the routing messages will be immediately forwarded to the destination node. Unfortunately, this approach is hampered by the lack of infrastructure in the network, which directly effects on the quality of interconnection among nodes. Therefore, end-to-end connection between the source node and the destination node is difficult to be obtained. Many approaches have been proposed to overcome this problem. Indeed, several routing protocols have also considered these approaches for distributing their routing messages. However, a paper survey that comprehensively summarizes the proposed solutions are difficult to be found in the literature. This leads not easy to understand problems, solutions and future works for these approaches in the network. This paper presents a comprehensive survey to track the development of Spray-and-Wait (SNW) routing protocol, one of the most popular SCF-based routing protocol in PSN.

S-SPRAY ROUTING PROTOCOL FOR INTERMITTENTLY CONNECTED MOBILE NETWORKS

The Intermittently Connected Mobile Networks (ICMN) is a disconnected mobile network where a complete connectivity never exists. The intermittent connectivity is due to the dense nature of the network. The dense nature is mainly due to the high mobility of the nodes in the network. Routing in such a sparse network is arduous. Due to the disconnected attribute of the network, the encounter of the suspicious nodes in the network also remains a tedious task. In this paper, we put forward a secure routing that aids in detecting and preventing intrusion of malicious nodes. The routing process is made adorable through Spray and Wait (SNW). Since ICMN is prompt to higher delays certain authentication series are used to enable secure communication within the network. The amalgamation of SNW with authentication series leads a novel routing protocol named S-Spray (Secured-Spray) which is highly secure.

A Storage-Friendly Routing Scheme in Intermittently Connected Mobile Network

Considering the constraints brought by mobility and resources, it is important for routing protocols to efficiently deliver data in intermittently connected mobile networks. Different from previous works that use the knowledge of previous encounters to predict future contacts, we propose a storage-friendly region-based protocol, i.e., RENA, in this paper. Instead of using temporal information, RENA builds routing tables based on regional movement history, which avoids excessive storage for tracking encounter history. We validate the generality of RENA through a time-variant community mobility model with parameters extracted from the Massachusetts Institute of Technology (MIT) Wireless Local Area Network (WLAN) trace and a vehicular network based on eight bus routes in the city of Helsinki, Finland. The comprehensive simulation results show that RENA is not only storage friendly but also more efficient than epidemic routing, the restricted replication protocol spray and wait (SNW), and the encounter-based protocol resource allocation protocol for intentional delay-tolerant networks under various conditions.