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
Energy efficient approach based on evolutionary algorithm for coverage contro...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORKijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Network Lifetime Enhancement by Node Deployment in WSNIJTET Journal
Abstract— The key challenge in wireless sensor network is network lifetime so it is necessary to increase the network lifetime. The work deals with the enhancement of the network lifetime for target coverage problem in wireless sensor network while deploying the sensor nodes. Initially sensor nodes and targets are placed randomly, where the targets are the not sensor nodes its external parameter. Network lifetime for this scenario is computed, where the sensing range and initial energy of the battery are assumed. Network lifetime is based on sensor nodes that monitor the targets and lifetime of battery. The randomly placed sensor nodes are redeployed using optimization algorithm called Artificial Bee Colony (ABC). The network lifetime for redeployed sensor nodes are computed and compared with randomly deployed sensor nodes.
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.
High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage Problemijasuc
Target coverage problem in wireless sensor networks is concerned with maximizing the lifetime of the
network while continuously monitoring a set of targets. A sensor covers targets which are within the
sensing range. For a set of sensors and a set of targets, the sensor-target coverage relationship is
assumed to be known. A sensor cover is a set of sensors that covers all the targets. The target coverage
problem is to determine a set of sensor covers with maximum aggregated lifetime while constraining the
life of each sensor by its initial battery life. The problem is proved to be NP-complete and heuristic
algorithms to solve this problem are proposed. In the present study, we give a unified interpretation of
earlier algorithms and propose a new and efficient algorithm. We show that all known algorithms are
based on a common reasoning though they seem to be derived from different algorithmic paradigms. We
also show that though some algorithms guarantee bound on the quality of the solution, this bound is not
meaningful and not practical too. Our interpretation provides a better insight to the solution techniques.
We propose a new greedy heuristic which prioritizes sensors on residual battery life. We show
empirically that the proposed algorithm outperforms all other heuristics in terms of quality of solution.
Our experimental study over a large set of randomly generated problem instances also reveals that a very
naïve greedy approach yields solutions which is reasonably (appx. 10%) close to the actual optimal
solutions.
Energy efficient approach based on evolutionary algorithm for coverage contro...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORKijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Network Lifetime Enhancement by Node Deployment in WSNIJTET Journal
Abstract— The key challenge in wireless sensor network is network lifetime so it is necessary to increase the network lifetime. The work deals with the enhancement of the network lifetime for target coverage problem in wireless sensor network while deploying the sensor nodes. Initially sensor nodes and targets are placed randomly, where the targets are the not sensor nodes its external parameter. Network lifetime for this scenario is computed, where the sensing range and initial energy of the battery are assumed. Network lifetime is based on sensor nodes that monitor the targets and lifetime of battery. The randomly placed sensor nodes are redeployed using optimization algorithm called Artificial Bee Colony (ABC). The network lifetime for redeployed sensor nodes are computed and compared with randomly deployed sensor nodes.
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.
High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage Problemijasuc
Target coverage problem in wireless sensor networks is concerned with maximizing the lifetime of the
network while continuously monitoring a set of targets. A sensor covers targets which are within the
sensing range. For a set of sensors and a set of targets, the sensor-target coverage relationship is
assumed to be known. A sensor cover is a set of sensors that covers all the targets. The target coverage
problem is to determine a set of sensor covers with maximum aggregated lifetime while constraining the
life of each sensor by its initial battery life. The problem is proved to be NP-complete and heuristic
algorithms to solve this problem are proposed. In the present study, we give a unified interpretation of
earlier algorithms and propose a new and efficient algorithm. We show that all known algorithms are
based on a common reasoning though they seem to be derived from different algorithmic paradigms. We
also show that though some algorithms guarantee bound on the quality of the solution, this bound is not
meaningful and not practical too. Our interpretation provides a better insight to the solution techniques.
We propose a new greedy heuristic which prioritizes sensors on residual battery life. We show
empirically that the proposed algorithm outperforms all other heuristics in terms of quality of solution.
Our experimental study over a large set of randomly generated problem instances also reveals that a very
naïve greedy approach yields solutions which is reasonably (appx. 10%) close to the actual optimal
solutions.
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.
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.
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
Energy efficient node deployment for target coverage in wireless sensor networkGaurang Rathod
Network lifetime plays an integral role in setting up an efficient wireless sensor network. Coverage in a network needs to guarantee that the region is monitored with the required degree of reliability. Locations of sensor nodes constitute the basic input for the algorithms that examine coverage of the network. Coverage problems can be broadly classified as area coverage problem and target coverage problem. Area coverage focuses on monitoring the entire region of interest, whereas target coverage concerns monitoring only certain specific points in a given region. Target coverage can be categorized as simple coverage, k-coverage and Q-coverage.
Lower coverage level (simple coverage) is enough for environmental or habitat monitoring or applications like home security. Higher degree of coverage (k-coverage) will be required for some applications like target tracking to track the targets accurately, or if sensors work in a hostile environment such as battle fields or chemically polluted areas. More reliable results are produced for higher degree of coverage which requires multiple sensor nodes to monitor the region/targets. An example of Q-coverage is video surveillance systems deployed for monitoring hostile territorial area where some sensitive targets like a nuclear plant may need more sensors cooperate to ensure source redundancy for precise data. Sensor nodes deterministically deployed by using artificial bee colony algorithm, so as to achieve the required target coverage level and maximize the network lifetime.
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.
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...ijsrd.com
In Wireless Sensor Network (WSNs), gather the data by using mobile sinks has become popular. Reduce the number of messages which is used for sink location broadcasting, efficient energy data forwarding, become accustomed to unknown earthly changes are achieved by a protocol which is projected by a SinkTrail. The forecast of mobile sinks’ location are done by using logical coordinate system. When sensor nodes don’t have any data to send, at that time they switch to sleep mode to save the energy and to increase the network lifetime. And due to this reason there is a chance of the involvement of nodes that are in sleeping state between the path sources to the mobile sink which is selected by the SinkTrail protocol. Before become the fully functional and process the information, these sleeping nodes can drop the some information. Due to this reason, it is vital to wake-up the sleeping nodes on the path earlier than the sender can start transferring of sensed data. In this paper, on-demand wake-up scheduling algorithm is projected which is used to activates sleeping node on the path before data delivery. Here, in this work the multi-hop communication in WSN also considers. By incorporating wake-up scheduling algorithm to perk up the dependability and improve the performance of on-demand data forwarding extends the SinkTrail solution in our work. This projected algorithm improves the quality of service of the network by dishonesty of data or reducing the loss due to sleeping nodes. The efficiency and the effectiveness projected solution are proved by the evaluation results.
Wireless Sensor Networks are highly distributed self-organized systems. WSN have been deployed in various fields. Now a day, Topology issues have received more and more attentions in Wireless Sensor Networks (WSN). While WSN applications are normally optimized by the given underlying network topology, another trend is to optimize WSN by means of topology control. In this area, a number of approaches have been invested, like network connectivity based topology control, cooperating schemes, topology directed routing, sensor coverage based topology control. Most of the schemes have proven to be able to provide a better network monitoring and communication performance with prolonged system lifetime. In this survey paper, I provide a full view of the studies in this area.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal,
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Spatial Correlation Based Medium Access Control Protocol Using DSR & AODV Rou...IOSR Journals
Abstract : In Wireless sensor network sensor nodes have a limited battery life and their efficient utilization is
a very much importent task. Their are many ways are proposed for efficient utilization of energy.For efficient
energy utilization many topologies,protocals are proposed by the help of which we can maximize the battery
life. In this paper we propesed a methode in which a correlation is made between all the sensor nodes including
ME(mobile element). A Vector Quantization methode are used for distance calculation between all the sensor
nodes and mobile element. After finding the corrélation we used the DSR & AODV routing Protocol. The
performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of
packet drop ratio and energy consumption. The simulation result shows that the proposed protocol with AODV
routing gives a batter result compared with same protocol with DSR routing.
Keywords: ME, DVT, DSR, AODV, Wireless Sensor Network, Efficient Energy Utilization
Analysis and Performance evaluation of Traditional and Hierarchal Sensor NetworkIJMER
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.
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.
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.
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
Energy efficient node deployment for target coverage in wireless sensor networkGaurang Rathod
Network lifetime plays an integral role in setting up an efficient wireless sensor network. Coverage in a network needs to guarantee that the region is monitored with the required degree of reliability. Locations of sensor nodes constitute the basic input for the algorithms that examine coverage of the network. Coverage problems can be broadly classified as area coverage problem and target coverage problem. Area coverage focuses on monitoring the entire region of interest, whereas target coverage concerns monitoring only certain specific points in a given region. Target coverage can be categorized as simple coverage, k-coverage and Q-coverage.
Lower coverage level (simple coverage) is enough for environmental or habitat monitoring or applications like home security. Higher degree of coverage (k-coverage) will be required for some applications like target tracking to track the targets accurately, or if sensors work in a hostile environment such as battle fields or chemically polluted areas. More reliable results are produced for higher degree of coverage which requires multiple sensor nodes to monitor the region/targets. An example of Q-coverage is video surveillance systems deployed for monitoring hostile territorial area where some sensitive targets like a nuclear plant may need more sensors cooperate to ensure source redundancy for precise data. Sensor nodes deterministically deployed by using artificial bee colony algorithm, so as to achieve the required target coverage level and maximize the network lifetime.
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.
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...ijsrd.com
In Wireless Sensor Network (WSNs), gather the data by using mobile sinks has become popular. Reduce the number of messages which is used for sink location broadcasting, efficient energy data forwarding, become accustomed to unknown earthly changes are achieved by a protocol which is projected by a SinkTrail. The forecast of mobile sinks’ location are done by using logical coordinate system. When sensor nodes don’t have any data to send, at that time they switch to sleep mode to save the energy and to increase the network lifetime. And due to this reason there is a chance of the involvement of nodes that are in sleeping state between the path sources to the mobile sink which is selected by the SinkTrail protocol. Before become the fully functional and process the information, these sleeping nodes can drop the some information. Due to this reason, it is vital to wake-up the sleeping nodes on the path earlier than the sender can start transferring of sensed data. In this paper, on-demand wake-up scheduling algorithm is projected which is used to activates sleeping node on the path before data delivery. Here, in this work the multi-hop communication in WSN also considers. By incorporating wake-up scheduling algorithm to perk up the dependability and improve the performance of on-demand data forwarding extends the SinkTrail solution in our work. This projected algorithm improves the quality of service of the network by dishonesty of data or reducing the loss due to sleeping nodes. The efficiency and the effectiveness projected solution are proved by the evaluation results.
Wireless Sensor Networks are highly distributed self-organized systems. WSN have been deployed in various fields. Now a day, Topology issues have received more and more attentions in Wireless Sensor Networks (WSN). While WSN applications are normally optimized by the given underlying network topology, another trend is to optimize WSN by means of topology control. In this area, a number of approaches have been invested, like network connectivity based topology control, cooperating schemes, topology directed routing, sensor coverage based topology control. Most of the schemes have proven to be able to provide a better network monitoring and communication performance with prolonged system lifetime. In this survey paper, I provide a full view of the studies in this area.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal,
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Spatial Correlation Based Medium Access Control Protocol Using DSR & AODV Rou...IOSR Journals
Abstract : In Wireless sensor network sensor nodes have a limited battery life and their efficient utilization is
a very much importent task. Their are many ways are proposed for efficient utilization of energy.For efficient
energy utilization many topologies,protocals are proposed by the help of which we can maximize the battery
life. In this paper we propesed a methode in which a correlation is made between all the sensor nodes including
ME(mobile element). A Vector Quantization methode are used for distance calculation between all the sensor
nodes and mobile element. After finding the corrélation we used the DSR & AODV routing Protocol. The
performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of
packet drop ratio and energy consumption. The simulation result shows that the proposed protocol with AODV
routing gives a batter result compared with same protocol with DSR routing.
Keywords: ME, DVT, DSR, AODV, Wireless Sensor Network, Efficient Energy Utilization
Analysis and Performance evaluation of Traditional and Hierarchal Sensor NetworkIJMER
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.
An Experimental Investigation of Capacity Utilization in Manufacturing Indus...IJMER
In the modern day competitive world, every organization demands an effective utilization of
capacity. Capacity Utilization means the maximum amount of output that can be produced in the short run of time. A lot of planning is necessary for the proper management of capacity. Capacity planning is one side of a coin and capacity management is the other. The capacity plans needs to be executed flawlessly, with unpleasant surprises avoided. A managerial problem is to match the capacity with the plans. Companies whether labour or machine intensive have a CI trend that remains fairly constant in
that particular sector. For example a company will have a monthly cumulative CI trend that could be compared with any other company trend within the same market. The present paper makes an attempt to study the most important parameter of the organization i.e capacity utilization of a company
Modified Procedure for Construction and Selection of Sampling Plans for Vari...IJMER
Linear Trend is Technique to generate the values for observerd frequency distribution and it
will give the accuracy of the smoothing obtained depends on the number of available data sets. In this
article ,an attempt was made to estimate the modified liner trend value generator for construction and
selection of sampling plans for variable inspection scheme indexed through the MAAOQ over the Liner
Trend .We compare the constructed sampling plans indexed through MAAOQ over Linear Trend with
the basic sampling plans indexed with AOQL. And also obtain the performance of the operating
characteristic curves.
Development of Nanocomposite from Epoxy/PDMS-Cyanate/Nanoclay for Materials w...IJMER
Dicyanate monomer viz bis-4-cyanato-polydimethylsiloxane(PDMS-CY) containing
siloxane known as thermally stable structural unit was prepared. The PDMS-CY/DGEBA-stability, thermal degradation kinetics and microstructures
Numerical Investigation of Multilayer Fractal FSSIJMER
Numerical investigations are presented for a multilayer frequency selective surface with Koch
fractal (levels 1 and 2) conducting patch elements. The structure investigated is obtained using two FSS
screens separated by an air gap layer. For the proposed investigation were used three different values an
air gap height. The results obtained using the numerical method were compared with other technique and
using the commercial software Ansoft DesignerTM. A good agreement was observed in terms of the
bandwidth.
Analysis of a Batch Arrival and Batch Service Queuing System with Multiple Va...IJMER
This paper concerns the queuing system MX
/G1, B/1, to which the customers are assumed
to arrive in batches of random size X according to a compound Poisson process and also are served in
batches. As soon as the system becomes empty, the server leaves for a vacation of random length V. If
no customers are available for service after returning from that vacation, the server keeps on taking
vacations till he finds at least one customer in the queue, then immediately begins to serve the
customers up to the service capacity B. If more than B customers are present when the server returns
from a vacation, the first B customers are taken into service. If fewer than B customers are present, all
waiting customers go into service. Late arrivals are not allowed to join the ongoing service. The steady
state behavior of this queuing system is derived by an analytic approach to study the queue size
distribution at a random point as well as a departure point of time under multiple vacation policy. It
may be noted that the results in [5] and [7] can be obtained as special cases from the results in this
paper.
Regression analysis of shot peening process for performance characteristics o...IJMER
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.
Experimental Investigation of the Residual Stress and calculate Average Fatig...IJMER
Shot peening procedures developed over the ago in substantial improvements of fatigue properties and Fatigue life. The use of shot peening on aluminium 7075-T6 plates to improve fatigue properties and improve resistance to stress on the corrosion cracking with help of glass beads and various peening methods. When these components subsequently are loaded in tension or bending to a
stress level in the range below the required for yield, the actual tensile stress at the surface is lower than
that calculated on the basis of load and cross sectional area. Fatigue are major problem which normally
start at or near the surface stressed in tension, thus processes that produce residual surface compressive
stresses in components usually enhance the resistance to fatigue. The impact of glass shots which create
resistance after the shot penning process carried out and also control the effects of failure on aluminium
alloys
Impact of Hybrid Pass-Transistor Logic (HPTL) on Power, Delay and Area in VL...IJMER
Abstract: Power reduction is a serious concern now days. As the MOS devices are wide spread, there is
high need for circuits which consume less power, mainly for portable devices which run on batteries, like
Laptops and hand-held computers. The Pass-Transistor Logic (PTL) is a better way to implement circuits
designed for low power applications.
ENERGY EFFICIENT APPROACH BASED ON EVOLUTIONARY ALGORITHM FOR COVERAGE CONTRO...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
International Journal of Computer Science, Engineering and Information Techno...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this paper, we address the problem of network coverage and connectivity and propose an energy efficient approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the sensor nodes can have different sensing ranges and transmission ranges .The proposed algorithm is simulated and it' efficiency
is demonstrated via different experiments.
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.
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
Application of Weighted Centroid Approach in Base Station Localization for Mi...IJMER
A Wireless Sensor Networks (WSNs) consisting of sensor with strategic locations, and a base-stations (BSs) whose locations are relatively flexible. A sensor cluster consists of many small sensor nodes (SNs) that capture, encode, and transmit relevant information from a designated area. This article is focused on the topology of positioning process for BSs in WSNs. Heterogeneous SNs are battery-powered and energy-constrained, their node lifetime directly affects the network lifetime of WSNs. We have proposed an algorithmic approach to locate BSs optimally such that we can maximize the topological network lifetime of WSNs deterministically, even when the initial energy provisioning for SNs is no longer always proportional to their average bit-stream rate. The obtained optimal BS locations are under different length of area field and number of nodes according to the mission criticality of WSNs. By studying energy consumption due to space loss and amplification losses in WSNs, we establish the upper and lower bounds of maximal topological parameters of area and number of nodes, which enable a quick assessment of energy provisioning feasibility and topology necessity. Numerical results and surface plot are given to demonstrate the efficiency and optimality of the proposed topology of BSs positioning approaches designed for maximizing network lifetime of WSNs.
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.
SINK RELOCATION FOR NETWORK LIFETIME ENHANCEMENT METHOD IN WSNEditor IJMTER
Recent advances in micro manufacturing technology have enabled the event of cheap, normal
power, unique functional detector nodes for the wireless communication. Sensing applications have
normal conjointly as a reality of result. These embrace environmental observation, intrusion detection,
battleground police work, and so on. In a very wireless detector network (WSN), the way the restricted
power resources of sensors to increase that to conserve the network lifespan of the WSN as long as double
whereas activity the sensing and detected knowledge news tasks, is that the most important issue within
the network style. In a WSN, detector nodes deliver detected knowledge back to the sink as multi hopping.
The detector nodes are very close to the sink can usually consume additional battery power than others;
consequently, these nodes will been drain out their battery energy quickly and short the network lifespan
of the WSN. Sink relocation have associate degree economical network lifespan extension methodology,
that could avoids an excessive amount of battery energy for a selected cluster of detector nodes. during
this paper, we have a tendency to propose a moving strategy known as energy-aware sink relocation
(EASR) for mobile sinks in WSN. These projected mechanism uses info associated with the residual
battery energy of detector nodes to be adaptively alter the transmission vary of detector nodes and
therefore the relocating theme to the sink. Some theoretical and numerical analyze area unit given to point
out that the EASR methodology will extend the network lifespan of the WSN considerably
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.
Multiagent based multipath routing in wireless sensor networksijwmn
This paper proposes a Multiagent Based Multipath Routing (MBMR) using a set of static and mobile agents
by employing localization technique. The operation of proposed routing technique can be briefly explained
as follows. (1) Anchor nodes are deployed evenly over the network environment. (2) Unknown sensor nodes
are deployed randomly over network environment and these nodes perform localization. (3) Source node
computes the shortest route to destination node through arbitrary midpoint node and intermediate nodes.
(4) Source node generates mobile agents for partial route discovery, which traverses to destination node
through the midpoint and intermediate nodes by carrying information. (5) Mobile agents update the
destination node with carried information. (6) Destination node computes route weight factor for all the
routes discovered by mobile agents. (7) Destination node computes the node disjoint routes and it selects
routes depending on the criticalness of event for communication. The performance of the proposed scheme
is evaluated in terms of performance parameters such as localization error, network lifetime, energy
consumption, cost factor, packet delivery ratio, and latency.
Messch protocol an energy efficient routing protocol for wsneSAT Journals
Abstract
The rapid development in the diversified sensor based devices with the communicating module through unguided media has led
the researchers to extend their research works in Wireless Sensor Network (WSN). The WSN contains large number of nodes that
can be deployed in an area to monitor and then the nodes send their sense data somehow to the base station or Sink Node. The
nodes run on button cell (3 volt) and are deployed in varied environments, so to maximize their operability and lifetime of the
whole WSN network; the routing is an important issue. In this paper I have developed and analysed Maximum Energy Selection
Static Clustering Hierarchy (MESSCH), Protocol architecture for WSN. The proposed protocol inherits the traits of an Energy
Efficient there by increasing the network lifetime and minimizing the latency of the network. MESSCH is an static clustering
hierarchy protocol where the cluster heads are rotated among the nodes in the respective cluster there by uniformly Expending
the Energy among all the nodes. The proposed MESSCH protocol is simulated in the MatLab and is analysed accordingly which
shows that the life time of the network increased compared to the LEACH protocol.
Keywords: Lifetime, Latency, Static Clustering Hierarchy Routing, Wireless Sensor Network
Scheduling different types of packets, such as
real-time and non-real-time data packets, at sensor nodes with
resource constraints in Wireless Sensor Networks (WSN) is of
vital importance to reduce sensors’ energy consumptions and endto-end
data transmission delays. Most of the existing packetscheduling
mechanisms of WSN use First Come First Served
(FCFS), non pre-emptive priority and pre-emptive priority
scheduling algorithms. These algorithms incur a high processing
overhead and long end-to-end data transmission delay due to the
FCFS concept, starvation of high priority real-time data packets
due to the transmission of a large data packet in non pre-emptive
priority scheduling, starvation of non-real-time data packets due
to the probable continuous arrival of real-time data in preemptive
priority scheduling, and improper allocation of data
packets to queues in multilevel queue scheduling algorithms.
Moreover, these algorithms are not dynamic to the changing
requirements of WSN applications since their scheduling policies
are predetermined.
In the Advanced Multilevel Priority packet scheduling
scheme, each node except those at the last level has three levels of
priority queues. According to the priority of the packet and
availability of the queue, node will schedule the packet for
transmission. Due to separated queue availability, packet
transmission delay is reduced. Due to reduction in packet
transmission delay, node can goes into sleep mode as soon as
possible. And Expired packets are deleted at the particular node
at itself before reaching the base station, so that processing
burden on the node is reduced. Thus, energy of the node is saved.
Issues in optimizing the performance of wireless sensor networkseSAT 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
A Study on Translucent Concrete Product and Its Properties by Using Optical F...IJMER
- Translucent concrete is a concrete based material with light-transferring properties,
obtained due to embedded light optical elements like Optical fibers used in concrete. Light is conducted
through the concrete from one end to the other. This results into a certain light pattern on the other
surface, depending on the fiber structure. Optical fibers transmit light so effectively that there is
virtually no loss of light conducted through the fibers. This paper deals with the modeling of such
translucent or transparent concrete blocks and panel and their usage and also the advantages it brings
in the field. The main purpose is to use sunlight as a light source to reduce the power consumption of
illumination and to use the optical fiber to sense the stress of structures and also use this concrete as an
architectural purpose of the building
Developing Cost Effective Automation for Cotton Seed DelintingIJMER
A low cost automation system for removal of lint from cottonseed is to be designed and
developed. The setup consists of stainless steel drum with stirrer in which cottonseeds having lint is mixed
with concentrated sulphuric acid. So lint will get burn. This lint free cottonseed treated with lime water to
neutralize acidic nature. After water washing this cottonseeds are used for agriculter purpose
Study & Testing Of Bio-Composite Material Based On Munja FibreIJMER
The incorporation of natural fibres such as munja fiber composites has gained
increasing applications both in many areas of Engineering and Technology. The aim of this study is to
evaluate mechanical properties such as flexural and tensile properties of reinforced epoxy composites.
This is mainly due to their applicable benefits as they are light weight and offer low cost compared to
synthetic fibre composites. Munja fibres recently have been a substitute material in many weight-critical
applications in areas such as aerospace, automotive and other high demanding industrial sectors. In
this study, natural munja fibre composites and munja/fibreglass hybrid composites were fabricated by a
combination of hand lay-up and cold-press methods. A new variety in munja fibre is the present work
the main aim of the work is to extract the neat fibre and is characterized for its flexural characteristics.
The composites are fabricated by reinforcing untreated and treated fibre and are tested for their
mechanical, properties strictly as per ASTM procedures.
Hybrid Engine (Stirling Engine + IC Engine + Electric Motor)IJMER
Hybrid engine is a combination of Stirling engine, IC engine and Electric motor. All these 3 are
connected together to a single shaft. The power source of the Stirling engine will be a Solar Panel. The aim of
this is to run the automobile using a Hybrid engine
Fabrication & Characterization of Bio Composite Materials Based On Sunnhemp F...IJMER
The present day technology demands eco-friendly developments. In this era the
composite material are playing a vital roal in different field of Engineering .The composite materials
are using as a principle materials. Nowaday the composite materials are utilizing as a important
component of engineering field .Where as the importance of the applications of composites is well
known, but thrust on the use of natural fibres in it for reinforcement has been given priority for some
times. But changing from synthetic fibres to natural fibres provides only half green-composites. A
partial green composite will be achieved if the matrix component is also eco-friendly. Keeping this in
view, a detailed literature surveyed has been carried out through various issues of the Journals
related to this field. The material systems used are sunnhemp fibres. Some epoxy and hardener has
been also added for stability and drying of the bio-composites. Various graphs and bar-charts are
super-imposed on each other for comparison among themselves and Graphs is plotted on MAT LAB
and ORIGIN 6.0 software. To determining tensile strengths, Various properties for different biocomposites
have been compared among themselves. Comparison of the behaviour of bio-composites of
this work has been also compare with other works. The bio-composites developed in this work are
likely to get applications in fall ceilings, partitions, bio-degradable packagings, automotive interiors,
sports things (e.g. rackets, nets, etc.), toys etc.
Geochemistry and Genesis of Kammatturu Iron Ores of Devagiri Formation, Sandu...IJMER
The Greenstone belts of Karnataka are enriched in BIFs in Dharwar craton, where Iron
formations are confined to the basin shelf, clearly separated from the deeper-water iron formation that
accumulated at the basin margin and flanking the marine basin. Geochemical data procured in terms of
major, trace and REE are plotted in various diagrams to interpret the genesis of BIFs. Al2O3, Fe2O3 (T),
TiO2, CaO, and SiO2 abundances and ratios show a wide variation. Ni, Co, Zr, Sc, V, Rb, Sr, U, Th,
ΣREE, La, Ce and Eu anomalies and their binary relationships indicate that wherever the terrigenous
component has increased, the concentration of elements of felsic such as Zr and Hf has gone up. Elevated
concentrations of Ni, Co and Sc are contributed by chlorite and other components characteristic of basic
volcanic debris. The data suggest that these formations were generated by chemical and clastic
sedimentary processes on a shallow shelf. During transgression, chemical precipitation took place at the
sediment-water interface, whereas at the time of regression. Iron ore formed with sedimentary structures
and textures in Kammatturu area, in a setting where the water column was oxygenated.
Experimental Investigation on Characteristic Study of the Carbon Steel C45 in...IJMER
In this paper, the mechanical characteristics of C45 medium carbon steel are investigated
under various working conditions. The main characteristic to be studied on this paper is impact toughness
of the material with different configurations and the experiment were carried out on charpy impact testing
equipment. This study reveals the ability of the material to absorb energy up to failure for various
specimen configurations under different heat treated conditions and the corresponding results were
compared with the analysis outcome
Non linear analysis of Robot Gun Support Structure using Equivalent Dynamic A...IJMER
Robot guns are being increasingly employed in automotive manufacturing to replace
risky jobs and also to increase productivity. Using a single robot for a single operation proves to be
expensive. Hence for cost optimization, multiple guns are mounted on a single robot and multiple
operations are performed. Robot Gun structure is an efficient way in which multiple welds can be done
simultaneously. However mounting several weld guns on a single structure induces a variety of
dynamic loads, especially during movement of the robot arm as it maneuvers to reach the weld
locations. The primary idea employed in this paper, is to model those dynamic loads as equivalent G
force loads in FEA. This approach will be on the conservative side, and will be saving time and
subsequently cost efficient. The approach of the paper is towards creating a standard operating
procedure when it comes to analysis of such structures, with emphasis on deploying various technical
aspects of FEA such as Non Linear Geometry, Multipoint Constraint Contact Algorithm, Multizone
meshing .
Static Analysis of Go-Kart Chassis by Analytical and Solid Works SimulationIJMER
This paper aims to do modelling, simulation and performing the static analysis of a go
kart chassis consisting of Circular beams. Modelling, simulations and analysis are performed using 3-D
modelling software i.e. Solid Works and ANSYS according to the rulebook provided by Indian Society of
New Era Engineers (ISNEE) for National Go Kart Championship (NGKC-14).The maximum deflection is
determined by performing static analysis. Computed results are then compared to analytical calculation,
where it is found that the location of maximum deflection agrees well with theoretical approximation but
varies on magnitude aspect.
In récent year various vehicle introduced in market but due to limitation in
carbon émission and BS Séries limitd speed availability vehicle in the market and causing of
environnent pollution over few year There is need to decrease dependancy on fuel vehicle.
bicycle is to be modified for optional in the future To implement new technique using change in
pedal assembly and variable speed gearbox such as planetary gear optimise speed of vehicle
with variable speed ratio.To increase the efficiency of bicycle for confortable drive and to
reduce torque appli éd on bicycle. we introduced epicyclic gear box in which transmission done
throgh Chain Drive (i.e. Sprocket )to rear wheel with help of Epicyclical gear Box to give
number of différent Speed during driving.To reduce torque requirent in the cycle with change in
the pedal mechanism
Integration of Struts & Spring & Hibernate for Enterprise ApplicationsIJMER
The proposal of this paper is to present Spring Framework which is widely used in
developing enterprise applications. Considering the current state where applications are developed using
the EJB model, Spring Framework assert that ordinary java beans(POJO) can be utilize with minimal
modifications. This modular framework can be used to develop the application faster and can reduce
complexity. This paper will highlight the design overview of Spring Framework along with its features that
have made the framework useful. The integration of multiple frameworks for an E-commerce system has
also been addressed in this paper. This paper also proposes structure for a website based on integration of
Spring, Hibernate and Struts Framework.
Microcontroller Based Automatic Sprinkler Irrigation SystemIJMER
Microcontroller based Automatic Sprinkler System is a new concept of using
intelligence power of embedded technology in the sprinkler irrigation work. Designed system replaces
the conventional manual work involved in sprinkler irrigation to automatic process. Using this system a
farmer is protected against adverse inhuman weather conditions, tedious work of changing over of
sprinkler water pipe lines & risk of accident due to high pressure in the water pipe line. Overall
sprinkler irrigation work is transformed in to a comfortableautomatic work. This system provides
flexibility & accuracy in respect of time set for the operation of a sprinkler water pipe lines. In present
work the author has designed and developed an automatic sprinkler irrigation system which is
controlled and monitored by a microcontroller interfaced with solenoid valves.
On some locally closed sets and spaces in Ideal Topological SpacesIJMER
In this paper we introduce and characterize some new generalized locally closed sets
known as
δ
ˆ
s-locally closed sets and spaces are known as
δ
ˆ
s-normal space and
δ
ˆ
s-connected space and
discussed some of their properties
Intrusion Detection and Forensics based on decision tree and Association rule...IJMER
This paper present an approach based on the combination of, two techniques using
decision tree and Association rule mining for Probe attack detection. This approach proves to be
better than the traditional approach of generating rules for fuzzy expert system by clustering methods.
Association rule mining for selecting the best attributes together and decision tree for identifying the
best parameters together to create the rules for fuzzy expert system. After that rules for fuzzy expert
system are generated using association rule mining and decision trees. Decision trees is generated for
dataset and to find the basic parameters for creating the membership functions of fuzzy inference
system. Membership functions are generated for the probe attack. Based on these rules we have
created the fuzzy inference system that is used as an input to neuro-fuzzy system. Fuzzy inference
system is loaded to neuro-fuzzy toolbox as an input and the final ANFIS structure is generated for
outcome of neuro-fuzzy approach. The experiments and evaluations of the proposed method were
done with NSL-KDD intrusion detection dataset. As the experimental results, the proposed approach
based on the combination of, two techniques using decision tree and Association rule mining
efficiently detected probe attacks. Experimental results shows better results for detecting intrusions as
compared to others existing methods
Natural Language Ambiguity and its Effect on Machine LearningIJMER
"Natural language processing" here refers to the use and ability of systems to process
sentences in a natural language such as English, rather than in a specialized artificial computer
language such as C++. The systems of real interest here are digital computers of the type we think of as
personal computers and mainframes. Of course humans can process natural languages, but for us the
question is whether digital computers can or ever will process natural languages. We have tried to
explore in depth and break down the types of ambiguities persistent throughout the natural languages
and provide an answer to the question “How it affects the machine translation process and thereby
machine learning as whole?” .
Today in era of software industry there is no perfect software framework available for
analysis and software development. Currently there are enormous number of software development
process exists which can be implemented to stabilize the process of developing a software system. But no
perfect system is recognized till yet which can help software developers for opting of best software
development process. This paper present the framework of skillful system combined with Likert scale. With
the help of Likert scale we define a rule based model and delegate some mass score to every process and
develop one tool name as MuxSet which will help the software developers to select an appropriate
development process that may enhance the probability of system success.
Material Parameter and Effect of Thermal Load on Functionally Graded CylindersIJMER
The present study investigates the creep in a thick-walled composite cylinders made
up of aluminum/aluminum alloy matrix and reinforced with silicon carbide particles. The distribution
of SiCp is assumed to be either uniform or decreasing linearly from the inner to the outer radius of
the cylinder. The creep behavior of the cylinder has been described by threshold stress based creep
law with a stress exponent of 5. The composite cylinders are subjected to internal pressure which is
applied gradually and steady state condition of stress is assumed. The creep parameters required to
be used in creep law, are extracted by conducting regression analysis on the available experimental
results. The mathematical models have been developed to describe steady state creep in the composite
cylinder by using von-Mises criterion. Regression analysis is used to obtain the creep parameters
required in the study. The basic equilibrium equation of the cylinder and other constitutive equations
have been solved to obtain creep stresses in the cylinder. The effect of varying particle size, particle
content and temperature on the stresses in the composite cylinder has been analyzed. The study
revealed that the stress distributions in the cylinder do not vary significantly for various combinations
of particle size, particle content and operating temperature except for slight variation observed for
varying particle content. Functionally Graded Materials (FGMs) emerged and led to the development
of superior heat resistant materials.
Energy Audit is the systematic process for finding out the energy conservation
opportunities in industrial processes. The project carried out studies on various energy conservation
measures application in areas like lighting, motors, compressors, transformer, ventilation system etc.
In this investigation, studied the technical aspects of the various measures along with its cost benefit
analysis.
Investigation found that major areas of energy conservation are-
1. Energy efficient lighting schemes.
2. Use of electronic ballast instead of copper ballast.
3. Use of wind ventilators for ventilation.
4. Use of VFD for compressor.
5. Transparent roofing sheets to reduce energy consumption.
So Energy Audit is the only perfect & analyzed way of meeting the Industrial Energy Conservation.
An Implementation of I2C Slave Interface using Verilog HDLIJMER
The focus of this paper is on implementation of Inter Integrated Circuit (I2C) protocol
following slave module for no data loss. In this paper, the principle and the operation of I2C bus protocol
will be introduced. It follows the I2C specification to provide device addressing, read/write operation and
an acknowledgement. The programmable nature of device provide users with the flexibility of configuring
the I2C slave device to any legal slave address to avoid the slave address collision on an I2C bus with
multiple slave devices. This paper demonstrates how I2C Master controller transmits and receives data to
and from the Slave with proper synchronization.
The module is designed in Verilog and simulated in ModelSim. The design is also synthesized in Xilinx
XST 14.1. This module acts as a slave for the microprocessor which can be customized for no data loss.
Discrete Model of Two Predators competing for One PreyIJMER
This paper investigates the dynamical behavior of a discrete model of one prey two
predator systems. The equilibrium points and their stability are analyzed. Time series plots are obtained
for different sets of parameter values. Also bifurcation diagrams are plotted to show dynamical behavior
of the system in selected range of growth parameter
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
TECHNICAL TRAINING MANUAL GENERAL FAMILIARIZATION COURSEDuvanRamosGarzon1
AIRCRAFT GENERAL
The Single Aisle is the most advanced family aircraft in service today, with fly-by-wire flight controls.
The A318, A319, A320 and A321 are twin-engine subsonic medium range aircraft.
The family offers a choice of engines
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
COLLEGE BUS MANAGEMENT SYSTEM PROJECT REPORT.pdfKamal Acharya
The College Bus Management system is completely developed by Visual Basic .NET Version. The application is connect with most secured database language MS SQL Server. The application is develop by using best combination of front-end and back-end languages. The application is totally design like flat user interface. This flat user interface is more attractive user interface in 2017. The application is gives more important to the system functionality. The application is to manage the student’s details, driver’s details, bus details, bus route details, bus fees details and more. The application has only one unit for admin. The admin can manage the entire application. The admin can login into the application by using username and password of the admin. The application is develop for big and small colleges. It is more user friendly for non-computer person. Even they can easily learn how to manage the application within hours. The application is more secure by the admin. The system will give an effective output for the VB.Net and SQL Server given as input to the system. The compiled java program given as input to the system, after scanning the program will generate different reports. The application generates the report for users. The admin can view and download the report of the data. The application deliver the excel format reports. Because, excel formatted reports is very easy to understand the income and expense of the college bus. This application is mainly develop for windows operating system users. In 2017, 73% of people enterprises are using windows operating system. So the application will easily install for all the windows operating system users. The application-developed size is very low. The application consumes very low space in disk. Therefore, the user can allocate very minimum local disk space for this application.
Democratizing Fuzzing at Scale by Abhishek Aryaabh.arya
Presented at NUS: Fuzzing and Software Security Summer School 2024
This keynote talks about the democratization of fuzzing at scale, highlighting the collaboration between open source communities, academia, and industry to advance the field of fuzzing. It delves into the history of fuzzing, the development of scalable fuzzing platforms, and the empowerment of community-driven research. The talk will further discuss recent advancements leveraging AI/ML and offer insights into the future evolution of the fuzzing landscape.
Courier management system project report.pdfKamal Acharya
It is now-a-days very important for the people to send or receive articles like imported furniture, electronic items, gifts, business goods and the like. People depend vastly on different transport systems which mostly use the manual way of receiving and delivering the articles. There is no way to track the articles till they are received and there is no way to let the customer know what happened in transit, once he booked some articles. In such a situation, we need a system which completely computerizes the cargo activities including time to time tracking of the articles sent. This need is fulfilled by Courier Management System software which is online software for the cargo management people that enables them to receive the goods from a source and send them to a required destination and track their status from time to time.
Greedy – based Heuristic for OSC problems in Wireless Sensor Networks
1. International
OPEN ACCESS Journal
Of Modern Engineering Research (IJMER)
| IJMER | ISSN: 2249–6645 | www.ijmer.com | Vol. 4 | Iss. 3 | Mar. 2014 | 1 |
Greedy – based Heuristic for OSC problems in Wireless
Sensor Networks
1
S. Somasundaram, 2
Dr. T. Ravichandran
1Research Scholar, Karpagam University, Coimbatore, Tamil Nadu-641 021 India
2
Hindusthan Institute of Technology, Coimbatore, Tamil Nadu-641 032 India
I. Introduction
A Wireless Sensor Networks (WSNs) are composed of low cost sensor nodes, which can be used for a
wide range of applications. WSNs are consisting of a large number of low cost devices to gather information
from various kinds of remote sensing applications. WSNs enabling technology for various applications it
involve long-term and low-cost monitoring, such as battlefield reconnaissance, building inspection, security
surveillance, etc. A goal in most WSN applications is to reconstruct the underlying physical phenomenon, e.g.,
temperature, based on sensor measurements. The networks may be composed by hundreds or thousands
independent devices, therefore is called sensor node.
The sensor nodes in a WSN have typically short battery life. Most WSN applications are however
expected to run autonomously for months or years. An important issue in sensor networks is power scarcity it’s
driven in part by battery size and weight limitations. Between the functional components of a sensor node the
radio consumes a major portion of the energy. The several techniques are been proposed to minimize its energy
consumption. Here we ponder the network lifetime optimization issues in the WSN, the energy saving
techniques can normally be classified in two types, scheduling the sensor nodes to alternate between active and
sleep mode, and adjusting the transmission or sensing range of the wireless nodes.
In this paper we give a lecture for aim to coverage problem. The goal is to maximize the network
lifetime to an energy consuming of WSNs for monitoring the coverage area. We have to consider a large
number of sensor nodes are randomly circulated and send information by central processing node. Then the all
sensing data from each node are not necessary to users, and data redundancy can be expected in a densely
distributed sensor network. The way used to extend the network’s lifetime is to organize the sensors into a
number of sets, such that all the targets are monitored continuously. Also the energy constraints for each sensor
and BS connectivity of each sensor set must be satisfied. Besides reducing the energy consumed, this method
lowers the density of active nodes is less, then reducing contention of MAC layer. The contributions of this
paper are:
1. Introduce the Optimize Set Coverage (OSC) problem and prove its NP- completeness.
2. The model of OSC problem using Integer Programming.
3. The model of OSC problem using linear Programming.
4. Greedy-based heuristic for OSC.
5. Design a distributed and localized heuristic for the OSC.
6. Analyze the performance of these algorithms through simulations.
Abstract: This paper contains optimize set coverage problem in wireless sensor networks with
adaptable sensing range. Communication and sensing consume energy, so efficient power management
can extended the network lifetime. In this paper we consider a enormous number of sensors with
adaptable sensing range that are randomly positioned to monitor a number of targets. Every single
target may be redundantly covered by various sensors. For preserving energy resources we organize
sensors in sets stimulated successively. In this paper we introduce the Optimize Set Coverage (OSC)
problem that has in unbiased finding with an extreme number of set covers in which every sensor node
to be activated is connected to the base station. A sensor can be participated in various sensor sets, but
the overall energy consumed in all groups is forced by the primary energy reserves. We show that the
OSC problem is NP-complete and we propose the solutions: an integer programming for OSC problem,
a linear programming for OSC problem with greedy approach, and a distributed and localized
heuristic. Simulation results are presented and validated to our approaches.
2. Greedy – based Heuristic for OSC problems in Wireless Sensor
| IJMER | ISSN: 2249–6645 | www.ijmer.com | Vol. 4 | Iss. 2 | Feb. 2014 | 2 |
7.
II. Related Work
In this paper we address the sensor coverage problem. As pointed out in, the coverage concept is a measure
of the quality of service of the sensing function and is subject to a wide range of interpretations due to a large
variety of sensors and applications. The goal is to have each location in the physical space of interest within the
sensing range of at least one sensor.
III. Optimization Of Network Lifetime
We consider a number of sensor nodes that circulate continuously and target with known locators. We
also consider a central data collector node; it will be referring to the base station (BS). The sensing data are been
process by the sensors in the BS.
We assuming the number of sensors deployed are larger than to needed to process the task. The sensing nodes
are been alternate between the active states and sleep states. The sensing node contains the sleep mode at the
time sensing tasks.
a) Aim to coverage the lifetime problem
We consider the sensors for the energy consume WSN will randomly circulate and the location, the
sensing nodes are observed continuously for network lifetime optimized.
1. The sensing node is accomplished as follows:
2. The BS collects the location information of the sensing nodes.
3. The BS executes the sensor scheduling algorithm and broadcast it when the node is in active.
4. The sensing node take breaks by own for active are to sleep.
In this paper we consider the designing the scheduling mechanisms of node and do not address the
problem by selecting which protocol is used for data gathering or node synchronization.
b) Energy consuming in transmitting data
The energy is delivering from a node to another node as one bit message within transmission range in
one hop communication is combined with the transmission energy to transmit a bit at the sending node and the
energy needed to receive a bit at the receiving node.
A small sensor nodes are contains the limitations for battery storage is containing only the small
transmission ranges and may not be able to communicate directly with the sink nodes; hence the concept of
multi-hop communication is needed.
In the multi-hop communication model, it is assumed that considerable energy savings can be achieved
by the use of multiple short range transmissions as opposed to one large hop transmission. The distance from the
source to the destination is communicates, and the transmission range for the multi-hop communication, the
required consumption energy.
IV. Optimize Set Coverage Problem
In this section we optimize the covered problem and prove it completely
a) Definition of optimize set coverage
Here we assume the given area to be covered by WSN, each of which will collect data periodically.
Then, lifetime optimization of the wireless sensor network is assigning the different transmission power of
nodes to balance their battery usage to avoid energy wastage at the time network coverage. The main goal of
this paper is to decide the communication between the each node.
We assume that the sensor s1, s2….sn and the randomly circulate and covers the aimed location range r1,
r2…rn. The base station has the coordinates of the sensor nodes and the aimed location. It is able to compute the
each sensor node which is covers the locations.
The method is to assume that the sensors are covers the aimed locations, if the distance between the sensor and
the location is small or same with the predefined sensing range.
3. Greedy – based Heuristic for OSC problems in Wireless Sensor
| IJMER | ISSN: 2249–6645 | www.ijmer.com | Vol. 4 | Iss. 2 | Feb. 2014 | 3 |
(a) (b)
Figure: Example with four sensor nodes (s1, s2, s3, s4) and three location range (r1, r2, r3)
Above figure shows an example with four sensor nodes s1, s2, s3, s4 and three location range r1, r2, r3.
In this example we assume that the each sensor can be active for a unit time of 1. That is, if all sensors are stored
continuously, then the network lifetime is 1.
In this brief, we are improving the scheduling scheme by allowing every sensor to be part of more than
one set, at by allowing the sets to be operational for different time intervals.
b) Optimize set coverage problem solution
In this section we first define the decision of optimize problem and then prove the problem.
A decision problem contains the collection of subsets of a finite sets and a number does it exist a family of set
covers s1,……sn and the range r1,……rn and for each subset of collection and a is appear in s1,…..sn and the
weight at most l, where l is the lifetime of each sensor.
c) Lifetime of network
The work of the WSN is collecting the data in the sensing applications. The wireless sensor network
lifetime is generally determined by the last active node.
d) Sensing node
In the WSN the sensor nodes must maintain the coverage area and network connection. They determine
the quality of service in the sensor network. The problem in data collecting from sensor network is how they
monitored the coverage area and notice the each and every action from the wireless sensor network. It senses the
coverage area to a wide-ranging of analyses in line for a large variety of sensors and applications. The goal is
every location in the physical space of interest surrounded by the sensing range of at least on sensor.
The interrupts occurs at connectivity are robustness and reachable throughput of the communication
link in a wireless sensor network. The wireless sensor network must also provide connectivity satisfaction;
therefore every node is used for data collecting.
e) Energy model
Assume sensor nodes can adjust their transmission power to control the transmission range. The energy
consumed by sensor to reliably transmit a b-bit message to sensor j.
Where is a system constant denoting the energy required by a transmitter amplifier to transmit 1-bit one
meter, is the path loss exponent depending on the medium properties, and di,j is the distance between sensor i
and sensor j.
V. Solution For Optimize Set Coverage
In this section we present the two heuristics for OSC problem. First we process the problem in integer
programming. Second we process the linear programming. Then we process the greed based for OSC and finally
we process the distributed and localized for OSC are given for computing the set covers.
The consolidated heuristics are implemented at the BS. When the sensors are placed, they send their
synchronization to the BS. The BS calculates and broadcasts back the sensor lists. In the distributed and limited
algorithm, each sensor node regulates its schedule created on communication with one-hop neighbors.
4. Greedy – based Heuristic for OSC problems in Wireless Sensor
| IJMER | ISSN: 2249–6645 | www.ijmer.com | Vol. 4 | Iss. 2 | Feb. 2014 | 4 |
a) Integer programming for OSC problem
In this section we formulate the OSC problem using the integer programming
Given:
Set N sensor nodes s1,s2,….sN
Set L location range r1,r2,….rL
The coefficient showing the relationship between the sensor nodes and ranges, therefore each sensor node is
covers the aimed location. This is modeled as having each element in s is represented as a subset of the
finite set r.
Set E for initialize energy
Let us define sN = i|sensor si covers range rk
Variables:
xij, Boolean variable, for i=1…n and j=1…p; xij=1 if sensor si is in the set cover sj,otherwise wij=0.
tj € Ɽ, 0≤ tj ≤ 1, for j=1…p, represents the time allocated for the set cover Sj.
Maximize t1 + … +tp
Subject to
Where
Remarks:
The first constraint, for all si € N guarantees that the time allocated for each sensor s1,across
all set covers, is not larger than 1,which is the life time of each sensor.
The second constraint, for all rk € L, j=1…p, and Nk= i|si covers range rk, guarantees that
each target rk is covered by at least one sensor si in each set cover sj.
We notice that the term xijtj is not linear. Therefore we set yij = xijtj, and reformulate the problem as:
Maximize t1 + … +tp
Subject to
Where
b) Linear programming for OSC problem
In this section we formulate the problem using linear programming, before that we have apply the relax
technique.
Maximize t1 + … +tp
Subject to
Where
5. Greedy – based Heuristic for OSC problems in Wireless Sensor
| IJMER | ISSN: 2249–6645 | www.ijmer.com | Vol. 4 | Iss. 2 | Feb. 2014 | 5 |
Linear programming based heuristic:
1. Solve the LP and get the optimal solution xikp and ck
2. Set x’ikp = 0 and c’k = 0 for all i=1…N,k=1…K,p=1…P
3. Sort ck in non-increasing order c1,c2,…ck
4. for all variable ck taken from the list in non-increasing order do
5. if ck > 0 then
6. sort xikp, i = 1..N, p = 1..P in non-increasing order
7. for all xikp do
8. if xikp covers new targets and sensor i has at least
9. ep energy at the beginning of setting up the cover
10. ck then
11. set up the range of sensor i to rp, xikp = 1
12. else
13. xikp = 0
14. else if
15. else for
16. if all targets are covered by xikp having value 1 then
17. /∗ we formed a valid set cover ∗/
18. set c_k = 1
19. update residual energy of any sensor i with range
20. rp in ck: Ei = Ei – ep
21. set ck = 0 and reset xikp = 0 for any i = 1..N and p = 1..P
22. end if
23. end if
24. end for
The heuristic begins in line 1 by solving the relaxed LP that outputs the optimal solution xikp and ck.
We round this solution in order to get a feasible solution xikp and ck for the IP. We use a greedy approach, by
giving priority to the set covers with a larger ck. When adding sensors to a cover ck, priority is given to the
sensors with larger xikp. We sort values ck in the non-increasing order.
We add sensors to the current set cover k, by adding first the sensors with higher xikp values. If, later,
the same sensor with a larger range is encountered, the new range setting is used if new targets are covered and
if the sensor has sufficient energy resources for this setting. If all the targets are covered by the selected sensors
in this set cover, then we set ck = 1. Otherwise, forming the current set cover was unsuccessful, ck = 0, and all of
set k’s members are removed (xikp = 0 for any i = 1..N and p = 1..P ).
The complication of this procedure is controlled by the linear programming solver, where n is the number of
variables. In our case n = K (1 + NP), where P usually a small number.
c) Greedy-based heuristic for OSC
The Greedy-based heuristic for OSC is executed by the base station. When the sensors are arranged,
they send their coordinates to the BS, it computes the connected set-covers and broadcasts back to the
scheduling sensors.
Greed based OSC:
1.Set residual energy of each sensor u to E′u ← E
2: SENSORS ← {(s1,E′1), . . . , (sN,E′N )}
3: h ← 0
4: while the sensors in SENSORS are connected and cover all the targets do
5: /* a new set Ch will be formed */
6: h ← h + 1; Sh ← _; Rh ← _
7: TARGETS ← {r1, r2, . . . , rM}
8: while TARGETS 6= 0 do
9: /* more targets have to be covered */
10: find a critical target rcritical ∈ TARGETS
11: select a sensor su ∈ SENSORS with greatest contribution that covers r critical and has Eu ≥ E1 + E2
12: Sh ← Sh ∪ {su}
13: for all targets rj ∈ TARGETS do
14: if rj is covered by su then
15: TARGETS ← TARGETS − rj
6. Greedy – based Heuristic for OSC problems in Wireless Sensor
| IJMER | ISSN: 2249–6645 | www.ijmer.com | Vol. 4 | Iss. 2 | Feb. 2014 | 6 |
16: end if
17: end for
18: end while
19: apply Breadth-First Search (BFS) algorithm starting from the BS
20: the BFS tree such that to sustain paths from the BS to each sensor in Sh
21: for all sensors su in the resulted BFS subtree with su /∈ Sh do
22: Rh ← Rh ∪ {su}
23: end for
24: for all sensors su ∈ Sh ∪ Rh do
25: if su ∈ Sh then
26: E′u ← E′u − (E1 + E2)
27: end if
28: if su ∈ Rh then
29: E′u ← E′u − E2
30: end if
31: if E′u < E2 then
32: SENSORS ← SENSORS − su
33: end if
34: end for
35: end while
36: return h-number of connected set covers and the connected set-covers (S1,R1), (S2,R2), . . . , (Sh,Rh).
The set covers build by the heuristic recursive, in lines 4 to 34. The enduring energy of every single
sensor is set initially to E. Everyone connected set cover relates to a round that will be active for and thus an
active sensing sensor consumes E1 + E2 energy, although a relay sensor consumes E2 energy per round. The set
SENSORS maintain the set of sensors that must be at least E2 energy left, and can therefore contribute in
additional set covers.
As like with OSC, we note with Sh (Rh) the set containing the sensing sensors in the current set-cover
h. We first build the sensing sensor set Sh, in lines 8 to 18 and then the relay sensor set Rh in lines 19 to 23. The
set TARGETS contain the targets that still have to be covered by the current set h. At all step, a critical target is
selected, in line 10, to be covered.
This is an example for the target most densely covered, both in terms of number of sensors as well as
with regard to the enduring energy of those sensors. The sensors considered for sensing have to be in the set
SENSORS and to have at least E1+E2 residual energy. Once the critical target has been selected, the heuristic
selects the sensor with the maximum contribution that covers the critical target. Various sensor contribution
functions can be defined. For example we can consider a sensor to have greater contribution if it covers a larger
number of uncovered targets and if it has more residual energy available. Once a sensor has been selected, it is
added to the current set cover in line 12, and all additionally covered targets are removed from the TARGETS
set. After all the targets have been covered, we need to guarantee BS connectivity.
d) Distributed and localized heuristic for OSC
In this section we process the distributed and localized for OSC, we discuss to a resolution process at
each node that makes use of only data for a neighborhood within a constant number of hops. A distributed and
localized algorithm is desirable in wireless sensor networks since it adapts better to dynamic and large
topologies. The distributed greedy algorithm goes in rounds. Every round initiates with an initialization phase,
in which sensors checks whether they will be in an active or sleep mode throughout the current round. The
initialization phases proceeds W time, where W is far less than the duration of a round.
Every sensor sustains a waiting time, after that it decides its status (sleep or active) and its sensing
range, and then it broadcasts the list of targets it covers to its one-hop neighbors. The waiting time of each
sensor si depends on si’s contribution, and is set up initially to Wi = (1 – BiP/Bmax) ×W where Bmax is the
largest possible contribution, defined as Bmax = M/e1, where M is the number of targets. The waiting time can
change during the initialization phase, when broadcast messages are received from neighbors.
If a sensor si gets a broadcast message from one of its neighbors, at that time si updates the set of
uncovered targets TiP and sets up its sensing range to the smallest value ru needed to cover this set of targets.
The sensor contribution value is also updated to Biu. If all si’s targets are already covered by its neighbors, then
si sets up its sensing range to r0 = 0. The waiting time Wi of the sensor si is as well updated to (1 – Biu/ Bmax )
× W. At the end of its waiting time, a sensor broadcasts its status (active or sleep) as well as the list of targets it
covers.
7. Greedy – based Heuristic for OSC problems in Wireless Sensor
| IJMER | ISSN: 2249–6645 | www.ijmer.com | Vol. 4 | Iss. 2 | Feb. 2014 | 7 |
If a sensing range is r0 then this sensor node will be in the sleep mode, otherwise it will be active
during this round. As unlike sensors have dissimilar waiting times, this serializes the sensors broadcasts in their
local neighborhood and contributes priority to the sensors with advanced contribution. These sensors decide
their status and broadcast their target coverage information first. In this algorithm we use a distinct time
window, where the length of the time slot is d. Therefore, the time window W has W d time units. The waiting
timing of the two sensor si and sj are too close, i.e. |Wi − Wj | < d, then the sensors neighbors to both si and sj
cannot tell from whom the message was received, thus they will not update their uncovered target set. We
assume sensor nodes are synchronized and the protocol starts by having the base station (BS) broadcast a start
message. If, after the initialization phase, a sensor si cannot cover one of the targets in the set TiP and its waiting
time reached the value zero, then si sends this failure information to BS. In our algorithm, we measure the
network lifetime as the time until BS detects the first failure. Next we present the Distributed Initialization, that
is run by each sensor si, i = 1...N during the initialization phase
Distributed Initialization:
1: compute the waiting time Wi and start timer t
2: while t ≤ Wi and TiP _= ∅ do
3: if message from neighbor sensor is received then
4: update TiP and set-up the sensing range to the smallest value ru needed to cover TiP
5: if TiP == 0 then
6: set si’s sensing range to r0
7: break
8: end if
9: update si’s contribution to Biu
10: update the waiting time Wi to (1 – Biu/Bmax) ×W
11: end if
12: end while
13: /* assume si’s sensing range was set up to ru */
14: if ru == r0 then
15: si broadcasts its sleep state decision
16: return
17: end if
18: if Ei < eu then
19: si reports failure to BS, indicating the targets it cannot cover due to the energy constraints
20: end if
21: si broadcasts information about the set of targets Tiu it will monitor during this round
22: return
The complexity of the Distributed Initialization procedure is O (Wd/ NMP). This corresponds to the
case when si receives messages from N neighbors, each d time. The updates for each message take O(MP).
VI. Simulation Results
8. Greedy – based Heuristic for OSC problems in Wireless Sensor
| IJMER | ISSN: 2249–6645 | www.ijmer.com | Vol. 4 | Iss. 2 | Feb. 2014 | 8 |
REFERENCES
[1] Martin Gruber and G¨unther R. Raidl ”Cluster- Based (Meta-)Heuristics for the Euclidean Bounded Diameter
Minimum Spanning Tree Problem”, Institute of Computer Graphics and Algorithms Vienna University of
Technology, Vienna, Austria, 2012.
[2] C. Joncour(1,3), S. Michel (2), R. Sadykov (3,1), D. Sverdlov (3), F. Vanderbeck (1,3) “Column Generation based
Primal Heuristics”, (1) Institut de Mathmatiques, Universit Bordeaux 1, France (2) Institut suprieur d’tudes
logistiques, Universit du Havre, France (3) Team RealOpt, INRIA Bordeaux-Sud-Ouest, France.
[3] N. Lesh, M. Mitzenmacher “BubbleSearch: A Simple Heuristic for Improving Priority-based Greedy Algorithms”,
TR2005-114 December 2005.
[4] Orestis A. Telelis “Set Covering and Network Optimization: Dynamic and Approximation Algorithms”, Department
of Informatics and Telecommunications National and Kapodistrian University of Athens, Hellas.
[5] Belma Yelbay, S¸. ˙Ilker Birbil and Kerem B¨ulb¨ul ” The Set Covering Problem Revisited: An Empirical Study of
the Value of Dual Information”, Sabancı University, Manufacturing Systems and Industrial Engineering, Orhanlı-
Tuzla, 34956 Istanbul, Turkey.
9. Greedy – based Heuristic for OSC problems in Wireless Sensor
| IJMER | ISSN: 2249–6645 | www.ijmer.com | Vol. 4 | Iss. 2 | Feb. 2014 | 9 |
[6] Rong-chii Duh, Martin F¨urer “Approximation of k-Set Cover by Semi-Local Optimization”, Dept. of Computer
Science and Engineering Pennsylvania State University University Park, PA16802.
[7] Shunji Umetani, Mutsunori Yagiura “RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM”,
University of Electro-Communications, Nagoya University.
[8] Robert P.D. Vanderkama, Yolanda F. Wiersmab , Douglas J. Kingc ” Heuristic algorithms vs. linear programs for
designing efficient conservation reserve networks: Evaluation of solution optimality and processing time”, a
Canadian Wildlife Service, Environment Canada, 351 St. Joseph Blvd., Gatineau, QC, Canada K1A 0H3.
[9] S K SEN and A RAMFUL “A direct heuristic algorithm for linear programming”, Supercomputer Education and
Research Centre, Indian Institute of Science, Bangalore.
[10] Krishnan Srinivasan, Karam S. Chatha “Integer linear programming and heuristic techniques for system-level low
power scheduling on multiprocessor architectures under throughput constraints”, Department of CSE, PO BOX
875406, Arizona State University, Tempe, AZ 85287-5406, USA.