This document discusses a proposed low-cost method for distributing nodes in a hexagonal pattern for wireless sensor networks. The method uses multidimensional scaling to determine the distribution of sensor nodes across a geographic area and estimates the computational cost of the system. Simulation results show that using a hexagonal distribution provides 100% coverage of the area with low computational costs for over 100 nodes, and less range error compared to random or square distributions. The proposed hexagonal method aims to optimize network coverage for wireless sensor networks.
This document summarizes research on coverage problems in wireless sensor networks in the presence of obstacles. It begins with definitions of key concepts related to sensor network coverage, including different types of coverage problems (point, area, barrier), deployment strategies (deterministic, random), coverage degrees, sensing models, and obstacles. It then reviews several approaches that have been proposed to address coverage problems when obstacles are present in the sensor field, including using computational geometry concepts to handle obstacles. The document concludes by noting that more work is still needed to fully address coverage problems in realistic environments with obstacles.
A Distributed Cut Detection Method for Wireless Sensor NetworksIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
This document analyzes node localization in wireless sensor networks. It compares three range-based localization algorithms (TOA, AOA, RSSI) based on their standard deviation of localization error under varying network parameters. Through simulations, it finds that the TOA algorithm generally provides the lowest error compared to the other two algorithms. Specifically, it finds that standard deviation decreases with increasing network density and anchor node density, but first decreases and then increases with network size. It concludes that the TOA algorithm provides the best accuracy for localization based on its analysis of parameter effects.
On-line Fault diagnosis of Arbitrary Connected NetworksIDES Editor
This paper proposes an on-line two phase fault
diagnosis algorithm for arbitrary connected networks. The
algorithm addresses a realistic fault model considering crash
and value faults in the nodes. Fault diagnosis is achieved by
comparing the heartbeat message generated by neighboring
nodes and dissemination of decision made at each node.
Theoretical analysis shows that time and message complexity
of the diagnosis scheme is O(n) for a n-node network. The
message and time complexity are comparable to the existing
state of art approaches and thus well suited for design of
different fault tolerant wireless communication networks
Energy efficient approach based on evolutionary algorithm for coverage contro...ijcseit
The document summarizes a research paper that proposes an energy efficient approach using an evolutionary algorithm to optimize coverage and connectivity in heterogeneous wireless sensor networks. The approach formulates the problem as a multi-objective optimization involving coverage rate, number of active nodes, and network lifetime. It uses a genetic algorithm and represents solutions as strings encoding sensor node states and ranges. Simulations show the approach improves coverage rate and total energy compared to other algorithms while maintaining connectivity.
11.0005www.iiste.org call for paper.a robust frame of wsn utilizing localizat...Alexander Decker
This document discusses localization techniques for wireless sensor networks. It begins by defining localization as identifying a sensor node's position and explains how accuracy is important. It then describes two main categories of localization techniques: range-based and range-free. Range-based uses distance or angle measurements between nodes for higher accuracy but requires expensive hardware. Range-free relies on information from nearby nodes and is less accurate but cheaper. The document reviews several specific localization algorithms from previous research and their limitations. It concludes by stating that energy efficiency is critical for wireless sensor networks due to limited battery life.
5.a robust frame of wsn utilizing localization technique 36-46Alexander Decker
This document discusses localization techniques for wireless sensor networks. It begins by defining localization as identifying a sensor node's position and explains that localization is a fundamental challenge for wireless sensor networks. It then describes two main categories of localization techniques: range-based and range-free. Range-based techniques use distance or angle measurements between nodes to determine positions but require expensive hardware. Range-free techniques estimate positions based on neighboring node information and are less expensive but less accurate. The document reviews several specific localization algorithms from previous research and discusses their advantages and limitations.
This document summarizes localization algorithms in wireless sensor networks. It discusses how node localization is an important challenge for wireless sensor networks. It reviews different approaches to node localization, including centralized and distributed algorithms. Centralized algorithms migrate data to a central station, while distributed algorithms perform computations locally. Specific algorithms discussed include MDS-MAP, simulated annealing approaches, beacon-based, relaxation-based, and coordinate system stitching approaches. The document also discusses hybrid localization techniques and future challenges in improving localization.
This document summarizes research on coverage problems in wireless sensor networks in the presence of obstacles. It begins with definitions of key concepts related to sensor network coverage, including different types of coverage problems (point, area, barrier), deployment strategies (deterministic, random), coverage degrees, sensing models, and obstacles. It then reviews several approaches that have been proposed to address coverage problems when obstacles are present in the sensor field, including using computational geometry concepts to handle obstacles. The document concludes by noting that more work is still needed to fully address coverage problems in realistic environments with obstacles.
A Distributed Cut Detection Method for Wireless Sensor NetworksIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
This document analyzes node localization in wireless sensor networks. It compares three range-based localization algorithms (TOA, AOA, RSSI) based on their standard deviation of localization error under varying network parameters. Through simulations, it finds that the TOA algorithm generally provides the lowest error compared to the other two algorithms. Specifically, it finds that standard deviation decreases with increasing network density and anchor node density, but first decreases and then increases with network size. It concludes that the TOA algorithm provides the best accuracy for localization based on its analysis of parameter effects.
On-line Fault diagnosis of Arbitrary Connected NetworksIDES Editor
This paper proposes an on-line two phase fault
diagnosis algorithm for arbitrary connected networks. The
algorithm addresses a realistic fault model considering crash
and value faults in the nodes. Fault diagnosis is achieved by
comparing the heartbeat message generated by neighboring
nodes and dissemination of decision made at each node.
Theoretical analysis shows that time and message complexity
of the diagnosis scheme is O(n) for a n-node network. The
message and time complexity are comparable to the existing
state of art approaches and thus well suited for design of
different fault tolerant wireless communication networks
Energy efficient approach based on evolutionary algorithm for coverage contro...ijcseit
The document summarizes a research paper that proposes an energy efficient approach using an evolutionary algorithm to optimize coverage and connectivity in heterogeneous wireless sensor networks. The approach formulates the problem as a multi-objective optimization involving coverage rate, number of active nodes, and network lifetime. It uses a genetic algorithm and represents solutions as strings encoding sensor node states and ranges. Simulations show the approach improves coverage rate and total energy compared to other algorithms while maintaining connectivity.
11.0005www.iiste.org call for paper.a robust frame of wsn utilizing localizat...Alexander Decker
This document discusses localization techniques for wireless sensor networks. It begins by defining localization as identifying a sensor node's position and explains how accuracy is important. It then describes two main categories of localization techniques: range-based and range-free. Range-based uses distance or angle measurements between nodes for higher accuracy but requires expensive hardware. Range-free relies on information from nearby nodes and is less accurate but cheaper. The document reviews several specific localization algorithms from previous research and their limitations. It concludes by stating that energy efficiency is critical for wireless sensor networks due to limited battery life.
5.a robust frame of wsn utilizing localization technique 36-46Alexander Decker
This document discusses localization techniques for wireless sensor networks. It begins by defining localization as identifying a sensor node's position and explains that localization is a fundamental challenge for wireless sensor networks. It then describes two main categories of localization techniques: range-based and range-free. Range-based techniques use distance or angle measurements between nodes to determine positions but require expensive hardware. Range-free techniques estimate positions based on neighboring node information and are less expensive but less accurate. The document reviews several specific localization algorithms from previous research and discusses their advantages and limitations.
This document summarizes localization algorithms in wireless sensor networks. It discusses how node localization is an important challenge for wireless sensor networks. It reviews different approaches to node localization, including centralized and distributed algorithms. Centralized algorithms migrate data to a central station, while distributed algorithms perform computations locally. Specific algorithms discussed include MDS-MAP, simulated annealing approaches, beacon-based, relaxation-based, and coordinate system stitching approaches. The document also discusses hybrid localization techniques and future challenges in improving localization.
Sensor Deployment Algorithm for Hole Detection and Healing By Using Local Hea...paperpublications3
Abstract: The main services provided by a WSN (wireless sensor network) is monitoring a particular region ie, RoI or specified region. The emergence of hole in that particular region is unavoidable. Due to some environmental factors, Random deployment and external attacks etc. In this work hole detection and hole healing process are discussed .Here show that heal deals with some virtual forces. According to the size of hole and also to improve the coverage area and need more energy efficient process.
Accurate and Energy-Efficient Range-Free Localization for Mobile Sensor Networksambitlick
The document summarizes an algorithm called WMCL that improves the sampling efficiency and localization accuracy of existing SMC-based localization algorithms for mobile sensor networks. WMCL achieves higher sampling efficiency by further reducing the size of sensor nodes' bounding boxes, which restrict the scope from which candidate samples are selected, by up to 87%. This improves the sampling efficiency by up to 95%. WMCL also improves localization accuracy by using estimated position information from sensor neighbors, achieving similar accuracy with less communication and computation compared to other algorithms using similar methods.
Nonlinear image processing using artificial neuralHưng Đặng
The document discusses the use of artificial neural networks (ANNs) for nonlinear image processing tasks. It first provides background on image processing problems, ANNs, and why ANNs may be suitable for nonlinear image processing. It then reviews literature on applying ANNs to image processing. The rest of the document focuses on using supervised ANNs for classification/feature extraction tasks like object recognition, and regression ANNs for image restoration/filtering tasks. It aims to determine when ANNs can effectively solve problems and how prior knowledge can improve ANN design/interpretability.
A CUSTOMIZED FLOCKING ALGORITHM FOR SWARMS OF SENSORS TRACKING A SWARM OF TAR...csandit
Wireless mobile sensor networks (WMSNs) are groups of mobile sensing agents with multimodal
sensing capabilities that communicate over wireless networks. WMSNs have more
flexibility in terms of deployment and exploration abilities over static sensor networks. Sensor
networks have a wide range of applications in security and surveillance systems, environmental
monitoring, data gathering for network-centric healthcare systems, monitoring seismic activities
and atmospheric events, tracking traffic congestion and air pollution levels, localization of
autonomous vehicles in intelligent transportation systems, and detecting failures of sensing,
storage, and switching components of smart grids.
A Fuzzy Based Priority Approach in Mobile Sensor Network CoverageIDES Editor
In this paper a new fuzzy based approach for
improving network coverage in wireless mobile sensor
networks is proposed. In the proposed approach firstly
each mobile sensor node determines its neighbors and its
distance from borders and obstacles. According to these
values, fuzzy inference engine calculates the priority of
node for movement. Then according to the priority, in
turn, nodes move away from each other to increase
coverage area in the target field. Simulation results show
that our fuzzy approach can reach higher degree of
coverage against other common approaches like FOA,
VEC and TRI algorithms.
High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage Problemijasuc
This document summarizes previous work on solving the energy-efficient target coverage problem in wireless sensor networks. It introduces the target coverage problem and formulates it as a linear program. It reviews existing heuristic algorithms that generate sensor covers to maximize network lifetime. These algorithms can be centralized or distributed, generate disjoint or non-disjoint covers, and consider variants that incorporate connectivity or adjustable sensing ranges. The document proposes a new high-energy-first greedy heuristic that prioritizes sensors based on remaining battery life to find covers.
The document presents a localization technique for wireless sensor networks that uses trilateration based on received signal strength. It begins with an introduction to wireless sensor networks and localization. It then discusses related work on trilateration localization techniques. The document proposes a methodology that uses signal propagation models to estimate distances between nodes from received signal strength, and then applies trilateration to compute node positions in 3D space using four or more anchor nodes. It presents simulation results showing the mean square error decreases and localization accuracy increases as the number of anchor nodes increases. The technique provides more accurate localization than existing fuzzy logic approaches, with average localization errors less than 0.5 units when using 100 anchor nodes.
Optimum Sensor Node Localization in Wireless Sensor Networkspaperpublications3
Abstract: Scientists, engineers, and researchers use wireless sensor networks (WSN) for a wide array of applications. Many of these applications rely on knowledge of the precise position of each node. An optimum localization algorithm can be used for determining the position of nodes in a wireless sensor network. This paper provides an overview of different approach of node localization discovery in wireless sensor networks. The overview of the schemes proposed by different scholars for the improvement of localization in wireless sensor networks is also presented. Experiments were performed in a testbed area containing anchor and blind nodes deployed in it to characterize the pathloss exponent and to determine the localization error of the algorithm. Details regarding the implementation of new algorithm are also discussed in this paper.
As Wireless Sensor Networks are penetrating into the industrial domain, many research opportunities are emerging. One such essential and challenging application is that of node localization. A feed-forward neural network based methodology is adopted in this paper. The Received Signal Strength Indicator (RSSI) values of the anchor node beacons are used. The number of anchor nodes and their configurations has an impact on the accuracy of the localization system, which is also addressed in this paper. Five different training algorithms are evaluated to find the training algorithm that gives the best result. The multi-layer Perceptron (MLP) neural network model was trained using Matlab. In order to evaluate the performance of the proposed method in real time, the model obtained was then implemented on the Arduino microcontroller. With four anchor nodes, an average 2D localization error of 0.2953 m has been achieved with a 12-12-2 neural network structure. The proposed method can also be implemented on any other embedded microcontroller system.
Key Management Schemes for Secure Communication in Heterogeneous Sensor NetworksIDES Editor
Hierarchical Sensor Network organization is
widely used to achieve energy efficiency in Wireless Sensor
Networks(WSN). To achieve security in hierarchical WSN,
it is important to be able to encrypt the messages sent
between sensor nodes and its cluster head. The key
management task is challenging due to resource constrained
nature of WSN. In this paper we are proposing two key
management schemes for hierarchical networks which
handles various events like node addition, node compromise
and key refresh at regular intervals. The Tree-Based
Scheme ensures in-network processing by maintaining some
additional intermediate keys. Whereas the CRT-Based
Scheme performs the key management with minimum
communication and storage at each node.
Energy efficient intrusion detection systemiaemedu
This document discusses energy efficient intrusion detection systems for wireless sensor networks. It proposes a hybrid intrusion detection system (HIDS) that considers both the energy consumption and past behavior of nodes. The HIDS classifies nodes as malicious or normal using an energy prediction approach, and then further analyzes abnormal packets sent by malicious nodes using a misuse detection module. By taking both energy patterns and past transmissions into account, the proposed HIDS aims to more accurately detect intrusions while minimizing energy usage compared to other intrusion detection schemes for wireless sensor networks.
Review of Deep Neural Network Detectors in SM MIMO Systemijtsrd
A deep neural network detector for SM MIMO has been proposed. Its detection principle is deep learning. For this a neural network must be trained first, and then used for detection purpose. It doesn’t need any channel model and instantaneous channel state information CSI . It can provide better bit error performance compared with conventional viterbi detector VD and also it can detect any length of sequences. For a MIMO system, the channel estimation complexity can be avoided. It can detect in real time as arrives the receiver. The main benefit is it can be used where the channel model is difficult to design and also the channel is continuously varying with time. Ruksana. P | Radhika. P "Review of Deep Neural Network Detectors in SM-MIMO System" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-3 , April 2020, URL: https://www.ijtsrd.com/papers/ijtsrd30535.pdf Paper Url :https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/30535/review-of-deep-neural-network-detectors-in-smmimo-system/ruksana-p
This document describes Marco Antonio Escobar Acevedo's Master's thesis which compares calculations of nonlinear optical response in semiconductors using two different gauges: the length gauge and transversal gauge. The thesis derives the expressions for calculating second-order optical susceptibilities in both gauges from quantum mechanics perturbation theory. It then presents ab initio calculations of second-order optical susceptibilities for GaAs using the local density approximation with scissors corrections. The results from both gauges are compared and the issue of gauge invariance in the calculations is discussed.
This document summarizes research on algorithms for proximity estimation in sensor networks. It discusses using sensor networks to detect events observed by nodes within a certain distance of each other. It proposes an algorithm that utilizes a distributed routing index maintained by nodes in the network to process multiple proximity queries involving different event types. The document reviews several related works on localization algorithms, data-centric sensor networks, geographic routing protocols, and node localization techniques. It evaluates different wireless sensor network simulators and deployment schemes.
Performance Comparison of Sensor Deployment Techniques Used in WSNIRJET Journal
This document compares different sensor deployment techniques for wireless sensor networks (WSNs) and their impact on network lifetime. It implements an artificial bee colony (ABC) algorithm for sensor deployment and compares the results to random deployment and a heuristic technique. Simulation results show that ABC deployment outperforms the other methods, extending network lifetime the most. The network lifetime is maximized when sensors are placed such that targets are covered by many sensors. ABC placement achieves this by iteratively moving sensors to locations with many nearby targets based on a fitness function. The network lifetime is significantly impacted by factors like the number of sensors, sensing range, targets, and area size. ABC deployment performs best across different parameter values tested.
3D Localization Algorithms for Wireless Sensor NetworksIOSR Journals
This document discusses localization algorithms for 3D wireless sensor networks. It begins by explaining that localization in 3D spaces poses unique challenges compared to 2D, as strategies used in 2D do not directly extend to 3D. It then reviews common range-based localization methods like received signal strength and time-based methods, as well as range-free methods like centroid and DV-HOP algorithms. The document aims to address the problem of localization for sensor networks deployed in 3D surfaces.
WiSE-MNet: an experimental environment for Wireless Multimedia Sensor Networkssmartcameras
The document describes WiSE-MNet, an experimental simulation environment for wireless multimedia sensor networks (WMSNs) developed using the OMNeT++ network simulator. It evaluates existing simulators and chooses to build upon the Castalia WSN simulation model, proposing extensions to support multimedia data types, idealized communication, and new modules for a moving target, camera sensor, and distributed target tracking application. The goal is to enable simulation and testing of algorithms and protocols for WMSNs.
The document discusses static and fatigue analysis of a modified multi-leaf spring used in light commercial vehicle (LCV) suspension systems. Finite element analysis is performed on the modified 7-leaf steel spring model to analyze stress, deflection, and stiffness. Fatigue life of the modified spring is also predicted using fatigue analysis software. The results from the finite element and fatigue analyses are compared to analytical calculations to validate the model and predicted fatigue life of the modified leaf spring design.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document discusses matrix inversion techniques for MIMO wireless communication systems. It begins by introducing how matrix inversion is used in algorithms for MIMO systems and standards like 802.11n. Existing matrix inversion approaches cannot achieve the performance needed for real-time 802.11n systems. The document then presents a new matrix inversion algorithm based on modified squared Givens rotations (MSGR) that enables real-time implementation with high throughput and low latency. This algorithm overcomes limitations of other QR decomposition techniques. Finally, the document evaluates this algorithm integrated into a MIMO receiver and demonstrates it can support the requirements of modern wireless standards like 802.11n.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Sensor Deployment Algorithm for Hole Detection and Healing By Using Local Hea...paperpublications3
Abstract: The main services provided by a WSN (wireless sensor network) is monitoring a particular region ie, RoI or specified region. The emergence of hole in that particular region is unavoidable. Due to some environmental factors, Random deployment and external attacks etc. In this work hole detection and hole healing process are discussed .Here show that heal deals with some virtual forces. According to the size of hole and also to improve the coverage area and need more energy efficient process.
Accurate and Energy-Efficient Range-Free Localization for Mobile Sensor Networksambitlick
The document summarizes an algorithm called WMCL that improves the sampling efficiency and localization accuracy of existing SMC-based localization algorithms for mobile sensor networks. WMCL achieves higher sampling efficiency by further reducing the size of sensor nodes' bounding boxes, which restrict the scope from which candidate samples are selected, by up to 87%. This improves the sampling efficiency by up to 95%. WMCL also improves localization accuracy by using estimated position information from sensor neighbors, achieving similar accuracy with less communication and computation compared to other algorithms using similar methods.
Nonlinear image processing using artificial neuralHưng Đặng
The document discusses the use of artificial neural networks (ANNs) for nonlinear image processing tasks. It first provides background on image processing problems, ANNs, and why ANNs may be suitable for nonlinear image processing. It then reviews literature on applying ANNs to image processing. The rest of the document focuses on using supervised ANNs for classification/feature extraction tasks like object recognition, and regression ANNs for image restoration/filtering tasks. It aims to determine when ANNs can effectively solve problems and how prior knowledge can improve ANN design/interpretability.
A CUSTOMIZED FLOCKING ALGORITHM FOR SWARMS OF SENSORS TRACKING A SWARM OF TAR...csandit
Wireless mobile sensor networks (WMSNs) are groups of mobile sensing agents with multimodal
sensing capabilities that communicate over wireless networks. WMSNs have more
flexibility in terms of deployment and exploration abilities over static sensor networks. Sensor
networks have a wide range of applications in security and surveillance systems, environmental
monitoring, data gathering for network-centric healthcare systems, monitoring seismic activities
and atmospheric events, tracking traffic congestion and air pollution levels, localization of
autonomous vehicles in intelligent transportation systems, and detecting failures of sensing,
storage, and switching components of smart grids.
A Fuzzy Based Priority Approach in Mobile Sensor Network CoverageIDES Editor
In this paper a new fuzzy based approach for
improving network coverage in wireless mobile sensor
networks is proposed. In the proposed approach firstly
each mobile sensor node determines its neighbors and its
distance from borders and obstacles. According to these
values, fuzzy inference engine calculates the priority of
node for movement. Then according to the priority, in
turn, nodes move away from each other to increase
coverage area in the target field. Simulation results show
that our fuzzy approach can reach higher degree of
coverage against other common approaches like FOA,
VEC and TRI algorithms.
High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage Problemijasuc
This document summarizes previous work on solving the energy-efficient target coverage problem in wireless sensor networks. It introduces the target coverage problem and formulates it as a linear program. It reviews existing heuristic algorithms that generate sensor covers to maximize network lifetime. These algorithms can be centralized or distributed, generate disjoint or non-disjoint covers, and consider variants that incorporate connectivity or adjustable sensing ranges. The document proposes a new high-energy-first greedy heuristic that prioritizes sensors based on remaining battery life to find covers.
The document presents a localization technique for wireless sensor networks that uses trilateration based on received signal strength. It begins with an introduction to wireless sensor networks and localization. It then discusses related work on trilateration localization techniques. The document proposes a methodology that uses signal propagation models to estimate distances between nodes from received signal strength, and then applies trilateration to compute node positions in 3D space using four or more anchor nodes. It presents simulation results showing the mean square error decreases and localization accuracy increases as the number of anchor nodes increases. The technique provides more accurate localization than existing fuzzy logic approaches, with average localization errors less than 0.5 units when using 100 anchor nodes.
Optimum Sensor Node Localization in Wireless Sensor Networkspaperpublications3
Abstract: Scientists, engineers, and researchers use wireless sensor networks (WSN) for a wide array of applications. Many of these applications rely on knowledge of the precise position of each node. An optimum localization algorithm can be used for determining the position of nodes in a wireless sensor network. This paper provides an overview of different approach of node localization discovery in wireless sensor networks. The overview of the schemes proposed by different scholars for the improvement of localization in wireless sensor networks is also presented. Experiments were performed in a testbed area containing anchor and blind nodes deployed in it to characterize the pathloss exponent and to determine the localization error of the algorithm. Details regarding the implementation of new algorithm are also discussed in this paper.
As Wireless Sensor Networks are penetrating into the industrial domain, many research opportunities are emerging. One such essential and challenging application is that of node localization. A feed-forward neural network based methodology is adopted in this paper. The Received Signal Strength Indicator (RSSI) values of the anchor node beacons are used. The number of anchor nodes and their configurations has an impact on the accuracy of the localization system, which is also addressed in this paper. Five different training algorithms are evaluated to find the training algorithm that gives the best result. The multi-layer Perceptron (MLP) neural network model was trained using Matlab. In order to evaluate the performance of the proposed method in real time, the model obtained was then implemented on the Arduino microcontroller. With four anchor nodes, an average 2D localization error of 0.2953 m has been achieved with a 12-12-2 neural network structure. The proposed method can also be implemented on any other embedded microcontroller system.
Key Management Schemes for Secure Communication in Heterogeneous Sensor NetworksIDES Editor
Hierarchical Sensor Network organization is
widely used to achieve energy efficiency in Wireless Sensor
Networks(WSN). To achieve security in hierarchical WSN,
it is important to be able to encrypt the messages sent
between sensor nodes and its cluster head. The key
management task is challenging due to resource constrained
nature of WSN. In this paper we are proposing two key
management schemes for hierarchical networks which
handles various events like node addition, node compromise
and key refresh at regular intervals. The Tree-Based
Scheme ensures in-network processing by maintaining some
additional intermediate keys. Whereas the CRT-Based
Scheme performs the key management with minimum
communication and storage at each node.
Energy efficient intrusion detection systemiaemedu
This document discusses energy efficient intrusion detection systems for wireless sensor networks. It proposes a hybrid intrusion detection system (HIDS) that considers both the energy consumption and past behavior of nodes. The HIDS classifies nodes as malicious or normal using an energy prediction approach, and then further analyzes abnormal packets sent by malicious nodes using a misuse detection module. By taking both energy patterns and past transmissions into account, the proposed HIDS aims to more accurately detect intrusions while minimizing energy usage compared to other intrusion detection schemes for wireless sensor networks.
Review of Deep Neural Network Detectors in SM MIMO Systemijtsrd
A deep neural network detector for SM MIMO has been proposed. Its detection principle is deep learning. For this a neural network must be trained first, and then used for detection purpose. It doesn’t need any channel model and instantaneous channel state information CSI . It can provide better bit error performance compared with conventional viterbi detector VD and also it can detect any length of sequences. For a MIMO system, the channel estimation complexity can be avoided. It can detect in real time as arrives the receiver. The main benefit is it can be used where the channel model is difficult to design and also the channel is continuously varying with time. Ruksana. P | Radhika. P "Review of Deep Neural Network Detectors in SM-MIMO System" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-3 , April 2020, URL: https://www.ijtsrd.com/papers/ijtsrd30535.pdf Paper Url :https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/30535/review-of-deep-neural-network-detectors-in-smmimo-system/ruksana-p
This document describes Marco Antonio Escobar Acevedo's Master's thesis which compares calculations of nonlinear optical response in semiconductors using two different gauges: the length gauge and transversal gauge. The thesis derives the expressions for calculating second-order optical susceptibilities in both gauges from quantum mechanics perturbation theory. It then presents ab initio calculations of second-order optical susceptibilities for GaAs using the local density approximation with scissors corrections. The results from both gauges are compared and the issue of gauge invariance in the calculations is discussed.
This document summarizes research on algorithms for proximity estimation in sensor networks. It discusses using sensor networks to detect events observed by nodes within a certain distance of each other. It proposes an algorithm that utilizes a distributed routing index maintained by nodes in the network to process multiple proximity queries involving different event types. The document reviews several related works on localization algorithms, data-centric sensor networks, geographic routing protocols, and node localization techniques. It evaluates different wireless sensor network simulators and deployment schemes.
Performance Comparison of Sensor Deployment Techniques Used in WSNIRJET Journal
This document compares different sensor deployment techniques for wireless sensor networks (WSNs) and their impact on network lifetime. It implements an artificial bee colony (ABC) algorithm for sensor deployment and compares the results to random deployment and a heuristic technique. Simulation results show that ABC deployment outperforms the other methods, extending network lifetime the most. The network lifetime is maximized when sensors are placed such that targets are covered by many sensors. ABC placement achieves this by iteratively moving sensors to locations with many nearby targets based on a fitness function. The network lifetime is significantly impacted by factors like the number of sensors, sensing range, targets, and area size. ABC deployment performs best across different parameter values tested.
3D Localization Algorithms for Wireless Sensor NetworksIOSR Journals
This document discusses localization algorithms for 3D wireless sensor networks. It begins by explaining that localization in 3D spaces poses unique challenges compared to 2D, as strategies used in 2D do not directly extend to 3D. It then reviews common range-based localization methods like received signal strength and time-based methods, as well as range-free methods like centroid and DV-HOP algorithms. The document aims to address the problem of localization for sensor networks deployed in 3D surfaces.
WiSE-MNet: an experimental environment for Wireless Multimedia Sensor Networkssmartcameras
The document describes WiSE-MNet, an experimental simulation environment for wireless multimedia sensor networks (WMSNs) developed using the OMNeT++ network simulator. It evaluates existing simulators and chooses to build upon the Castalia WSN simulation model, proposing extensions to support multimedia data types, idealized communication, and new modules for a moving target, camera sensor, and distributed target tracking application. The goal is to enable simulation and testing of algorithms and protocols for WMSNs.
The document discusses static and fatigue analysis of a modified multi-leaf spring used in light commercial vehicle (LCV) suspension systems. Finite element analysis is performed on the modified 7-leaf steel spring model to analyze stress, deflection, and stiffness. Fatigue life of the modified spring is also predicted using fatigue analysis software. The results from the finite element and fatigue analyses are compared to analytical calculations to validate the model and predicted fatigue life of the modified leaf spring design.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document discusses matrix inversion techniques for MIMO wireless communication systems. It begins by introducing how matrix inversion is used in algorithms for MIMO systems and standards like 802.11n. Existing matrix inversion approaches cannot achieve the performance needed for real-time 802.11n systems. The document then presents a new matrix inversion algorithm based on modified squared Givens rotations (MSGR) that enables real-time implementation with high throughput and low latency. This algorithm overcomes limitations of other QR decomposition techniques. Finally, the document evaluates this algorithm integrated into a MIMO receiver and demonstrates it can support the requirements of modern wireless standards like 802.11n.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document summarizes a research paper that proposes using prosody (rhythm, stress, intonation) information from user utterances to help a spoken dialogue system determine the user's level of certainty. It describes annotating a travel dialogue corpus for levels of certainty. Acoustic prosody features are extracted from utterances and used to train a classifier, achieving better certainty classification than a non-prosodic model. The paper argues that determining certainty from prosody could help dialogue systems respond more appropriately based on the user's mental state.
This document summarizes a research paper on improving vehicle-to-roadside unit communication using WiMAX technology. The researchers implemented a VANET simulation scenario in Qualnet to test connectivity between vehicles and roadside units. They found that using WiMAX instead of DSRC reduced packet loss from 58% to 8% at 72 km/h and lowered latency times. The appropriate routing protocol for the WiMAX scenario was determined to be AODV, as it had lower latency than DSR. The simulation showed that WiMAX increased the network range tremendously from 1.8km to 50km compared to DSRC. The study aims to enhance safety and reduce traffic accidents by improving connectivity between vehicles and roadside infrastructure.
This document discusses the detection of "smart worms", which are malicious software programs that can intelligently manipulate their scanning behavior to avoid detection. The authors propose a novel spectrum-based scheme to detect smart worms using power spectral density analysis of traffic volumes. Their scheme analyzes the spectral flatness measure of worm traffic compared to background traffic. Evaluation results demonstrate the scheme can effectively detect smart worm propagation and outperforms existing detection methods. The authors also show it can detect traditional worms.
This document presents a new approach to redesigning the basic operators used in parallel prefix adders when implementing them in FPGAs. Parallel prefix adders are commonly used for high-speed binary addition. They work by using generate and propagate signals to compute the carry inputs at each stage in parallel. Typically, two operators called "black" and "gray" are used to compute the generate and propagate signals. The authors propose redesigning these basic operators by using multiplexers instead of logic gates, to better match the structure of FPGA slices. They implement several parallel prefix adders, including Brent-Kung, Skalansky, and Kogge-Stone adders, using the original and redesigned operators on
This document describes a computer integrated network solution for power plants in Poland called Badel. The network would connect process levels with plant operator levels.
The process levels would consist of microprocessor-based cells for monitoring heat and power generating units. These cells would be connected via local area networks and communicate process variables to the plant operator level.
The plant operator level would include a power plant database, control processor, and operator consoles for monitoring the plant. The network is intended to help operators monitor and control large power plants by integrating data collection from process levels and centralizing control and monitoring at the plant operator level. Performance evaluation of this integrated network solution for a power plant is the focus of the paper.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Tras Cámara del documental Reflejo de la Urbe, Una mirada crítica a la arquitectura de Barquisimeto. Proyecto iniciado en el 2007 y terminado en el 2009. Producción Nacional Independiente y de autogestión.
Documental: Reflejo de la Urbe
Dirección y Guión: Lucy González
Investigación y Producción: Lucy González
Dirección de Fotografía: Ramón Méndez
CO-Producción: CIECA y ALL TIME SYSTEMS
Producción Ejecutiva: Lucy González y Elías González
Sonorización: Ramón Méndez
Diseño Gráfico: Gustavo Rojas
Edición y Efectos: Lucy González y Elías González
Duración: 52’
Urbe: Barquisimeto
País: Venezuela
Año: 2009
Este documento describe la adolescencia y sus características. Explica que la adolescencia es un período de transición entre la niñez y la adultez donde los individuos empiezan a tomar sus propias decisiones. También cubre temas como los cambios físicos y emocionales durante la adolescencia, las causas de los embarazos en adolescentes, y proporciona enlaces a recursos adicionales sobre el tema.
Con motivo de la Festividad del Día de Andalucía, los niños y niñas de Guadalinfo Torrox, han buscado información y han elaborado la siguiente presentación.
Internet Startup Camp Valencia #ISC2014 ProgramaSoluciona Facil
Este documento presenta el programa de una conferencia de cuatro días sobre emprendimiento en Internet. La conferencia cubrirá temas como modelos de negocio móviles, marketing en línea, SEO, blogs, YouTube, Google AdWords y Analytics, comercio electrónico, financiamiento e inversión. Incluirá presentaciones magistrales, mesas redondas, casos de éxito y talleres.
Mi empresa está en las redes sociales, ¿y ahora qué?Soluciona Facil
Este documento ofrece consejos sobre cómo las empresas pueden utilizar las redes sociales como Facebook para conseguir clientes. Recomienda crear una imagen coherente de la empresa y controlar el contenido que se publica sobre ella. También advierte sobre errores comunes como no publicar contenido o mezclar cuentas personales y profesionales. Incluye casos de éxito como empresas que animaron a los usuarios a participar mediante juegos o transformando sus selfies. Finalmente, sugiere herramientas para monitorizar conversaciones online sobre la empresa y la competencia.
This document summarizes a research paper that proposes combining a unified power quality conditioner (UPQC) with a photovoltaic (PV) array. The UPQC uses series and shunt inverters connected back-to-back to compensate for both voltage and current-related power quality issues in both grid-connected and islanding modes. By connecting the PV array to the UPQC's DC link, the system can inject active power from the PV to the grid during voltage interruptions or islanding events. Control strategies are described for operating the shunt and series inverters to compensate for harmonics, reactive power, and voltage disturbances while also injecting PV power as needed. Simulation results demonstrate the effectiveness of the
El documento explica el uso de los principales signos de puntuación en español como la coma, el punto y coma, el punto, los puntos suspensivos, los signos de interrogación y exclamación, y las comillas. Describe cuándo y cómo se utilizan cada uno de estos signos para estructurar oraciones, párrafos y textos, y para indicar pausas, enumeraciones, citas textuales, diálogos y énfasis.
ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE LIFETIME OF WIRELESS SENSOR NETWORK IJCNCJournal
Wireless Sensor Network (WSN) is commonly used to collect information from a remote area and one of the most important challenges associated with WSN is to monitor all targets in a given area while maximizing network lifetime. In wireless communication, energy consumption is proportional to the breadth of sensing range and path loss exponent. Hence, the energy consumption of communication can be minimized by varying the sensing range and decreasing the number of messages being sent. Sensing energy can be optimized by reducing the repeated coverage target. In this paper, an Adaptive Sensor Sensing Range (ASSR) technique is proposed to maximize the WSN Lifetime. This work considers a sensor network with an adaptive sensing range that are randomly deployed in the monitoring area. The sensor is adaptive in nature and can be modified in order to save power while achieving maximum time of monitoring to increase the lifetime of WSN network. The objective of ASSR is to find the best sensing range for each sensor to cover all targets in the network, which yields maximize the time of monitoring of all targets and eliminating double sensing for the same target. Experiments were conducted using an NS3 simulator to verify our proposed technique. Results show that ASSR is capable to improve the network lifetime by 20% as compared to other recent techniques in the case of a small network while achieving an 8% improvement for the case of a large networks.
Adaptive Sensor Sensing Range to Maximise Lifetime of Wireless Sensor NetworkIJCNCJournal
The document describes an Adaptive Sensor Sensing Range (ASSR) technique proposed to maximize the lifetime of a Wireless Sensor Network (WSN). The ASSR technique allows sensors to vary their sensing range to minimize energy consumption while ensuring all targets are monitored. It considers a WSN with sensors randomly deployed that can modify their sensing range to save power. The objective of ASSR is to find the optimal sensing range for each sensor to cover all targets, maximizing monitoring time and eliminating duplicate monitoring. Simulation results show ASSR can improve network lifetime by 20% for small networks and 8% for large networks compared to other recent variable sensing range techniques.
Comparative Analysis of Different Deployment Techniques in Wireless Sensor Ne...IJEACS
This document compares different deployment techniques for wireless sensor networks. It summarizes randomized, grid-based, contour-based, and projection-based deployment methods. Through simulations, it finds that projection-based deployment outperforms the other methods by using fewer sensor nodes, less energy, and less memory. It concludes that projection-based deployment provides more efficient coverage of target areas, including irregular shapes, compared to the other analyzed techniques.
WSN performance based on node placement by genetic algorithm at smart home en...TELKOMNIKA JOURNAL
Wireless sensor connectivity is one of several factors that determines the communication reliability of each node. The placement of the node depends on the area that covered by wireless coverage area, so the node placement should be optimally placed. But the other aspect is the sensor coverage area. Sensor coverage area sometimes could be different with wireless sensor coverage area. Based on that situation, it needs to optimize that situation. Genetic Algorithm is an algorithm that utilizes a heuristic approach that uses biological mechanism evolution. It used to evolution the best position of Sensor Node based on Wireless and Sensor coverage area. After the position of each node generated by Genetic Algorithm, it still needs to evaluate the wireless sensor node performance. The performance indicates that the genetic algorithm can be used to determine sensor node placement in the smart home environment. The smart home environment used to monitor event at the house such as wildfire. In this research used Quality of Services (QoS) to measure wireless sensor performance. The experimental testing scenario will be used to place several nodes that generated. The QoS performed systems reliability that produced based on 3, 4 and 5 testing nodes, the minimum and maximum of each: delay is 6.21 and 8.74 milliseconds, jitter is 0.11 and 1.59 Hz and throughput is 68.83 and 90.49 bps. Based on ETSI classification, the performance of sensor node placement is Good and acceptable in real-time systems.
Enhanced DV Hop Localization Algorithm for Wireless Sensor Networksijtsrd
The Wireless Sensor Networks Localization is an important area due to its wide spread application in the all fields. Hence in this work, an improved Distance Vector technics is used to reduce the localization error of target nodes in the wireless sensor networks. The proposed technique is an modification over classical D V hop algorithm. The importance of localization of unknown sensor nodes in WSN is an emerging area due to the wide use of applications. Hence in this paper, an advanced Distance Vector algorithm is proposed to improve the localization or positional accuracy of unknown sensor nodes. The proposed algorithm is an enhancement over traditional over classical Distance Vector algorithm. The main goal of this algorithm is minimize the error generated during the calculation of average hop size value with the help of weighted correction on average hop size. And further improvement in positional accuracy of sensor node is maintained by using WLS algorithm, by considering the distance between anchor nodes and unknown sensor nodes. Simulation results are generated by using MATLAB and the localization accuracy or error compared with classical DV hop, improved method by changing the parameters like radius of communication of nodes, density of sensor nodes and percentage of anchor counts. Jamal Kutty K | Dr. Kanika Sharma "Enhanced DV-Hop Localization Algorithm for Wireless Sensor Networks" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-7 | Issue-3 , June 2023, URL: https://www.ijtsrd.com.com/papers/ijtsrd57477.pdf Paper URL: https://www.ijtsrd.com.com/engineering/electronics-and-communication-engineering/57477/enhanced-dvhop-localization-algorithm-for-wireless-sensor-networks/jamal-kutty-k
This document summarizes a research paper that proposes a new cuboid-based localization algorithm for wireless sensor networks. The algorithm aims to minimize localization error and decrease energy consumption by shifting complexity to anchor nodes that have GPS. It works by having anchor nodes broadcast their locations to form triangles around unknown nodes. Distances from unknown nodes to anchors are estimated using RSSI. The algorithm is simulated in a 3D space and shows decreasing localization error as the number of anchor nodes increases, achieving an error of under 1.6m. The paper aims to improve over existing localization methods that have issues like multipath interference affecting RSSI-based techniques.
Redundant Actor Based Multi-Hole Healing System for Mobile Sensor NetworksEditor IJCATR
In recent years, the Mobile Wireless Sensor Network
is the emerging solution for monitoring of a specified region of
interest. Several anomalies can occur in WSNs that impair their
desired functionalities resulting in the formation of different
kinds of holes, namely: coverage holes, routing holes. Our
ultimate aim is to cover total area without coverage hole in
wireless sensor networks. We propose a comprehensive solution,
called holes detection and healing. We divided our proposed
work into two phases. The first phase consists of three sub- tasks;
Hole-identification, Hole-discovery and border detection. The
second phase treats the Hole-healing with novel concept, hole
healing area. It consists of two sub-tasks; Hole healing area
determination and node relocation.
Design and implementation of a centralized approach for multi-node localizatioIJECEIAES
In this paper, a centralized approach for multi nodes localization is introduced. This approach is based on using a beacon fixed at the lower middle edge of the environment. This beacon is provided with a distance sensor and can scan the environment to measure the distance between the detecting node and the beacon. Also, remote control is fixed on the beacon to distinguish the identity of the detecting node. Two nodes are used in this approach, each node contains eight cells, and each cell has a 5 mm infrared (IR) transmitter and TSOP4P38 IR receiver. If any one of the IR receivers has received the beacon ID, the transmitter which belongs to the same cell will respond by sending the node ID to the beacon. The beacon measurements and the information received from the detected nodes are then used to estimate the location and orientation of the visible nodes and the results will be saved in the main computer. Several experimental results have been tested with different distances from the nodes to the beacon. Also, different rotation angles at the beacon have been experienced to analyze the performance of the introduced approach.
IRJET- Coverage Hole Avoidance using Fault Node Recovery in Mobile Sensor Net...IRJET Journal
This document presents a fault node recovery algorithm for wireless sensor networks. It proposes combining the Grade Diffusion algorithm with a genetic algorithm to identify and replace faulty sensor nodes. The goal is to replace fewer sensor nodes while reusing existing routing paths, which increases the lifetime of the wireless sensor network and reduces replacement costs. It describes modules for sensor deployment, hole identification when sensors fail, hole healing by moving neighboring sensors, and healing holes when obstacles are present. The algorithm is implemented and evaluated using the Network Simulator NS2 tool. The results show the proposed algorithm increases the number of active sensor nodes and reduces the rate of energy consumption compared to other approaches.
CP-NR Distributed Range Free Localization Algorithm in WSNIJAAS Team
Advancements in wireless communication technology have empowered the researchers to develop large scale wireless networks with huge number of sensor nodes. In these networks localization is very active field of research. Localization is a way to determine the physical position of sensor nodes which is useful in many aspects such as to find the origin of events, routing and network coverage. Locating nodes with GPS systems is expensive, power consuming and not applicable to indoor environments. Localization in three dimensional space and accuracy of the estimated location are two factors of major concern. In this paper, a new three dimensional Distributed range-free algorithm which is known as CP-NR is proposed. This algorithm has high localization accuracy and resolved the problem of existing NR algorithm. CP-NR (Coplanar and Projected Node Reproduction) algorithm makes use of co-planarity and projection of point on plane concepts to reduce the localization error. Results have shown that CP-NR algorithm is superior to NR algorithm and comparison is done for the localization accuracy with respect to variations in range, anchor density and node density.
The document proposes a new localization method called A2L (Angle to Landmark) for wireless sensor networks. A2L uses angle of arrival measurements between sensor nodes and a subset of nodes equipped with GPS (landmarks) to determine the positions of non-landmark nodes. Compared to previous methods like APS and AHLoS that also use angle and distance measurements, simulations show that A2L can locate a greater number of nodes with higher accuracy while requiring fewer connections between nodes. The method is also low-cost since it does not require each node to have GPS or other expensive equipment.
Performance Analysis of Fault Detection in Round Trip Delay and Path Wireless...Editor IJMTER
In recent years, wsns detect to the fault sensor node based on round trip delay using path
in wireless sensor networks. Portable sensor node is low cost in Wsns . Measured in the round trip
delay time and number of sensor node. Existing method is used to large value of sensor node,
identification of sensor node time and distance . it is used to linear selection path, disadvantages are
data loss, more number of path, complexity. in this proposed method using distributed autonomous
sensor software implementation in NS2.it is detected fault sensor node and malfunction ,in this
analysis time and path using discrete Rtp. real time applicability in received signal strength ,separate
wavelength for end of the node avoid the data loss and complexity. Hardware implementation using
ZigBee and Microcontroller .Equal to the hardware and software implementation. It is overcomes to
the data loss. comparing the threshold and Rtd time. Finally, the algorithm is tested under different
number of faulty sensors in the same area. Our Simulation results demonstrate that the time
consumed to find out the faulty nodes in our proposed algorithm is relatively less with a large
number of faulty sensors existing in the network.
AN ENERGY EFFICIENT DISTRIBUTED PROTOCOL FOR ENSURING COVERAGE AND CONNECTIVI...ijasuc
As wireless sensor networks (WSNs) continue to attract more and more researchers attention, new ideas for
applications are continually being developed, many of which involve consistent coverage with good
network connectivity of a given area of interest. For the successful operation of the wireless Sensor
Network, the active sensor nodes must maintain both coverage and also connectivity. These are two closely
related essential prerequisites and they are also very important measurements of quality of service (QoS)
for wireless sensor networks. This paper presents the design and analysis of novel protocols that can
dynamically configure a sensor network to result in guaranteed degrees of coverage and connectivity. This
protocol is simulated using NS2 simulated and compared against a distributed probabilistic coveragepreserving configuration protocol (DPCCP) with SPAN [1] protocol in the literature and show that it
activates lesser number of sensor nodes, consumes much lesser energy and maximises the network lifetime
significantly.
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkIJMTST Journal
Optimal sensor deployment is necessary condition in homogeneous and heterogeneous wireless sensor
network. Effective deployment of sensor nodes is a major point of concern as performance and lifetime of any
WSN. Proposed sensor deployment in WSN explore every sensor node sends its data to the nearest sink node
of the WSN. In addition to that system proposes a hexagonal cell based sensor deployment which leads to
optimal sensor deployment for both homogeneous and heterogeneous sensor deployment. Wireless sensor
networks are receiving significant concentration due to their potential applications ranging from surveillance
to tracking domains. In limited communication range, a WSN is divided into several disconnected sub-graphs
under certain conditions. We deploy sensor nodes at random locations so that it improves performance of the
network.This paper aims to study, discuss and analyze various node deployment strategies and coverage
problems for Homogeneous and Heterogeneous WSN.
An implementation of recovery algorithm for fault nodes in a wireless sensor ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
The Expansion of 3D wireless sensor network Bumps localizationIJERA Editor
Bump localization of wireless sensor network is a hot topic, but present algorithms of 3D wireless sensor node localization arenot accurate enough. In this paper, the DR-MDS algorithm is proposed, DR-MDS algorithm mainly calibrates the coordinatesof nodes and the ranging of nodes based on multidimensional scaling, it calculates the distance between any nodes exactlyaccording to the hexahedral measurement, introducing a modification factor to calibrate the measuring distance by ReceivedSignal Strength Indicator (RSSI). Results of simulation show that DR-MDS algorithm has significant improvement inlocalization accuracy compare with MDS-MAP algorithm.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document summarizes research on detecting sensor node failures and proposing a node scheduling scheme in wireless sensor networks. It first introduces wireless sensor networks and discusses common node failures that can occur. It then proposes three algorithms: 1) using neighborhood keys and testing procedures to detect node failures, 2) implementing a security-aware routing protocol to provide security, and 3) developing an adaptive node scheduling method to maintain sensing levels when nodes fail. The document evaluates these approaches and concludes they can help address problems of node failure detection, security, and maintaining network functionality.
Greedy – based Heuristic for OSC problems in Wireless Sensor NetworksIJMER
This document summarizes an article about optimizing set coverage problems in wireless sensor networks. It discusses the following key points:
1) Wireless sensor networks aim to maximize network lifetime by scheduling sensors to alternate between active and sleep modes or adjusting transmission ranges. The optimize set coverage (OSC) problem aims to find a maximum number of set covers where each active sensor is connected to the base station.
2) The OSC problem is proved to be NP-complete. Integer programming and linear programming models are proposed to formulate the OSC problem.
3) Greedy-based heuristics are presented for solving the OSC problem in a centralized and distributed manner. Simulations are used to validate the performance of
Localization of wireless sensor networkIRJET Journal
This document summarizes a range-free localization algorithm for wireless sensor networks called TSBMCL (Temporary-Seed Based Monte Carlo Localization) that uses the Monte Carlo method. It discusses how TSBMCL works in two main parts: 1) voting for temporary anchor nodes from localized nodes, and 2) using the temporary anchors to aid localization of other nodes. The algorithm is shown to improve localization accuracy over the MCB algorithm. Simulation results demonstrate that TSBMCL reduces localization failure rates and requires fewer sampling particles than standard Monte Carlo localization methods. In conclusion, TSBMCL provides an accurate and efficient range-free localization scheme for mobile wireless sensor networks.
NETWORK PERFORMANCE ENHANCEMENT WITH OPTIMIZATION SENSOR PLACEMENT IN WIRELES...ijwmn
From one side, sensor manufacturing technology and from other side wireless communication technology
improvement has an effect on the growth and deployment of Wireless Network Sensor (WSN). The
appropriate performance of WSN has abundant necessity which has dependent on the different parameters
such as optimize sensor placement and structure of network sensor. The optimized placement in WSN not
only would optimize number of sensors, but also help to reach to the more precise information. Therefore
different solutions are proposed to reduce cost and increase life time of sensor networks that most of them
are concentrated in the field of routing and information transmission. In this paper, places which they need
new sensors placement or sensor movements are determined and then with applying these changes,
performance of WSN will calculate. To achieve the optimum placement, the network should evaluate
precisely and effective criteria on the performance should extract. Therefore the criteria should be ranked
and after weighting with using AHP algorithms, with use of Geographical Information System (GIS), these
weighted criteria will combined and in the locations which WSN doesn’t have enough performance, new
sensor placement will create. New proposed method, improve 21.11% performance of WSN with sensor
placement in the low performance locations. Also the number of added sensor is 26.09% which is lowest
number of added sensors in comparison with other methods.
NETWORK PERFORMANCE ENHANCEMENT WITH OPTIMIZATION SENSOR PLACEMENT IN WIRELES...
Ka2417181721
1. N. Pushpalatha, Dr. B. Anuradha / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.1718-1721
A Low Cost Nodes Distribution on Hexagonal method for
Wireless Sensor Networks
N. Pushpalatha* , Dr. B. Anuradha**
1
Department of ECE, AITS, Tirupathi, India
2
Department of ECE, S.V. University College of Engineering, Tirupathi, India
ABSTRACT Mechanical Systems and other modern technology,
In some atmospheric environment, randomly wireless sensor networks are becoming an active
deployed sensor nodes could not satisfy the research area. Wireless sensor network is composed of
requirements of wireless sensor networks. massive collaborative sensor nodes, and each node has
Therefore, it is necessary to use mobile sensor the abilities of sensing, computing and
nodes in specially shaped area conditions. After communicating. It has synthesized sensor techniques,
moving nodes are deployed randomly, they could embedded computations, distributed information
be relocated according to the real-time situation of processing and wireless communication technique,
network coverage area. This paper proposes A Low which can cooperate to complete real-time monitoring,
Cost Nodes Distribution on Hexagonal method for sensing and gathering of object information, and then
wireless sensor networks (WSNs) using MDS transmit it to the user after information processing. At
algorithm. It is to determine the Distribution of present, wireless sensor network has a very broad
sensor nodes on the geographic area and application in military defense [6], industrial control
computational cost of the system is presented. In [7], urban management [8], biomedicine [9],
this paper, to measure the accuracy of nodes environmental monitoring [10], disaster and dangerous
distribution, a hexagonal method is used to deploy regional remote control, etc. Network coverage is the
sensor nodes to the appropriate positions of fundamental issue of wireless sensor network, and it
wireless sensor network. Nowadays Wireless has played a vital role in the coverage performance
networking is used to meet a variety of needs. and life span of wireless sensor network. Coverage
Smart environments represent the next problem can be divided into two classes, static sensor
evolutionary development step in buildings, network coverage and mobile sensor network
utilities, industrial, scientific, medical, home, coverage. This paper mainly discusses mobile sensor
shipboard, military, transportation systems network coverage.
automation and mobile applications. Like any
organism, the smart environment relies first and The work presented in the paper is A Low
foremost the sensory data from the real world. It is Cost Nodes Distribution on Hexagonal method for
used for 3D open and closed surfaces. The wireless sensor networks (WSNs). Some challenges of
hexagonal method simulation results indicate that position estimation problem in real applications are
it has hundred percent coverage area with low dealt in this paper. The conditions that most existing
computational cost for more than 100 nodes and sensor positioning methods fail to perform well are the
range error is low. anisotropic topology of the sensor networks and
complex terrain where the sensor networks are
Key Words - Wireless Sensor Networks, Nodes deployed. Moreover, cumulative measurement error is
Distribution, Hexagonal method, Network Coverage a constant problem of some existing sensor positioning
Area methods [1-2]. This proposed method able to
distribute the sensor nodes on hexagonal method and
1. Introduction
also estimate the computational cost.
With the development of sensor technique, The focus of the paper is A Low Cost Nodes
network, wireless communications, Micro-Electro- Distribution on Hexagonal method for wireless sensor
networks (WSNs). The paper is organized as follows.
1718 | P a g e
2. N. Pushpalatha, Dr. B. Anuradha / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.1718-1721
Section 2 presents the previous work of localization
10
problem in wireless sensor networks. Proposed
method has been discussed in section 3. In section 4
8
Simulation Results of the paper has been discussed. In
section 5 Conclusion and Future work, where the
6
future challenges and directions to improve
localization in WSN technology are described.
4
2. Previous Work 2
The multidimensional scaling technique, 0
which was a technique that had been successfully used
0 2 4 6 8 10
to capture the inter correlation of high dimensional
data at low dimension in social science, was used [4].
A Square method was used to estimate all sensors’ Fig.2. Randomly distributed sensors in a
relative locations by applying MDS to compute the Square method.
relative positions of sensors with high error tolerance
[3]. In order to collect some of pair wise distances 3. Proposed Method
among sensors, we select a number of source sensors, In this section, we present A Low Cost Nodes
and they initialize the whole network to estimate some Distribution on Hexagonal method for wireless sensor
of the pair wise distances [2]. These estimated networks (WSNs).The choice of integrating MDS is
distances are then transmitted to a computer or sensor based on our extensive studies on existing localization
for square computation of some sensor system design algorithms. In this paper it is proposed 100 uniformly
or fly-over base-station. In this method, the number of distributed nodes and there are no measurement errors.
nodes is more when compared to triangle positioning The Simulation results with 100 anchors randomly
method algorithm and the coverage area was also more distributed across the networks are shown in Figure 3.
as shown in Fig. 1 and Fig.2. A hexagonal method is used to deploy all the sensors
within the coverage network area. In the square
method some of the sensor nodes are not placed in the
coverage area and there exists a ranging error. In the
10
proposed method the sensors are deployed without any
ranging error and coverage area is very high.
8
38 85 65
81
22 78
6 1 50 84
42 89 3 6
25 56
752 7311 29
18
46
92
4 40 70 8 36
0.5 14 71 54 86
98 9932
5 37 21 59
16
63
79 26
No.of nodes
35 75 88 15
2 48
0 64 27
51 6169 72
87
82 12 58
10 44
74 67 23 24
0 1 55 19 83
62 66
77 68
-0.5 94
49 3439
0 2 4 6 8 10 80
97
90 60 28 4720
4 9 57
31 91
30 245
-1 76 41
95 43 93 96 33
100 17 53
13
Fig.1 Randomly distributed sensors -1.5 -1 -0.5 0
No.of nodes
0.5 1 1.5
in a triangular Method
Fig.3 Randomly deployed sensors on a
hexagonal method
1719 | P a g e
3. N. Pushpalatha, Dr. B. Anuradha / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.1718-1721
4. Simulation Results 5. Conclusions and Future Work
It is shown that the proposed algorithm works In this paper A Low Cost Nodes Distribution
well for near uniform radio propagation. However, in on Hexagonal method for wireless sensor networks
the real world, radio propagation indoors and in (WSNs) is present. Simulation results also show that
cluttered circumstances is far from uniform. Local our proposal is low cost to adverse effect of anchor
position estimation may also be very high. In the mat placement. The proposed algorithm can be
lab simulation the proposed algorithm is a random implemented in a distributed fashion efficiently when
network of >100 nodes are created for a hexagonal the number of anchors is chosen appropriately. From
area and a low cost hexagonal method is used to find simulations, we find that choosing anchors is more
out the computational cost as shown in table 1.In this than 100 in the network. However, most networks in
method the computational cost is increases when we real-world applications are not isotropic. For
are increasing the number of nodes in the entire area of anisotropic networks a circle shaped MDS algorithm
the hexagon and the coverage area of the network is can give better results than hexagonal method. The
100% up to 300 nodes are randomly deployed in the main advantage of the hexagonal method is used in
entire area of the hexagon. The proposed method Cellular and Mobile Networks as shown in Fig.4. In
shows that when number of sides is increases in the this algorithm the Computational cost is very low
entire area of the network the coverage area is comparative to the previous method. In this method
increases and range error reduces. the coverage area is more and computational cost is
low and it can reduce the power consumption. It is
used in 3D open and closed surfaces. The future
Table.1 Analysis of Hexagonal Method enhancement is increasing radio range for wireless
sensor networks. The main limitation is when we are
increasing the number of nodes above 300, then it can
decrease the coverage area and range error is
decreased. To overcome that better to increase number
sides in the perimeter of the entire coverage area like
octagon.
4
3
2
1
0
-1
-2
-3
-4
-4 -3 -2 -1 0 1 2 3 4
Fig.4 Hexagonal Cell site used in mobile
networks
1720 | P a g e
4. N. Pushpalatha, Dr. B. Anuradha / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.1718-1721
6. References
9 R. Arumugan, V. Subramanian, A. Minai.
1 N.Pushpalatha and Dr.B.Anuradha, “A Two-
SCRIBE: self organized contention and routing
Dimensional IR Algorithm for Position
in intelligent broadcast environments [C],
Estimation in Wireless Sensor Networks”,
Military Communications Conference, 2003:
International Journal of Computer Science and
1567-1572.
Technology, ISSN : 0976-8491(Online) | ISSN :
2229-4333 (Print) IJCST Vol. 3,Issue 2,
10 Wu-chun Feng. Securing wireless
Version 1, April - June 2012.Pp:35-39.
communication in heterogeneous environments
[C], MILCOM, 2002, 2: 1101-1106.
2 N.Pushpalatha and Dr.B.Anuradha, “Shortest
path position estimation between source and
destination nodes in wireless sensor networks
N.Pushpalatha completed her B.Tech
with low cost”, International Journal of at JNTU, Hyderabad in 2004 and
Emerging Technology and Advanced M.Tech at A.I.T.S., Rajampet in 2007.
Engineering (ISSN 2250-2459, Volume 2, Issue Presently she is working as Assistant
4, April 2012). Pp:6-12 Professor of ECE, Annamacharya
Institute of Technology and Sciences
3 N. Pushpalatha and Dr.B.Anuradha, Tirupati since 2006. She has guided
many B.Tech projects. Her Research
“Distribution of Nodes on Square Method for
area includes Data Communications
Wireless Sensor Networks”, in International and Ad-hoc Wireless Sensor
Journal of Computer Science and Networks.
Telecommunications [Volume 3, Issue 1,
January 2012].
Dr.B.Anuradha is working as
4 N.Pushpalatha and Dr.B.Anuradha, “ Study of Associate Professor in the
Various Methods of Wireless Ad-hoc Sensor Department of ECE, at Sri
Networks using Multidimensional Scaling for
Venkateswara University College of
Position Estimation” Global Journal
Engineering and AppliedSciences-ISSN2249- Engineering since 1992. She has
2631(online): 2249-2623(Print) GJEAS guided many B.Tech and M.Tech
Vol.1(3) , 2011.Pp:76-81 projects. At present Five Scholars are
working for PhD. She has published a
5 Eiko Yoneki and Jean Bacon, “A survey of good number of papers in journals and
Wireless Sensor Network technologies:
conferences.
research trends and middleware’s role”
University of Cambridge Computer Laboratory
Cambridge CB3 0FD, United Kingdom
6 D. Estrin, R. Govindan, J. Heidemann, et al.
Next century challenges: scalable coordination
in sensor networks [C], Mobile
Communications, 1999: 263-270
7 PG. J. Pottie, W. J. Kaiser. Wireless integrated
network sensors [J], Communications of the
ACM, 2000, 43(5): 51-58.
8 T. Arici, Y. Altunbasak. Adaptive sensing for
environment monitoring using wireless sensor
networks [C], Wireless Communications and
NetworkingConference,2004,4:2347-2352.
1721 | P a g e