IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
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.
DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...IJEEE
Data transmission occurs from transmitting node to sink node, which communicate each other via large number of intermediate nodes or directly to an external base station. A network consists of numbers of nodes with one as a source and one or more as a destination node.
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...ijwmn
Target localization and tracking problems in WSNs have received considerable attention recently, driven
by the requirement to achieve high localization accuracy, with the minimum cost possible. In WSN based
tracking applications, it is critical to know the current location of any sensor node with the minimum
energy consumed. This paper focuses on the energy consumption issue in terms of communication
between nodes whenever the localization information is transmitted to a sink node. Tracking through
WSNs can be categorized into centralized and decentralized systems. Decentralized systems offer low
power consumption when deployed to track a small number of mobile targets compared to the centralized
tracking systems. However, in several applications, it is essential to position a large number of mobile
targets. In such applications, decentralized systems offer high power consumption, since the location of
each mobile target is required to be transmitted to a sink node, and this increases the power consumption
for the whole WSN. In this paper, we propose a power efficient decentralized approach for tracking a
large number of mobile targets while offering reasonable localization accuracy through ZigBee network
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
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.
DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...IJEEE
Data transmission occurs from transmitting node to sink node, which communicate each other via large number of intermediate nodes or directly to an external base station. A network consists of numbers of nodes with one as a source and one or more as a destination node.
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...ijwmn
Target localization and tracking problems in WSNs have received considerable attention recently, driven
by the requirement to achieve high localization accuracy, with the minimum cost possible. In WSN based
tracking applications, it is critical to know the current location of any sensor node with the minimum
energy consumed. This paper focuses on the energy consumption issue in terms of communication
between nodes whenever the localization information is transmitted to a sink node. Tracking through
WSNs can be categorized into centralized and decentralized systems. Decentralized systems offer low
power consumption when deployed to track a small number of mobile targets compared to the centralized
tracking systems. However, in several applications, it is essential to position a large number of mobile
targets. In such applications, decentralized systems offer high power consumption, since the location of
each mobile target is required to be transmitted to a sink node, and this increases the power consumption
for the whole WSN. In this paper, we propose a power efficient decentralized approach for tracking a
large number of mobile targets while offering reasonable localization accuracy through ZigBee network
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
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.
A HYBRID FUZZY SYSTEM BASED COOPERATIVE SCALABLE AND SECURED LOCALIZATION SCH...ijwmn
Localization entails position estimation of sensor nodes by employing different techniques and mathematical computations. Localizable sensors also form an inherent part in the functioning of IoT devices and robotics. In this article, the author extends1 a novel scheme for node localization implemented using a hybrid fuzzy logic system to trace the node locations inside the deployment region, presented by the
Abhishek Kumar et. al. The results obtained were then optimized using Gauss Newton Optimization to improve the localization accuracy by 50% to 90% vis-à-vis weighted centroid and other fuzzy based localization algorithms. This article attempts to scale the proposed scheme for large number of sensor nodes to emulate somewhat real world scenario by introducing cooperative localization in previous presented work. The study also analyses the effectiveness of such scaling by comparing the localization accuracy. In next section, the article incorporates security in the proposed cooperative localization approach to detect malicious nodes/anchors by mutual authentication using El Gamel digital Signature scheme. A detailed study of the impact of incorporating security and scaling on average processing time and localization coverage has also been performed. The processing time increased by a factor of 2.5s for 500 nodes (can be attributed to more number of iterations and computations and large deployment area with small radio range of nodes) and coverage remained almost equal, albeit slightly low by a factor of 1% to 2%. Apart from these, the article also discusses the impact of adding extra functionalities in the proposed hybrid fuzzy system based localization scheme on processing time and localization accuracy.Lastly, this study also briefs about how the proposed scalable, cooperative and secure localization scheme tackles the type of attacks that pose threat to localization.
Parallel and Distributed System IEEE 2014 ProjectsVijay Karan
List of Parallel and Distributed System IEEE 2014 Projects. It Contains the IEEE Projects in the Domain Parallel and Distributed System for the year 2014
List of Parallel and Distributed System IEEE 2014 Projects. It Contains the IEEE Projects in the Domain Parallel and Distributed System for the year 2014
The wormhole attack in Wireless sensor networks (WSNs) decreases the network performance by dropping the No. of Packets. Many techniques have been proposed to so far reduce the impact of the wormhole attack by detecting and preventing it. But, related work indicates that no technique is perfect for every kind of circumstances of WSNs. Among the existing techniques, Watchdog technique has better performance in preventing the wormhole attack. It utilizes the local knowledge of the next hop node and eavesdrops it. If it gets that spending time of the Packet is more than the given threshold, then it characterizes that node as wormhole attacker. However, this method has several shortcomings that it does not track the link transmission errors, which may be because of congestion in WSNs and also it not offers high mobility for maximum No. of nodes, which eventually decreases the WSNs performance. In order to handle this issue, a new multipoint relay based Watchdog monitoring and prevention technique is proposed in this paper. The proposed technique utilizes the dynamic threshold value to detect the wormhole attacker node, and then clustering and the Watchdog based optimistic path is selected for communicating the Packets. Thus, it reduces the overall Packet dropping, which improves the performance of the WSNs.
AN EFFICIENT DEPLOYMENT APPROACH FOR IMPROVED COVERAGE IN WIRELESS SENSOR NET...csandit
Wireless Sensor Networks (WSNs) are experiencing a revival of interest and a continuous advancement in various scientific and industrial fields. WSNs offer favorable low cost and readily deployable solutions to perform the monitoring, target tracking, and recognition of physical events. The foremost step required for these types of ad-hoc networks is to deploy all the sensor nodes in their positions carefully to form an efficient network. Such network should satisfy the quality of service (QoS) requirements in order to achieve high performance levels. In
this paper we address the coverage requirement and its relation with WSN nodes placement problems. In fact, we present a new optimization approach based on the Flower Pollination Algorithm (FPA) to find the best placement topologies in terms of coverage maximization. We have compared the performance of the resulting algorithm, called FPACO, with the original practical swarm optimization (PSO) and the genetic algorithm (GA). In all the test instances, FPACO performs better than all other algorithms.
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.
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 PERFORMANCE ENHANCEMENT WITH OPTIMIZATION SENSOR PLACEMENT IN WIRELES...ijwmn
From one side, sensor manufacturing technology and from other side wireless communication technology
improvement has an effect on the growth and deployment of Wireless Network Sensor (WSN). The
appropriate performance of WSN has abundant necessity which has dependent on the different parameters
such as optimize sensor placement and structure of network sensor. The optimized placement in WSN not
only would optimize number of sensors, but also help to reach to the more precise information. Therefore
different solutions are proposed to reduce cost and increase life time of sensor networks that most of them
are concentrated in the field of routing and information transmission. In this paper, places which they need
new sensors placement or sensor movements are determined and then with applying these changes,
performance of WSN will calculate. To achieve the optimum placement, the network should evaluate
precisely and effective criteria on the performance should extract. Therefore the criteria should be ranked
and after weighting with using AHP algorithms, with use of Geographical Information System (GIS), these
weighted criteria will combined and in the locations which WSN doesn’t have enough performance, new
sensor placement will create. New proposed method, improve 21.11% performance of WSN with sensor
placement in the low performance locations. Also the number of added sensor is 26.09% which is lowest
number of added sensors in comparison with other methods.
An Efficient Security Way of Authentication and Pair wise Key Distribution wi...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.
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.
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.
A HYBRID FUZZY SYSTEM BASED COOPERATIVE SCALABLE AND SECURED LOCALIZATION SCH...ijwmn
Localization entails position estimation of sensor nodes by employing different techniques and mathematical computations. Localizable sensors also form an inherent part in the functioning of IoT devices and robotics. In this article, the author extends1 a novel scheme for node localization implemented using a hybrid fuzzy logic system to trace the node locations inside the deployment region, presented by the
Abhishek Kumar et. al. The results obtained were then optimized using Gauss Newton Optimization to improve the localization accuracy by 50% to 90% vis-à-vis weighted centroid and other fuzzy based localization algorithms. This article attempts to scale the proposed scheme for large number of sensor nodes to emulate somewhat real world scenario by introducing cooperative localization in previous presented work. The study also analyses the effectiveness of such scaling by comparing the localization accuracy. In next section, the article incorporates security in the proposed cooperative localization approach to detect malicious nodes/anchors by mutual authentication using El Gamel digital Signature scheme. A detailed study of the impact of incorporating security and scaling on average processing time and localization coverage has also been performed. The processing time increased by a factor of 2.5s for 500 nodes (can be attributed to more number of iterations and computations and large deployment area with small radio range of nodes) and coverage remained almost equal, albeit slightly low by a factor of 1% to 2%. Apart from these, the article also discusses the impact of adding extra functionalities in the proposed hybrid fuzzy system based localization scheme on processing time and localization accuracy.Lastly, this study also briefs about how the proposed scalable, cooperative and secure localization scheme tackles the type of attacks that pose threat to localization.
Parallel and Distributed System IEEE 2014 ProjectsVijay Karan
List of Parallel and Distributed System IEEE 2014 Projects. It Contains the IEEE Projects in the Domain Parallel and Distributed System for the year 2014
List of Parallel and Distributed System IEEE 2014 Projects. It Contains the IEEE Projects in the Domain Parallel and Distributed System for the year 2014
The wormhole attack in Wireless sensor networks (WSNs) decreases the network performance by dropping the No. of Packets. Many techniques have been proposed to so far reduce the impact of the wormhole attack by detecting and preventing it. But, related work indicates that no technique is perfect for every kind of circumstances of WSNs. Among the existing techniques, Watchdog technique has better performance in preventing the wormhole attack. It utilizes the local knowledge of the next hop node and eavesdrops it. If it gets that spending time of the Packet is more than the given threshold, then it characterizes that node as wormhole attacker. However, this method has several shortcomings that it does not track the link transmission errors, which may be because of congestion in WSNs and also it not offers high mobility for maximum No. of nodes, which eventually decreases the WSNs performance. In order to handle this issue, a new multipoint relay based Watchdog monitoring and prevention technique is proposed in this paper. The proposed technique utilizes the dynamic threshold value to detect the wormhole attacker node, and then clustering and the Watchdog based optimistic path is selected for communicating the Packets. Thus, it reduces the overall Packet dropping, which improves the performance of the WSNs.
AN EFFICIENT DEPLOYMENT APPROACH FOR IMPROVED COVERAGE IN WIRELESS SENSOR NET...csandit
Wireless Sensor Networks (WSNs) are experiencing a revival of interest and a continuous advancement in various scientific and industrial fields. WSNs offer favorable low cost and readily deployable solutions to perform the monitoring, target tracking, and recognition of physical events. The foremost step required for these types of ad-hoc networks is to deploy all the sensor nodes in their positions carefully to form an efficient network. Such network should satisfy the quality of service (QoS) requirements in order to achieve high performance levels. In
this paper we address the coverage requirement and its relation with WSN nodes placement problems. In fact, we present a new optimization approach based on the Flower Pollination Algorithm (FPA) to find the best placement topologies in terms of coverage maximization. We have compared the performance of the resulting algorithm, called FPACO, with the original practical swarm optimization (PSO) and the genetic algorithm (GA). In all the test instances, FPACO performs better than all other algorithms.
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.
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 PERFORMANCE ENHANCEMENT WITH OPTIMIZATION SENSOR PLACEMENT IN WIRELES...ijwmn
From one side, sensor manufacturing technology and from other side wireless communication technology
improvement has an effect on the growth and deployment of Wireless Network Sensor (WSN). The
appropriate performance of WSN has abundant necessity which has dependent on the different parameters
such as optimize sensor placement and structure of network sensor. The optimized placement in WSN not
only would optimize number of sensors, but also help to reach to the more precise information. Therefore
different solutions are proposed to reduce cost and increase life time of sensor networks that most of them
are concentrated in the field of routing and information transmission. In this paper, places which they need
new sensors placement or sensor movements are determined and then with applying these changes,
performance of WSN will calculate. To achieve the optimum placement, the network should evaluate
precisely and effective criteria on the performance should extract. Therefore the criteria should be ranked
and after weighting with using AHP algorithms, with use of Geographical Information System (GIS), these
weighted criteria will combined and in the locations which WSN doesn’t have enough performance, new
sensor placement will create. New proposed method, improve 21.11% performance of WSN with sensor
placement in the low performance locations. Also the number of added sensor is 26.09% which is lowest
number of added sensors in comparison with other methods.
An Efficient Security Way of Authentication and Pair wise Key Distribution wi...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.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
This webinar on 10 April 2013 (12:30-1:30pm EDT) provides information for speakers presenting at the 2013 STC Technical Communication Summit in Atlanta, GA. The Summit is 5-8 May 2013, and more information is available at http://summit.stc.org.
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,
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.
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.
Data gathering in wireless sensor networks using mobile elementsijwmn
In this paper, we investigate the problem of designing the minimum number of required mobile elements
tours such that each sensor node is either on the tour or one hop away from the tour, and the length of the
tour to be bounded by pre-determined value L. To address this problem, we propose heuristic-based
solution. This solution works by directing the mobile element tour towards the highly dense area in the
network. The experiment results show that our scheme outperform the benchmark scheme by 10% in most
scenarios.
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.
Ant Colony Optimization for Wireless Sensor Network: A Reviewiosrjce
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.
Improvising Network life time of Wireless sensor networks using mobile data a...Editor IJCATR
Energy consumption becomes a primary concern in a Wireless Sensor Network. To pursue high energy saving at sensor
nodes, a mobile collector should traverse the transmission range of each sensor in the field such that each data packet can be directly
transmitted to the mobile collector without any relay.
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
Electrically small antennas: The art of miniaturizationEditor IJARCET
We are living in the technological era, were we preferred to have the portable devices rather than unmovable devices. We are isolating our self rom the wires and we are becoming the habitual of wireless world what makes the device portable? I guess physical dimensions (mechanical) of that particular device, but along with this the electrical dimension is of the device is also of great importance. Reducing the physical dimension of the antenna would result in the small antenna but not electrically small antenna. We have different definition for the electrically small antenna but the one which is most appropriate is, where k is the wave number and is equal to and a is the radius of the imaginary sphere circumscribing the maximum dimension of the antenna. As the present day electronic devices progress to diminish in size, technocrats have become increasingly concentrated on electrically small antenna (ESA) designs to reduce the size of the antenna in the overall electronics system. Researchers in many fields, including RF and Microwave, biomedical technology and national intelligence, can benefit from electrically small antennas as long as the performance of the designed ESA meets the system requirement.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Knowledge engineering: from people to machines and back
Volume 2-issue-6-2102-2107
1. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 6, June 2013
www.ijarcet.org
2102
Abstract— Through wireless sensor networks, the surveillance
applications are considered where has to choose one path between
a set of candidate sites where to place sensors in order to identify
mobile targets traversing a prearranged region. The existing system
was designed with the intend of minimizing the sensor installation
costs whereas promising that the spotlight of any path is above a
definite threshold, and maximizing the coverage of the least
uncovered paths subject to a resource on the sensors setting up
charges. Through this motivation the Tabu Search heuristics are
employed that are capable of endow with near-optimal resolutions
of the same occurrences in tiny computing occasion in addition
attempt huge size occurrences. The vital descriptions are widened
to account for limitations on the wireless connectivity with assorted
machines and non-uniform sensing. In this there can be an attacker
may be able to capture and compromise mobile nodes, and then
that can be utilized to insert bogus data, interrupt network
functions, and eavesdrop on network communications. To defeat
this problem a novel mobile replica detection system is suggested
based on the Sequential Probability Ratio Test (SPRT). Here the
intuition is exercised that an uncompromised mobile node ought to
shift at speeds exceeding the system-configured maximum speed.
If the outcome is observed that a mobile node’s speed is in excess
of the maximum speed, it is afterward extremely probable that in
any case two nodes with the unchanged identity are present in the
network. Particularly, the SPRT achieves on each mobile node via
a null assumption that the mobile node hasn’t been reproduced and
an exchange hypothesis that it has. The proposed system is also
developed to attain the goal of weighted intrusion detection,and
maximizing the network using game theory approach,life time of
the sensor node is increased. Above all, experimental results
illustrate that proposed scheme very rapidly senses mobile replicas
with zero false positive and negatives. This is essential since the
SPRT is confirmed to be the paramount system in terms of the
number of observations to achieve a decision between all
sequential and non-sequential decision practices.
Keywords: Wireless Sensor Networks, Tabu Search Heuristics
Method, Mobile Targets, Mobile Replica Detection, Sequential
Probability Ratio Test, Mobile Target Detection, Optimization
Resolutions, Game theory
.
Manuscript received June, 2013.
J.Naveen, Computer Science, Anna University Chennai/ A.S.L Paul’s
College Of Engineering And Technology/. Coimbatore,India,9943014326
S.Madhu Priya, Anna University Chennai/ A.S.L Paul’s College Of
Engineering And Technology/ ). Coimbatore,India, 9944403072
INTRODUCTION
One of the main applications of wireless sensor networks is the
target or event detection/tracking. Whereas most of the preceding
work has been on static sensor networks, B. Liu et.al [1] in recent
times it has been exposed that the coverage of a sensor network can
be enhanced by the use of mobility. Mobile robots prepared with
sensors can be positioned for efficient coverage in case of
monitoring in nature inaccessible or hazardous areas. In addition, if
the target or event to be perceived through the sensor network is
about time-critical nature, the coverage of the network should be
adequately high to be able to react to the sensed event in an
appropriate manner; for example wildfire observing or dynamism
detection under ruins in case of an earthquake, where the urgent
situation personnel work in opposition to the timer. Exclusively,
regarded as the subsequent condition: specified a sensor network,
how does one negotiate throughout the sensor field from one point
to another such that the sensors have the least or the majority
coverage of the traveled path. This referred to as the least-covered
path dilemma, signifies the sensor network's worst-case coverage.
Sensor networks are intended to watch the sensor field, and the
least-covered path computes the capability to travel in the sensor
field with not being exposed. Consequently, how one can intend
the sensor network to exploit such least coverage turns into very
important and has concerned important concentration in recent
times [2], [6], [7].
Two well-liked techniques dealing this problem are the
maximum breach path and the minimal exposure path. The
maximum breach path problem looks forward to discover a path
such that the path's maximum exposure to the sensors at some
known point is reduced [7]. The minimal exposure path problem
searches forward to discover a path between two given points such
that the total exposure obtained from the sensors by traversing the
path is reduced [7], [8]. By means of the minimal exposure path
dilemma to assess a network is essential. Previously the minimal
exposure path is recognized; the user can influence sensors in the
network or add sensors to the network to enhance coverage. Still,
with a centralized method to resolve the minimal exposure path
denotes that the moved/added node’s location must be reported to
a central node or to each other node in the network. A
single-point-of-failure trouble occurs if a central node is utilized; if
the new data is disseminated to each other node in the network, the
difficulty of energy utilization turns out to be more significant.
Consequently, we present a localized minimal coverage path
algorithm such that simply adjacent nodes have to be updated and
path information can be considered on-line in an easier and more
competent method.
Even as the least coverage problem receives the distrustful view of
the sensor network design, related to real-time system intends
based on worst-case implementation time analysis, that we call it as
the maximal exposure path problem. A maximal exposure path is
the path of subsequent which the total coverage to the sensors is
IMPLEMENTATION OF MOBILE
TARGET DETECTION IN WIRELESS
SENSOR NETWORKS
J.NAVEEN, S.MADHU PRIYA
2. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 6, June 2013
2103
www.ijarcet.org
exploited; specifically, the path that is best covered by the sensors.
In general, there is a maximum length constriction on the maximal
exposure path or a delay constriction that specifies how long the
object can wait in the sensor field. Or else, one can keep moving
devoid of getting the ending point or stay at a point with optimistic
revelation eternally to build up unlimited coverage. Contrasting the
least coverage problem, that calculates how well the sensor
network monitors its situation, the maximal exposure difficulty,
even if it can be deduced as the best case of coverage, discovers
applications in the environment that can advantage from the
positioned sensors. These applications include, for case, how to
supervise for example collecting information from the sensors, the
sensor network competently and how to obtain the most advantage,
in relation to any predefined benefit function, from the sensors
whereas traversing the sensor field. A more physical example of
using the maximal exposure path to resolve the benefit of a sensor
network is regarding a light-detecting network.
The perception of barrier coverage is established in [14]. An
exciting algorithm to resolve whether a network affords barrier
coverage is presented. Acentralized, most favorable sleep-wake up
algorithm for achieving global barrier coverage is suggested in
[15]. The notion of local barrier coverage is projected in [11]. This
new notion of barrier coverage is basically more interesting than
the original barrier coverage, and it facilitates the authors of [11] to
enlarge localized sleep-wake up algorithms that affords
near-optimal performance, even as ensuring global barrier
coverage usually. The dilemma of deriving a dependable
approximation for ensuring 1-barrier coverage in a random
deployment is resolved in [9]. Several articles have conferred the
difficulty of total sensors to an obtainable operation to attain a
variety of properties, typically k-connectivity. In [10], an algorithm
is projected that calculates the minimum number of extra sensors
wanted to construct a sensor network k-connected. The excellence
of k-connectivity measured there is either 1 or 0, which is yes, it is
k-connected" or no, it is not." The metric of k redundancy is
initiated in [16] to compute the local quality of k-connectivity; extra
nodes (robots) are additional to expanses with low redundancy.
Our work splits with [16] a similar support of measuring local
excellence and recognizing areas that require repair.
Schillings and Yang et.al [20] utilized the GT framework to
construct a query-based Versatile Game Theoretic Routing
Protocol (VGTR) to achieve the extraction of data from WSN.
Three payoff functions are exercised. The first two represent node
survivability and the third one corresponds to the importance of the
information collected. Node survivability signifies the competence
of a node to continue in contact with the Sink for given that
possible. To make clear these three payoff functions obviously,
several definitions were utilized, for example Upstream Potential
Path Nodes (UPPN) Robustness, and Neighbor Robustness.
Affecting goals can be measured as intelligent agents and this
characteristic frequently augments the tracking complexity.
Conversely, sensor nodes only have limited wireless
communication competence. Consequently, there is a want to
discover a way to cooperate proficiently in target assessment. Gu
et.al [21] applied a zero-sum game approach to the estimation of
target position. The minimax filter is assembled to reduce the
opinion error under the worst case noise; as a result it is robust to
the adversary tracking complexity obligatory by moving targets.
The work also developed a dispersed version of the minimax filter
with an enhanced routine.
In our advance, we believe two main objects: minimizing the
number of nodes positioned and maximizing the revelation of the
least-exposed path. Given these complementary purposes, we
suggest and examine two WSN planning dilemmas. In the first one,
sensors must be situated with the intention of exploiting the
coverage of the least-exposed path, because of experience
resources on the installation cost with the number of sensors also
the size of the sensors is reduced. In the second one, sensors have
to be situated in order to diminish the mechanism cost, offered that
the revelation of the least-exposed path is above a given threshold.
The game theory is integrated to examine the coverage difficulties
in Wireless Sensor Networks (WSN) in this manuscript. GCC
(Game-theoretical Complete Coverage) algorithm is utilized to
guarantee whole network coverage essentially from side to side
regulating the covering range of nodes and calculating the network
redundancy. After this, by scheming appropriate cost and
usefulness function for every node, simulations establish the
competence and applicability of GCC algorithm and also motivate
that GCC is an outstanding way for time scheduling and
maintenance Network Integrity.
The remainder of the paper is discussed as follows: Section 2
describes the previous work and the methods are explained.
Section 3 deals with the proposed work and algorithm. In section 4
the results of the approach are explained and the comparison
results are described. The conclusion and future of the work are
explained in section 5.
PREVIOUS WORK
The concept of exposure [25] has been initiated to give a
quantitative measure of the excellence of WSNs for the recognition
of mobile objects traversing areas of concentration along a given
path. Instinctively, the more depiction a path is, the better the
coverage offered by the WSN, and the higher the probability to
notice the mobile object touching along that path. The formal
definition of experience perceptibly depends on the specific sensing
model accepted and the way in which sensed data are utilized for
discovery. A common sensing model presumes that the sensing
machine is based on the energy of a signal established from the
purpose that is the signal can be either produced or just reflected by
the target [17]. Given a location in the monitored area, the energy
of the signal expected by a sensor at position from a target in
is , where is the geometric distance between
locations and , is the energy emitted by the target, and is an
energy decay factor. Since the exposure value of the least-exposed
path is a measure of the vulnerability level of the network,
maximizing this value is one of the objectives of the network
planning problem. Clearly, another objective is to minimize the
installation cost, which is directly related to the number of sensors
deployed.
Fig 1: Distributed Wireless Sensor Network Environment
Thus, we address two versions of the problem: maximizing the
exposure of the least-exposed path subject to a budget constraint on
the cost, and minimizing the installation cost while guaranteeing
that all paths have an exposure value above a given threshold. It is
3. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 6, June 2013
www.ijarcet.org
2104
worth pointing out that the two versions deriving from the two
contrasting objectives differ substantially. Note that the budget
constraint is not tight in the exposure maximization problem. This
leads to different duality properties, requires changes in the design
of the related heuristics, and implies higher solution times. By
adding constraints to these two basic versions, we can easily ensure
wireless communications among the sensors. Given a sensor layout
(a set of sensors located in a subset of candidate sites (CSs)) and
their transmission ranges, consider the communication graph
where sensors are connected by a link if they are in range. An
additional node of the graph represents the sink device where all
data must be delivered. To guarantee communication, a sensor
layout must correspond to a connected communication graph. To
account for resiliency to failures, we may require -connectivity.
Based on the same graph, we can also include capacity constraints
on the node traffic, corresponding to limited transmission rates on
the radio channel and/or to energy consumption limitations.
Moreover, practical surveillance systems may integrate multiple
types of sensing devices running different sensing technologies,
with different capability/accuracy, as well as different installation
costs. To this extent, we show how the basic optimization
formulation can be extended to plan such heterogeneous systems,
capturing further degrees of freedom.
Given the area of interest, let denote the set of all CSs where
sensors can be installed. The area is approximated by a grid on
which targets can move. The grid graph is defined as
follows. The vertex set includes one vertex for each grid
intersection point and two distinguished vertices and that
represent the virtual origin and, respectively, destination of any
path. The arc set includes two arcs and for each grid
edge , the incoming/outgoing arcs connecting to the leftmost
column vertices of the grid, and the rightmost column vertices to ,
respectively. Note that CSs are not forced to lie on the grid. They
can be positioned in any position of the area surrounding the grid,
according to the available installation sites. Without loss of
generality, we assume that is a square grid of size . Given
an illustration defined by with two special vertices and
and a budget value , the first vital adaptation of the difficulty
consists in deciding where to launch the sensors so as to exploit the
exposure of the least-exposed path from two while guaranteeing a
total installation cost of at most . To obtain a mathematical model
for this difficulty version, we believe the decision variables: ,
which is equal to if a sensor is installed in candidate site ,and
or else; ,which is equal to if arc belongs to the least-exposed
path and or else; and the nonnegative continuous variable that
expresses the exposure of the least-exposed path. These variables
cause the following formulation: ,
.
With the intention of avoiding cycling by believing feasible
solutions that have previously been produced and try to run off
from local maxima, a list of “tabu moves” is preserved. If the length
of the list and the move approved out at a given iteration, the
opposite of is forbidden (tabu) for the next iterations, until it is
detached from the list. In accordance with the “aspiration criteria,”
tabu moves can be obviously made if they cause a best found
solution. The best solution encountered throughout the search
procedure is accumulated and revisited subsequent to a maximum
number of iterations . The tabu list is applied in a simple way:
Sensors that are deleted cannot be reinstalled through iterations.
To support search diversification, if the best solution found in the
neighborhood does not improve the current solution throughout
moves, a random swap is carried out: A randomly chosen sensor is
removed from , while a sensor is installed in an empty CS
chosen at random. We now consider the version of the intrusion
detection problem with the objective of maximizing the detection
probability of a mobile target that traverses the protected area,
subject to a budget constraint on the total sensors’ installation cost.
More precisely, we want to maximize the detection probability of
any path with the lowest in the underlying grid .
Fig 2: MILP formulation
Along with the possible heuristics able to resolve our
optimization difficulty, we prefer in this paper the Tabu Search
method [18, 19]. This method is a local search optimization method
which tries to diminish a cost function ), where signifies a
parameter vector, by iteratively moving from a elucidation to a
elucidation in the neighborhood of x according to a
neighborhood function until a stopping criterion is satisfied
or a predetermined number of iterations is reached. The Tabu
Search algorithm is independent of the event detection model. This
model gives input parameters to the method, though some other
detections models can be utilized. To deal with large-size instances
of both formulations, we have developed Tabu Search (TS)
algorithms. TS is a metaheuristic that guides a local search process
to discover the solution space of optimization problems beyond
local optima, which has been effectively adapted to a number of
other challenging network design troubles. Starting from an initial
feasible solution , a set of neighboring solutions is
produced by concerning a set of possible “moves” to . Then, the
best solution in the “neighborhood” is selected as the next
iteration , even if it does not strictly improve the value of the
objective function. The process is iterated to generate a sequence of
solutions { }.The rationale is to try to improve an initial solution
by iteratively installing and removing sensors chosen on the basis
of their revelation contribution to a least-exposed path of the
current solution.
4. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 6, June 2013
2105
www.ijarcet.org
Fig 3: Heuristic Algorithm for Formulation
Game theory based intrusion detection schemes in WSN
The concentrate of the interaction among the intrusion detection
negotiator and the attacker can be signified systematically by a
game between two players. In these games, different strategies can
be exercised by the intrusion detection agent with the aim of secure
beside the different strategies that attackers always exploit. In the
following, some game speculative based intrusion detection
schemes in WSNare presented. The flexibility, fault tolerance, high
sensing reliability, low-cost and rapid exploitation characteristics
of WSNs are popular features in creating many new and exciting
application areas for remote sensing, perceiving, tracking, and
observing. But, it is non-trivial and very concerned to devise an
optimal WSN to persuade performance ideas for example
maximum sensing coverage and extended operating periods. With
the intention of attaining a practical and feasible WSN and because
of the operation nature of the network, game theory (GT) is
considered as an attractive and a suitable basis to achieve the design
goal. Game theory is a division of mathematics and can be
exercised to examine system operations in dispersed and
self-organizing networks. GT illustrates the behavior of players in
a game. Players may be either cooperate or non-cooperative even
as determined to exploit their results from the game.
In this view, sensors manage their processes in terms of power
resources distributed to sensing and communicating between
themselves and with a global regulator such that the dispatched
assignment could be talented proficiently as favored [23]. Game
theory is regularly attracting more attention as a method to resolve
various problems in WSNs [23][24]. Typically, a game consists of
a set of players, a set of strategies for each player and a set of
equivalent utility functions. A model form game of a WSN of n
sensor nodes is specified by a 3-tuple Here, G is
a particular game, where N = {n1, n2, …, nn} is a finite set of the
sensor nodes. S = {S1, S2, …, Sn}, is the strategy space of the sensor
node i can select from is represented by Si (i = 1, 2, …, n). U = {u1,
u2, …, un} is the subsequent payoff function of node i symbolized
by ui (i = 1, 2, …, n), ui is a utility value of each node obtains at the
end of an action.
An approach for a player is an absolute plan of exploits in all
possible circumstances in the game. The players attempt to act
egoistically to make the most of their significances according to
their preferences. We have to devise the payoff functions in a way
that will help node i to select a strategy Si that stands for the best
reaction to the strategies selected by the other n-1 nodes. Here, si is
the particular strategy selected by node i and s-i is the particular
strategies selected by all of the other nodes in the game. For
strategies s = {si, s−i}, it is described a strategy profile or on occasion
a strategy combination. Each different combination of individual
options of strategies can construct a different strategy profile. The
strategy profile s = {s1, s2, …, sn ∣ si ∈ Si, i = 1, 2, …, n} requires to
position the nodes responding to a Nash Equilibrium (NE). It is a
solution perception that explains a steady state condition of a game
connecting two or more players, in which each player is
unspecified to know the equilibrium strategies of the other players,
and no player has whatever thing to achieve by changing only its
own strategy independently. NE is distinguished wherein no nodes
will sensibly prefer to turn aside from his selected strategy
otherwise it will diminish its utility, i.e., ui (si, s-i) ≥ ui (si*, s-i) for all
si* ∈ Si.
A utility function describing player favorites for a given player
allocates a number for every probable result of the game with the
belongings that a higher number implies that the effect is more
favored. In literature [25], the utility is described as:
Where ui (si, s−i) can be believed as the utility of node i
transmitting information to a node j, b is the number of information
bits in a packet of size F bits, r is the transmission rate in bits/sec
using strategy si, and f (γj) is efficiency function which enlarge with
predictable SINR of the receiving node. The effectiveness purpose
is identified as:
Where is the bit error rate which depends on the channel state
and interference from other nodes
Mechanism design not only gives the right incentives, but also to
make certain the participants tell the truth. It can balance individual
interests and common interests. The following terms related to the
mechanism:
Definition 1 (Mechanism): Mechanism can be
expressed as M = (λ, P), where M means some kind of
mechanism, λ is the output function, λ = λ (λ1, λ2, …,λn),
P is the payment function, P = P (P1 (λ), P2 (λ), …, Pn
(λ)).
Definition 2 (Strategy proof Mechanism): In the
mechanism M, any agent i, its true value ti, the bid vector
b−i, agent i in order to obtain maximum profit only by
submitting a real bid (i.e., bi = ti), the method is strategy
proof.
Definition 3 (Voluntary participation condition): In
the mechanism M, any agent i, as long as it honestly bid,
it cannot get negative profits, then this mechanism to
meet the voluntary participation condition.
In a method, a member is identified an agent, there are usually n
agents, each agent i (i = 1,2,…,n) has some private information
which is recognized as the type of the agent or called the true value
ti, the private value is merely identified by agent, and is secret for
the other agents. For instance, the type of an agent ti can be the cost
executing a consigned task. vi (ti, λ) is the value function of an agent
i, said the cost of executing a task. pi (·) is the payment function for
agent performing a task. ui (·) is the utility function of an agent, that
ui (·) = pi (·) − vi (ti, λ). ti is the true value, and i is the execution
value [55]. Define vector t = (t1,t2,…,tn), b = (b1,b2,…,bn), = 1, 2,
…, n), and the output vector λ (b) = (λ1 (b), λ2 (b),…, λn (b)).
Vector b-i does not include the value bi, which is b = (b−i, bi). In a
mechanism design, strategy proof situation will construct all
participants’ description their true value and voluntary
involvement condition can make sure that all participants are eager
to contribute.
5. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 6, June 2013
www.ijarcet.org
2106
Fig 4: Intrusion Detection With HA With GT
The algorithm can comprise a weighted computation under the
assumption that nearby nodes have greater effects than far away
nodes, specifically giving the instantaneous neighbor the highest
values in evaluating the intrusion detection states.
EXPERIMENTAL RESULTS AND DISCUSSION
The comparison is based on different metrics as the number of
sensors deployed, packet delivery, and hop. For a regular
exploitation we prefer a grid topology, so the shape is rectangular.
We standardized the Tabu search process by fixing the number of
iterations, the size of the Tabu list and the size of neighborhood
investigated. For results of stochastic deployment strategies (Tabu
Search and Random) we fixed a confidence level to 99:75%. Figure
5 shows the deployed sensor locations obtained by our Tabu
Search approach. The number of nodes is represented in Xaxis and
the delay in seconds represents in Y axis. The delay for the
proposed is less when compared with the existing system.
Fig 5: Delay comparison graph
Figure 6 shows the hop value of the sensor node with respect to
the end to end distance. From the graph it can be said that as the
network distance increases the energy consumed by the node also
increases. It is so because when the node distance is improved
the number of hop increases that is the transmitting and processing
power increases relative. From the graph we can say that the HA
with GT algorithm works better than the HA algorithm.
Fig 6: Hop based comparision
The packet delivery ratio is defined as the ratio of data packets
received by the destinations to those produced from the sources.
Mathematically, it can be defined as: PDR= S1÷ S2 Where, S1 is the
sum of data packets accepted by the each destination and S2 is the
sum of data packets produced by the each source. The Figure 7
shows the fraction of data packets that are successfully
delivered during simulation time versus the number of nodes.
Fig 7: Packet Delivery Comparision
CONCLUSION
This paper has reviewed the recent developments in Game
Theory for Wireless Sensor Networks. GT has the capability to
observe a larger amount of probable scenarios before performing
the action. Like a modeling tool, GT can make a decision procedure
more sophisticated. The potential of applying GT to WSNs is
forthcoming. In this paper, we concentrated on the intrusion
detection problem in heterogeneous networks consisting of nodes
with diverse security advantages. We devised the interaction
between the attackers and the defenders as a noncooperative game
and achieved an in-depth analysis on the NE and the engineering
implications behind it. Founded on our game theoretical analysis,
we derived expected behaviors of rational attackers. The
experimental results show that the proposed work is 99.75% better
than the existing method.
REFERENCES
1. B. Liu, P. Brass, O. Dousse, P. Nain, and D. Towsley, “Mobility
Improves Coverage of Sensor Networks,” in Proc. ACM Int’l.
Symp. Mob. Ad hoc Net. Comp. (ACM MobiHoc’05), pp.
300-308, 2005.
2. Dhillon, S. S., Chakrabarty, K., Iyengar, S. S. "Sensor
Placement for Grid Coverage under Imprecise Detections."
FUSION 2002.
3. Estrin, D., Govindan, R., Heidemann, J."Embedding the
Internet." Communications of the ACM 2000.
6. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 6, June 2013
2107
www.ijarcet.org
4. Garey, M.R. and Johnson, D.S. “Computers and Intractability: A
Guide to the Theory of NPCompleteness.” W.H. Freeman and
Company, 1979.
5. Gelfand, M. Fomin, S. "Calculus of Variations." Prentice-Hall
Inc. 1963.
6. Li, X., Wan, P., Frieder, O. "Coverage Problems in Wireless
Ad-Hoc Sensor Networks." IEEE Transactions for Computers
2002.
7. Megerian, S., Koushanfar, F., Qu, G., Potkonjak, M. "Exposure
in Wireless Sensor Networks." MobiCom 2001.
8. Megerian, S., Koushanfar, F., Potkonjak, M.,Srivastava,
M."Coverage Problems in Wireless AdHoc Sensor
Networks."IEEE Infocom 2001
9. P. Balister, B. Bollobas, A. Sarkar, and S. Kumar,”Reliable
Density Estimates for Achieving Coverage and Connectivity
in Thin Strips of Finite Length. In Proc. of ACM Mobicom'07,
Canada, September 2007.
10. J. L. Bredin, E. D. Demaine, M. Hajiaghayi, and D. Rus,
“Deploying Sensor Networks with Guaranteed Capacity and
Fault Tolerance”, In Proc. of ACM MobiHoc'05, 2005.
11. Chen, S. Kumar, and T. H. Lai,”Designing Localized
Algorithms for Barrier Coverage. In Proc. of ACM
Mobicom'07, Canada, September 2007.
12. Y. Gao, K. Wu, and F. Li. “Analysis on the Redundancy of
Wireless Sensor Networks. In Proc. of ACM WSNA'03, 2003.
13. R. Iyengar, K. Kar, and S. Banerjee,”Low-Coordination
Topologies for Redundancy in Sensor Networks”, In Proc. of
MobiHoc'05, 2005.
14. S. Kumar, T. H. Lai, and A. Arora, “Barrier Coverage with
Wireless Sensors”, In Proc. of ACM MobiCom'05, 2005.
15. S. Kumar, T. H. Lai, M. E. Posner, and P. Sinha,”Optimal
Sleep Wakeup Algorithms for Barriers of Wireless Sensors”,
In Proc. of BROADNETS'07, 2007.
16. N. Atay and B. Bayazit,“Mobile Wireless Sensor Network
Connectivity Repair with K-Redundancy”, Technical report,
Washington University in St. Louis.
17. S. Meguerdichian, F. Koushanfar, G. Qu, and M. Potkonjak,
“Exposure in wireless ad hoc sensor networks,” in Proc. ACM
MobiCom, 2001, pp. 139–150.
18. Y. C. Wang and Y. C. Tseng, “Distributed deployment
schemes for mobile wireless sensor networks to ensure
multilevel coverage,” IEEE Trans. Parallel Distrib. Syst., vol.
19, no. 9, pp. 1280–1294, Sep. 2008.
19. F.G.Nakamura,F.P.Quintao,G.C.Menezes,and
G.R.Mateus,“An optimal node scheduling for flat wireless
sensor networks,” Lecture Notes Comput. Sci., vol. 3420, pp.
475–482, 2005.
20. Apt K., Witzel A. "Ageneric approach to coalition formation",
Proceedings of the International Workshop Computational
Social Choice (COMSOC);Amsterdam, The Netherlands. 6–8
December 2006.
21. Gu D. "A game theory approach to target tracking in sensor
networks". IEEE Trans. Syst. Man Cyber. B Cybern.
2011;41:2–13
22. Kazemeyni F., Johnsen E., Owe O., Balasingham I. "Group
Selection by Nodes in Wireless Sensor Networks Using
Coalitional Game Theory". Proceedings of 2011 16th IEEE
International Conference on Engineering of Complex
Computer Systems (ICECCS 2011); Las Vegas, NV, USA.
27–29 April 2011.
23. Kannan R., Sarangi S., Iyengar S.S. "Sensor-centric
energy-constrained reliable query routing for wireless sensor
networks". J. Paral. Distrib. Comput. 2004;64:839–852
24. Wang W., Li X. "Low-cost routing in selfish and rational
wireless ad hoc networks", IEEE Trans. Mobile Comput.
2006;5:596–607
25. Sengupta S., Chatterjee M., Kwiat K. "A game theoretic
framework for power control in wireless sensor networks".
IEEE Trans. Comput. 2010;59:231–242
26. McCune J.M., Shi E., Perrig A., “Reiter M. Detection of
denial-of-message attacks on sensor network broadcasts”.
Proceedings of 2005 IEEE Symposium on Security and
Privacy; Oakland, CA, USA. 8–11 May 2005.
27. Kodialam M., Lakshman T.V. “Detecting network intrusions
via sampling: A game theoretic approach”. Proceedings of
Annual Joint Conference of the IEEE Computer and
Communications (INFOCOM 2003); 30 March–3 April 2003.
28. Maskery M., Krishnamurthy V. “Decentralized adaptation in
sensor networks: Analysis and application of regret-based
algorithms”. Proceedings of 2007 46th IEEE Conference on
Decision and Control; New Orleans, LA, USA. 12–14
December 2007.
29. Czarlinska A., Luh W., Kundur D. “Attacks on sensing in
hostile wireless sensor-actuator environments”. Proceedings
of Globecom 2007: 2007 IEEE Global Telecommunications
Conference; Washington, DC, USA. 26–30 November 2007.
30. Ren H., Meng M., Chen X. “Cross-layer optimization schemes
for wireless biosensor networks”. Proceedings of 6th World
Congress on Intelligent Control and Automation; Dalian,
China. 21–23 June 2006.
31. Li X., Lyu M.R. “A novel coalitional game model for security
issues in wireless networks”. Proceedings of 2008 IEEE
Global Telecommunications Conference; New Orleans, LA,
USA. 30 November–4 December 2008.
32. Wang W., Chatterjee M., Kwiat K. “Coexistence with
Malicious Nodes: A Game Theoretic Approach”. Proceedings
of International Conference on Game Theory for Networks
(GameNets '09); Istanbul, Turkey. 13–15 May 2009; pp.
277–286.
J.NAVEEN Received his B.E Computer Science &
Engineering From Anna University, Chennai in 2008 and
Pursuing M.E Computer Science & Engineering From
Anna University, Chennai, India His PG Project interest
are In the area of Wireless sensor network’s