scholarly journals Intersection and Complement Set (IACS) Method to Reduce Redundant Node in Mobile WSN Localization

Sensors ◽  
2018 ◽  
Vol 18 (7) ◽  
pp. 2344 ◽  
Author(s):  
Muhammad Mohd. Zaid Harith ◽  
Noorzaily Mohamed Noor ◽  
Mohd. Idna Idris ◽  
Emran Mohd. Tamil
Keyword(s):  
Energy Consumption ◽  
Maximum Velocity ◽  
Communication Cost ◽  
Density Maximum ◽  
Computation Cost ◽  
Localization Accuracy ◽  
Redundant Data ◽  
Normal Node ◽  
Shortest Distance ◽  
Unknown Node

The majority of the Wireless Sensor Network (WSN) localization methods utilize a large number of nodes to achieve high localization accuracy. However, there are many unnecessary data redundancies that contributes to high computation, communication, and energy cost between these nodes. Therefore, we propose the Intersection and Complement Set (IACS) method to reduce these redundant data by selecting the most significant neighbor nodes for the localization process. Through duplication cleaning and average filtering steps, the proposed IACS selects the normal nodes with unique intersection and complement sets in the first and second hop neighbors to localize the unknown node. If the intersection or complement sets of the normal nodes are duplicated, IACS only selects the node with the shortest distance to the blind node and nodes that have total elements larger than the average of the intersection or complement sets. The proposed IACS is tested in various simulation settings and compared with MSL* and LCC. The performance of all methods is investigated using the default settings and a different number of degree of irregularity, normal node density, maximum velocity of sensor node and number of samples. From the simulation, IACS successfully reduced 25% of computation cost, 25% of communication cost and 6% of energy consumption compared to MSL*, while 15% of computation cost, 13% of communication cost and 3% of energy consumption compared to LCC.

scholarly journals Range-Free Localization Schemes for Wireless Sensor Networks

2015 ◽  
Vol 16 (2) ◽  
pp. 323
Author(s):  
R. Khadim ◽  
M. Erritali ◽  
A. Maaden
Keyword(s):  
Energy Consumption ◽  
Cost Effective ◽  
Wireless Sensor ◽  
Localization Accuracy ◽  
The Third ◽  
Centroid Algorithm ◽  
Linear Distance ◽  
Normal Node ◽  
Key Issues ◽  
Range Free

<span lang="EN-US">Localization of nodes is one of the key issues of wireless sensor network (WSN) that gained a wide attention in recent years. The existing localization techniques can be generally categorized into two types: range-based and range-free. Compared with rang-based schemes, the range-free schemes are more cost-effective, because no additional ranging devices are needed. As a result, we focus our research on the range-free schemes. In this paper we study three types of range-free location algorithms to compare the localization error and energy consumption of each one. Centroid algorithm requires a normal node has at least three neighbor anchors, while DV-hop algorithm doesn’t have this requirement. The third studied algorithm is the amorphous algorithm similar to DV-Hop algorithm, and the idea is to calculate the hop distance between two nodes instead of the linear distance between them .The simulation results show that the localization accuracy of the amorphous algorithm is higher than that of other algorithms and the energy consumption does not increase too much. </span>

scholarly journals A Bit String Content Aware Chunking Strategy for Reduced CPU Energy on Cloud Storage

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Bin Zhou ◽  
ShuDao Zhang ◽  
Ying Zhang ◽  
JiaHao Tan
Keyword(s):  
Energy Consumption ◽  
Data Center ◽  
System Performance ◽  
Cloud Storage ◽  
High Performance ◽  
Factors Affecting ◽  
Redundant Data ◽  
Energy Factors ◽  
The Cost ◽  
Content Aware

In order to achieve energy saving and reduce the total cost of ownership, green storage has become the first priority for data center. Detecting and deleting the redundant data are the key factors to the reduction of the energy consumption of CPU, while high performance stable chunking strategy provides the groundwork for detecting redundant data. The existing chunking algorithm greatly reduces the system performance when confronted with big data and it wastes a lot of energy. Factors affecting the chunking performance are analyzed and discussed in the paper and a new fingerprint signature calculation is implemented. Furthermore, a Bit String Content Aware Chunking Strategy (BCCS) is put forward. This strategy reduces the cost of signature computation in chunking process to improve the system performance and cuts down the energy consumption of the cloud storage data center. On the basis of relevant test scenarios and test data of this paper, the advantages of the chunking strategy are verified.

scholarly journals A Non-Parametric Propagation Condition Identification Method and Non-Line of Sight Mitigation Algorithm for Wireless Sensor Network

2016 ◽  
Vol 10 (1) ◽  
pp. 80-87 ◽  
Author(s):  
Hao Chu ◽  
Cheng-dong Wu
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Line Of Sight ◽  
Propagation Condition ◽  
Localization Accuracy ◽  
Chi Squared ◽  
Potential Applications ◽  
Unknown Node ◽  
Non Line Of Sight

The wireless sensor network (WSN) has received increasing attention since it has many potential applications such as the internet of things and smart city. The localization technology is critical for the application of the WSN. The obstacles induce the larger non-line of sight (NLOS) error and it may decrease the localization accuracy. In this paper, we mainly investigate the non-line of sight localization problem for WSN. Firstly, the Pearson's chi-squared testing is employed to identify the propagation condition. Secondly, the particle swarm optimization based localization method is proposed to estimate the position of unknown node. Finally the simulation experiments are implemented. The simulation results show that the proposed method owns higher localization accuracy when compared with other two methods.

scholarly journals EERP-DPM: Energy Efficient Routing Protocol Using Dual Prediction Model for Healthcare Using IoT

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Faris A. Almalki ◽  
Soufiene Ben Othman ◽  
Fahad A. Almalki ◽  
Hedi Sakli
Keyword(s):  
Energy Consumption ◽  
Prediction Model ◽  
Routing Protocol ◽  
Health Care Professionals ◽  
Energy Efficient ◽  
Temporal Correlation ◽  
Sensor Nodes ◽  
Energy Efficient Routing ◽  
Battery Lifetime ◽  
Redundant Data

Healthcare is one of the most promising domains for the application of Internet of Things- (IoT-) based technologies, where patients can use wearable or implanted medical sensors to measure medical parameters anywhere and anytime. The information collected by IoT devices can then be sent to the health care professionals, and physicians allow having a real-time access to patients’ data. However, besides limited batteries lifetime and computational power, there is spatio-temporal correlation, where unnecessary transmission of these redundant data has a significant impact on reducing energy consumption and reducing battery lifetime. Thus, this paper aims to propose a routing protocol to enhance energy-efficiency, which in turn prolongs the sensor lifetime. The proposed work is based on Energy Efficient Routing Protocol using Dual Prediction Model (EERP-DPM) for Healthcare using IoT, where Dual-Prediction Mechanism is used to reduce data transmission between sensor nodes and medical server if predictions match the readings or if the data are considered critical if it goes beyond the upper/lower limits of defined thresholds. The proposed system was developed and tested using MATLAB software and a hardware platform called “MySignals HW V2.” Both simulation and experimental results confirm that the proposed EERP-DPM protocol has been observed to be extremely successful compared to other existing routing protocols not only in terms of energy consumption and network lifetime but also in terms of guaranteeing reliability, throughput, and end-to-end delay.

Sequence Localization Algorithm Based on 3D Voronoi Diagram in Wireless Sensor Network

2014 ◽  
Vol 644-650 ◽  
pp. 4422-4426 ◽  
Author(s):  
Xi Yang ◽  
Jun Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Voronoi Diagram ◽  
Wireless Sensor ◽  
Weighted Estimate ◽  
Localization Algorithm ◽  
Simulation Experiments ◽  
Localization Accuracy ◽  
3D Space ◽  
Unknown Node

For nodes’ self-localization in wireless sensor networks (WSN), a new localization algorithm called Sequence Localization algorithm based on 3D Voronoi diagram (SL3V) is proposed, which uses 3D Voronoi diagram to divide the localization space.It uses the polyhedron vertices as the virtual beacon nodes and constructs the rank sequence table of virtual beacon nodes. Then it computes Kendall coefficients of the ranks in the optimal rank sequence table and that of the unknown node. Finally, it realizes the weighted estimate of the unknown node by normalization processing Kendall coefficients. Simulation experiments prove that itcan obviously improve the localization accuracy compared with the traditional 2D sequence-based localization and can satisfy the need of localization for 3D space.

A Collaborative Multilateral Localization Algorithm for Wireless Sensor Networks

2013 ◽  
Vol 303-306 ◽  
pp. 201-205
Author(s):  
Shao Ping Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimization Method ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Localization Method ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Unknown Node

Localization technology is one of the key supporting technologies in wireless sensor networks. In this paper, a collaborative multilateral localization algorithm is proposed to localization issues for wireless sensor networks. The algorithm applies anchor nodes within two hops to localize unknown nodes, and uses Nelder-Mead simplex optimization method to compute coordinates of the unknown nodes. If an unknown node can not be localized through two-hop anchor nodes, it is localized by anchor nodes and localized nodes within two hops through auxiliary iterative localization method. Simulation results show that the localization accuracy of this algorithm is very good, even in larger range errors.

scholarly journals Indoor Localization Using Bayesian Filter

2019 ◽  
Author(s):  
Karthik Muthineni ◽  
Attaphongse Taparugssanagorn
Keyword(s):  
Communication Technology ◽  
Indoor Localization ◽  
Position Estimation ◽  
Received Signal Strength Indicator ◽  
Localization Accuracy ◽  
Ambient Intelligent ◽  
Unknown Node ◽  
Visualization Of Data ◽  
Log Normal ◽  
Environment Parameters

Ambient Intelligent (AmI) Wireless Sensor Networks (WSN) provide intelligent services based on user and environment data obtained by sensors. Such networks are developed to give environmental monitoring and indoor localization services. In this work, Zigbee which is a wireless communication technology is used for localization based on Received Signal Strength Indicator (RSSI) method. In practice, Extended Kalman Filter (EKF) is adapted to filter RSSI values influenced by multi-path fading and noise. Log-Normal Shadowing Method (LNSM) together with the Trilateration method was implemented to locate the position of the unknown node or entity. In addition, Cramer Rao Lower Bound (CRLB) is derived for the position estimation, that can be used to evaluate the performance of the system in terms of localization accuracy. Along with indoor localization, the deployed WSN could also monitor environment parameters like temperature and humidity surrounding entity using Digital Humidity and Temperature (DHT11) sensor. Using Zigbee location coordinates of entity and environment parameters are transmitted to remote desktop where visualization of data is done using Matrix Laboratory (MATLAB).

scholarly journals Large Scale Hotel Resource Retrieval Algorithm Based on Characteristic Threshold Extraction

2022 ◽  
Vol 16 ◽  
pp. 26-31
Author(s):  
Min Fang
Keyword(s):  
Energy Consumption ◽  
Data Processing ◽  
Large Scale ◽  
High Energy ◽  
Error Component ◽  
Retrieval Algorithm ◽  
Data Detection ◽  
Redundant Data ◽  
Variable Window ◽  
Resource Data

At present, the hotel resource retrieval algorithm has the problem of low retrieval efficiency, low accuracy, low security and high energy consumption, and this study proposes a large scale hotel resource retrieval algorithm based on characteristic threshold extraction. In the large-scale hotel resource data, the mass sequence is decomposed into periodic component, trend component, random error component and burst component. Different components are extracted, the singular point detection is realized by the extraction results, and the abnormal data in the hotel resource data are obtained. Based on the attribute of hotel resource data, the data similarity is processed with variable window, the total similarity of data is obtained, and the abnormal detection of redundant resource data is realized. The abnormal data detection results and redundant data detection results are substituted into the space-time filter, and the data processing is completed. The retrieval problem is identified, and the data processing results are replaced in the hotel resource retrieval based on the characteristic threshold extraction to achieve the normalization of data source and rule knowledge. The characteristic threshold and retrieval strategy are determined, and data fusion reasoning is carried out. After repeated iteration, effective solutions are obtained. The effective solution is fused to get the best retrieval result. Experimental results showed that the algorithm has higher retrieval accuracy, efficiency and security coefficient, and the average search energy consumption is 56n J/bit.

scholarly journals Decentralized Scheduling Algorithm for DAG Based Tasks on P2P Grid

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Piyush Chauhan ◽  
Nitin
Keyword(s):  
Distributed Computing ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Communication Cost ◽  
Computation Cost ◽  
Grid Systems ◽  
Acyclic Graph ◽  
Computational Resources ◽  
Decentralized Scheduling ◽  
Grid Resources

Complex problems consisting of interdependent subtasks are represented by a direct acyclic graph (DAG). Subtasks of this DAG are scheduled by the scheduler on various grid resources. Scheduling algorithms for grid strive to optimize the schedule. Nowadays a lot of grid resources are attached by P2P approach. Grid systems and P2P model both are newfangled distributed computing approaches. Combining P2P model and grid systems we get P2P grid systems. P2P grid systems require fully decentralized scheduling algorithm, which can schedule interreliant subtasks among nonuniform computational resources. Absence of central scheduler caused the need for decentralized scheduling algorithm. In this paper we have proposed scheduling algorithm which not only is fruitful in optimizing schedule but also does so in fully decentralized fashion. Hence, this unconventional approach suits well for P2P grid systems. Moreover, this algorithm takes accurate scheduling decisions depending on both computation cost and communication cost associated with DAG’s subtasks.

Research on RSSI and Triangles Deformation Based APIT Localization Algorithm for Wireless Sensor Networks

2014 ◽  
Vol 998-999 ◽  
pp. 1305-1310
Author(s):  
Fei Liu ◽  
Guang Zeng Feng
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Localization Error ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Sparse Network ◽  
Unknown Node

The localization accuracy of traditional APIT localization algorithm for wireless sensor network depends on the Approximate Perfect Point-In-Triangulation Test (APIT), and the localization error can be promoted in sparse network. We design one improved localization algorithm (RTD-APIT) based on APIT by using the RSSI and the triangles deformation. RTD-APIT uses the RSSI to improve the APIT for achieving the preliminary location of unknown node, and expand or deform the triangles for solving the Point-In-Triangulation (PIT) problem well and enhancing the localization. Simulation shows RTD-APIT can reduce the localization error effectively, and it also promote the localization coverage.

Sign in / Sign up

Export Citation Format

Share Document