MDS-BASED METHODS FOR AD HOC NETWORK LOCALIZATION

2006 ◽  
Vol 07 (01) ◽  
pp. 5-19 ◽  
Author(s):  
AHMED A. AHMED ◽  
YI SHANG ◽  
HONGCHI SHI ◽  
BEI HUA

Recently, multidimensional scaling (MDS) techniques have been successfully applied in the MDS-MAP method to the node localization problem of ad hoc networks, such as wireless sensor networks. MDS-MAP uses MDS to compute a local, relative map at each node from the distance or proximity information of its neighboring nodes. Based on the local maps and the locations of a set of anchor nodes with known locations, the absolute positions of unknown nodes in the network can be computed. In this paper, we investigate the effects of several variants of MDS on the accuracy of localization in wireless sensor networks. We compare metric scaling and non-metric scaling methods, each with several different optimization criteria. Simulation results show that different optimization models of metric scaling achieve comparable localization accuracy for dense networks and non-metric scaling achieves more accurate results than metric scaling for sparse networks at the expense of higher computational cost.

2012 ◽  
pp. 864-892
Author(s):  
Jianmin Chen ◽  
Jie Wu

Many secure mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs) use techniques of applied cryptography. Numerous security routing protocols and key management schemes have been designed based on public key infrastructure (PKI) and identity-based cryptography. Some of these security protocols are fully adapted to fit the limited power, storage, and CPUs of these networks. For example, one-way hash functions have been used to construct disposable secret keys instead of creating public/private keys for the public key infrastructure. In this survey of MANET and WSN applications we present many network security schemes using cryptographic techniques and give three case studies of popular designs.


Sensors ◽  
2020 ◽  
Vol 20 (2) ◽  
pp. 343 ◽  
Author(s):  
Dezhi Han ◽  
Yunping Yu ◽  
Kuan-Ching Li ◽  
Rodrigo Fernandes de Mello

The Distance Vector-Hop (DV-Hop) algorithm is the most well-known range-free localization algorithm based on the distance vector routing protocol in wireless sensor networks; however, it is widely known that its localization accuracy is limited. In this paper, DEIDV-Hop is proposed, an enhanced wireless sensor node localization algorithm based on the differential evolution (DE) and improved DV-Hop algorithms, which improves the problem of potential error about average distance per hop. Introduced into the random individuals of mutation operation that increase the diversity of the population, random mutation is infused to enhance the search stagnation and premature convergence of the DE algorithm. On the basis of the generated individual, the social learning part of the Particle Swarm (PSO) algorithm is embedded into the crossover operation that accelerates the convergence speed as well as improves the optimization result of the algorithm. The improved DE algorithm is applied to obtain the global optimal solution corresponding to the estimated location of the unknown node. Among the four different network environments, the simulation results show that the proposed algorithm has smaller localization errors and more excellent stability than previous ones. Still, it is promising for application scenarios with higher localization accuracy and stability requirements.


Sensors ◽  
2019 ◽  
Vol 19 (4) ◽  
pp. 914 ◽  
Author(s):  
Lukas Nemec ◽  
Vashek Matyas ◽  
Radim Ostadal ◽  
Petr Svenda ◽  
Pierre-Louis Palant

Wireless sensor networks with a large number of cheap low-power interconnected devices bring up challenging tasks when considering the security of their communications. In our previous work, we presented two approaches for the design of dynamic protocols for link key (re-)establishment in ad hoc networks, using two elements studied earlier—secrecy amplification and key extraction from radio channel fading. The goal of this article is to provide a unified approach to the design of these protocols, together with their experimental verification, in a real network with various settings. The overall results of our experiments show that our dynamic combination of secrecy amplification and key extraction from radio channel fading saves a significant portion of messages with corresponding energy expenditure and can adapt to a much wider scale of environments when compared to previous solutions based on the exploitation of the individual elements of secrecy amplification and key extraction from radio channel fading.


Author(s):  
Jianmin Chen ◽  
Jie Wu

Many secure mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs) use techniques of applied cryptography. Numerous security routing protocols and key management schemes have been designed based on public key infrastructure (PKI) and identity-based cryptography. Some of these security protocols are fully adapted to fit the limited power, storage, and CPUs of these networks. For example, one-way hash functions have been used to construct disposable secret keys instead of creating public/private keys for the public key infrastructure. In this survey of MANET and WSN applications we present many network security schemes using cryptographic techniques and give three case studies of popular designs.


Sign in / Sign up

Export Citation Format

Share Document