Bonding Based Technique for message forwarding in Social Opportunistic Network

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.

Download Full-text

Survey on Node Mobility Model for Opportunistic Network

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.52-54.1253 ◽

2011 ◽

Vol 52-54 ◽

pp. 1253-1257 ◽

Cited By ~ 2

Author(s):

Ming Xia Yang ◽

Shuang Xia Han ◽

Cai Yun Yang ◽

Lu Zhang ◽

Dong Fen Ye

Keyword(s):

Wireless Sensor Networks ◽

Ad Hoc ◽

Mobility Model ◽

Opportunistic Networks ◽

Wireless Sensor ◽

Node Mobility ◽

Mobility Models ◽

Opportunistic Network ◽

Research Focus ◽

Mobile Ad Hoc

Opportunistic networks is one of the newest hot research spots in wireless networks after mobile ad hoc net-works(MANET) and wireless sensor networks(WSN). Mobility model describes mobility manners of nodes. It has been widely used in research on wireless network. This paper firstly introduced, classifies, and compares the current familiar mobility models. Secondly, it classifies, and compares the current familiar mobility models. Next, it was discussed that current research focus on new mobility models, analysis of nodes mobility features, trace strategy, and evaluation of mobility model. Finally, this paper involved what calls for further study.

Download Full-text

A Purpose-Driven User Mobility Model for Opportunistic Networks

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.171-172.804 ◽

2010 ◽

Vol 171-172 ◽

pp. 804-809

Author(s):

Jian Bo Xu ◽

Guang Yang

Keyword(s):

Human Movement ◽

Mobility Model ◽

Opportunistic Networks ◽

User Mobility ◽

Node Mobility ◽

Opportunistic Network ◽

Data Forwarding ◽

Challenging Tasks ◽

Efficient Data ◽

Two Sides

An opportunistic Network is a network consisting exclusively of users’ mobile devices, with mobility being one of its essential features. Under the circumstances that a path may never exist between the two sides of communication, an opportunistic network exploits node mobility to realize delayed data delivery by capturing the opportunities of node meeting to relay messages. Designing efficient data forwarding strategies is one of the most challenging tasks in opportunistic network research, while currently the validation of any protocol for data forwarding almost absolutely relies on simulations of which node mobility models are one of the fundamental components. In this paper, we suggest a purpose-driven user mobility model for opportunistic networks which, to our best knowledge, is the first work considering the factor of purposes behind users’ movement. On the basis of location functionalization, our model can gain a better approximation of human movement patterns.

Download Full-text

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

10.32920/ryerson.14657526 ◽

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.

Download Full-text

Routing in Opportunistic Networks: Implementation and Research Challenges

Journal of Engineering Research ◽

10.36909/jer.icari.15273 ◽

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.

Download Full-text

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

10.32920/ryerson.14657526.v1 ◽

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

Download Full-text

Establishing Reliability for Efficient Routing in Opportunistic Networks

Scalable Computing Practice and Experience ◽

10.12694/scpe.v20i1.1479 ◽

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.

Download Full-text

Opportunistic Network Algorithms for Internet Traffic Offloading in Music Festival Scenarios

Sensors ◽

10.3390/s21103315 ◽

2021 ◽

Vol 21 (10) ◽

pp. 3315

Author(s):

Aida-Ștefania Manole ◽

Radu-Ioan Ciobanu ◽

Ciprian Dobre ◽

Raluca Purnichescu-Purtan

Keyword(s):

High Performance ◽

Geographical Area ◽

Mobility Model ◽

Routing Algorithms ◽

Message Delivery ◽

Opportunistic Network ◽

Key Factors ◽

Network Algorithms ◽

Music Festival ◽

Social Metrics

Constant Internet connectivity has become a necessity in our lives. Hence, music festival organizers allocate part of their budget for temporary Wi-Fi equipment in order to sustain the high network traffic generated in such a small geographical area, but this naturally leads to high costs that need to be decreased. Thus, in this paper, we propose a solution that can help offload some of that traffic to an opportunistic network created with the attendees’ smartphones, therefore minimizing the costs of the temporary network infrastructure. Using a music festival-based mobility model that we propose and analyze, we introduce two routing algorithms which can enable end-to-end message delivery between participants. The key factors for high performance are social metrics and limiting the number of message copies at any given time. We show that the proposed solutions are able to offer high delivery rates and low delivery delays for various scenarios at a music festival.

Download Full-text

An improved supervisory protocol for automatic selection of routing protocols in environment-aware vehicular ad hoc networks

International Journal of Distributed Sensor Networks ◽

10.1177/1550147718815051 ◽

2018 ◽

Vol 14 (11) ◽

pp. 155014771881505 ◽

Cited By ~ 2

Author(s):

Ishtiaq Wahid ◽

Ata Ul Aziz Ikram ◽

Masood Ahmad ◽

Fasee Ullah

Keyword(s):

Routing Protocols ◽

Vehicular Ad Hoc Networks ◽

Ad Hoc ◽

Performance Metrics ◽

Mobility Model ◽

Operational Environment ◽

Trade Offs ◽

Microscopic Features ◽

And Performance ◽

Hoc Networks

With resource constraint’s distributed architecture and dynamic topology, network issues such as congestion, latency, power awareness, mobility, and other quality of service issues need to be addressed by optimizing the routing protocols. As a result, a number of routing protocols have been proposed. Routing protocols have trade-offs in performance parameters and their performance varies with the underlying mobility model. For designing an improved vehicular ad hoc network, three components of the network are to be focused: routing protocols, mobility models, and performance metrics. This article describes the relationship of these components, trade-offs in performance, and proposes a supervisory protocol, which monitors the scenario and detects the realistic mobility model through analysis of the microscopic features of the mobility model. An analytical model is used to determine the best protocol for a particular mobility model. The supervisory protocol then selects the best routing protocol for the mobility model of the current operational environment. For this, EstiNet 8.1 Simulator is used to validate the proposed scheme and compare its performance with existing schemes. Simulation results of the proposed scheme show the consistency in the performance of network throughout its operation.

Download Full-text