SMGSAF: A Secure Multi-Geocasting based Routing Scheme for Opportunistic Networks

2021 ◽  
Author(s):  
Jagdeep Singh ◽  
Sanjay K. Dhurandher ◽  
Raghav Kumar ◽  
Geetanshu Gupta
Keyword(s):  
Secret Sharing ◽  
Key Distribution ◽  
Opportunistic Networks ◽  
Disjoint Path ◽  
Time Interval ◽  
Routing Scheme ◽  
Delivery Probability ◽  
Simulation Results ◽  
Scarcity Of Resources ◽  
Network Overhead

Abstract This paper proposes a novel Secure Multi- Geocasting Spray And Flood technique for opportunistic networks called SMGSAF, which uses secret sharing and disjoint path routing to secure the privacy of messages. In multi-geocasting, routing aims to successfully deliver a given geomessage to all the nodes, or to as many as possible, located inside defined geographic areas within a given time interval. It is desired that as long as a message is outside its destination casts it cannot be read by intermediate nodes. Encryption is a proven way to ensure this but classical encryption techniques are not well suited for the opportunistic paradigm. Key distribution and scarcity of resources are the major challenges in this regard. Therefore we have used secret sharing and disjoint path routing to protect the privacy of messages. Simulation results show that the proposed SMGSAF protocol provides the intended security but at the expense of performance, that is within acceptable limits. Notably, the SMGSAF protocol outperforms unitary geocasting in terms of delivery probability. The proposed protocol is evaluated in terms of delivery probability, network overhead, and latency. Its performance has been compared to MGSAF and GSAF.

A Novel Method of Detecting Measurement Uncertainty of Voltage Deviation

2013 ◽  
Vol 805-806 ◽  
pp. 688-692
Author(s):  
Xin Fang ◽  
Xue Liang Huang ◽  
Yan Zhu
Keyword(s):  
Measurement Uncertainty ◽  
Power Quality ◽  
National Standards ◽  
Measurement Time ◽  
Time Interval ◽  
Basic Measurement ◽  
Voltage Deviation ◽  
Novel Method ◽  
Simulation Results

Nowadays, there are various devices to detect the power quality of AC grid, where uncertainty of voltage deviation is an important parameter to investigate the power quality. National standards specify several sinusoidal waveforms to detect it, usually implemented into the detecting devices. But these waveforms are not enough and a novel method of detecting measurement uncertainty of voltage deviation is proposed in this paper. A series of detection waveforms are designed using this method. The simulation results verify that the method is available to measure uncertainty of voltage deviation more accurately. Moreover, it can be used to justify whether the basic measurement time interval of voltage deviation meets IEC standard requirements.

scholarly journals An efficient probabilistic routing scheme based on game theory in opportunistic networks

2019 ◽  
Vol 149 ◽  
pp. 144-153 ◽  
Author(s):  
Xueyang Qin ◽  
Xiaoming Wang ◽  
Liang Wang ◽  
Yaguang Lin ◽  
Xinyan Wang
Keyword(s):  
Game Theory ◽  
Opportunistic Networks ◽  
Routing Scheme ◽  
Probabilistic Routing

Cryptanalysis and improvement of the novel semi-quantum secret sharing scheme based on Bell states

2018 ◽  
Vol 32 (25) ◽  
pp. 1850294 ◽  
Author(s):  
Bingren Chen ◽  
Wei Yang ◽  
Liusheng Huang
Keyword(s):  
Secret Sharing ◽  
Quantum Key Distribution ◽  
Quantum Secret Sharing ◽  
Key Distribution ◽  
Bell States ◽  
Secret Sharing Scheme ◽  
The Novel ◽  
Improvement Strategy ◽  
Sharing Scheme ◽  
Quantum Secret Sharing Scheme

A recent paper proposed a semi-quantum secret sharing (SQSS) scheme based on Bell states [A. Yin et al., Mod. Phys. Lett. B. https://doi.org/10.1142/S0217984917501500 ]. This protocol was presumed that only the sender has the quantum power and all participants perform classical operations. However, we find this protocol is not that secure as it is expected. We can utilize the intercept-resend method to attack this scheme. Then, we give an improvement strategy based on semi-quantum key distribution, which ensures that the new scheme resists the attack we have proposed.

scholarly journals Resilient greedy routing on GPS-free surface sensor networks

2020 ◽  
Vol 16 (4) ◽  
pp. 155014772091381
Author(s):  
Buri Ban ◽  
Xuan Li ◽  
Miao Jin
Keyword(s):  
Sensor Networks ◽  
Large Scale ◽  
Three Dimensional ◽  
Network Routing ◽  
Time Interval ◽  
Delivery Ratio ◽  
Greedy Routing ◽  
Routing Scheme ◽  
Random Node ◽  
Routing Methods

We design a greedy routing scheme specifically for GPS-free large-scale wireless sensor networks deployed on surfaces of complex-connected three-dimensional settings. Compared with other greedy embedding–based surface network routing scheme, the proposed one is cut free such that no pair of nodes suffers a long detour to reach each other. The routing scheme is designed to be resilient to node or link failures especially under random node or link failure model where each node in a network has an equal and independent probability of failure during some time interval. The proposed algorithm is fully distributed and scalable to both the size and the topological complexity of a network. Each sensor node requires only limited and constant storage. Simulation results show the proposed routing scheme with a higher successful delivery ratio, a lower average stretch factor, and a lower normalized communication cost compared with other resilient routing methods.

scholarly journals Data Transmission and Management Based on Node Communication in Opportunistic Social Networks

Symmetry ◽  
2020 ◽  
Vol 12 (8) ◽  
pp. 1288 ◽  
Author(s):  
Yutong Xiao ◽  
Jia Wu
Keyword(s):  
Data Transmission ◽  
Opportunistic Networks ◽  
Theoretical Research ◽  
Delivery Ratio ◽  
Connection Strength ◽  
Network Algorithms ◽  
Adaptive Allocation ◽  
Routing Strategy ◽  
Distance Communication ◽  
Network Overhead

Due to the rapid popularization of various short distance communication mobile devices, the use scenarios of opportunistic networks are increasing day by day. However, in opportunistic networks, because of the complexity of community structure, many methods lack of symmetry between application and theoretical research. Thus, the connection strength between nodes is different, and the degree of message diffusion is different. If the above factors cannot be accurately estimated and analyzed, and effective data forwarding and scheduling strategies cannot be formulated, the delivery ratio will be low, the delay will be relatively high, and the network overhead will be large. In light of improving symmetry problems in opportunistic networks, this paper establishes the message duplicate adaptive allocation and spray routing strategy (MDASRS) algorithm model, measures the connection strength between nodes through social pressure, and estimates the diffusion of current messages in the network through the probability of messages leaving the current node successfully, so as to develop the self-adaptive control replication transmission mode and achieve the effect of reducing the network burden and network overhead. This is done through experiments and comparison of social network algorithms, comparing the MDASRS with Epidemic, Spray and Wait, and EIMST algorithms. The experiment results showed that this method improves the cache utilization of nodes, reduces data transmission delay, and improves the network’s overall efficiency.

scholarly journals An Energy-Efficient Two-Stage Cooperative Routing Scheme in Wireless Multi-Hop Networks

Sensors ◽  
2019 ◽  
Vol 19 (5) ◽  
pp. 1002 ◽  
Author(s):  
Jianming Cheng ◽  
Yating Gao ◽  
Ningbo Zhang ◽  
Hongwen Yang
Keyword(s):  
Energy Efficiency ◽  
Network Lifetime ◽  
Cooperative Transmission ◽  
Transmission Model ◽  
Two Stage ◽  
Routing Scheme ◽  
Cooperative Routing ◽  
Link Cost ◽  
Simulation Results ◽  
End To End

Cooperative routing is one of the most widely used technologies for improving the energy efficiency and energy balance of wireless multi-hop networks. However, the end-to-end energy cost and network lifetime are greatly restricted if the cooperative transmission model is not designed properly. The main aim of this paper is to explore a two-stage cooperative routing scheme to further improve the energy efficiency and prolong the network lifetime. A two-stage cooperative (TSC) transmission model is firstly designed in which the core helper is introduced to determine the helper set for cooperation. Then, the two-stage link cost is formulated where x, the weight of residual energy, is introduced to be adjusted for different design goals. By selecting the optimal helper set, the two-stage link cost of each link can be optimized. Finally, based on the designed TSC transmission model and the optimized two-stage link cost, a distributed two-stage cooperative routing (TSCR) scheme is further proposed to minimize the end-to-end cooperative routing cost. Simulation results evaluate the effect of x on the different performance metrics. When x equals 0, TSCR can achieve the shortest end-to-end transmission delay and highest energy efficiency, while a larger x can achieve a longer network lifetime. Furthermore, simulation results also show that the proposed TSCR scheme can effectively improve both the energy efficiency and network lifetime compared with the existing schemes.

Sagnac quantum key distribution and secret sharing

2009 ◽  
Author(s):  
Jan Bogdanski ◽  
Johan Ahrens ◽  
Mohamed Bourennane
Keyword(s):  
Secret Sharing ◽  
Quantum Key Distribution ◽  
Key Distribution
Sign in / Sign up

Export Citation Format

Share Document