scholarly journals Routing in Opportunistic Networks: Implementation and Research Challenges

2021 ◽  
Author(s):  
Rahul Sachdeva ◽  
◽  
Amita Dev ◽  
Keyword(s):  
Relay Node ◽  
Opportunistic Networks ◽  
Network Routing ◽  
Literature Survey ◽  
Delay Tolerant Network ◽  
Destination Node ◽  
Extensive Literature ◽  
Opportunistic Network ◽  
Open Problems ◽  
One Simulator

Opportunistic Networks can be defined as Delay Tolerant Network, which are formed dynamically with participating nodes’ help. Opportunistic Networks follows Store-Carry-Forward principle to deliver/route the data in the network. Routing in Opportunistic Network starts with the Seed Node (Source Node) which delivers the data with the help of Intermediate nodes. Intermediate nodes store the data while roaming in the network until it comes in contact with appropriate forwarding node (relay node) or destination node itself. An extensive literature survey is performed to analyse various routing protocols defined for Opportunistic Network. With mobility induced routing, establishing and maintaining the routing path is a major challenge. Further, Store-Carry-Forward routing paradigm imposes various challenges while implementing and executing the network. Due to the unavailability of the suitable relay node, data needs to be stored within the Node’s Memory, imposes buffer storage issues at the node level. Also, uncontrolled flooding may impose link-level Congestion and treated as overhead to maintain the network. Another major challenge can be maintaining the energy level of the nodes in the network. Recently developed ONE (Opportunistic Network Environment) Simulator is used to simulate and emulate the environment required by Opportunistic Network. Along with the extensive literature survey of the protocols, few of the existing protocols viz. Direct Delivery, ProPHET, Epidemic and Spray & Wait Routing are implemented using ONE Simulator to analyse their performance while in execution. Results are being compared, and the researchers’ future direction is identified to address the open problems and challenges in Opportunistic Network.

scholarly journals Analisis Unjuk Kerja Protokol Spray and Focus di Jaringan Opportunistic

AITI ◽  
2018 ◽  
Vol 15 (1) ◽  
pp. 67-74
Author(s):  
Maria Hilary ◽  
Bambang Soelistijanto
Keyword(s):  
Routing Protocol ◽  
Relay Node ◽  
Delay Tolerant Network ◽  
Destination Node ◽  
Delivery Probability ◽  
Performance Matrix ◽  
Result Show ◽  
Working Day ◽  
One Simulator ◽  
Delay Tolerant

Delay Tolerant Network (DTN) is a wireless connection which does not need infrastructure in its formation. In this research the writer test the performance of a spray and focus routing protocol in opportunistic network using ONE SIMULATOR. Performance matrix used are delivery probability, overhead, delay, and drop. Scenario used in every test are increasing the number of nodes, increasing the number of copy pesan, additional TTL (time-to-live), and addition of buffer capacity. The test result show that spray and focus routing protocol is better in working day movement when TTL is increasing because spray and focus uses transitivity to choise the best relay node so the message can reach its destination in a shorter time even though nodes are often forming a community. The delivery probabilty reached 99.4% which is mean in every 100 messages, 99 messages are sucessfully delivered to destination node.

scholarly journals Establishing Reliability for Efficient Routing in Opportunistic Networks

2019 ◽  
Vol 20 (1) ◽  
pp. 27-40
Author(s):  
Deepak Kumar Sharma ◽  
Deepika Kukreja
Keyword(s):  
Opportunistic Networks ◽  
Source Node ◽  
Buffer Overflow ◽  
Destination Node ◽  
Message Delivery ◽  
Opportunistic Network ◽  
Intermediate Node ◽  
Delivery Probability ◽  
One Simulator ◽  
Spray And Wait

Opportunistic network (Oppnet) is a class of networks where connections between the nodes are not permanent. The nodes are continuously moving and some nodes even switch off their batteries to conserve energy. Reliable delivery of messages in Opportunistic network is one major inherent issue. It is unreliable in the sense that once the source node has forwarded its message, then it will never get to know about its status in the network like whether the message has got discarded at an intermediate node or at the destination node (due to buffer overflow) or the successful delivery of the message has taken place. This work tries to make Oppnet as much reliable as possible. It proposes a reliability protocol named as “Reliability in Oppnet” (RIO). RIO improves the routing in Oppnet and works in parallel with the existing routing protocols. It makes the source node aware about the status of message so that if an error occurs then the source node can take suitable action to resend the message. It considers the redirection error, buffer overflow error, Time Limit Exceeded (TLE), parameter problem and destination unreachable errors that may occur inside the network. RIO has been tested using ONE simulator and implemented with Spray and Wait routing protocol. Results show that the RIO with Spray and Wait protocol outperforms normal Spray and Wait protocol in terms of average message delivery probability.

scholarly journals An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks

2018 ◽  
Vol 8 (11) ◽  
pp. 2215 ◽  
Author(s):  
Eun Lee ◽  
Dong Seo ◽  
Yun Chung
Keyword(s):  
Routing Protocol ◽  
Opportunistic Networks ◽  
Opportunistic Routing ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Destination Node ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Final Destination ◽  
History Of

In opportunistic networks such as delay tolerant network, a message is delivered to a final destination node using the opportunistic routing protocol since there is no guaranteed routing path from a sending node to a receiving node and most of the connections between nodes are temporary. In opportunistic routing, a message is delivered using a ‘store-carry-forward’ strategy, where a message is stored in the buffer of a node, a node carries the message while moving, and the message is forwarded to another node when a contact occurs. In this paper, we propose an efficient opportunistic routing protocol using the history of delivery predictability of mobile nodes. In the proposed routing protocol, if a node receives a message from another node, the value of the delivery predictability of the receiving node to the destination node for the message is managed, which is defined as the previous delivery predictability. Then, when two nodes contact, a message is forwarded only if the delivery predictability of the other node is higher than both the delivery predictability and previous delivery predictability of the sending node. Performance analysis results show that the proposed protocol performs best, in terms of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.

scholarly journals A history-based energy-efficient routing protocol for opportunistic networks

2021 ◽  
Author(s):  
Khuram Khalid
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Opportunistic Networks ◽  
Superior Performance ◽  
Opportunistic Network ◽  
Energy Aware ◽  
Energy Efficient Routing ◽  
One Simulator ◽  
Overhead Ratio

In this thesis, a history-based energy-efficient routing protocol (called AEHBPR) for opportunistic networks (OppNets) is proposed, which saves the energy consumption by avoiding unnecessary packets transmission in the network and by clearing the buffer of nodes carrying the copies of the already delivered packets. The proposed AEHBPR protocol is evaluated using the Opportunistic NEtwork (ONE) simulator with both synthetic and real mobility traces, showing a superior performance compared to the History-Based Prediction for Routing (HBPR) protocol and AEProphet, in terms of average remaining energy, number of dead nodes, number of delivered messages, and overhead ratio, where AEProphet is the ProPHet routing protocol for OppNets on which the same energy-aware mechanism has been implemented.

scholarly journals A Routing Algorithm for the Sparse Opportunistic Networks Based on Node Intimacy

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Gang Xu ◽  
Xinyue Wang ◽  
Na Zhang ◽  
Zhifei Wang ◽  
Lin Yu ◽  
...  
Keyword(s):  
Routing Algorithm ◽  
Opportunistic Networks ◽  
Network Routing ◽  
Routing Algorithms ◽  
Time Slice ◽  
Message Delivery ◽  
Opportunistic Network ◽  
Network Resources ◽  
Subsequent Time

Opportunistic networks are becoming more and more important in the Internet of Things. The opportunistic network routing algorithm is a very important algorithm, especially based on the historical encounters of the nodes. Such an algorithm can improve message delivery quality in scenarios where nodes meet regularly. At present, many kinds of opportunistic network routing algorithms based on historical message have been provided. According to the encounter information of the nodes in the last time slice, the routing algorithms predict probability that nodes will meet in the subsequent time slice. However, if opportunistic network is constructed in remote rural and pastoral areas with few nodes, there are few encounters in the network. Then, due to the inability to obtain sufficient encounter information, the existing routing algorithms cannot accurately predict whether there are encounters between nodes in subsequent time slices. For the purpose of improving the accuracy in the environment of sparse opportunistic networks, a prediction model based on nodes intimacy is proposed. And opportunistic network routing algorithm is designed. The experimental results show that the ONBTM model effectively improves the delivery quality of messages in sparse opportunistic networks and reduces network resources consumed during message delivery.

scholarly journals Novel Opportunistic Network Routing Based on Social Rank for Device-to-Device Communication

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Tong Wang ◽  
Yongzhe Zhou ◽  
Yunfeng Wang ◽  
Mengbo Tang
Keyword(s):  
Communication Networks ◽  
Social Rank ◽  
Large Data ◽  
Opportunistic Networks ◽  
Network Routing ◽  
Delivery Ratio ◽  
Opportunistic Network ◽  
Fifth Generation ◽  
Device To Device ◽  
Data Files

In recent years, there has been dramatic proliferation of research concerned with fifth-generation (5G) mobile communication networks, among which device-to-device (D2D) communication is one of the key technologies. Due to the intermittent connection of nodes, the D2D network topology may be disconnected frequently, which will lead to failure in transmission of large data files. In opportunistic networks, in case of encountering nodes which never meet before a flood message blindly to cause tremendous network overhead, a novel opportunistic network routing protocol based on social rank and intermeeting time (SRIT) is proposed in this paper. An improved utility approach applied in utility replication based on encounter durations and intermeeting time is put forward to enhance the routing efficiency. Meanwhile, in order to select better candidate nodes in the network, a social graph among people is established when they socially relate to each other in social rank replication. The results under the scenario show an advantage of the proposed opportunistic network routing based on social rank and intermeeting time (SRIT) over the compared algorithms in terms of delivery ratio, average delivery latency, and overhead ratio.

scholarly journals Bonding Based Technique for message forwarding in Social Opportunistic Network

2019 ◽  
Vol 20 (1) ◽  
pp. 1-15 ◽  
Author(s):  
Ritu Nigam ◽  
Deepak Kumar Sharma ◽  
Satbir Jain ◽  
Sarthak Gupta ◽  
Shilpa Ghosh
Keyword(s):  
Shortest Path ◽  
Mobility Model ◽  
Opportunistic Networks ◽  
Opportunistic Network ◽  
Contact Information ◽  
Indirect Bonding ◽  
Average Latency ◽  
Shortest Path Map ◽  
And Performance ◽  
One Simulator

Integrating social networks properties such as centrality, tie strength, etc into message forwarding protocols in opportunistic networks has grown into a vital major benchmark. The opportunistic network is a demanding network with no set route to travel a message from the source to be able to the destination. During these networks, nodes use possibilities gained based on store-carry-forward patterns to forward communications. Every node that obtains a message when it activities another node makes selection concerning the forwarding or not necessarily delivering the node came across. Most of these message forwarding protocols use the benefit of social properties information like contact information and social relationship enclosed by the nodes in the social opportunistic network. In this paper, a Bonding based forwarding technique is proposed which is finding direct and indirect bonding among nodes by exploiting contact information and social pattern. In the proposed protocol, we also focus on indirect bonding by finding weakest direct bonded nodes and then replace it with strong indirect bonded nodes of the network. In this work, the balance between transmission delay and network traffic is considered by using shortest path map based mobility model. ONE simulator is used for simulation and performance of the proposed protocol is compared contrary popular approaches for instance Epidemic, PRoPHET, and BubbleRap, and Interaction based when using the shortest path map based mobility model. The Bonding based forwarding technique performs adequately well concerning the number of messages delivered, overhead ratio, message dropping and average latency.

scholarly journals A history-based energy-efficient routing protocol for opportunistic networks

2021 ◽  
Author(s):  
Khuram Khalid
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Opportunistic Networks ◽  
Superior Performance ◽  
Opportunistic Network ◽  
Energy Aware ◽  
Energy Efficient Routing ◽  
One Simulator ◽  
Overhead Ratio

In this thesis, a history-based energy-efficient routing protocol (called AEHBPR) for opportunistic networks (OppNets) is proposed, which saves the energy consumption by avoiding unnecessary packets transmission in the network and by clearing the buffer of nodes carrying the copies of the already delivered packets. The proposed AEHBPR protocol is evaluated using the Opportunistic NEtwork (ONE) simulator with both synthetic and real mobility traces, showing a superior performance compared to the History-Based Prediction for Routing (HBPR) protocol and AEProphet, in terms of average remaining energy, number of dead nodes, number of delivered messages, and overhead ratio, where AEProphet is the ProPHet routing protocol for OppNets on which the same energy-aware mechanism has been implemented.

An Efficient Distributed Single-hop Relay Supporting (EDSRS) MAC Protocol for Wireless Sensor Networks

2019 ◽  
Vol 9 (2) ◽  
pp. 153-164
Author(s):  
Arvind Kakria ◽  
Trilok Chand Aseri
Keyword(s):  
Energy Efficiency ◽  
Cooperative Communication ◽  
Mimo Systems ◽  
Mac Protocol ◽  
Multiple Input Multiple Output ◽  
Relay Node ◽  
Base Stations ◽  
Destination Node ◽  
Distributed Coordination ◽  
Hardware Complexity

Background & Objective: Wireless communication has immensely grown during the past few decades due to significant demand for mobile access. Although cost-effective as compared to their wired counterpart, maintaining good quality-of-service (QoS) in these networks has always remained a challenge. Multiple-input Multiple-output (MIMO) systems, which consists of multiple transmitter and receiver antennas, have been widely acknowledged for their QoS and transmit diversity. Though suited for cellular base stations, MIMO systems are not suited for small-sized wireless nodes due to their hardware complexity, cost, and increased power requirements. Cooperative communication that allows relays, i.e. mobile or fixed nodes in a communication network, to share their resources and forward other node’s data to the destination node has substituted the MIMO systems nowadays. To harness the full benefit of cooperative communication, appropriate relay node selection is very important. This paper presents an efficient single-hop distributed relay supporting medium access control (MAC) protocol (EDSRS) that works in the single-hop environment and improves the energy efficiency and the life of relay nodes without compensating the throughput of the network. Methods: The protocol has been simulated using NS2 simulator. The proposed protocol is compared with energy efficient cooperative MAC protocol (EECOMAC) and legacy distributed coordination function (DCF) on the basis of throughput, energy efficiency, transmission delay and an end to end delay with various payload sizes. Result and Conclusion: The result of the comparison indicates that the proposed protocol (EDSRS) outperforms the other two protocols.

Sign in / Sign up

Export Citation Format

Share Document