Acumen Message Drop scheme (AMD) in Opportunistic Networks

2020 ◽  
Vol 10 ◽  
Author(s):  
Halikul Lenando ◽  
Aref Hassan Kurd Ali ◽  
Mohamad Alrfaay
Keyword(s):  
Performance Evaluation ◽  
Waiting Time ◽  
Routing Protocol ◽  
Data Dissemination ◽  
Opportunistic Networks ◽  
Transmission Time ◽  
Limited Resources ◽  
Message Transmission ◽  
Epidemic Routing ◽  
The Impact

Background: In traditional networks, nodes drop messages in order to free up enough space for buffer optimization. However, keeping messages alive until it reaches its destination is crucial in Opportunistic Networks. Therefore, this paper proposes an Acumen Message Drop scheme (AMD) that consider the impact of the message drop decision on data dissemination performance. Methods: In order to achieve this goal, AMD drops the message based on the following considerations: the estimated time of message's arrival to its destination, message time to live, message transmission time, and the waiting time of the message in the queue. AMD scheme works as a plug-in in any routing protocol. Results: Performance evaluation shows that the integration of the proposed scheme with the PRoPHET routing protocol may increase efficiency by up to 80%, while if integrated with Epidemic routing protocol, efficiency increases by up to 35%. Moreover, the proposed system significantly increases performance in the case of networks with limited resources. Conclusion: To the best of our knowledge, most of the previous works did not address the issue of formulating the message drop decision in the non-social stateless opportunistic networks without affecting performance.

scholarly journals Distribution of Data Dissemination Model using DTN Routing Protocols

2020 ◽  
Vol 9 (3) ◽  
pp. 3014-3019
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Buffer Capacity ◽  
Performance Metrics ◽  
Data Dissemination ◽  
Real Life ◽  
Research Paper ◽  
Performance Comparison ◽  
Dtn Routing ◽  
The Impact

In this research paper compare the protocol’s performance together with the experimental results of optimal routing using real-life scenarios of vehicles and pedestrians roaming in a city. In this research paper, conduct several simulation comparison experiments(in the NS2 Software) to show the impact of changing buffer capacity, packet lifetime, packet generation rate, and number of nodes on the performance metrics. This research paper is concluded by providing guidelines to develop an efficient DTN routing protocol. To the best of researcher(Parameswari et al.,) knowledge, this work is the first to provide a detailed performance comparison among the diverse collection of DTN routing protocols.

scholarly journals Evaluating Forwarding Protocols in Opportunistic Networks: Trends, Advances, Challenges and Best Practices

2019 ◽  
Vol 11 (5) ◽  
pp. 113 ◽  
Author(s):  
Vishnupriya Kuppusamy ◽  
Udaya Thanthrige ◽  
Asanga Udugama ◽  
Anna Förster
Keyword(s):  
Performance Evaluation ◽  
Best Practices ◽  
Data Dissemination ◽  
Evaluation Studies ◽  
Opportunistic Networks ◽  
Research Topic ◽  
Data Forwarding ◽  
Survey Paper ◽  
Future Evaluation ◽  
Performance Results

A variety of applications and forwarding protocols have been proposed for opportunistic networks (OppNets) in the literature. However, the methodology of evaluation, testing and comparing these forwarding protocols are not standardized yet, which leads to large levels of ambiguity in performance evaluation studies. Performance results depend largely on the evaluation environment, and on the used parameters and models. More comparability in evaluation scenarios and methodologies would largely improve also the availability of protocols and the repeatability of studies, and thus would accelerate the development of this research topic. In this survey paper, we focus our attention on how various OppNets data forwarding protocols are evaluated rather than what they actually achieve. We explore the models, parameters and the evaluation environments and make observations about their scalability, realism and comparability. Finally, we deduce some best practices on how to achieve the largest impact of future evaluation studies of OppNets data dissemination/forwarding protocols.

scholarly journals Performance evaluation of MANET routing protocols based on QoS and energy parameters

2020 ◽  
Vol 10 (4) ◽  
pp. 3635
Author(s):  
Salma S. Mohamed ◽  
Abdel-Fatah I. Abdel-Fatah ◽  
Mohamed A. Mohamed
Keyword(s):  
Performance Evaluation ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Network Performance ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Energy Utilization ◽  
Delivery Ratio ◽  
Distance Vector ◽  
The Impact

Routing selection and supporting Quality of Service (QoS) are fundamental problems in Mobile Ad Hoc Network (MANET). Many different protocols have been proposed in the literature and some performance simulations are made to address this challenging task. This paper discusses the performance evaluation and comparison of two typical routing protocols; Ad Hoc On-Demand Distance Vector (AODV) and Destination-Sequenced Distance-Vector (DSDV) based on measuring the power consumption in network with varing of the QoS parameters. In this paper, we have studied and analyzed the impact of variations in QoS parameter combined with the choice of routing protocol, on network performance. The network performance is measured in terms of average throughput, packet delivery ratio (PDR), average jitter and energy consumption. The simulations are carried out in NS-3. The simulation results show that DSDV and AODV routing protocols are less energy efficient. The main aim of this paper is to highlight the directions for the future design of routing protocol which would be better than the existing ones in terms of energy utilization and delivery ratio.

scholarly journals BiPAD: Binomial Point Process Based Energy-Aware Data Dissemination in Opportunistic D2D Networks

Energies ◽  
2018 ◽  
Vol 11 (8) ◽  
pp. 2073
Author(s):  
Seho Han ◽  
Kisong Lee ◽  
Hyun-Ho Choi ◽  
Howon Lee
Keyword(s):  
Point Process ◽  
Routing Protocol ◽  
Data Dissemination ◽  
Optimal Number ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Energy Aware ◽  
Epidemic Routing ◽  
Efficient Data ◽  
Binomial Point Process

In opportunistic device-to-device (D2D) networks, the epidemic routing protocol can be used to optimize the message delivery ratio. However, it has the disadvantage that it causes excessive coverage overlaps and wastes energy in message transmissions because devices are more likely to receive duplicates from neighbors. We therefore propose an efficient data dissemination algorithm that can reduce undesired transmission overlap with little performance degradation in the message delivery ratio. The proposed algorithm allows devices further away than the k-th furthest distance from the source device to forward a message to their neighbors. These relay devices are determined by analysis based on a binomial point process (BPP). Using a set of intensive simulations, we present the resulting network performances with respect to the total number of received messages, the forwarding efficiency and the actual number of relays. In particular, we find the optimal number of relays to achieve almost the same message delivery ratio as the epidemic routing protocol for a given network deployment. Furthermore, the proposed algorithm can achieve almost the same message delivery ratio as the epidemic routing protocol while improving the forwarding efficiency by over 103% when k≥10.

scholarly journals A Privacy-Preserving Routing Protocol Using Mix Networks in Opportunistic Networks

Electronics ◽  
2020 ◽  
Vol 9 (11) ◽  
pp. 1754
Author(s):  
Depeng Chen ◽  
Carlos Borrego ◽  
Guillermo Navarro-Arribas
Keyword(s):  
Routing Protocol ◽  
Network Performance ◽  
Opportunistic Networks ◽  
Privacy Preserving ◽  
Simple Solution ◽  
Anonymous Communications ◽  
Trade Off ◽  
Message Delay ◽  
The Impact

This paper focuses on the problem of providing anonymous communications in opportunistic networks. To that end, we propose an approach using Mix networks that enables a relatively simple solution. Opportunistic networks present some constraints that make the deployment of typical network anonymity solutions difficult or infeasible. We show, utilizing simulations on the basis of real mobility traces, that the proposed solution is feasible for some scenarios by introducing a tolerable penalty in terms of message delay and delivery. To investigate the impact of routing strategies, we offer two different methods to select Mix nodes. From the experiment results, we show the trade-off between network performance and security.

Sign in / Sign up

Export Citation Format

Share Document