Improving network performance with affinity based mobility model in opportunistic network

2012 ◽  
Author(s):  
Suvadip Batabyal ◽  
Parama Bhaumik
Keyword(s):  
Network Performance ◽  
Mobility Model ◽  
Opportunistic Network

scholarly journals Opportunistic Network Algorithms for Internet Traffic Offloading in Music Festival Scenarios

Sensors ◽  
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.

Survey on Node Mobility Model for Opportunistic Network

2011 ◽  
Vol 52-54 ◽  
pp. 1253-1257 ◽  
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.

A Purpose-Driven User Mobility Model for Opportunistic Networks

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.

An Evolving GPSR Protocol in Urban Roundabout Scenario

2014 ◽  
Vol 596 ◽  
pp. 833-837
Author(s):  
Hai Yang Yu ◽  
Hua Min Yang ◽  
Xiao Qiang Di ◽  
Liang Dong Qu
Keyword(s):  
Routing Protocol ◽  
Packet Loss ◽  
Network Performance ◽  
Mobility Model ◽  
Performance Parameters ◽  
Special Position

According to the research of VANET routing protocol, an improved protocol SN-GPSR has been proposed. It is based on the sensitive nodes. The nodes select routing through a special position and steady speed under GPSR protocol. In a crossroads scenario, we designed a vehicular mobility model and simulated it using NS-2. By analyzing the results, the network performance parameters of SN-GPSR have improved above the GPSR, such as delay, packet loss and others.

The impact of node velocity diversity on mobile opportunistic network performance

2015 ◽  
Vol 55 ◽  
pp. 47-58 ◽  
Author(s):  
Yaguang Lin ◽  
Xiaoming Wang ◽  
Lichen Zhang ◽  
Peng Li ◽  
Dan Zhang ◽  
...  
Keyword(s):  
Network Performance ◽  
Opportunistic Network ◽  
The Impact ◽  
Mobile Opportunistic Network

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.

Sign in / Sign up

Export Citation Format

Share Document