scholarly journals Time-Based Confidentiality Enhancement Scheme for Mobile Wireless Networks

2011 ◽  
pp. 65-79
Author(s):  
Qunwei Zheng ◽  
Xiaoyan Hong ◽  
Jun Liu ◽  
Lei Tang
Keyword(s):  
Wireless Networks ◽  
Wireless Network ◽  
Delay Tolerant Networks ◽  
Mobile Wireless Networks ◽  
Node Mobility ◽  
Mobile Wireless ◽  
Intermediate Node ◽  
Valuable Alternative ◽  
Original Message ◽  
Delay Tolerant

A multi-hop wireless network with highly dynamic members and mobility is vulnerable to many attacks. To address this problem, we propose a novel time-based approach that exploits mobility. In our scheme, the source sends shares at different times. Due to node mobility, these shares will be routed through different intermediate nodes. It is highly unlikely that a particular intermediate node is able to be on many of these routes and to collect enough shares to reconstruct the original message. The scheme is particularly suitable for applications that can tolerate long message delays, as studied in Delay Tolerant Networks. The article focuses on analyzing the feasibility of this scheme. We describe a general approach to calculate the probability of intercepting enough shares by arbitrary nodes, together with simulations. The results show that the probability is small. The scheme provides a valuable alternative for delay tolerant applications to enhance message confidentiality.

scholarly journals Time-Based Confidentiality Enhancement Scheme for Mobile Wireless Networks

2010 ◽  
pp. 1473-1487
Author(s):  
Qunwei Zheng ◽  
Xiaoyan Hong ◽  
Jun Liu ◽  
Lei Tang
Keyword(s):  
Wireless Networks ◽  
Wireless Network ◽  
Delay Tolerant Networks ◽  
Mobile Wireless Networks ◽  
Node Mobility ◽  
Mobile Wireless ◽  
Intermediate Node ◽  
Valuable Alternative ◽  
Original Message ◽  
Delay Tolerant

A multi-hop wireless network with highly dynamic members and mobility is vulnerable to many attacks. To address this problem, we propose a novel time-based approach that exploits mobility. In our scheme, the source sends shares at different times. Due to node mobility, these shares will be routed through different intermediate nodes. It is highly unlikely that a particular intermediate node is able to be on many of these routes and to collect enough shares to reconstruct the original message. The scheme is particularly suitable for applications that can tolerate long message delays, as studied in Delay Tolerant Networks. The article focuses on analyzing the feasibility of this scheme. We describe a general approach to calculate the probability of intercepting enough shares by arbitrary nodes, together with simulations. The results show that the probability is small. The scheme provides a valuable alternative for delay tolerant applications to enhance message confidentiality.

A Novel Smooth Gauss–Semi-Markov Mobility Model for Mobile Wireless Networks

Frequenz ◽  
2015 ◽  
Vol 69 (5-6) ◽  
Author(s):  
Hengyang Zhang ◽  
Bo Zheng ◽  
Kun Zhuo
Keyword(s):  
Wireless Networks ◽  
Mobility Model ◽  
Mobile Wireless Networks ◽  
Stable Phase ◽  
Node Mobility ◽  
Mobility Models ◽  
Mobile Wireless ◽  
Deceleration Phase ◽  
Random Direction ◽  
Almost All

AbstractMobility model serves as the basis of protocol design and simulation in mobile wireless networks. In this paper, we propose a novel mobility model for mobile wireless networks, named smooth Gauss–semi-Markov (SGM) mobility model. Introducing Gauss and semi-Markov processes, the model can characterize the smooth movement of mobile users in accordance with the physical law of motion in order to eliminate sharp turns, abrupt speed change and sudden stops exhibited by existing mobility models. The SGM model consists of five consecutive phases: acceleration phase, stable phase, turn phase, deceleration phase and pause phase, including almost all kinds of movement states in realistic conditions. Through stochastic analysis, we prove mathematically the time stationary average speed and uniform spatial node distribution in the SGM model. The model can be easily and flexibly applied for simulating node mobility in mobile wireless networks. By adjusting parameters, many existing mobility models widely used at present, such as the Random Walk, Random Direction, Modified Random Direction, Gauss–Markov, Semi-Markov Smooth, Smooth Random mobility models, etc., can be derived from the SGM model. We show the unity and generality of the SGM model by NS-2 simulations.

Sign in / Sign up

Export Citation Format

Share Document