scholarly journals Improving Message Delivery Performance in Opportunistic Networks Using a Forced-Stop Diffusion Scheme

2016 ◽  
pp. 156-168 ◽  
Author(s):  
Jorge Herrera-Tapia ◽  
Enrique Hernández-Orallo ◽  
Andrés Tomas ◽  
Pietro Manzoni ◽  
Carlos T. Calafate ◽  
...  
Keyword(s):  
Opportunistic Networks ◽  
Message Delivery ◽  
Delivery Performance ◽  
Diffusion Scheme

Implementasi Enkripsi dan Otentikasi Transmisi Data ZeroMQ Menggunakan Advanced Encryption Standard

2020 ◽  
Vol 4 (6) ◽  
Author(s):  
I Made Sukarsa ◽  
I Made Rama Pradana ◽  
Putu Wira Buana
Keyword(s):  
Direct Observation ◽  
Advanced Encryption Standard ◽  
Message Delivery ◽  
Normal Delivery ◽  
Delivery Performance ◽  
Data Message ◽  
Encryption And Authentication ◽  
Block Chaining

Communication via sockets is used to transmit information between applications or between processes over network or locally. ZeroMQ is a library for sending messages using sockets that are quite well known. Talking about sending data, message security is an important part that needs to be taken into account, especially when sending data over a network. ZeroMQ sends messages openly without securing the messages sent. This is evidenced by research which states that ZeroMQ does not have a security layer for sending messages over the network and direct observation of message packets using the wireshark application. Therefore, this study creates a method of securing and authenticating message delivery using AES (Advanced Encryption Standard) CBC (Cipher Block Chaining) mode combined with an authentication method. The AES CBC mode was chosen because it is faster than other methods and has strong encryption. This encryption and authentication are used so that the sender and recipient of the message are both valid senders and recipients so that no message changes during message delivery and messages can only be opened by the message recipient and the sender of the message. Tests are conducted to measure the effect of encryption and authentication on message delivery performance. Based on the tests conducted, there is an increase of 7% from normal delivery speed and the potential for messages is not up to 0.3% - 1.5%.

LOC algorithm

2014 ◽  
Vol 10 (4) ◽  
pp. 481-496 ◽  
Author(s):  
Sardar Kashif Ashraf Khan ◽  
Jonathan Loo ◽  
Aboubaker Lasebae ◽  
Muhammad Awais Azam ◽  
Muhammad Adeel ◽  
...  
Keyword(s):  
Ad Hoc ◽  
Opportunistic Networks ◽  
Communication Cost ◽  
Destination Node ◽  
Data Sets ◽  
Message Delivery ◽  
Movement Model ◽  
Content Type ◽  
Mobility Data ◽  
Working Day

Purpose – This paper aims to propose an algorithm, location-aware opportunistic content forwarding (LOC), to improve message directivity using direction vectors in opportunistic networks. The LOC is based on the assumption that if approximate location of the destination node is known, then overall message delivery and cost can be improved. Efficient message delivery with low communication cost is a major challenge in current opportunistic networks. In these networks, nodes do not have prior knowledge of their recipients, and message forwarding can be achieved by selecting suitable forwarder based on some forwarding criteria, as compared to its ancestor mobile ad hoc networks. Design/methodology/approach – In this paper, the authors tested LOC in two sets of mobility models, synthetic movement model and real mobility data sets. In the first set, working day movement is used as synthetic movement model, where proposed algorithm is compared against Lobby Influence (LI) and Epidemic algorithms. In the second set of experiments, the new algorithm is tested in three mobility data sets, namely, Cambridge, Reality and Sassy, and results compared against LI algorithm. The reason of using various movement models is to establish strengths and weaknesses of the proposed algorithm in different scenarios. Findings – The experimental results show that the new algorithm performed extremely well in different scenarios, not only in terms of overall message delivery but also successfully managed to reduce the communication cost. Originality/value – The new contribution increases the overall energy and storage efficiency of nodes by targeting relevant forwarding nodes in the network.

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 Barter trade improves message delivery in opportunistic networks

2010 ◽  
Vol 8 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Levente Buttyán ◽  
László Dóra ◽  
Márk Félegyházi ◽  
István Vajda
Keyword(s):  
Opportunistic Networks ◽  
Message Delivery

scholarly journals Providing Real-Time Message Delivery on Opportunistic Networks

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 40696-40712 ◽  
Author(s):  
Rodrigo M. Santos ◽  
Javier Orozco ◽  
Sergio F. Ochoa ◽  
Roc Meseguer ◽  
Daniel Mosse
Keyword(s):  
Real Time ◽  
Opportunistic Networks ◽  
Message Delivery

Intelligent Authentication and Message Forwarding in VANET

2020 ◽  
Vol 3 (1) ◽  
pp. 1-20
Author(s):  
Sachin Pandurang Godse ◽  
Parikshit N. Mahalle
Keyword(s):  
Ad Hoc ◽  
Security Model ◽  
Message Authentication ◽  
Message Delivery ◽  
Vehicle Communication ◽  
Delivery Performance ◽  
Vehicle Ad Hoc Networks ◽  
Vanet Security ◽  
Hoc Networks ◽  
Result Analysis

Vehicle ad hoc networks face the challenging issue of vehicle communication and its security. So, these issues become key research topics for global VANET researchers. Researcher's current solutions mostly focus on either of the problems but currently they are now heading towards finding satisfactory solutions for both of the above-mentioned problems. VANET networks should be robust and strongly dependent on their communication rapidness, message authentication, priority messaging, and security. Here, the authors discuss four VANET issues: authentication delays, fake messages, priority-based messaging, and VANET security, with respective solutions. This article presents an enhanced ECC-based algorithm to minimize authentication delays and provide secure VANET. Result analysis shows that the algorithm is effective in reducing the authentication delays and improves communication rapidness, improves the security model operation to detect Sybil and reply attack, and promotes intelligent message forwarding to block fake messages and increases message delivery performance.

An Novel Message Delivery Mechanism in Opportunistic Networks

2015 ◽  
pp. 900-909
Author(s):  
Gang Cheng ◽  
Yong Zhang ◽  
Mei Song ◽  
Da Guo ◽  
Deyu Yuan ◽  
...  
Keyword(s):  
Opportunistic Networks ◽  
Message Delivery ◽  
Delivery Mechanism

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.

Sign in / Sign up

Export Citation Format

Share Document