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.

Novel Wireless Sensor Network Routing Protocol Performance Evaluation using Diverse Packet Size for Agriculture Application

2021 ◽  
Vol 13 (4) ◽  
Author(s):  
Amierul Syazrul Azman ◽  
◽  
Mohamad Yusry Lee ◽  
Siva Kumar Subramaniam ◽  
Farah Shahnaz Feroz ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Network Performance ◽  
Network Routing ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Large Network ◽  
Packet Size ◽  
Agriculture Industry ◽  
Grid Nodes ◽  
The Impact

As the wireless sensor networks (WSNs) progress with newer and more advanced technologies, so do the demands for them in a growing number of applications. Precision agricultural environment monitoring is one of the most prominent applications that require feasible wireless support systems, particularly in the protection and condition control of the crops. This paper focuses on the grid nodes arrangement of WSN, considering the wide dissemination of the plantation areas in the agriculture industry. Due to the different types of sensors used and their data size, the study on the impact of the varied packet size on the performance of the small and large network has been carried out using AODV and OLSR routing protocols. No significant differences in terms of performance can be seen as the packet size is varied. However, compared to the small network, more performance issues have occured in the large network, such as more packet loss, higher throughput degradation, higher energy consumption, worse unfairness, and more overhead production. The OEG routing protocol has been proposed to enhance the network performance by reducing the strain due to the saturated traffic. When solely compared to AODV, OEG routing protocol is able to enhance the network performance with at most 27% more packet delivery ratio, 31kbps more throughput, and 0.991J lesser energy consumed in the network.

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

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 Dynamic Detection of Secure Routes in Ad hoc Networks

2018 ◽  
Vol 1 (4) ◽  
Author(s):  
Niloofar Movahedian Attar
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Network Performance ◽  
Ad Hoc ◽  
Malicious Nodes ◽  
Data Packets ◽  
Proposed Model ◽  
Distance Vector ◽  
Hoc Networks ◽  
The Impact

The present paper focused on ad hoc networks with an emphasis on their dynamic nature. After an introduction to ad hoc networks, there are the AODV (Ad hoc On-demand Distance Vector) routing protocol with the node malicious behaviour and consequent damages to ad hoc networks. Then, trust is described as one of the solutions for identifying secure routes when there are malicious nodes in the network. Accordingly, the paper focuses on the proposed solutions that are based on the parameter trust and the prevention of the impact of malicious networks and vulnerable connections to identify a secure route. Then, an equation is presented to calculate trust using packet forwarding rate to select a secure route for sending data packets. The proposed model was implemented on OMNET++ to evaluate the network performance. The feature of the proposed method is better performance than of the methods TVAODV and AODV. Using the proposed method, packet delivery rate increases more significantly when malicious nodes increases than that of the basic method AODV and TVAODV. There is thus a lower packet dropping rate.

scholarly journals Impact of Black Hole Attack over Random Aodv Routing Protocol

2020 ◽  
Vol 9 (6) ◽  
pp. 1110-1115
Keyword(s):  
Black Hole ◽  
Routing Protocol ◽  
Network Performance ◽  
Research Work ◽  
Delivery Ratio ◽  
Black Hole Attack ◽  
Proposed Model ◽  
Random Node ◽  
The Impact ◽  
Selection Of

There are many researches in which the impact of black hole attacks at AODV networks is highlighted. In the research work, the impact of iBlack iHole iattack iover iAODV routing is calculated and random node selection technique is used. In addition, the simulation of black hole attacks’ impact on network performance is proposed in case of proposed model and traditional model. The selection of nodes is made randomly. The simulation of proposed selection based model is able to enhance the ratio of packet delivery. It is efficient to decrease the ratio of packet loss than traditional models. Comparative evaluation of the performance of existing and proposed model is made ion ithe ibase iof iPacket iDelivery iratio, iPacket iloss iratio, iPacket iDelivery iratio, iPacket iLoss iratio in case of 200 Node and 225 Node. This research paper also determined iAverage iEnd ito iEnd iDelivery iand iRouting iover head during comparative analysis. The proposed work can minimize the downfall in delivery ratio as the amount of malicious node increases.

scholarly journals HTPC: heterogeneous traffic-aware partition coding for random packet spraying in data center networks

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Jiawei Huang ◽  
Shiqi Wang ◽  
Shuping Li ◽  
Shaojun Zou ◽  
Jinbin Hu ◽  
...  
Keyword(s):  
Data Center ◽  
Large Scale ◽  
Network Performance ◽  
Rooted Tree ◽  
Heterogeneous Traffic ◽  
Data Center Networks ◽  
Packet Reordering ◽  
Traffic Characteristics ◽  
Network Utilization ◽  
The Impact

AbstractModern data center networks typically adopt multi-rooted tree topologies such leaf-spine and fat-tree to provide high bisection bandwidth. Load balancing is critical to achieve low latency and high throughput. Although the per-packet schemes such as Random Packet Spraying (RPS) can achieve high network utilization and near-optimal tail latency in symmetric topologies, they are prone to cause significant packet reordering and degrade the network performance. Moreover, some coding-based schemes are proposed to alleviate the problem of packet reordering and loss. Unfortunately, these schemes ignore the traffic characteristics of data center network and cannot achieve good network performance. In this paper, we propose a Heterogeneous Traffic-aware Partition Coding named HTPC to eliminate the impact of packet reordering and improve the performance of short and long flows. HTPC smoothly adjusts the number of redundant packets based on the multi-path congestion information and the traffic characteristics so that the tailing probability of short flows and the timeout probability of long flows can be reduced. Through a series of large-scale NS2 simulations, we demonstrate that HTPC reduces average flow completion time by up to 60% compared with the state-of-the-art mechanisms.

Secure and privacy-preserving structure in opportunistic networks

2021 ◽  
Vol 104 ◽  
pp. 102208
Author(s):  
Samaneh Rashidibajgan ◽  
Thomas Hupperich ◽  
Robin Doss ◽  
Anna Förster
Keyword(s):  
Opportunistic Networks ◽  
Privacy Preserving

scholarly journals Market buoyancy, information transparency and pricing strategy in the Scottish housing market

Urban Studies ◽  
2021 ◽  
pp. 004209802199178
Author(s):  
Nan Liu
Keyword(s):  
Pricing Strategy ◽  
Selling Price ◽  
Trade Off ◽  
Information Transparency ◽  
North East ◽  
Sealed Bid ◽  
Strategy Changes ◽  
The Impact ◽  
Role Of Information

In housing markets there is a trade-off between selling time and selling price, with pricing strategy being the balancing act between the two. Motivated by the Home Report scheme in Scotland, this paper investigates the role of information symmetry played in such a trade-off. Empirically, this study tests if sellers’ pricing strategy changes when more information becomes available and whether this, in turn, affects the trade-off between the selling price and selling time. Using housing transaction data of North-East Scotland between 1998Q2 and 2018Q2, the findings show that asking price has converged to the predicted price of the property since the introduction of the Home Report. While information transparency reduces the effect of ‘overpricing’ on selling time, there is little evidence to show that it reduces the impact of pricing strategy on the final selling price in the sealed-bid context.

Sign in / Sign up

Export Citation Format

Share Document