In this paper, we investigate the problem of visual coverage in visual sensor networks (VSNs). It is required to select a subset of sensor nodes to provide a visual coverage over the monitoring region at each point of time. In contrast with the pervious works which considered only single metric for sensor selection method, in this study we assumed the sensor selection as multi-criteria problem. For the purpose of maximizing the network lifetime, we consider three metrics a) visual coverage ratio, i.e., percentage of monitoring region which is fully covered by camera sensors, b) number of selected sensors, i.e., number of active sensors for covering the desired region, and c) overlapping coverage ratio, i.e., percentage of monitoring region which is covered by more than one camera sensor. Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is used to solve the problem. Besides, impact of steady state selection and generational selection method is studied on the network lifetime. Simulation results show the superiority of multi-objective optimization. NSGA-II results not only longer network lifetime but also fewer number of active sensor and lower overlapping ratio at each point of time.
AUTOMATIC IDENTIFICATION OF CLOUD COVER REGIONS USING SURF ijcseit
Weather forecasting has become an indispensable application to predict the state of the atmosphere for a
future time based on cloud cover identification. But it generally needs the experience of a well-trained
meteorologist. In this paper, a novel method is proposed for automatic cloud cover estimation, typical to
Indian Territory Speeded Up Robust Feature Transform(SURF) is applied on the satellite images to obtain
the affine corrected images. The extracted cloud regions from the affine corrected images based on Otsu
threshold are superimposed on the artistic grids representing latitude and longitude over India. The
segmented cloud and grid composition drive a look up table mechanism to identify the cloud cover regions.
Owing to its simplicity, the proposed method processes the test images faster and provides accurate
segmentation for cloud cover regions.
Closed Loop Control of Gimbal-less MEMS Mirrors for Increased Bandwidth in Li...Ping Hsu
we presented a low SWaP wirelessly controlled MEMS mirror
-
based LiDAR
prototype
which utilized an OEM
laser rangefinder for distance measurement
[1]
.
The MEMS mirror was run in open loop based on its e
xceptional
ly fast
design and high
repeatability performance.
However, to
further
extend the bandwidth and incorporate necessary eye
-
safety features, we recently focused on providing mirror position feedback and running the system in closed loop control.
A new approach of edge detection in sar images using region based active cont...eSAT Journals
Abstract This paper presents a new methodology for the edge detection of complex radar images. The approach includes the edge improvisation algorithm and followed with edge detection. The nature of complex radar images made edge enhancement part before the edge detection as the data is highly heterogeneous in nature. Thus, the use of discrete wavelet transform in the edge improvisation algorithm is justified. Then region based active contour model is used as edge detection algorithm. The paper proposes the distribution fitting energy with a level set function and neighborhood means and variances as variables. The performance is tested by applying it on different images and the results are been analyzed. Keywords: Edge detection, Edge improvisation, Synthetic Aperture radar (SAR), wavelet transforms.
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.
AUTOMATIC IDENTIFICATION OF CLOUD COVER REGIONS USING SURF ijcseit
Weather forecasting has become an indispensable application to predict the state of the atmosphere for a
future time based on cloud cover identification. But it generally needs the experience of a well-trained
meteorologist. In this paper, a novel method is proposed for automatic cloud cover estimation, typical to
Indian Territory Speeded Up Robust Feature Transform(SURF) is applied on the satellite images to obtain
the affine corrected images. The extracted cloud regions from the affine corrected images based on Otsu
threshold are superimposed on the artistic grids representing latitude and longitude over India. The
segmented cloud and grid composition drive a look up table mechanism to identify the cloud cover regions.
Owing to its simplicity, the proposed method processes the test images faster and provides accurate
segmentation for cloud cover regions.
Closed Loop Control of Gimbal-less MEMS Mirrors for Increased Bandwidth in Li...Ping Hsu
we presented a low SWaP wirelessly controlled MEMS mirror
-
based LiDAR
prototype
which utilized an OEM
laser rangefinder for distance measurement
[1]
.
The MEMS mirror was run in open loop based on its e
xceptional
ly fast
design and high
repeatability performance.
However, to
further
extend the bandwidth and incorporate necessary eye
-
safety features, we recently focused on providing mirror position feedback and running the system in closed loop control.
A new approach of edge detection in sar images using region based active cont...eSAT Journals
Abstract This paper presents a new methodology for the edge detection of complex radar images. The approach includes the edge improvisation algorithm and followed with edge detection. The nature of complex radar images made edge enhancement part before the edge detection as the data is highly heterogeneous in nature. Thus, the use of discrete wavelet transform in the edge improvisation algorithm is justified. Then region based active contour model is used as edge detection algorithm. The paper proposes the distribution fitting energy with a level set function and neighborhood means and variances as variables. The performance is tested by applying it on different images and the results are been analyzed. Keywords: Edge detection, Edge improvisation, Synthetic Aperture radar (SAR), wavelet transforms.
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.
Reconstruction of Objects with VSN M.Priscilla - UG Scholar,
B.Nandhini - UG Scholar,
S.Manju - UG Scholar,
S.Shafiqa Shalaysha – UG Scholar,
Christo Ananth - Assistant Professor,
Department of ECE,
Francis Xavier Engineering College, Tirunelveli, India
Data Collection via Synthetic Aperture Radiometry towards Global SystemIJERA Editor
Nowadays it is widely accepted that remote sensing is an efficient way of large data management philosophy. In
this paper, we present a future view of the big data collection by synthetic aperture radiometry as a passive
microwave remote sensing towards building a global monitoring system. Since the collected data may not have
any value, it is mandatory to analyses these data in order to get valuable and beneficial information with respect
to their base data. The collected data by synthetic aperture radiometry is one of the high resolution earth
observation, these data will be an intensive problems, Meanwhile, Synthetic Aperture Radar able to work in
several bands, X, C, S, L and P-band. The important role of synthetic aperture radiometry is how to collect data
from areas with inadequate network infrastructures where the ground network facilities were destroyed. The
future concern is to establish a new global data management system, which is supported by the groups of
international teams working to develop technology based on international regulations. There is no doubt that the
existing techniques are so limited to solve big data problems totally. There is a lot of work towards improving 2-
D and 3-D SAR to get better resolution.
Numerical Assessment of UWB Patch Antenna for Breast Tumor DetectionIDES Editor
In this paper, numerical assessment of two UWB
planar monopole patch antennas is presented. One is disc
monopole patch antenna with rectangular-slot, which
operates from 2.8 GHz to 11.2 GHz and the second one is
rectangular patch antenna, which operates from 3.4 GHz to
14.5 GHz. These antennas perform reasonably well in terms
of return loss and radiation efficiency. Radiation patterns
are almost omni directional. We propose these antennas for
breast tumor detection and location. Microwave
Imaging(MWI) systems constructed from UWB patch
antennas can be used to construct three-dimensional profiles
of the electrical properties of the body part that is being
examined. The simulations are performed using CST
Microwave studio, an electromagnetic simulator. The
simulation results show good agreement with the
published results.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Localization based range map stitching in wireless sensor network under non l...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
AN EFFICIENT IMPLEMENTATION OF TRACKING USING KALMAN FILTER FOR UNDERWATER RO...IJCSEIT Journal
The exploration of oceans and sea beds is being made increasingly possible through the development of
Autonomous Underwater Vehicles (AUVs). This is an activity that concerns the marine community and it
must confront the existence of notable challenges. However, an automatic detecting and tracking system is
the first and foremost element for an AUV or an aqueous surveillance network. In this paper a method of
Kalman filter was presented to solve the problems of objects track in sonar images. Region of object was
extracted by threshold segment and morphology process, and the features of invariant moment and area
were analysed. Results show that the method presented has the advantages of good robustness, high
accuracy and real-time characteristic, and it is efficient in underwater target track based on sonar images
and also suited for the purpose of Obstacle avoidance for the AUV to operate in the constrained
underwater environment.
Development and Hardware Implementation of an Efficient Algorithm for Cloud D...sipij
Detecting clouds in satellite imagery is becoming more important with increasing data availability which
are generated by earth observing satellites. Hence, intellectual processing of the enormous amount of data
received by hundreds of earth receiving stations, with specific satellite image oriented approaches,
presents itself as a pressing need. One of the most important steps in previous stages of satellite image
processing is cloud detection. While there are many approaches that compact with different semantic
meaning, there are rarely approaches that compact specifically with cloud and cloud cover detection. In
this paper, the technique presented is the scene based adaptive cloud, cloud cover detection and find the
position with assumption of sun reflection, background varying and scattering are constant. The capability
of the developed system was tested using dedicated satellite images and assessed in terms of cloud
percentage coverage. The system used for this process comprises of Intel(R) Xenon(R) CPU E31245 @
3.30GHz processor along with MATLAB 13 software and DSPC6713 processor along with Code Compose
Studio 3.1.
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
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Granular Mobility-Factor Analysis Framework for enrichingOccupancy Sensing wi...IJECEIAES
With the growing need for adoption of smarter resource control system in existing infrastructure, the proliferation of occupancy sensing is slowly increasing its pace. After reviewing an existing system, we find that utilization of Doppler radar is less progressive in enhancing the accuracy of occupancy sensing operation. Therefore, we introduce a novel analytical model that is meant for incorporating granularity in tracing the psychological periodic characteristic of an object by emphasizing on the mobility and uncertainty movement of an object in the monitoring area. Hence, the model is more emphasized on identifying the rate of change in any periodic physiological characteristic of an object with the aid of mathematical modelling. At the same time, the model extracts certain traits of frequency shift and directionality for better tracking of the unidentified object behavior where its applicabilibility can be generalized in majority of the fields related to object detection.
ENERGY EFFICIENT MULTIHOP QUALITY PATH BASED DATA COLLECTION IN WIRELESS SENS...Editor IJMTER
In recent years there has been an increased focus on the use of sensor networks to sense and measure
the environment. This leads to a wide variety of theoretical and practical issues on appropriate protocols for data
sensing and transfer. Recent work shows sink mobility can improve the energy efficiency in wireless sensor
networks (WSNs). However, data delivery latency often increases due to the speed limit of mobile sink. Most of
them exploit mobility to address the problem of data collection in WSNs. The WSNs with MS (mobile Sink) and
provide a comprehensive taxonomy of their architectures, based on the role of the MS. An overview of the data
collection process in such a scenario, and identify the corresponding issues and challenges. A protocol named
weighted rendezvous planning (WRP) which is a heuristic method that finds a near-optimal traveling tour that
minimizes the energy consumption of sensor nodes. Focus on the path selection problem in delay-guaranteed
sensor networks with a path-constrained mobile sink. Concentrate an efficient data collection scheme, which
simultaneously improves the total amount of data and reduces the energy consumption. The optimal path is chosen
to meet the requirement on delay as well as minimize the energy consumption of entire network. Predictable sink
mobility is exploited to improve energy efficiency of sensor networks.
Multispectral images are used for space Arial application, target detection and remote sensing application. MS images are very rich in spectral resolution but at a cost of spatial resolution. We propose a new method to increase a spatial resolution MS images. For spatial resolution enhancement of MS images we need to employ a super-resolution technique which uses a Principal Component Analysis (PCA) based approach by learning an edge details from database. Experiments have been carried out on both real multispectral (MS) data and MS data. This experiment is done with the usefulness for hyper spectral (HS) data as a future work.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
A Survey on Object Detection Methods in Visual Sensor Networks ijassn
Object detection is one of the major challenges in visual sensor networks (VSNs) which is set up in the
monitoring applications. Many approaches proposed to solve the object detection problem in VSNs,
considering diverse metrics such as reliability, energy consumption, detection accuracy and being realtime.
In this paper, a survey on the object detection methods in visual sensor networks is presented for the
first time. Furthermore, this paper classified the methods precisely. Two main object detection categories
in VSNs that explored in this paper are conventional object detection methods and object detection
approaches with the camera nodes involvement. To be more precise, presented survey promotes an
overview of recent object detection methods' literature with their performance evaluation. Also, this
research is challenging and the object detection issue in the visual sensor networks is open caused by
differences in estimations and performance metrics. Therefore, the survey concludes with open research
challenges.
Reconstruction of Objects with VSN M.Priscilla - UG Scholar,
B.Nandhini - UG Scholar,
S.Manju - UG Scholar,
S.Shafiqa Shalaysha – UG Scholar,
Christo Ananth - Assistant Professor,
Department of ECE,
Francis Xavier Engineering College, Tirunelveli, India
Data Collection via Synthetic Aperture Radiometry towards Global SystemIJERA Editor
Nowadays it is widely accepted that remote sensing is an efficient way of large data management philosophy. In
this paper, we present a future view of the big data collection by synthetic aperture radiometry as a passive
microwave remote sensing towards building a global monitoring system. Since the collected data may not have
any value, it is mandatory to analyses these data in order to get valuable and beneficial information with respect
to their base data. The collected data by synthetic aperture radiometry is one of the high resolution earth
observation, these data will be an intensive problems, Meanwhile, Synthetic Aperture Radar able to work in
several bands, X, C, S, L and P-band. The important role of synthetic aperture radiometry is how to collect data
from areas with inadequate network infrastructures where the ground network facilities were destroyed. The
future concern is to establish a new global data management system, which is supported by the groups of
international teams working to develop technology based on international regulations. There is no doubt that the
existing techniques are so limited to solve big data problems totally. There is a lot of work towards improving 2-
D and 3-D SAR to get better resolution.
Numerical Assessment of UWB Patch Antenna for Breast Tumor DetectionIDES Editor
In this paper, numerical assessment of two UWB
planar monopole patch antennas is presented. One is disc
monopole patch antenna with rectangular-slot, which
operates from 2.8 GHz to 11.2 GHz and the second one is
rectangular patch antenna, which operates from 3.4 GHz to
14.5 GHz. These antennas perform reasonably well in terms
of return loss and radiation efficiency. Radiation patterns
are almost omni directional. We propose these antennas for
breast tumor detection and location. Microwave
Imaging(MWI) systems constructed from UWB patch
antennas can be used to construct three-dimensional profiles
of the electrical properties of the body part that is being
examined. The simulations are performed using CST
Microwave studio, an electromagnetic simulator. The
simulation results show good agreement with the
published results.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Localization based range map stitching in wireless sensor network under non l...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
AN EFFICIENT IMPLEMENTATION OF TRACKING USING KALMAN FILTER FOR UNDERWATER RO...IJCSEIT Journal
The exploration of oceans and sea beds is being made increasingly possible through the development of
Autonomous Underwater Vehicles (AUVs). This is an activity that concerns the marine community and it
must confront the existence of notable challenges. However, an automatic detecting and tracking system is
the first and foremost element for an AUV or an aqueous surveillance network. In this paper a method of
Kalman filter was presented to solve the problems of objects track in sonar images. Region of object was
extracted by threshold segment and morphology process, and the features of invariant moment and area
were analysed. Results show that the method presented has the advantages of good robustness, high
accuracy and real-time characteristic, and it is efficient in underwater target track based on sonar images
and also suited for the purpose of Obstacle avoidance for the AUV to operate in the constrained
underwater environment.
Development and Hardware Implementation of an Efficient Algorithm for Cloud D...sipij
Detecting clouds in satellite imagery is becoming more important with increasing data availability which
are generated by earth observing satellites. Hence, intellectual processing of the enormous amount of data
received by hundreds of earth receiving stations, with specific satellite image oriented approaches,
presents itself as a pressing need. One of the most important steps in previous stages of satellite image
processing is cloud detection. While there are many approaches that compact with different semantic
meaning, there are rarely approaches that compact specifically with cloud and cloud cover detection. In
this paper, the technique presented is the scene based adaptive cloud, cloud cover detection and find the
position with assumption of sun reflection, background varying and scattering are constant. The capability
of the developed system was tested using dedicated satellite images and assessed in terms of cloud
percentage coverage. The system used for this process comprises of Intel(R) Xenon(R) CPU E31245 @
3.30GHz processor along with MATLAB 13 software and DSPC6713 processor along with Code Compose
Studio 3.1.
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
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Granular Mobility-Factor Analysis Framework for enrichingOccupancy Sensing wi...IJECEIAES
With the growing need for adoption of smarter resource control system in existing infrastructure, the proliferation of occupancy sensing is slowly increasing its pace. After reviewing an existing system, we find that utilization of Doppler radar is less progressive in enhancing the accuracy of occupancy sensing operation. Therefore, we introduce a novel analytical model that is meant for incorporating granularity in tracing the psychological periodic characteristic of an object by emphasizing on the mobility and uncertainty movement of an object in the monitoring area. Hence, the model is more emphasized on identifying the rate of change in any periodic physiological characteristic of an object with the aid of mathematical modelling. At the same time, the model extracts certain traits of frequency shift and directionality for better tracking of the unidentified object behavior where its applicabilibility can be generalized in majority of the fields related to object detection.
ENERGY EFFICIENT MULTIHOP QUALITY PATH BASED DATA COLLECTION IN WIRELESS SENS...Editor IJMTER
In recent years there has been an increased focus on the use of sensor networks to sense and measure
the environment. This leads to a wide variety of theoretical and practical issues on appropriate protocols for data
sensing and transfer. Recent work shows sink mobility can improve the energy efficiency in wireless sensor
networks (WSNs). However, data delivery latency often increases due to the speed limit of mobile sink. Most of
them exploit mobility to address the problem of data collection in WSNs. The WSNs with MS (mobile Sink) and
provide a comprehensive taxonomy of their architectures, based on the role of the MS. An overview of the data
collection process in such a scenario, and identify the corresponding issues and challenges. A protocol named
weighted rendezvous planning (WRP) which is a heuristic method that finds a near-optimal traveling tour that
minimizes the energy consumption of sensor nodes. Focus on the path selection problem in delay-guaranteed
sensor networks with a path-constrained mobile sink. Concentrate an efficient data collection scheme, which
simultaneously improves the total amount of data and reduces the energy consumption. The optimal path is chosen
to meet the requirement on delay as well as minimize the energy consumption of entire network. Predictable sink
mobility is exploited to improve energy efficiency of sensor networks.
Multispectral images are used for space Arial application, target detection and remote sensing application. MS images are very rich in spectral resolution but at a cost of spatial resolution. We propose a new method to increase a spatial resolution MS images. For spatial resolution enhancement of MS images we need to employ a super-resolution technique which uses a Principal Component Analysis (PCA) based approach by learning an edge details from database. Experiments have been carried out on both real multispectral (MS) data and MS data. This experiment is done with the usefulness for hyper spectral (HS) data as a future work.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
A Survey on Object Detection Methods in Visual Sensor Networks ijassn
Object detection is one of the major challenges in visual sensor networks (VSNs) which is set up in the
monitoring applications. Many approaches proposed to solve the object detection problem in VSNs,
considering diverse metrics such as reliability, energy consumption, detection accuracy and being realtime.
In this paper, a survey on the object detection methods in visual sensor networks is presented for the
first time. Furthermore, this paper classified the methods precisely. Two main object detection categories
in VSNs that explored in this paper are conventional object detection methods and object detection
approaches with the camera nodes involvement. To be more precise, presented survey promotes an
overview of recent object detection methods' literature with their performance evaluation. Also, this
research is challenging and the object detection issue in the visual sensor networks is open caused by
differences in estimations and performance metrics. Therefore, the survey concludes with open research
challenges.
Handling ambiguities and unknown words in named entity recognition using anap...ijcsa
Anaphora Resolution is a method of determining what a particular noun phrase or pronoun at a given instance refers to. In this paper, we have discussed how Anaphora Resolution is useful in performing computation linguistic task in various Natural languages including the Indian languages. Also, we have discussed how Anaphora Resolution is conducive in handling unknown words in Named Entity Recognition
We show some of the benefits and results of developing a (software) product development environment for teams called FreeNest. It is based on Open Source Software, Open Content, Open Access, and Lean Learning. The presentation was given during the Open Knowledge roadshow in Jyväskylä, November 2013.
Quickscan brancheorganisaties en verenigingenHowardsHome
HowardsHome heeft een scan uitgevoerd onder een aselecte groep van 30 brancheorganisaties uit verschillende sectoren.
Welke content gebruiken branche-organisaties op hun websites en social media om nieuwe leden te werven en binding te houden met hun bestaande leden?
Gaat men online de conversatie aan en op welke punten proberen ze hun publiek te verleiden tot lidmaatschap?
Guía de buenas prácticas sobre personas con discapacidad.José María
Los medios de comunicación deben utilizar un lenguaje apropiado e inclusivo cuando informan acerca de las personas con discapacidad. Su labor en fundamental para lograr una sociedad más abierta y equitativa.
A new approach for area coverage problem in wireless sensor networks with hyb...ijmnct
One of the most important and basic problems in Wireless Sensor Networks (WSNs) is the coverage
problem. The coverage problem in WSNs causes the security environments is supervised by the existing
sensors in the networks suitably. The importance of coverage in WSNs is so important that is one of the
quality of service parameters. If the sensors do not suitably cover the physical environments they will not
be enough efficient n supervision and controlling. The coverage in WSNs must be in a way that the energy
of the sensors would be the least to increase the lifetime of the network. The other reasons which had
increase the importance of the problem are the topologic changes of the network which are done by the
damage or deletion of some of the sensors and in some cases the network must not lose its coverage. SO, in
this paper we have hybrid the Particle Swarm Optimization (PSO) and Differential Evolution (DE)
algorithms which are the Meta-Heuristic algorithms and have analyzed the area coverage problem in
WSNs. Also a PSO algorithm is implemented to compare the efficiency of the hybrid model in the same
situation. The results of the experiments show that the hybrid algorithm has made more increase in the
lifetime of the network and more optimized use of the energy of the sensors by optimizing the coverage of
the sensors in comparison to PSO.
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
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.
Increasing the Network life Time by Simulated Annealing Algorithm in WSN wit...ijasuc
Since we are not able to replace the battery in a wireless sensor networks (WSNs), the issues
of energy and lifetime are the most important parameters. In asymmetrical networks, different sensors
with various abilities are used. Super nodes, with higher power and wider range of communication in
comparison with common sensors, are used to cause connectivity and transmit data to base stations in
these networks. It is crucial to select the parameters of fit function and monitoring sensors optimally in a
point covering network. In this paper, we utilized an algorithm to select monitoring sensors. The
selection is done by using a novel algorithm that used by simulated annealing. This selection takes
remained energy into consideration. This method increases lifetime, decreases and balances energy
consumption as confirmed by simulation results.
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...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...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.
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.
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...Editor IJCATR
In this paper, we explored the possibility of using Genetic Algorithm (GA) being used in Wireless Sensor Networks in general with
specific emphasize on Fault tolerance. In Wireless sensor networks, usually sensor and sink nodes are separated by long communication
distance and hence to optimize the energy, we are using clustering approach. Here we are employing improved K-means clustering algorithm to
form the cluster and GA to find optimal use of sensor nodes and recover from fault as quickly as possible so that target detection won’t be
disrupted. This technique is simulated using Matlab software to check energy consumption and lifetime of the network. Based on the
simulation results, we concluded that this model shows significant improvement in energy consumption rate and network lifetime than other
method such as Traditional clustering or Simulated Annealing
Basic Video-Surveillance with Low Computational and Power Requirements Using ...uberticcd
V. Caglioti, A. Giusti: "Basic Video-Surveillance with Low Computational and Power Requirements Using Long-Exposure Frames".
Proc. of Advanced Concepts for Intelligent Vision Systems (ACIVS) 2008.
Sensors Scheduling in Wireless Sensor Networks: An Assessmentijtsrd
The wireless sensor networks WSN is a combination of a large number of low power, short lived, unreliable sensors. The main challenge of wireless sensor network is to obtain long system lifetime. Many node scheduling algorithms are used to solve this problem. This method can be divided into the following two major categories first is round based node scheduling and second is group based node scheduling. In this paper many node scheduling algorithm like one phase decomposition model, Tree Based distributed wake up scheduling and Clique based node scheduling Algorithm are analyzed. Manju Ghorse | Dr. Avinash Sharma "Sensors Scheduling in Wireless Sensor Networks: An Assessment" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-1 , December 2019, URL: https://www.ijtsrd.com/papers/ijtsrd29560.pdfPaper URL: https://www.ijtsrd.com/computer-science/computer-network/29560/sensors-scheduling-in-wireless-sensor-networks-an-assessment/manju-ghorse
A MULTI-PATH ROUTING DETERMINATION METHOD FOR IMPROVING THE ENERGY EFFICIENCY...ijwmn
A selective forwarding attack in mobile wireless sensor networks is an attack that selectively drops or delivers event packets as the compromised node moves. In such an attack, it is difficult to detect the compromised node compared with the selective forwarding attack occurring in the wireless sensor network
because all sensor nodes move. In order to detect selective forwarding attacks in mobile wireless sensor networks, a fog computing-based system for a selective forwarding detection scheme has been proposed. However, since the proposed detection scheme uses a single path, the energy consumption of the sensor node for route discovery when the sensor node moves is large. To solve this problem, this paper uses fuzzy
logic to determine the number of multi-paths needed to improve the energy efficiency of sensor networks. Experimental results show that the energy efficiency of the sensor network is improved by 9.5737% compared with that of the existing scheme after 200 seconds when using the proposed scheme
WSN nodes power consumption using multihop routing protocol for illegal cutti...TELKOMNIKA JOURNAL
The need for an automation system from a remote area cannot be separated from the role of the wireless sensor network. However, the battery consumption is still a problem that influences the lifetime of the system. This research focused on studying how to characterize the power consumption on each sensor node using multihop routing protocol in the illegal logging field, to get the prediction lifetime of the network. The system is designed by using six sensor nodes in a master-slave connection and implemented in a tree topology. Each sensor node is consisting of a sound sensor, vibration sensor, Xbee communication, current and voltage sensor, and Arduino nano. The system is tested using battery 10050 mAH with several scenarios to have calculated how long the battery lifetime can be predicted. The results stated that the master node on the network depleted the power of the battery faster than the slave node since the more slaves connected to the master, the more energy the battery consumes.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Similar to Energy efficient sensor selection in visual sensor networks based on multi objective optimization (20)
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
Energy efficient sensor selection in visual sensor networks based on multi objective optimization
1. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
ENERGY EFFICIENT SENSOR SELECTION IN VISUAL
SENSOR NETWORKS BASED ON MULTI-OBJECTIVE
OPTIMIZATION
Ehsan Saradar Torshizi1 and Erfan Shokrollahi Ghahremanlu2
Department of Computer Engineering, Urmia University, Urmia, Iran
ABSTRACT
In this paper, we investigate the problem of visual coverage in visual sensor networks (VSNs). It is required
to select a subset of sensor nodes to provide a visual coverage over the monitoring region at each point of
time. In contrast with the pervious works which considered only single metric for sensor selection method,
in this study we assumed the sensor selection as multi-criteria problem. For the purpose of maximizing the
network lifetime, we consider three metrics a) visual coverage ratio, i.e., percentage of monitoring region
which is fully covered by camera sensors, b) number of selected sensors, i.e., number of active sensors for
covering the desired region, and c) overlapping coverage ratio, i.e., percentage of monitoring region which
is covered by more than one camera sensor. Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is
used to solve the problem. Besides, impact of steady state selection and generational selection method is
studied on the network lifetime. Simulation results show the superiority of multi-objective optimization.
NSGA-II results not only longer network lifetime but also fewer number of active sensor and lower
overlapping ratio at each point of time.
KEYWORDS
Visual sensor network, coverage, multi-objective optimization, genetic algorithm, NSGA-II
1. INTRODUCTION
VSNs are a large number of cheap and small camera sensor nodes which are distributed over a
region to provide visual coverage. VSNs are also known as Wireless Camera Sensor Networks
(WCSNs). In contrast with wireless sensor networks (WSNs) which can only be used to collect
numerical data from the sensing area, VSNs are capable of providing images or video from the
monitoring region [1]. The most important applications of VSNs are area surveillance, tracking
and environmental monitoring. In fact, camera sensors can be deployed on a sensing area to
provide images or video from the monitoring environment. Each sensor node has limited energy
power and battery replacement is an inconvenient and expensive task and usually is not possible.
Thus, there is a huge interest to prolong the network lifetime.
The main difference between the VSNs and WSNs is the types of sensors which are used in each
one. WSNs composed of sensors which are used for temperature sensing, humidity monitoring
and etc. On the other hand, VSNs consist of wireless camera sensors which can bring visual data
from their monitoring environment [2]. The coverage is an important issue in the networks. In
VSNs, the sensing range of sensor nodes is replaced by the viewing volume of the camera called
field of view (FoV). All cameras are static and there is no pan, tilt and zoom (PTZ) possibility for
cameras. Cameras’ FoVs can overlap, so that same parts of sensing area would be monitored by
more than one camera sensor. Although overlap monitoring may increase the reliability but it
consumes more energy for both area monitoring and data transmission.
DOI:10.5121/ijcsa.2013.3505
37
2. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
Full coverage and partial coverage are two main types of coverage which can be discussed. In
fact, full and partial coverage could be considered in both WSNs [3,4] and VSNs [5]. Full
coverage is useful for applications where monitoring a target plane (monitoring area) completely
as much longer as possible is desired. Conversely, partial coverage can be used in applications
where network lifetime prolonging is more critical than providing full coverage or in applications
where the data provided by a subset of the target plane is satisfactory. In this paper surveillance of
a target plane with energy constrained camera sensors is considered. Our objective is to enhance
the area coverage using minimum number of camera sensors in order to achieve maximum
coverage with minimum overlapping at each time step.
The NP-completeness of sensor selection for coverage in VSNs and WSNs proved in [6,7].
Therefore, an evolutionary multi-objective optimization algorithm is employed to select the best
subset of sensors at each point of time. In fact, multi-objective optimization used to achieve
maximum coverage with minimum overlapping and minimum number of sensors. The rest of this
paper is organized as follows: A brief overview of the state-of-the-art in visual coverage in VSNs
is given is given in section 2. In Section 3, we gave a problem definition and statement in detail.
Proposed method is presented in section 4. Performance evaluation and simulation results are
shown in section 5. In section 6, the paper ends with a concluding epilogue along with a hint on
future works conceivable in this area.
2. RELATED WORKS
Camera selection techniques are used when camera deployment is redundant. In such cases, by
using camera selection methods, the visual network can prevent redundant monitoring of
overlapped areas. There are many quality metrics which are employed in the evaluation of a
sensor selection method, such as the energy-efficiency or the quality of the gathered image data.
In fact, camera selection strategy depends on the application [8]. Surveillance and monitoring of
large areas such as parking lots, public areas and large stores, require complete coverage of the
area at each point of time. Dagher et al.[9] proposed an efficient strategy for monitoring parts of
the desired region with cameras sensors while the battery lifetime of the camera nodes are
maximized. The optimal fractions of regions covered by every camera are found in a centralized
way at the base station. JPEG2000 [10] encoding used at the cameras to encode the allocated
region such that the cost per bit transmission is reduced. However, energy efficiency is the only
metrics used in [9], while in this study coverage ratio, energy efficiency, minimum overlapping
are assumed as the efficiency metrics.
In [11], the authors investigated on distributed power management of camera nodes based on
coordinated node wake-ups in order to reduce the energy consumption of camera sensors. They
used a coordinated distributed power management (CDPM) policy which includes dynamic and
adaptive timeout thresholds, two-hop broadcast information dissemination and remote wakeup. In
fact, they assumed that each camera node is awake for a certain period of time. After a while each
camera node decides whether it should enter the low-power state based on the timeout statuses of
its neighbouring nodes. Similarly, camera nodes can decide whether to enter the low-power state
according to their neighbour’s votes. However, their proposed method cannot be applied to the
application with large area monitoring environments. The most relevant study is that of [12]
where camera sensor nodes are used for an airspace surveillance applications. They used
heuristics and evolutionary methods to select a subset of sensors which brings maximum
coverage with minimum number of sensor nodes. Actually, in the evolutionary methods coverage
maximization and minimizing the number of sensor selection are not solved simultaneously.
Besides, minimizing the overlapped coverage is not considered in their methods.
38
3. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
Soro and Heinzelman [5] investigated on two different camera selection strategies for prolonging
the network lifetime. One scheme selects cameras that minimize the difference between captured
images and the other scheme is based on choosing a VN by considering the energy constraints
and the three-dimensional coverage. In [13] camera selection is performed based on the user
defined applications. For each type of application, minimum number of cameras sensors is
selected to satisfy the desired coverage. Similarly in [14] camera selection, frame rate and
resolution assignment is performed based on the user defined QoS. However, most of camera
sensor nodes have simple cameras which cannot be adjusted with different resolution and frame
rates. In [15] problem is formulated as convex optimization problem. Using the lagrangian
duality, the problem solved in distributed environment. However, the convergence of their
optimization happens very slowly and consumes a lot of energy for transmitting the lagrangian
variables between sensor nodes. In [16] authors investigated on collaboration routing and camera
selection for removing the overlapping coverage. They formulated the problem as convex
optimization. However, the assumed that each camera sensor node can select a part of camera
field of view which is not always possible.
3. PROBLEM STATEMENT
In this paper we assumed camera sensors which scattered randomly in visual sensor nodes plane
and employed for monitoring a parallel plane called target plane. Figure 1 shows an example of
this situation for monitoring the floor by camera sensors mounted on the ceiling and directed
toward the floor[17]. Another example of this scenario is airspace surveillance through a
terrestrial VSN with randomly distributed camera sensors on the ground[12]. The same
assumption is made in [13,18,19,20,21].
Figure 1. Visual coverage model
Our goal is to prolong the monitoring of the target plane as much as possible. We believe that
monitoring the target plane with minimum number of camera sensors and minimum amount of
overlapping would increase the network lifetime. The visual coverage of a camera sensor is
defined as a set of points which lies in the intersection of a camera’s FoV and the target plane.
Let shows an arbitrary set of sensors, then
can be defined as visual coverage of on the
target plane. Let show the set of alive of sensors at each time step and
shows the set of alive
sensors at the system initialization. Obviously,
) is the maximum achievable visual coverage
and
) is the maximum achievable visual coverage at each point of time. We assumed that full
visual coverage is achievable at the system startup.
39
4. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
As result, full visual coverage lifetime can be defined as period of time where
). In
other words, full visual coverage lifetime is the duration of time that complete coverage of target
plane is achievable by the selected sensors. Although maximizing the full visual coverage is the
ultimate goal of surveillance cases, but after a while, by the death of some sensors, full visual
coverage is not achievable. Meanwhile there exist a lot of visual sensors which can bring partial
visual coverage. Accordingly, partial visual coverage can be defined as period of time where
and
while full coverage cannot be achieved any more. In
other words, after a while, when full visual coverage cannot be achieved, the task is degraded to
achieve of maximum achievable coverage. Meanwhile, the partial visual coverage solution
should be able to monitor at least 50% of target plane at each point of time. Maximizing the full
visual coverage lifetime is the first priority of our problem. However, when full visual coverage is
not achievable, of maximum achievable coverage is acceptable.
4. PROPOSED APPROACH
Visual coverage problem is a multi-criteria problem in which coverage ratio, number of selected
sensor and overlapped coverage ratio affects the network lifetime. Increasing the visual coverage
ratio causes more working sensor and reducing the working sensors will lead to a lower coverage
ratio. Meanwhile, visual overlapped coverage ratio is affected by number of selected sensors and
coverage ratio. Obviously, these three metrics need to be considered simultaneously. Using the
multi-objective optimization technics leads to solve multi-criteria problem and results the
optimum answer. So, we assumed a three criteria problem where shows the total amount of
coverage ratio, shows the number of selected sensors and shows the total amount of
overlapped coverage ratio. In that case, the multi objective optimization can be formulated as
follows:
(1)
Where is the feasible set of decision vectors. Obviously minimizing
leads to maximize
. Therefore, the problem can be modeled as multi-objective minimization problem. In
multi-objective optimization, usually there no exists a feasible solution that minimizes all
objective functions simultaneously. Therefore, attention is paid to Pareto optimal solutions, i.e.,
solutions that cannot be improved in any of the objectives without impairment in at least one of
the other objectives. In mathematical terms, for a multi-criteria problem with
objectives
(
), a feasible solution
is said to dominate another solution
strongly iff:
(2)
In the same way, a feasible solution
iff:
is said to dominate another solution
weakly
(3)
(4)
40
5. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
An example of non-dominated sorting for a two objective problem is illustrated in Figure 2. As it
can be seen,
dominates , and .
dominates
and .
dominates .
A solution called Pareto optimal if there does not exist another solution that dominates it. The set
of Pareto optimal outcomes is often called the Pareto front.
Figure 2. Non-dominated sorting
4.1. NSGA-II
There are several well-known MOGA such as [22-24]. NSGA-II [24] (elitism non-dominated
sorting genetic algorithm) is one of the most popular algorithms proposed as an improvement of
NSGA [23]. In this paper, we present an approach based on NSGAII to find Pareto optimal
solutions for visual coverage problem in VSNs. In fact, the goal of NSGA-II is to find the nondominated fronts using genetic algorithm approach. The overall complexity of the algorithm is
, where M is the number of objectives and N is the population size. The
whole operation of NSGA-II approach is shown in Figure 3.
Algorithm 1(NSGA-II algorithm)
Input: Given number of population size N, recombination probability
probability
and
mutation
Output: The non-dominated front solution
01 Generate
at random
02 Set t=0
03 While termination criteria has not been reached {
04 Generate offspring population
from
by performing recombination and
mutation according to and
and save them in
05 Set
06 Set
41
6. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
07 While
{
08 Set
09 Set
10 }
11 Sort
according to the crowding distance
12 Set
13 Set
14 }
15 Return
Figure 3. NSGA-II pseudo code
In the above pseudo code, the initial population is generated randomly. In line 04, at each
iteration a new child population is generated. In fact, based on the selection scheme, there exist
two main types of GAs: generational and steady-state. In the generational model, after creating
new population of individuals from an old population, both new and the old ones would be
selected for next generation (
. On the other hand, a steady-state GA creates
typically only one new member which is tested to be inserted in the population at each step of the
algorithm. In this paper we study both generational and steady-state models which are shown by
and
respectively. In line 05, the non-dominated sorting, tries to
divide into
while for each and
, the following conditions should be
satisfied:
1- dominated by
2-
dominates
In other word, for all
there should not exist
that dominates x and meanwhile for all
there should be at least one
that dominates y. After sorting the population, elitist
sets are selected for the next population. When the size of elitist set
is found to be more than
population size, subset of gens in needs to be selected according to their crowding distance.
In fact, crowding distance is used to get an estimate of the density of solutions surrounding a
particular solution in the population. Crowding distance is calculated by first sorting the set of
solutions in ascending objective function values. The crowding distance value of a particular
solution is the average distance of its two neighboring solutions. The boundary solutions which
have the lowest and highest objective function values are given an infinite crowding distance
values so that they are always selected. This process is done for each objective function. The final
crowding distance value of a solution is computed by adding the entire individual crowding
distance values in each objective function. However, this procedure would be repeated until the
convergence of the optimum solution. Using the above method, we can find out the optimum set
of sensors which has the maximum coverage, minimum number of sensors and minimum
overlapping coverage. Using a discrete genetic representation, each chromosome shows whether a
sensor is selected or not.
42
7. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
The output of the above method would be a non-dominated front solution which represents N
various solution for a problem. Each solution has different values of
and . Since the
coverage is the most important criteria, we choose a sub set of solutions which satisfies the
coverage requirement. Among the chosen subset, another subset of solution will be selected
which has minimum number of active sensors and after that, among the selected ones, a solution
would be selected which has the minimum amount of overlapping coverage. Using the mentioned
approach, a solution would be achieved that can satisfy coverage requirement by minimum
number of sensor nodes while the overlapped coverage is minimized. The selected set of sensors
would be used until at least one of the sensors dies and the visual coverage requirement cannot be
satisfied. After that, another set of sensors would be selected based on the NSGA-II. This
procedure continues until the solution of NSGA-II cannot satisfy the coverage requirement.By
knowing the sensors locations, their camera FoV and their initial energy, the problem can be
solved in an off-line phase in the sink node.
5. SIMULATION RESULTS
In this section, we evaluate the performance of proposed approach by solving both
and
algorithms for visual coverage problem. Furthermore, to demonstrate
the superiority of our methods, we compare it with GA heuristic introduced by [12] for different
scenarios. In fact, in [12] authors proposed different heuristics and evolutionary approaches to
solve the visual coverage problem. Their simulation results showed that a GA based heuristic can
solve the problem in an efficient manner which results a trade of between coverage ratio, number
of active sensors and overlapping. However, we believe that optimizing these three metric
simultaneously would result a better solution for the problem.
A stationary network assumed while 50 camera sensors are deployed randomly in a 100m×100m
plane for monitoring a 100m×100m target plane. The initial energy of each camera sensor
selected randomly between [100,200]. Each scenario plotted on the figure is the average of 100
randomly generated networks. For partial coverage =0.93 (i.e. at each point of time
). OMNET++ [25] is used for simulation of each scenario. Figure 4 shows the
coverage ratio of solutions achieve by using GA [12],
and
for
visual coverage problem. Even though the results are shown until the entire sensors die but the
comparisons are performed until at least 50% of coverage ratio could be achieved (based on the
partial coverage definition). Obviously, after a while, some sensors runs out of energy and full
coverage could not be achieved. The full visual coverage lifetime achieved by GA is about 100
seconds while
and
results 200 and 250 seconds respectively. After
a while, when a typical number of sensors run out of energy, the partial coverage could not be
achieved. GA can insure the partial coverage requirements for 400 seconds while
and
can insure the partial coverage requirements for 495 and 520 seconds
respectively. Figure 5 compares the number of selected sensors in solutions resulted by using
each method. It can be seen that both
and
select fewer number for
sensors in cooperation to GA. Because of that, it can be seen in Figure 3 that GA results lower
network lifetime for both full and partial visual coverage. In fact GA stops after finding a
chromosome which has the required coverage. As result, after full coverage cannot be achieved
by GA, it tries to select more sensors for the partial coverage.
43
8. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
Figure 4. Impact of sensor selection method on the network lifetime
Figure 5. Impact of the sensor selection schema on the number of active sensors at each point of time
Figure 6 compares the overlapped coverage ratio of solutions resulted by each method. In fact,
GA does not consider overlapping directly and tries to select minimum number of sensors for the
visual coverage. It can be seen that
and
result solutions with very
lower overlapping coverage in the network lifetime. Convergence speed is another important
parameter which affects on the efficiency. We used improvement ratio as convergence metric. In
fact, the improvement-ratio is the ratio of the number of previous population dominated by the
new members. Figure 7 shows that,
converges faster than
.
Obviously, GA convergence is very faster than
and
. The results
confirm that
results more accurate solutions but with slower convergence.
44
9. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
Figure 6. Overlapping coverage of different sensor selection schema
Figure 7. Impact of sensor selection method on the convergence speed
6. CONCLUSION
In this paper we studied on visual coverage using VSNs. Due to the restricted energy resource in
sensors nodes, at each point of time a subset of sensors should be selected to cover the desired
region. Since full coverage is not always possible, we investigate on both full and partial visual
coverage. Coverage ratio, number of selected sensors and overlapping ratio considered as
performance metrics for sensor selection approach. Based on that, we consider the coverage
problem as multi-criteria problem which solved by NSGA-II. Besides, impact of both
generational and steady-state selection schemas studied on the performance of NSGA-II.
Simulation results indicated that a multi-objective optimization can result a much better solution
in comparison to single-objective optimization. Moreover, simulation results showed that
generational selection results more accurate solution but converges slower than the steady state
selection method. We believe that by considering both routing and sensor selection, the impact of
multi-objective optimization would be more significant. In fact, by selecting camera sensors with
lower overlapping coverage, transmission energy consumption would be decreased and simpler
source coding technics could be used.
REFERENCES
[1] Ian F. Akyildiz, M.Tommaso, and R.Kaushik Chowdhury. "A survey on wireless multimedia sensor
networks." Computer networks, vol.4,pp. 921-960,2007.
45
10. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
[2] J.Yick,B.Mukherjee,and D.Ghosal."Wireless sensor network survey." Computer networks, vol12,pp:
2292-2330, 2008.
[3] Y .Gu,Y.Ji,H.Chen, J.Li and B.Zhao. "Partial Target Coverage Problem in Surveillance Sensor
Networks." In Proc 2010 Wireless Communications and Networking Conference.
[4] A.Gallais "Localized sensor area coverage with low communication overhead." IEEE Trans.Mobile
Computing vol.7,pp 661-672,2008.
[5] S,Soro, and H.Wendi. "Camera selection in visual sensor networks." In Proc 2007 Advanced Video
and Signal Based Surveillance
[6] Y.Li, Hu.Xiao-min, Z.Jun. "A new genetic algorithm for the SET k-cover problem in wireless sensor
networks." In Proc 2009 Systems, Man and Cybernetics.
[7] C.Kandoth, S.Chellappan, ”Angular mobility assisted coverage in directional sensor networks. In
Network-Based Information Systems”, In Proc 2009 NBIS'09. International Conference on ,pp. 376379
[8] S,Soro, , and H.Wendi. "A survey of visual sensor networks." In Proc 2009 Advances in Multimedia
[9] J. C. Dagher, M. W. Marcellin, and M. A. Neifeld, “A method for coordinating the distributed
transmission of imagery,” IEEE Transactions on Image Processing, vol. 15, no. 7, pp. 1705– 1717,
2006
[10] Taubman, S.David, W.Michael, and M.Rabbani. "JPEG2000: Image compression fundamentals,
standards and practice." Journal of Electronic Imaging vol.2, pp: 286-287,2002.
[11] N. H. Zamora and R. Marculescu, “Coordinated distributed power management with video sensor
networks: analysis, simulation, and prototyping,” in Proceedings of the 1st ACM/IEEE International
Conference on Distributed Smart Cameras (ICDSC ’07), pp. 4–11, 2007.
[12] M.Houshmand, S.Soroushmehr, M. R., Khadivi, P., Samavi, S. and S.Shirani, “Visual sensor network
lifetime maximization by prioritized scheduling of nodes”. Journal of Network and Computer
Applications, 2012
[13] Yu, Chao, and S.Gaurav. "Camera scheduling and energy allocation for lifetime maximization in
user-centric visual sensor networks." IEEE Transactions on Image Processing, vol.8,pp: 20422055,2010
[14] Dieber, Bernhard, M.Christian, and R.Bernhard. "Resource-aware coverage and task assignment in
visual sensor networks." EEE Transactions on Circuits and Systems for Video Technology, vol.10,pp:
1424-1437, 2011.
[15] He, Yifeng, Ivan Lee, and Ling Guan. "Distributed algorithms for network lifetime maximization in
wireless visual sensor networks." IEEE Transactions on Circuits and Systems for Video Technology,
vol.5 pp: 704-718,2009
[16] S. M. Amiri, P. Nasiopoulos, and V. C. M. Leung. "Collaborative routing and camera selection for
visual wireless sensor networks." IET Communications, vol.17 pp: 2443-2450,2011
[17] Soro, Stanislava, and W. B. Heinzelman. "On the coverage problem in video-based wireless sensor
networks." In Proc 2005. 2nd International Conference on Broadband Networks.
[18] Yu, Chao, and S.Gaurav. "Camera scheduling and energy allocation for lifetime maximization in
user-centric visual sensor networks." IEEE Transactions on Image Processing, vol.8,pp: 20422055,2010
[19] S.Ye, Lin.Yaping Lin, and R. Li. "Energy-aware interleaving for robust image transmission over
visual sensor networks." IET Wireless Sensor Systems, vol.4 pp: 267-274,2011
[20] Y.Charfi, , W.Naoki and M.Masayuki. "Challenging issues in visual sensor networks." IEEE Wireless
Communications, vol.2, pp: 44-49. 2009
[21] Yu, Chao, and S.Gaurav. "Optimized energy allocation in battery powered image sensor networks."
Image Processing (ICIP), 2009 16th IEEE International Conference on. IEEE
[22] Fonseca, M.Carlos, and J.Peter. "Genetic algorithms for multiobjective optimization: Formulation,
discussion and generalization." Proceedings of the fifth international conference on genetic
algorithms. Vol. 1. 1993.
[23] Srinivas, Nidamarthi, and Deb.Kalyanmoy "Muiltiobjective optimization using nondominated sorting
in genetic algorithms." Evolutionary computation ,vol.3 pp: 221-248,1994.
[24] K.Deb, S.Agrawal, A.Pratap and T.Meyarivan " A fast elitist non-dominated sorting genetic algorithm
for multi-objective optimization: NSGA-II". Lecture notes in computer science, 1917, 849-858.
[25] www.omnetpp.org
46