scholarly journals Node-Dependence-Based Dynamic Incentive Algorithm in Opportunistic Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-14
Author(s):  
Ruiyun Yu ◽  
Pengfei Wang
Keyword(s):  
Network Performance ◽  
Opportunistic Networks ◽  
Delivery Ratio ◽  
Selfish Nodes ◽  
Performance Incentive ◽  
Average Latency ◽  
Simulation Results ◽  
End To End ◽  
Reliability And Robustness ◽  
Reward And Punishment

Opportunistic networks lack end-to-end paths between source nodes and destination nodes, so the communications are mainly carried out by the “store-carry-forward” strategy. Selfish behaviors of rejecting packet relay requests will severely worsen the network performance. Incentive is an efficient way to reduce selfish behaviors and hence improves the reliability and robustness of the networks. In this paper, we propose the node-dependence-based dynamic gaming incentive (NDI) algorithm, which exploits the dynamic repeated gaming to motivate nodes relaying packets for other nodes. The NDI algorithm presents a mechanism of tolerating selfish behaviors of nodes. Reward and punishment methods are also designed based on the node dependence degree. Simulation results show that the NDI algorithm is effective in increasing the delivery ratio and decreasing average latency when there are a lot of selfish nodes in the opportunistic networks.

Friend-Based Prediction Routing Protocol in Socially-Aware Opportunistic Networks

2014 ◽  
Vol 519-520 ◽  
pp. 241-244
Author(s):  
Li Liu
Keyword(s):  
Mobile Devices ◽  
Routing Protocol ◽  
Social Relationship ◽  
Data Dissemination ◽  
Opportunistic Networks ◽  
Delivery Ratio ◽  
Average Latency ◽  
Simulation Results ◽  
Carry And Forward ◽  
Intermittently Connected

Mobile devices are popular used in peoples life. Generally, most of portable mobile devices are carried by people. Thus, the mobility of mobile devices is influenced heavily by peoples social relationship. Socially-aware Opportunistic Networks are used in intermittently connected networks by use of store-carry-and-forward fashion. It is mainly based on social relationship to design solutions for problem such as routing protocol or data dissemination. In this paper, we exploit social relationship about friendships information among people and use them to predict the contact opportunities. We present Friend-based Prediction routing protocol (FBP) and establish experiment based on ONE. The simulation results show that the efficiency of FBP outperforms Epidemic and PROPHET in higher delivery ratio, lower overhead and shorter average latency.

scholarly journals Performance Evaluation of Routing Metrics in the LOADng Routing Protocol

2017 ◽  
Vol 13 (2) ◽  
pp. 87 ◽  
Author(s):  
Jose V. V. Sobral ◽  
Joel J. P. C. Rodrigues ◽  
Neeraj Kumar ◽  
Chunsheng Zhu ◽  
Raja W. Ahmad
Keyword(s):  
Routing Protocol ◽  
Network Performance ◽  
Ad Hoc ◽  
Average Energy ◽  
Delivery Ratio ◽  
Traffic Patterns ◽  
Routing Metric ◽  
Lossy Networks ◽  
Routing Metrics ◽  
Average Latency

LOADng (Lightweight On-demand Ad hoc Distance-vector Routing Protocol - Next Generation) is an emerging routing protocol that emerged as an alternative to RPL (IPv6 Routing Protocol for Low power and Lossy Networks). Although some work has been dedicated to study LOADng, these works do not analyze the performance of this protocol with different routing metrics. A routing metric is responsible for defining values for paths during the route creation process. Moreover, based on these metrics information a routing protocol will select the path to forward a message. Thus, this work aims to realize a performance assessment study considering different routing metrics applied to LOADng. The scenarios under study consider different traffic patterns and network sizes. The routing metrics are evaluated considering the packet delivery ratio, average energy spent per bit delivered, average latency, and number of hops. The results reveals that routing metrics used by this protocol may influence (directly) the network performance.

scholarly journals Energy-Efficient Check-and-Spray Geocast Routing Protocol for Opportunistic Networks

Information ◽  
2020 ◽  
Vol 11 (11) ◽  
pp. 504
Author(s):  
Khuram Khalid ◽  
Isaac Woungang ◽  
Sanjay Kumar Dhurandher ◽  
Jagdeep Singh ◽  
Joel J. P. C. Rodrigues
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Network Performance ◽  
Opportunistic Networks ◽  
Packet Transmission ◽  
Superior Performance ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Hop Count

Opportunistic networks (OppNets) are a type of challenged network where there is no guaranteed of end-to-path between the nodes for data delivery because of intermittent connectivity, node mobility and frequent topology changes. In such an environment, the routing of data is a challenge since the battery power of the mobile nodes drains out quickly because of multi-routing activities such as scanning, transmitting, receiving, and computational processing, effecting the overall network performance. In this paper, a novel routing protocol for OppNets called Energy-Efficient Check-and-Spray Geocast Routing (EECSG) is proposed, which introduces an effective way of message distribution in the geocasting region to all residing nodes while saving the energy consumption by restricting the unnecessary packet transmission in that region. A Check-and-Spray technique is also introduced to eliminate the overhead of packets in the geocast region. The proposed EECSG is evaluated by simulations and compared against the Efficient and Flexible Geocasting for Opportunistic Networks (GSAF) and the Centrality- Based Geocasting for Opportunistic networks (CGOPP) routing protocols in terms of average latency, delivery ratio, number of messages forwarded, number of dead nodes, overhead ratio, and hop count, showing superior performance.

scholarly journals Sinkhole Attack Detection and Prevention using Agent Based Algorithm

2021 ◽  
Vol 23 (05) ◽  
pp. 526-544
Author(s):  
Ashwini V. Jatti ◽  
◽  
Dr V. J. K. Kishor Sonti ◽  
Keyword(s):  
Network Performance ◽  
Attack Detection ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Agent Based ◽  
Data Packets ◽  
Packet Delivery ◽  
Jitter Delay ◽  
Network Simulations ◽  
Simulation Results

This study presents sinkhole attack detection and prevention using agent-based algorithm. In this algorithm, agents are used to provide information to all node from its reliable neighbors by negotiation in three steps, thus nodes may not be able to pay the attention to the traffic made by sinkhole attacker. In this work, network scale of 500×500 m2 square areas have been considered. Series of simulation are carried in each experiment. Every simulation run is being organized to work for 10mins. Network performance is evaluated in terms of throughput, packet delivery ratio, jitter, delay in packets delivery, data packets received, data packets drop using network simulations software. Network simulation results depicts that in proposed algorithm, throughput increases by 15 to 20 percent, packet delivery ratio increases by 30 to 40%, decrease in the jitter by 10 to 15 %, delay in packets delivery is decreased by 15 to 20 %, data packets received are increased by 15 to 20 % and number of the data packets drop are decreased by 5 to 15 %. Based on simulation results throughput, packet delivery ratio and data packets received increased in proposed agent-based algorithm. However, it is observed that, jitter, delay in packets delivery and data packets drop were decreased.

scholarly journals EpSoc: Social-Based Epidemic-Based Routing Protocol in Opportunistic Mobile Social Network

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Halikul Lenando ◽  
Mohamad Alrfaay
Keyword(s):  
Routing Protocol ◽  
Opportunistic Networks ◽  
Delivery Ratio ◽  
Degree Centrality ◽  
Message Delivery ◽  
Hop Count ◽  
Hybrid Routing ◽  
Epidemic Routing ◽  
Average Latency ◽  
Hybrid Routing Protocol

In opportunistic networks, the nature of intermittent and disruptive connections degrades the efficiency of routing. Epidemic routing protocol is used as a benchmark for most of routing protocols in opportunistic mobile social networks (OMSNs) due to its high message delivery and latency. However, Epidemic incurs high cost in terms of overhead and hop count. In this paper, we propose a hybrid routing protocol called EpSoc which utilizes the Epidemic routing forwarding strategy and exploits an important social feature, that is, degree centrality. Two techniques are used in EpSoc. Messages’ TTL is adjusted based on the degree centrality of nodes, and the message blocking mechanism is used to control replication. Simulation results show that EpSoc increases the delivery ratio and decreases the overhead ratio, the average latency, and the hop counts as compared to Epidemic and Bubble Rap.

A Community-Based Message Transmission Algorithm for Opportunistic Networks

2013 ◽  
Vol 427-429 ◽  
pp. 2333-2337
Author(s):  
Zhi Ren ◽  
Yan Wei Liu ◽  
Shuang Peng ◽  
Ji Bi Li
Keyword(s):  
Routing Algorithm ◽  
Opportunistic Networks ◽  
Transmission Condition ◽  
Routing Algorithms ◽  
Delivery Ratio ◽  
Community Based ◽  
Delivery Delay ◽  
Message Transmission ◽  
Simulation Results ◽  
Determination Mechanism

In opportunistic networks, routing algorithms based on community division have some redundant forwarding in the process of message transmission. In this paper, we propose a community-based message transmission algorithm (CMTA). CMTA makes fully use of the nodes within communication overlapping areas to forward messages and optimizes forwarding determination mechanism to carry message nodes, then CMTA redesigns the message transmission condition and reduces the number of message forwarding which improve the efficiency of forwarding messages and reduce the average end-end delivery delay. Theoretical analysis and simulation results show that CMTA outperforms an existing Epidemic routing algorithm and the Prophet algorithm and CHMTS in terms of delivery ratio, average end-end delivery delay, relay ratio, etc.

scholarly journals A Message Transfer Framework for Enhanced Reliability in Delay-Tolerant Networks

2015 ◽  
Vol 7 (3) ◽  
pp. 52
Author(s):  
Farzana Yasmeen ◽  
Uyen Trang Nguyen ◽  
Nurul Huda ◽  
Shigeki Yamada ◽  
Cristian Borcea
Keyword(s):  
Network Performance ◽  
Performance Metrics ◽  
Delay Tolerant Networks ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Delivery Performance ◽  
End To End Delay ◽  
End To End ◽  
Deadline Constraints ◽  
Delay Tolerant

Delay-tolerant networks (DTNs) can tolerate disruption on end-to-end paths by taking advantage of temporal links emerging between nodes as nodes move in the network. Intermediate nodes store messages before forwarding opportunities become available. A series of encounters (i.e., coming within mutual transmission range) among different nodes will eventually deliver the message to the desired destination. The message delivery performance in a DTN (such as delivery ratio and end-to-end delay) highly depends on the time elapsed between encounters and the time two nodes remain in each others communication range once a contact is established. As messages are forwarded opportunistically among nodes, it is important to have sufficient contact opportunities in the network for faster, more reliable delivery of messages. We propose a simple yet efficient method for improving the performance of a DTN by increasing the contact duration of encountered nodes (i.e., mobile devices). Our proposed sticky transfer framework and protocol enable nodes in DTNs to collect neighbors’ information, evaluate their movement patterns and amounts of data to transfer in order to make decisions of whether to “stick” with a neighbor to complete the necessary data transfers. The sticky transfer framework can be combined with any DTN routing protocol to improve its performance. We evaluate ourframework through simulations and measure several network performance metrics. Simulation results show that the proposed framework can improve the message delivery ratio, end-to-end delay, overhead ratio, buffer occupancy, number of disrupted message transmissions and so on. It can be well adopted for challenged scenarios where larger messages sizes need to be delivered with application deadline constraints. Furthermore, performance of the DTN improved (upto 43%) at higher node densities and (up to 49%) under increased mobility conditions.

scholarly journals A QoS Enhancement Scheme through Joint Control of Clear Channel Assessment Threshold and Contending Window for IEEE 802.11e Broadcasting

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Chen Chen ◽  
Honghui Zhao ◽  
Hongyu Xiang ◽  
Canding Sun ◽  
Jisheng Sui ◽  
...  
Keyword(s):  
Control Algorithm ◽  
Network Performance ◽  
Packet Transmission ◽  
Ieee 802.11E ◽  
Joint Control ◽  
Delivery Ratio ◽  
Clear Channel Assessment ◽  
Carrier Sensing ◽  
Simulation Results ◽  
Clear Channel

In a WLAN, when a great many nodes coexist, the network may readily be congested, thus causing packets dropping and network performance degradation. To solve this issue, a lot of schemes have been proposed. However, most of the previous works attempt to avoid the possible channel congestion by controlling the packets generation rate and/or transmitting power of nodes, while the effects of Clear Channel Assessment (CCA) threshold are not well examined. In our paper, a Joint CCA threshold and contending window control algorithm (JCCA) is proposed to avoid channel congestion or reduce the congestion probability of broadcasting in an IEEE 802.11e network. Both the network conditions and the priorities of messages are taken into account to improve the broadcasting performance in our paper. According to the simulation results, it can be concluded that our scheme can significantly increase the network throughput as well as packets delivery ratio and reduce the packet transmission delay compared to the IEEE 802.11e and Adaptive Carrier Sensing-Based MAC Designs (ACSBM) protocol.

scholarly journals Predict and Forward: An Efficient Routing-Delivery Scheme Based on Node Profile in Opportunistic Networks

2018 ◽  
Vol 10 (8) ◽  
pp. 74 ◽  
Author(s):  
Kanghuai Liu ◽  
Zhigang Chen ◽  
Jia Wu ◽  
Yutong Xiao ◽  
Heng Zhang
Keyword(s):  
Opportunistic Networks ◽  
Routing Algorithms ◽  
Delivery Ratio ◽  
Complex Data ◽  
Relay Nodes ◽  
End To End Delay ◽  
The Social ◽  
Optimal Stopping Theory ◽  
Social Scene ◽  
End To End

In the social scene of opportunistic networks, message applications find suitable relay nodes or certain transmission destinations from the surrounding neighbors through specific network addresses of users. However, at the dawn of big data and 5G networks, the variational location information of nodes is difficult to be available to mobile devices all the time, and a long wait for the destination may cause severe end-to-end delay. To improve the transmission environment, this study constructs an efficient routing-delivery scheme (Predict and Forward) based on node profile for the opportunistic networks. The node profile effectively characterizes nodes by analyzing and comparing their attributes instead of network addresses, such as physical characteristics, places of residence, workplaces, occupations or hobbies. According to the optimal stopping theory, this algorithm implements the optimal transmission for Prelearn messages by dividing the complex data transmission process into two different phases (Predict and Forward). Through simulations and the comparison of routing algorithms in opportunistic networks, the proposed strategy increases the delivery ratio by 80% with the traditional methods on average, and the average end-to-end delay in this algorithm is the lowest.

ANALYSIS OF EPIDEMIC, PROPHET AND SPRAY AND WAIT ROUTING PROTOCOLS IN THE MOBILE OPPORTUNISTIC NETWORKS

2019 ◽  
Vol 13 ◽  
Author(s):  
Jasvir Singh ◽  
Raman Maini
Keyword(s):  
Mobile Networks ◽  
Routing Protocols ◽  
Opportunistic Networks ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Message Size ◽  
Average Latency ◽  
Overhead Ratio ◽  
Spray And Wait

Background: The opportunistic mobile networks (OMNs) are a type of mobile adhoc networks (MANETs) with delay-tolerant network (DTN) features, where the sender to receiver connectivity never exists most of the time, due to dynamic nature of the nodes and the network partition. The real use of OMNs is to provide connectivity in challenged environments. Methods: The paper presents the detailed analysis of three routing protocols, namely Epidemic, PROPHET and Spray and Wait, against variable size of the messages and the time to live (TTL) in the networks. The key contribution of the paper is to explore routing protocols with mobility models for the dissemination of data to the destination. Routing uses the store-carryforward mechanism for message transfer and network has to keep compromise between message delivery ratio and delivery delay. Results: The results are generated from the experiments with Opportunistic Network Environment (ONE) simulator. The performance is evaluated based on three metrics, the delivery ratio, overhead ratio and the average latency. The results show that the minimum message size (256 KB) offers better performance in the delivery than the larger message size (1 MB). It has also been observed that with the epidemic routing, since there are more message replicas, which in turn increase the cost of delivery, so with a smaller message, the protocol can reduce the overhead ratio with a high proportion. Conclusion: The average latency observed increases with the increase of the TTL of the message in three protocols with variation of the message size from 256KB to 1 MB.

Sign in / Sign up

Export Citation Format

Share Document