This document proposes modifications to the physical and data link layers to improve resistance against jamming attacks in wireless sensor networks. In the physical layer, an uncorrelated groups based direct sequence spread spectrum technique is proposed where sequences are grouped and selected randomly to spread messages. In the data link layer, two modifications to the SMAC protocol are proposed: 1) Data Packet Separation Slot Size Randomization, which separates data packets to mislead jammers' estimation of slot size, forcing them to deplete power more quickly. 2) Maximum Covers using Mixed Integer Programming algorithm, which aims to minimize energy consumption while scheduling network tasks. Simulation results show the proposed techniques can achieve over 8% reduction in an attacker's lifetime advantage compared to
The document analyzes the likelihood of intruder detection in wireless sensor networks (WSNs) distributed uniformly, Gaussianly, and cohesively. It finds that cohesive networks have the highest detection likelihood as sensing range increases, followed by Gaussian and uniform distributions. The detection probability is calculated for single and multiple sensor detection models under varying parameters like sensing range, number of sensors, and intrusion distance. Clustering sensors improves energy efficiency without impacting intruder detection performance.
Selective jamming attack prevention based on packet hiding methods and wormholesIJNSA Journal
Because of the widespread use of wireless sensor ne
tworks in many applications, and due to the nature
of
the specifications of these networks (WSN) in terms
of wireless communication, the network contract
specifications, and published it in difficult envir
onments. All this leads to the network exposure to
many
types of external attacks. Therefore, the protectio
n of these networks from external attacks is consid
ered the
one of the most important researches at this time.
In this paper we investigated the security in wirel
ess
sensor networks, Limitations of WSN, Characteristic
Values for some types of attacks, and have been
providing protection mechanism capable of detecting
and protecting wireless sensor networks from a wid
e
range of attacks
The document discusses a machine learning-based technique for detecting wormhole attacks in wireless sensor networks. It proposes using a multipoint relay-based Watchdog monitoring and prevention protocol. The technique will use a dynamic threshold to detect wormhole attacker nodes. Then, clustering and Watchdog-based optimistic path selection will be used to communicate packets and reduce packet dropping, improving the network's performance. The approach aims to address limitations of existing Watchdog techniques, such as not being able to distinguish collisions from attacks. It incorporates a cooperative cross-layer monitoring framework to handle falsely reported attacks.
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
Malicious attack detection and prevention in ad hoc network based on real tim...eSAT Journals
Abstract This paper deals with Real Time Operating System (RTOS) based secure wormhole detection and prevention in ad hoc networks. The wormhole attack can form a serious threat to wireless networks, especially against many ad hoc network routing protocols and location based wireless security systems. A wormhole is created in the ad hoc network by introducing two malicious nodes. These two nodes form a worm hole link and message is transmitted through this link. The next part of the work is to detect the wormhole link by defining worm hole detection and prevention algorithm. After detecting suspicious links, one node performs a verification procedure for each suspicious link. The detection procedure and verifying procedure of suspicious worm link are used for further prevention of wormhole attack in the ad hoc network.
Review of Deep Neural Network Detectors in SM MIMO Systemijtsrd
A deep neural network detector for SM MIMO has been proposed. Its detection principle is deep learning. For this a neural network must be trained first, and then used for detection purpose. It doesn’t need any channel model and instantaneous channel state information CSI . It can provide better bit error performance compared with conventional viterbi detector VD and also it can detect any length of sequences. For a MIMO system, the channel estimation complexity can be avoided. It can detect in real time as arrives the receiver. The main benefit is it can be used where the channel model is difficult to design and also the channel is continuously varying with time. Ruksana. P | Radhika. P "Review of Deep Neural Network Detectors in SM-MIMO System" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-3 , April 2020, URL: https://www.ijtsrd.com/papers/ijtsrd30535.pdf Paper Url :https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/30535/review-of-deep-neural-network-detectors-in-smmimo-system/ruksana-p
Performance analysis of papr reduction techniques in multicarrier modulation ...eSAT Journals
Abstract Orthogonal FrequencyDivisionMultiplexing (OFDM) is one of the many multicarrier modulation techniques which provide high spectral efficiency, less vulnerability to echoes,low implementation complexity and resilience to non – linear distortion. It is used in communication systems due to its various advantages. However, while this system is implemented problem of high peak – to – average power ratio(PAPR) is encountered. The reason behind this drawback is the existence of manyindependent subcarriers, due towhichthesignal amplitudecanhavehighpeakvalues as compared to average of whole system. The high PAPR in multicarrier transmission systems causes power degradation and spectrum spreading.Interleaving, Tone Reservation, Peak Reduction Carrier,Block Coding, Active Constellation Extension, Envelope ScalingareamongmanyPAPRreductionschemesthathavebeenproposedas a remedy to thisproblem. In this paper, performances of Amplitude Clipping and Filtering, Selected Level Mapping (SLM), and PartialTransmitSequence (PTS) techniques of PAPR reduction in OFDM systems by parameter variations are analyzed, based on Complementary Cumulative Distribution Function. An attempt has been made to simulate clipping and filtering technique with iterations and the simulation shows that PAPR problem is reduced as number of iterations increases. The attempts have also been made to simulate SLM technique and PTS technique by varying number of phase sequences, number of sub-blocks in SLM, PTS respectively and simulation results shows that by increasing the number of phase sequences, sub-blocks, PAPR can be reduced significantly.The mathematical equations are incorporated here to compute the maximum expected PAPR from an OFDM signal which shows when there is phase alignment of all sub carriers and sub carriers are equally modulated, then signal peak value hits the maximum. Besides these computer simulations, a comparative study of these three techniques is done.
The document analyzes the likelihood of intruder detection in wireless sensor networks (WSNs) distributed uniformly, Gaussianly, and cohesively. It finds that cohesive networks have the highest detection likelihood as sensing range increases, followed by Gaussian and uniform distributions. The detection probability is calculated for single and multiple sensor detection models under varying parameters like sensing range, number of sensors, and intrusion distance. Clustering sensors improves energy efficiency without impacting intruder detection performance.
Selective jamming attack prevention based on packet hiding methods and wormholesIJNSA Journal
Because of the widespread use of wireless sensor ne
tworks in many applications, and due to the nature
of
the specifications of these networks (WSN) in terms
of wireless communication, the network contract
specifications, and published it in difficult envir
onments. All this leads to the network exposure to
many
types of external attacks. Therefore, the protectio
n of these networks from external attacks is consid
ered the
one of the most important researches at this time.
In this paper we investigated the security in wirel
ess
sensor networks, Limitations of WSN, Characteristic
Values for some types of attacks, and have been
providing protection mechanism capable of detecting
and protecting wireless sensor networks from a wid
e
range of attacks
The document discusses a machine learning-based technique for detecting wormhole attacks in wireless sensor networks. It proposes using a multipoint relay-based Watchdog monitoring and prevention protocol. The technique will use a dynamic threshold to detect wormhole attacker nodes. Then, clustering and Watchdog-based optimistic path selection will be used to communicate packets and reduce packet dropping, improving the network's performance. The approach aims to address limitations of existing Watchdog techniques, such as not being able to distinguish collisions from attacks. It incorporates a cooperative cross-layer monitoring framework to handle falsely reported attacks.
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
Malicious attack detection and prevention in ad hoc network based on real tim...eSAT Journals
Abstract This paper deals with Real Time Operating System (RTOS) based secure wormhole detection and prevention in ad hoc networks. The wormhole attack can form a serious threat to wireless networks, especially against many ad hoc network routing protocols and location based wireless security systems. A wormhole is created in the ad hoc network by introducing two malicious nodes. These two nodes form a worm hole link and message is transmitted through this link. The next part of the work is to detect the wormhole link by defining worm hole detection and prevention algorithm. After detecting suspicious links, one node performs a verification procedure for each suspicious link. The detection procedure and verifying procedure of suspicious worm link are used for further prevention of wormhole attack in the ad hoc network.
Review of Deep Neural Network Detectors in SM MIMO Systemijtsrd
A deep neural network detector for SM MIMO has been proposed. Its detection principle is deep learning. For this a neural network must be trained first, and then used for detection purpose. It doesn’t need any channel model and instantaneous channel state information CSI . It can provide better bit error performance compared with conventional viterbi detector VD and also it can detect any length of sequences. For a MIMO system, the channel estimation complexity can be avoided. It can detect in real time as arrives the receiver. The main benefit is it can be used where the channel model is difficult to design and also the channel is continuously varying with time. Ruksana. P | Radhika. P "Review of Deep Neural Network Detectors in SM-MIMO System" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-3 , April 2020, URL: https://www.ijtsrd.com/papers/ijtsrd30535.pdf Paper Url :https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/30535/review-of-deep-neural-network-detectors-in-smmimo-system/ruksana-p
Performance analysis of papr reduction techniques in multicarrier modulation ...eSAT Journals
Abstract Orthogonal FrequencyDivisionMultiplexing (OFDM) is one of the many multicarrier modulation techniques which provide high spectral efficiency, less vulnerability to echoes,low implementation complexity and resilience to non – linear distortion. It is used in communication systems due to its various advantages. However, while this system is implemented problem of high peak – to – average power ratio(PAPR) is encountered. The reason behind this drawback is the existence of manyindependent subcarriers, due towhichthesignal amplitudecanhavehighpeakvalues as compared to average of whole system. The high PAPR in multicarrier transmission systems causes power degradation and spectrum spreading.Interleaving, Tone Reservation, Peak Reduction Carrier,Block Coding, Active Constellation Extension, Envelope ScalingareamongmanyPAPRreductionschemesthathavebeenproposedas a remedy to thisproblem. In this paper, performances of Amplitude Clipping and Filtering, Selected Level Mapping (SLM), and PartialTransmitSequence (PTS) techniques of PAPR reduction in OFDM systems by parameter variations are analyzed, based on Complementary Cumulative Distribution Function. An attempt has been made to simulate clipping and filtering technique with iterations and the simulation shows that PAPR problem is reduced as number of iterations increases. The attempts have also been made to simulate SLM technique and PTS technique by varying number of phase sequences, number of sub-blocks in SLM, PTS respectively and simulation results shows that by increasing the number of phase sequences, sub-blocks, PAPR can be reduced significantly.The mathematical equations are incorporated here to compute the maximum expected PAPR from an OFDM signal which shows when there is phase alignment of all sub carriers and sub carriers are equally modulated, then signal peak value hits the maximum. Besides these computer simulations, a comparative study of these three techniques is done.
Elimination of wormhole attacker node in manet using performance evaluation m...Alexander Decker
This document summarizes a research paper that proposes a new method for detecting wormhole attacker nodes in mobile ad hoc networks (MANETs). The method detects malicious nodes based on analyzing hop counts and time delays in routes, without requiring any special hardware or protocol modifications. The proposed method is simulated using OPNET software with scenarios of 50 nodes, both with and without wormhole attacks. The results show that without prevention, a wormhole attack decreases average hop count and increases delays. However, when the proposed method is applied, it is able to detect the attacker nodes and avoid their paths, regaining normal hop counts and delays.
VIRTUAL ARCHITECTURE AND ENERGYEFFICIENT ROUTING PROTOCOLS FOR 3D WIRELESS SE...ijwmn
This paper proposes a virtual architecture for three-dimensional (3D) wireless sensor networks (WSNs), a dynamic coordinate system, and a scalable energy-efficient training protocol for collections of nodes deployed in the space that are initially anonymous, asynchronous, and unaware of their initial location. The 3D WSNs considered comprise massively deployed tiny energy-constrained commodity sensors and one or more sink nodes that provide an interface to the outside world. The proposed architecture is a generalization of a two-dimensional virtual architecture previously proposed in the literature, in which a flexible and intuitive coordinate system is imposed onto the deployment area and the anonymous nodes are partitioned into clusters where data can be gathered from the environment and synthesized under local control. The architecture solves the hidden sensors problem that occurs because of irregularities in rugged deployment areas or environments containing buildings by training the network of nodes arbitrarily dispersed in the 3D space. In addition, we derive two simple and energy-efficient routing protocols, respectively for dense and sparse networks, based on the proposed dynamic coordinate system. They are used to minimize the power expended in collecting and routing data to the sink node, thus increasing the lifetime of the network.
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,
This document discusses the application of machine learning techniques in physical layer communication. It outlines the fundamentals and limitations of classical approaches to physical layer communication. It then introduces multi-layer perceptrons and recurrent neural networks as machine learning methodologies that can be applied. Specific use cases of machine learning for MIMO detection and modulation classification are discussed. The conclusion is that while classical approaches face limitations, machine learning shows promise in helping to solve physical layer communication problems, especially as more training data becomes available.
A Fuzzy Based Priority Approach in Mobile Sensor Network CoverageIDES Editor
In this paper a new fuzzy based approach for
improving network coverage in wireless mobile sensor
networks is proposed. In the proposed approach firstly
each mobile sensor node determines its neighbors and its
distance from borders and obstacles. According to these
values, fuzzy inference engine calculates the priority of
node for movement. Then according to the priority, in
turn, nodes move away from each other to increase
coverage area in the target field. Simulation results show
that our fuzzy approach can reach higher degree of
coverage against other common approaches like FOA,
VEC and TRI algorithms.
BLACK HOLE ATTACKS MITIGATION AND PREVENTION IN WIRELESS SENSOR NETWORKAM Publications
Wireless Sensor Network consists of nodes which communicate with each other with wireless
channel. A general conception of wireless sensor network (WSN) nodes is static and it remains fixed in their
position. It has been deployed in dominant manner for a long period of time. Many researches mostly focus on
energy consumption in WSN sensor nodes. In WSN The security in wireless sensor networks (WSNs) is a critical
issue due to the inherent limitations of computational capacity and power usage The Black hole attacks is
one of the attack that challenges the security of WSN. Black hole attacks occur when an adversary cap-tures
and re-programs a set of nodes in the network to block/drop the packets they receive/generate instead of
forwarding them towards the base station. As a result any information that enters the black hole region is
captured. Black hole attacks are easy to constitute, and they are capable of undermining network effectiveness by
partitioning the network, such that important event information do not reach the base stations. Several
techniques based on secret sharing and multi-path routing have been proposed in the literature to overcome
black hole attacks in the network. However, these techniques are not very effective, and as we demonstrate, they
may even end up making black hole attacks more effective. Propose an efficient technique that uses multiple base
stations deployed in the network to counter the impact of black holes on data transmission, using java simulator
and performance compare with multiple base station and without multiple base station to prevent black hole
attacks. It implemented using Net bean IDE Java network simulator .
A Traffic-Aware Key Management Architecture for Reducing Energy Consumption i...IDES Editor
In Wireless Sensor Networks (WSNs), most
of the existing key management schemes, establish shared
keys for all pairs of neighbor sensor nodes without
considering the communication between these nodes.
When the number of sensor nodes in WSNs is increased
then each sensor node is to be loaded with bulky amount
of keys. In WSNs a sensor node may communicate with a
small set of neighbor sensor nodes. Based on this fact, in
this paper, an energy efficient Traffic-Aware Key
Management (TKM) scheme is developed for WSNs,
which only establishes shared keys for active sensors
which participate in direct communication. The proposed
scheme offers an efficient Re-keying mechanism to
broadcast keys without the need for retransmission or
acknowledgements. Numerical results show that proposed
key management scheme achieves high connectivity. In
the simulation experiments, the proposed key
management scheme is applied for different routing
protocols. The performance evaluation shows that
proposed scheme gives stronger resilence, low energy
consumption and lesser end to end delay.
This paper modifies the DYMO protocol and develops the AIS-DYMO protocol that is
capable to handle the network layer attack. It means the performance of the network doesn’t get
degraded under the attack. Various immune algorithms can be used to enhance the performance of
the DYMO protocol, but the clonal selection algorithm is used in this work to enhance the
performance of the DYMO protocol. Overall the DYMO protocol is modified to handle the network
layer attacks by using the clonal selection immune algorithm.
An Approach of Mobile Wireless Sensor Network for Target Coverage and Network...IRJET Journal
This document discusses using mobile sensors to improve target coverage and network connectivity in wireless sensor networks. It first defines key concepts in mobile wireless sensor networks like coverage, connectivity, and network lifetime. It then reviews existing literature on algorithms for mobile sensor deployment to optimize target coverage and network connectivity with minimum movement. The proposed method aims to deploy mobile sensors with no movement needed to achieve both target coverage and network connectivity. The goal is to minimize energy consumption from sensor movement.
An Adaptive Mobility Based Attack Detection Mechanism to Detect Selective For...paperpublications3
Abstract: In this paper propose Mobile network based attack detection of Selective Forwarding Attacks in Wireless Sensor Networks. In existing method only used static network and mobility network require high energy and time. So these problems can be overcome by using Mobile network based attack detection. The wireless sensor network has become a hot research area due its wide range of application in military and civilian domain, but as it uses wireless media for communication these are easily prone to security attacks. Selective forwarding attacks are most effective when the attacker is explicitly included on the path of a data flow. Selective forwarding and black hole attacks are very disastrous attacks for sensor networks if used with sinkhole attack because the intruder can drop most of the important packets. Moreover, the technique involves energy efficiency, reliability and scalability. Simulation results demonstrate that our proposed method can accurately detect selective forwarding attacks and identify the compromised sensor nodes. Experimental result show analytically and through simulation experiments that our schemes achieve effective and robust detection capability with reasonable overheads.
Keywords: Wireless Sensor Network, Selective Forwarding attack, Reputation System, Packet Dropping, Channel-aware, Routing.
Title: An Adaptive Mobility Based Attack Detection Mechanism to Detect Selective Forwarding Attack in Wireless Sensor Network
Author: S.K.Shaju, R.Isaac Sajan, Bibin Christopher, Dr. A.J.Deepa
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Fault Diagonosis Approach for WSN using Normal Bias TechniqueIDES Editor
In wireless sensor and actor networks (WSAN), the
sensor nodes have a limitation on lifetime as they are equipped
with non-chargeable batteries. The failure probability of the
sensor node is influenced by factors like electrical dynamism,
hardware disasters, communication inaccuracy and undesired
environment situations, etc. Thus, fault tolerant is a very
important and critical factor in such networks. Fault tolerance
also ensures that a system is available for use without any
interruption in the presence of faults. In this paper an
improved fault tolerance scheme is proposed to find the
probability of correctly identifying a faulty node for three
different types of faults based on normal bias. The nodes fault
status is declared based on its confidence score that depends
on the threshold valve. The aim is to find the Correct
Recognition Rate (CRR) and the False Fear Rate (FFR) with
respect to the different error probability (pe) introduced. The
techniques, neighboring nodes, fault calculations, range and
CRR for existing algorithm and proposed algorithm is also
presented.
Secure data storage over distributed nodes in network through broadcast techn...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Data Security and Data Dissemination of Distributed Data in Wireless Sensor N...IJERA Editor
The document discusses a data dissemination protocol called seDrip for wireless sensor networks. seDrip allows multiple authorized network users to simultaneously distribute data items directly to sensor nodes, without relying on a central sink node. It implements authentication using digital signatures to provide security and prevent unauthorized access. The protocol is analyzed and shown to satisfy security requirements like authenticity, integrity, and resistance to denial-of-service attacks. RSA encryption is used to encode data for confidentiality.
Broad-Spectrum Model for Sharing Analysis between IMTAdvanced Systems and FSS...IOSRJECE
An appraisal of orthogonal frequency division multiplexing (OFDM) accredited for IMT-Advanced has been well thought-out in this letter. Derivation of the power spectral density (PSD) produce new model which easily assess the interfering signal power that appears in the band of a victim system without a spectrum emission mask. Furthermore, the broad-spectrum investigative model (BIM) can assess the interference from the 4G systems into FSS systems, when transmit power is unallocated to some sub-carriers overlapping the band of the victim system. Closed form is derived to create the model.
Key Management Schemes for Secure Communication in Heterogeneous Sensor NetworksIDES Editor
Hierarchical Sensor Network organization is
widely used to achieve energy efficiency in Wireless Sensor
Networks(WSN). To achieve security in hierarchical WSN,
it is important to be able to encrypt the messages sent
between sensor nodes and its cluster head. The key
management task is challenging due to resource constrained
nature of WSN. In this paper we are proposing two key
management schemes for hierarchical networks which
handles various events like node addition, node compromise
and key refresh at regular intervals. The Tree-Based
Scheme ensures in-network processing by maintaining some
additional intermediate keys. Whereas the CRT-Based
Scheme performs the key management with minimum
communication and storage at each node.
Network coding combined with onion routing for anonymous and secure communica...IJCNCJournal
This paper presents a novel scheme that provides high level of security and privacy in a Wireless Mesh
Network (WMN). We combine an approach of Network Coding with multiple layered encryption of onion routing for a WMN. An added superior feature provides higher level of security and privacy. Sensitive network information is confined to 1-hop neighborhood which is available anyways in a wireless medium with nodes using a bivariate polynomial. The only routing information divulged to a relay node is about next hop. No plain text is ever transmitted and all data can only be decrypted by its source and destination.Prior work finds it difficult to enforce encryption with network coding without divulging in complete
routing information,hence losing privacy and anonymity. We compare our scheme with other existing approach for several networks. The preliminary results show this work to provide superior security and anonymity at low overhead cost.
Cooperative Black Hole Attack Prevention by Particle Swarm Optimization with ...IJARIIT
MANET (Mobile Ad Hoc Network) is a type of ad hoc network that can change locations and configure
itself, because of moving of nodes. As MANETs are mobile in nature, they use wireless connections to connect various
networks without infrastructure or any centralized administration. Open medium, dynamic topology, distributed
cooperation are the characteristics of MANET and hence ad hoc networks are open to different types of security
attacks. A Grey hole is a node that selectively drops and forwards data packets after advertises itself as having the
shortest path to the destination node in response to a route request message. Our mechanism helps to protect the
network by detecting and reacting to malicious activities of any node. The results enable us to minimize the attacks on
integrated MANET-Internet communication efficiently. Simulation will be carried out by using network simulator
tool so as to address the problem of detection & prevention of grey hole attack in mobile ad-hoc network. In this thesis
uses Particle swarm optimization(PSO).Which monitors by changing its values because of adhoc nature ,if node
converge then it change its value infinite and prevent the node to send packet.
The document summarizes a research paper on avoiding jamming attacks over wireless networks through packet hiding. It discusses how selective jamming works, impacting network performance. It proposes three schemes combining cryptographic mechanisms like puzzle schemes, commitment schemes, and all-or-nothing transformations with physical layer parameters to mitigate selective jamming. The main goal is to transform a selective jammer into a random one and enable safe transmission even with a jammer present.
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.
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.
This document discusses collision avoidance mechanisms in wireless ad hoc networks using distributed medium access control (MAC) protocols. It analyzes two main approaches for collision avoidance - out-of-band signaling using a busy tone, and an in-band handshaking approach using request-to-send and clear-to-send messages. The hidden node problem is a major cause of collisions at intermediate nodes in ad hoc networks, so the goal is to reduce collisions and improve transmission reliability. Algorithms for collision avoidance at intermediate nodes are presented for both the out-of-band and in-band approaches.
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.
Elimination of wormhole attacker node in manet using performance evaluation m...Alexander Decker
This document summarizes a research paper that proposes a new method for detecting wormhole attacker nodes in mobile ad hoc networks (MANETs). The method detects malicious nodes based on analyzing hop counts and time delays in routes, without requiring any special hardware or protocol modifications. The proposed method is simulated using OPNET software with scenarios of 50 nodes, both with and without wormhole attacks. The results show that without prevention, a wormhole attack decreases average hop count and increases delays. However, when the proposed method is applied, it is able to detect the attacker nodes and avoid their paths, regaining normal hop counts and delays.
VIRTUAL ARCHITECTURE AND ENERGYEFFICIENT ROUTING PROTOCOLS FOR 3D WIRELESS SE...ijwmn
This paper proposes a virtual architecture for three-dimensional (3D) wireless sensor networks (WSNs), a dynamic coordinate system, and a scalable energy-efficient training protocol for collections of nodes deployed in the space that are initially anonymous, asynchronous, and unaware of their initial location. The 3D WSNs considered comprise massively deployed tiny energy-constrained commodity sensors and one or more sink nodes that provide an interface to the outside world. The proposed architecture is a generalization of a two-dimensional virtual architecture previously proposed in the literature, in which a flexible and intuitive coordinate system is imposed onto the deployment area and the anonymous nodes are partitioned into clusters where data can be gathered from the environment and synthesized under local control. The architecture solves the hidden sensors problem that occurs because of irregularities in rugged deployment areas or environments containing buildings by training the network of nodes arbitrarily dispersed in the 3D space. In addition, we derive two simple and energy-efficient routing protocols, respectively for dense and sparse networks, based on the proposed dynamic coordinate system. They are used to minimize the power expended in collecting and routing data to the sink node, thus increasing the lifetime of the network.
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,
This document discusses the application of machine learning techniques in physical layer communication. It outlines the fundamentals and limitations of classical approaches to physical layer communication. It then introduces multi-layer perceptrons and recurrent neural networks as machine learning methodologies that can be applied. Specific use cases of machine learning for MIMO detection and modulation classification are discussed. The conclusion is that while classical approaches face limitations, machine learning shows promise in helping to solve physical layer communication problems, especially as more training data becomes available.
A Fuzzy Based Priority Approach in Mobile Sensor Network CoverageIDES Editor
In this paper a new fuzzy based approach for
improving network coverage in wireless mobile sensor
networks is proposed. In the proposed approach firstly
each mobile sensor node determines its neighbors and its
distance from borders and obstacles. According to these
values, fuzzy inference engine calculates the priority of
node for movement. Then according to the priority, in
turn, nodes move away from each other to increase
coverage area in the target field. Simulation results show
that our fuzzy approach can reach higher degree of
coverage against other common approaches like FOA,
VEC and TRI algorithms.
BLACK HOLE ATTACKS MITIGATION AND PREVENTION IN WIRELESS SENSOR NETWORKAM Publications
Wireless Sensor Network consists of nodes which communicate with each other with wireless
channel. A general conception of wireless sensor network (WSN) nodes is static and it remains fixed in their
position. It has been deployed in dominant manner for a long period of time. Many researches mostly focus on
energy consumption in WSN sensor nodes. In WSN The security in wireless sensor networks (WSNs) is a critical
issue due to the inherent limitations of computational capacity and power usage The Black hole attacks is
one of the attack that challenges the security of WSN. Black hole attacks occur when an adversary cap-tures
and re-programs a set of nodes in the network to block/drop the packets they receive/generate instead of
forwarding them towards the base station. As a result any information that enters the black hole region is
captured. Black hole attacks are easy to constitute, and they are capable of undermining network effectiveness by
partitioning the network, such that important event information do not reach the base stations. Several
techniques based on secret sharing and multi-path routing have been proposed in the literature to overcome
black hole attacks in the network. However, these techniques are not very effective, and as we demonstrate, they
may even end up making black hole attacks more effective. Propose an efficient technique that uses multiple base
stations deployed in the network to counter the impact of black holes on data transmission, using java simulator
and performance compare with multiple base station and without multiple base station to prevent black hole
attacks. It implemented using Net bean IDE Java network simulator .
A Traffic-Aware Key Management Architecture for Reducing Energy Consumption i...IDES Editor
In Wireless Sensor Networks (WSNs), most
of the existing key management schemes, establish shared
keys for all pairs of neighbor sensor nodes without
considering the communication between these nodes.
When the number of sensor nodes in WSNs is increased
then each sensor node is to be loaded with bulky amount
of keys. In WSNs a sensor node may communicate with a
small set of neighbor sensor nodes. Based on this fact, in
this paper, an energy efficient Traffic-Aware Key
Management (TKM) scheme is developed for WSNs,
which only establishes shared keys for active sensors
which participate in direct communication. The proposed
scheme offers an efficient Re-keying mechanism to
broadcast keys without the need for retransmission or
acknowledgements. Numerical results show that proposed
key management scheme achieves high connectivity. In
the simulation experiments, the proposed key
management scheme is applied for different routing
protocols. The performance evaluation shows that
proposed scheme gives stronger resilence, low energy
consumption and lesser end to end delay.
This paper modifies the DYMO protocol and develops the AIS-DYMO protocol that is
capable to handle the network layer attack. It means the performance of the network doesn’t get
degraded under the attack. Various immune algorithms can be used to enhance the performance of
the DYMO protocol, but the clonal selection algorithm is used in this work to enhance the
performance of the DYMO protocol. Overall the DYMO protocol is modified to handle the network
layer attacks by using the clonal selection immune algorithm.
An Approach of Mobile Wireless Sensor Network for Target Coverage and Network...IRJET Journal
This document discusses using mobile sensors to improve target coverage and network connectivity in wireless sensor networks. It first defines key concepts in mobile wireless sensor networks like coverage, connectivity, and network lifetime. It then reviews existing literature on algorithms for mobile sensor deployment to optimize target coverage and network connectivity with minimum movement. The proposed method aims to deploy mobile sensors with no movement needed to achieve both target coverage and network connectivity. The goal is to minimize energy consumption from sensor movement.
An Adaptive Mobility Based Attack Detection Mechanism to Detect Selective For...paperpublications3
Abstract: In this paper propose Mobile network based attack detection of Selective Forwarding Attacks in Wireless Sensor Networks. In existing method only used static network and mobility network require high energy and time. So these problems can be overcome by using Mobile network based attack detection. The wireless sensor network has become a hot research area due its wide range of application in military and civilian domain, but as it uses wireless media for communication these are easily prone to security attacks. Selective forwarding attacks are most effective when the attacker is explicitly included on the path of a data flow. Selective forwarding and black hole attacks are very disastrous attacks for sensor networks if used with sinkhole attack because the intruder can drop most of the important packets. Moreover, the technique involves energy efficiency, reliability and scalability. Simulation results demonstrate that our proposed method can accurately detect selective forwarding attacks and identify the compromised sensor nodes. Experimental result show analytically and through simulation experiments that our schemes achieve effective and robust detection capability with reasonable overheads.
Keywords: Wireless Sensor Network, Selective Forwarding attack, Reputation System, Packet Dropping, Channel-aware, Routing.
Title: An Adaptive Mobility Based Attack Detection Mechanism to Detect Selective Forwarding Attack in Wireless Sensor Network
Author: S.K.Shaju, R.Isaac Sajan, Bibin Christopher, Dr. A.J.Deepa
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Fault Diagonosis Approach for WSN using Normal Bias TechniqueIDES Editor
In wireless sensor and actor networks (WSAN), the
sensor nodes have a limitation on lifetime as they are equipped
with non-chargeable batteries. The failure probability of the
sensor node is influenced by factors like electrical dynamism,
hardware disasters, communication inaccuracy and undesired
environment situations, etc. Thus, fault tolerant is a very
important and critical factor in such networks. Fault tolerance
also ensures that a system is available for use without any
interruption in the presence of faults. In this paper an
improved fault tolerance scheme is proposed to find the
probability of correctly identifying a faulty node for three
different types of faults based on normal bias. The nodes fault
status is declared based on its confidence score that depends
on the threshold valve. The aim is to find the Correct
Recognition Rate (CRR) and the False Fear Rate (FFR) with
respect to the different error probability (pe) introduced. The
techniques, neighboring nodes, fault calculations, range and
CRR for existing algorithm and proposed algorithm is also
presented.
Secure data storage over distributed nodes in network through broadcast techn...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Data Security and Data Dissemination of Distributed Data in Wireless Sensor N...IJERA Editor
The document discusses a data dissemination protocol called seDrip for wireless sensor networks. seDrip allows multiple authorized network users to simultaneously distribute data items directly to sensor nodes, without relying on a central sink node. It implements authentication using digital signatures to provide security and prevent unauthorized access. The protocol is analyzed and shown to satisfy security requirements like authenticity, integrity, and resistance to denial-of-service attacks. RSA encryption is used to encode data for confidentiality.
Broad-Spectrum Model for Sharing Analysis between IMTAdvanced Systems and FSS...IOSRJECE
An appraisal of orthogonal frequency division multiplexing (OFDM) accredited for IMT-Advanced has been well thought-out in this letter. Derivation of the power spectral density (PSD) produce new model which easily assess the interfering signal power that appears in the band of a victim system without a spectrum emission mask. Furthermore, the broad-spectrum investigative model (BIM) can assess the interference from the 4G systems into FSS systems, when transmit power is unallocated to some sub-carriers overlapping the band of the victim system. Closed form is derived to create the model.
Key Management Schemes for Secure Communication in Heterogeneous Sensor NetworksIDES Editor
Hierarchical Sensor Network organization is
widely used to achieve energy efficiency in Wireless Sensor
Networks(WSN). To achieve security in hierarchical WSN,
it is important to be able to encrypt the messages sent
between sensor nodes and its cluster head. The key
management task is challenging due to resource constrained
nature of WSN. In this paper we are proposing two key
management schemes for hierarchical networks which
handles various events like node addition, node compromise
and key refresh at regular intervals. The Tree-Based
Scheme ensures in-network processing by maintaining some
additional intermediate keys. Whereas the CRT-Based
Scheme performs the key management with minimum
communication and storage at each node.
Network coding combined with onion routing for anonymous and secure communica...IJCNCJournal
This paper presents a novel scheme that provides high level of security and privacy in a Wireless Mesh
Network (WMN). We combine an approach of Network Coding with multiple layered encryption of onion routing for a WMN. An added superior feature provides higher level of security and privacy. Sensitive network information is confined to 1-hop neighborhood which is available anyways in a wireless medium with nodes using a bivariate polynomial. The only routing information divulged to a relay node is about next hop. No plain text is ever transmitted and all data can only be decrypted by its source and destination.Prior work finds it difficult to enforce encryption with network coding without divulging in complete
routing information,hence losing privacy and anonymity. We compare our scheme with other existing approach for several networks. The preliminary results show this work to provide superior security and anonymity at low overhead cost.
Cooperative Black Hole Attack Prevention by Particle Swarm Optimization with ...IJARIIT
MANET (Mobile Ad Hoc Network) is a type of ad hoc network that can change locations and configure
itself, because of moving of nodes. As MANETs are mobile in nature, they use wireless connections to connect various
networks without infrastructure or any centralized administration. Open medium, dynamic topology, distributed
cooperation are the characteristics of MANET and hence ad hoc networks are open to different types of security
attacks. A Grey hole is a node that selectively drops and forwards data packets after advertises itself as having the
shortest path to the destination node in response to a route request message. Our mechanism helps to protect the
network by detecting and reacting to malicious activities of any node. The results enable us to minimize the attacks on
integrated MANET-Internet communication efficiently. Simulation will be carried out by using network simulator
tool so as to address the problem of detection & prevention of grey hole attack in mobile ad-hoc network. In this thesis
uses Particle swarm optimization(PSO).Which monitors by changing its values because of adhoc nature ,if node
converge then it change its value infinite and prevent the node to send packet.
The document summarizes a research paper on avoiding jamming attacks over wireless networks through packet hiding. It discusses how selective jamming works, impacting network performance. It proposes three schemes combining cryptographic mechanisms like puzzle schemes, commitment schemes, and all-or-nothing transformations with physical layer parameters to mitigate selective jamming. The main goal is to transform a selective jammer into a random one and enable safe transmission even with a jammer present.
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.
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.
This document discusses collision avoidance mechanisms in wireless ad hoc networks using distributed medium access control (MAC) protocols. It analyzes two main approaches for collision avoidance - out-of-band signaling using a busy tone, and an in-band handshaking approach using request-to-send and clear-to-send messages. The hidden node problem is a major cause of collisions at intermediate nodes in ad hoc networks, so the goal is to reduce collisions and improve transmission reliability. Algorithms for collision avoidance at intermediate nodes are presented for both the out-of-band and in-band approaches.
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.
This document summarizes a research paper that proposes using a genetic algorithm to efficiently cluster wireless sensor nodes. The genetic algorithm aims to minimize the total communication distance between sensors and the base station in order to prolong the network lifetime. Simulation results showed that the genetic algorithm can quickly find good clustering solutions that reduce energy consumption compared to previous clustering methods. The full paper provides details on wireless sensor networks, related clustering algorithms, genetic algorithms, and the proposed genetic algorithm-based clustering method.
Defending Reactive Jammers in WSN using a Trigger Identification Service.ijsrd.com
In the last decade, the greatest threat to the wireless sensor network has been Reactive Jamming Attack because it is difficult to be disclosed and defend as well as due to its mass destruction to legitimate sensor communications. As discussed above about the Reactive Jammers Nodes, a new scheme to deactivate them efficiently is by identifying all trigger nodes, where transmissions invoke the jammer nodes, which has been proposed and developed. Due to this identification mechanism, many existing reactive jamming defending schemes can be benefited. This Trigger Identification can also work as an application layer .In this paper, on one side we provide the several optimization problems to provide complete trigger identification service framework for unreliable wireless sensor networks and on the other side we also provide an improved algorithm with regard to two sophisticated jamming models, in order to enhance its robustness for various network scenarios.
A survey on jamming attacks, detection and defending strategies in wireless s...eSAT Journals
Abstract
Wireless Sensor Network (WSN)s are now a days most widely used and are undergoing many security threats. Of the different types of threats, Jamming attack has been considered a severe security threat. These jamming attacks cause the overutilization of scarce resources like the battery power. Further, high computations require lot of memory. Such problems cause the reduction in the lifetime of the sensor nodes in WSNs. There are four types of jamming attacks in which the most difficult type of attack is the reactive jammer as it is easy to launch by the adversary but very difficult to detect and defend. In this paper we present a brief survey of the types of jamming attacks, methods used to detect and defend the jammers.
Keywords: Wireless Sensor Networks, Jamming Attacks, Reactive jamming attack, and Trigger node identification
CODE AWARE DYNAMIC SOURCE ROUTING FOR DISTRIBUTED SENSOR NETWORKIJNSA Journal
Sensor network facilitates monitoring and controlling of physical environments. These wireless networks consist of dense collection of sensors capable of collection and dissemination of data. They have application in variety of fields such as military purposes, environment monitoring etc. Typical deployment of sensor network assumes central processing station or a gateway to which all other nodes route their data using dynamic source routing (DSR). This causes congestion at central station and thus reduces the efficiency of the network. In this work we will propose a better dynamic source routing technique using network coding to reduce total number of transmission in sensor networks resulting in better efficiency.
Grid-Based Multipath with Congestion Avoidance Routing Protocolijtsrd
This document summarizes routing techniques for wireless sensor networks. It discusses traditional techniques like flooding and gossiping and current techniques including flat, hierarchical, and location-based routing. For hierarchical routing, it describes protocols like LEACH, PEGASIS and TEEN in detail. LEACH uses clustering to reduce energy consumption and extends network lifetime by randomly selecting cluster heads. It compares LEACH to other protocols like SPIN and directed diffusion, showing LEACH provides better performance. The document also discusses issues like uneven energy consumption in LEACH that new protocols try to address.
Jamming Attacks Prevention in Wireless Networks Using Packet Hiding MethodsIOSR Journals
This document discusses selective jamming attacks in wireless networks and methods to prevent them. It begins by introducing the open nature of wireless networks leaves them vulnerable to jamming attacks. It then discusses different types of jamming attacks and notes that selective jamming, which targets specific important packets, is more effective than continuous jamming. The document proposes using cryptographic techniques like commitment schemes and puzzles combined with physical layer parameters to prevent real-time packet classification and selective jamming. It reviews related work on jamming attacks and defenses. Finally, it outlines the problem statement, system model, and the contribution of using symmetric encryption and resisting brute force block encryption attacks to reduce jamming through packet hiding.
This document summarizes a research paper that proposes using network coding to improve the efficiency of dynamic source routing in wireless sensor networks. The paper describes how typical sensor networks rely on a central processing station that causes congestion. It then discusses network coding and how it allows intermediate nodes to encode packets before forwarding. The paper proposes a scheme where some sensor nodes act as aggregators that apply network coding on received packets from neighboring sensors if the data is significantly different. Simulation results show this approach reduces total transmissions for networks with up to 75 nodes, improving efficiency, but performance degrades for larger networks potentially due to increased collisions.
Ameliorate the performance using soft computing approaches in wireless networksIJECEIAES
Wireless sensor networks are an innovative and rapidly advanced network occupying the broad spectrum of wireless networks. It works on the principle of “use with less expense, effort and with more comfort.” In these networks, routing provides efficient and effective data transmission between different sources to access points using the clustering technique. This work addresses the low-energy adaptive clustering hierarchy (LEACH) protocol’s main backdrop of choosing head nodes based on a random value. In this, the soft computing methods are used, namely the fuzzy approach, to overcome this barrier in LEACH. Our approach’s primary goal is to extend the network lifetime with efficient energy consumption and by choosing the appropriate head node in each cluster based on the fuzzy parameters. The proposed clustering algorithm focused on two fuzzy inference structures, namely Mamdani and Sugeno fuzzy logic models in two scenarios, respectively. We compared our approach with four existing works, the conventional LEACH, LEACH using the fuzzy method, multicriteria cluster head delegation, and fuzzy-based energy efficient clustering approach (FEECA) in wireless sensor network. The proposed scenario based fuzzy LEACH protocol approaches are better than the four existing methods regarding stability, network survivability, and energy consumption.
REAL TIME SECURING OF ALL-OPTICAL NETWORKS AGAINST SECURITY ATTACKS AT THE PH...IJNSA Journal
This paper deals with protecting all-optical networks (AON) from security attacks at the physical level. It firstly presents an overall high level protocol for establishment, management and on-the-fly restoration of optimal secure lightpaths established by applying constraint-based open shortest path first (OSPF) source routing using proposed security databases of components. Secondly it presents a protocol for using fiber diversity between adjacent nodes to protect against attacks on fiber links. Thirdly it presents analytical models of propagation of security attacks on optical amplifiers and switches. These models are then used to develop security envelopes around these components, to calculate security indices and on-the-fly real-time restoration of components in case of an attack. Fourthly it presents simulation results for evaluation of the performance of these on-the-fly restoration schemes. These on-the-fly restoration schemes eliminate need for tearing down of attacked lightpaths and prevent consequent loss of large amount of data.
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.
ENERGY EFFICIENCY OF MIMO COOPERATIVE NETWORKS WITH ENERGY HARVESTING SENSOR ...ijasuc
This paper addresses the maximizing network lifetime problem in wireless sensor networks (WSNs) taking
into account the total Symbol Error rate (SER) at destination. Therefore, efficient power management is
needed for extend network lifetime. Our approach consists to provide the optimal transmission power
using the orthogonal multiple access channels between each sensor. In order to deeply study the
properties of our approach, firstly, the simple case is considered; the information sensed by the source
node passes by a single relay before reaching the destination node. Secondly, global case is studied; the
information passes by several relays. We consider, in the previous both cases, that the batteries are nonrechargeable. Thirdly, we spread our work the case where the batteries are rechargeable with unlimited
storage capacity. In all three cases, we suppose that Maximum Ratio Combining (MRC) is used as a
detector, and Amplify and Forward (AF) as a relaying strategy. Simulation results show the viability of
our approach which the network lifetime is extended of more than 70.72%when the batteries are non
rechargeable and 100.51% when the batteries are rechargeable in comparison with other traditional
method.
ENERGY EFFICIENCY OF MIMO COOPERATIVE NETWORKS WITH ENERGY HARVESTING SENSOR ...ijasuc
This paper addresses the maximizing network lifetime problem in wireless sensor networks (WSNs) taking
into account the total Symbol Error rate (SER) at destination. Therefore, efficient power management is
needed for extend network lifetime. Our approach consists to provide the optimal transmission power
using the orthogonal multiple access channels between each sensor. In order to deeply study the
properties of our approach, firstly, the simple case is considered; the information sensed by the source
node passes by a single relay before reaching the destination node. Secondly, global case is studied; the
information passes by several relays. We consider, in the previous both cases, that the batteries are nonrechargeable. Thirdly, we spread our work the case where the batteries are rechargeable with unlimited
storage capacity. In all three cases, we suppose that Maximum Ratio Combining (MRC) is used as a
detector, and Amplify and Forward (AF) as a relaying strategy. Simulation results show the viability of
our approach which the network lifetime is extended of more than 70.72%when the batteries are non
rechargeable and 100.51% when the batteries are rechargeable in comparison with other traditional
method.
This document presents a study on a proposed distributed attack detection algorithm using experimental and simulation analysis. The key points are:
1) The algorithm detects distributed denial of service attacks in wireless sensor networks using detector nodes that monitor traffic and reconstruct patterns to identify attacks.
2) Performance is affected by algorithmic parameters like time epoch length and number of detector nodes, and network parameters like node density and energy.
3) Simulation experiments quantify the attack detection rate, false positive/negative rates, and node energy utilization under variations in these parameters.
SELECTIVE JAMMING ATTACK PREVENTION BASED ON PACKET HIDING METHODS AND WORMHOLESIJNSA Journal
The wireless networks are more sensitive to the Denial-of-Service (DoS) attacks. The existing system is based on Spread Spectrum (SS). This technique mainly focuses on an external threat model. In wireless network the communications between nodes take place through broadcast communication. That is why, if an attacker present within the network can easily eavesdrop the message sent by any node. The main attack present in the wireless network is the selective jamming attack. This type of attack mainly focuses a single node termed as target node. Attacker always tries to block the message sent by the target node. This leads to the Denial-of-Service attack. We are proposing a new method to prevent the selective jamming attack in an internal threat model.
A wormhole is used, which will generate an alarm to indicate the presence of jammer and sent IP address of jammer node to all other nodes in the network. Using a method called packet hiding, we can send message through the network even though a jammer is present. This method is based on the technique called Strong Hiding Commitment Scheme (SHCS). Here, the access point in a network region becomes the wormhole whenever it finds out any node that violates the rules in a particular network region. That node is then considered as a jammer node. The wormhole sends IP address of jammer to all other nodes. Wormhole then prevents the jamming activity of the jammer by encrypting the source ID of message along with the message packet.So that the jammer is unable to identify its target node and the source can forward its message safely through jammer node itself.
Wireless Sensor Network Based Clustering Architecture for Cooperative Communi...ijtsrd
1. The document proposes a cluster-based cooperative communication architecture for wireless sensor networks. It uses clustering as an underlying system to help with stable routing and cooperative transmission.
2. The architecture has three components: an underlying clustering structure, cluster-based cooperative transmission, and analysis of cooperative transmission opportunities.
3. It evaluates the proposed cooperative transmission approach through simulation and finds it achieves at least 12 times higher energy efficiency than non-cooperative transmission.
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
“An Outlook of the Ongoing and Future Relationship between Blockchain Technologies and Process-aware Information Systems.” Invited talk at the joint workshop on Blockchain for Information Systems (BC4IS) and Blockchain for Trusted Data Sharing (B4TDS), co-located with with the 36th International Conference on Advanced Information Systems Engineering (CAiSE), 3 June 2024, Limassol, Cyprus.
Driving Business Innovation: Latest Generative AI Advancements & Success StorySafe Software
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
Building Production Ready Search Pipelines with Spark and MilvusZilliz
Spark is the widely used ETL tool for processing, indexing and ingesting data to serving stack for search. Milvus is the production-ready open-source vector database. In this talk we will show how to use Spark to process unstructured data to extract vector representations, and push the vectors to Milvus vector database for search serving.
AI 101: An Introduction to the Basics and Impact of Artificial IntelligenceIndexBug
Imagine a world where machines not only perform tasks but also learn, adapt, and make decisions. This is the promise of Artificial Intelligence (AI), a technology that's not just enhancing our lives but revolutionizing entire industries.
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
GraphRAG for Life Science to increase LLM accuracyTomaz Bratanic
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc
How does your privacy program stack up against your peers? What challenges are privacy teams tackling and prioritizing in 2024?
In the fifth annual Global Privacy Benchmarks Survey, we asked over 1,800 global privacy professionals and business executives to share their perspectives on the current state of privacy inside and outside of their organizations. This year’s report focused on emerging areas of importance for privacy and compliance professionals, including considerations and implications of Artificial Intelligence (AI) technologies, building brand trust, and different approaches for achieving higher privacy competence scores.
See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar will review:
- The top 10 privacy insights from the fifth annual Global Privacy Benchmarks Survey
- The top challenges for privacy leaders, practitioners, and organizations in 2024
- Key themes to consider in developing and maintaining your privacy program
1. International Journal of Engineering Science Invention
ISSN (Online): 2319 – 6734, ISSN (Print): 2319 – 6726
www.ijesi.org Volume 2 Issue 6ǁ June. 2013 ǁ PP.41-46
www.ijesi.org 41 | Page
An Effective Defensive Node against Jamming Attacks in Sensor
Networks
P.Indumathi1
, P.Manikandan2
and K.Yogitha3
[1][2]
PG Scholar, Network Engineering and [3]
Assistant Professor, ECE Department
Arunai Engineering College, Tiruvannamalai, India
ABSTRACT-Resilience to electromagnetic jamming and its avoidances are difficult problem in wireless
sensor networks .Jamming is one such Denial Of Service (DOS) attack that has been addressed at the physical
layer and Energy Efficient Link Layer jamming attacks have proven to be a real threat to network
communication for prolonged time.
The intent of this paper proposes some changes in physical layer as well as Data Link layer. In
Physical layer, uncorrelated groups based DSSS technique, which is a slender modification of DSSS used in
sensor network standard, in which all possible 15 chip PN sequences are used to form groups of 5 sequences
each and each group assigned an index and randomly selected.
In Data Link layer, SMAC (Sensor Medium Access Control) protocol contains two modifications. The
first is Data Packet Separation Slot Size Randomization (DS-SSR); the second is Maximum Covers using Mixed
Integer Programming (MC-MIP). DS-SSR is used to increase the WSN resistance against the Energy efficient
denial of service link layer jamming attacks, MC-MIP is used to slightly eliminate the negative impact on the
network throughput when using countermeasures against energy efficient jamming.
Lifetime advantage and censorship rate are the two measures used to evaluate the resistance of the
proposed protocol against the attack. When compared to other counter measure experimental results shows
more than 8% reduction of the attacker lifetime advantage can be achieved with DS-SSR and SMAC.
KEYWORDS-DSSS; index; SMAC; jamming.
I. INTRODUCTION
Wireless sensor networking is an emerging technology that has a wide range of potential applications
including environment monitoring, smart spaces, medical systems and robotic exploration. Such a network
normally consists of a large number of distributed nodes that organize themselves into a multi-hop wireless
network. Each node has one or more sensors, embedded processors and low-power radios, and is normally
battery operated. Typically, these nodes coordinate to perform a common task. Jamming is one such denial of
service attack which prevents the network from performing its basic functions. Jamming is defined as interfering
with the legitimate frequency of sensor nodes. Hence anti jamming techniques are essential in order to ensure
timely delivery of information and to increase the performance of the network. There are various types of
jamming such as sweep jamming, spot jamming, barrage jamming, deceptive jamming etc., [1] and many
countermeasures are also proposed against jamming. Generally the countermeasures are classified into proactive
techniques that are used to prevent jamming and reactive techniques that are used to overcome jamming. Direct
Sequence Spread Spectrum (DSSS), Frequency Hopping Spread Spectrum (FHSS) etc., [2] are few proactive
techniques and wormhole based anti jamming technique, hybrid model of defense etc., are few reactive anti
jamming techniques. Energy efficient attacks target the Medium Access Control (MAC) protocol of WSNs.
These attacks perform statistical analysis to select the proper time to jam in and sleep otherwise. An energy
efficient jammer will not waste energy while preventing network communication for a long time compared to
other jammer styles.
This paper is ordered as follows section II gives related works. Section III provides in detail about
proposed modification to physical layer and SMAC protocol. Section IV provides the conclusion and
suggestions for future work.
II. RELATED WORKS
In cagalj M et al (2005)[3] used Wormhole threat as a solution to bring out the message out of jammed
area. This is done using three techniques namely (i) Wired pair of sensors, (ii) frequency hopping and (iii)
uncorrelated channel hopping. In the first technique pair of sensor nodes is connected using wires and are
deployed. The drawback of the technique is that it is complex and costly. In the second technique frequency
hopping (FH) enabled nodes are deployed and then it is paired. The drawback of this technique is that it requires
2. An Effective Defensive Node Against …
www.ijesi.org 42 | Page
synchronization. In the third technique the sensor nodes opeirating on the same channel will be paired to
transmit the measured even to outside the jammed area. This technique does not require any synchronization.
Mpitziopoulos A and Gavalas D (2008) [4] designed a prototype node named Ares that uses hybrid
FHSS/DSSS to defend jamming attacks which is more efficient than existing techniques. Ares node uses a
specific frequency hopping spread spectrum (FHSS) technique in 5 GHz band with 51frequency channels
wherein the channel sequence is generated using a key which is derived from a secret word known only to the
sensor nodes. Each channel uses direct sequence spread spectrum (DSSS) technique with 16 bit pseudo noise
(PN) code. The Ares node can effectively defend the jamming attacks and also provides satisfactory packet
delivery ratio. The drawback is that designing of the Ares node is complex. In [5] Mario Strasser et al. (2008)
proposed an Uncoordinated Frequency Hopping (UFH) scheme which provides jamming free communication
between two nodes in the presence of jammer without shared keys. UFH scheme is used for key establishment
protocol that enables the nodes to agree on a shared key which will be further used to create secret hopping
sequence and communicate using coordinated frequency hopping. It achieves same level of protection as
frequency hopping technique. The drawback is that it has low throughput, high storage and processing cost.
Law Pajic and R.Mangharam[6] proposed the WisperNet communication protocol. This protocol uses
the modules (WisperNetTime), (WisperNetSpace) to resist energy efficient link layer jamming.
i)WisperNet-Time:
This component in the WisperNet communication protocol is related to randomizing the timing
properties of a TDMA protocol, this is accomplished by slot size randomization and schedule randomization
.In slot size randomization nodes within the network are assigned a predefined key in nodes. In schedule
randomization nodes change their transmission schedule randomly to further mislead the attacker however this
may result in collision in transmission, which is resolved with preassgined node priorities.
ii)WisperNet-Space:
This module uses routing techniques to stay away from the jamming area, and it allows the nodes to
moves away from the jammed area in a technique called spatial retreat.
III APPROACHES
A.UNCORRELATED GROUPS BASED DSSS TECHNIQUE
In this paper, an effective anti jamming technique is proposed to overcome the drawback of traditional
DSSS technique. This scheme is a slight modification of traditional DSSS technique used in the IEEE 802.15.4
standard. Fig.1 shows the block diagram of the proposed scheme.
Fig 1Block diagram of uncorrelated groups based DSSS technique
This technique uses all possible sequences of 15 chip PN code to form groups with 5 sequences in each
group. After forming these groups they will be permuted to form the group set. Each group in the group set will
be assigned an index and these groups will be known to the sender and receiver. Totally 3003 groups are
possible with the 15 chip PN sequence which is called as the group set. The measured event is spreaded with the
groups that are selected for spreading from the group set. Each bit of the message is spreaded with different PN
sequence present in the group. The index of the initial group selected for spreading is appended to the spreaded
message and is transmitted through the channel. At the receiver side the groups are selected for despreading,
starting with the initial group corresponding to the index which is received along with the received signal. The
method for selecting groups for spreading is given in detail:
3. An Effective Defensive Node Against …
www.ijesi.org 43 | Page
i) Formation of group set:
Let {Gi} be the group set where1 ≤ i ≤ 3003, it is formed by permuting the possible combinations of 15
chip PN sequence. Each group in the group set will have 5 sequences, for example the group G1 will have any 5
sequences from possible sequences given by { Sj} where1≤ j ≤15. Each group will be assigned an index denoted
as Ik where1≤ k ≤ 3003.
ii) Spreading process:
The sender selects a group called as the initial group randomly from the available group set and its
corresponding index is called as the initial index. In this technique each bit is spreaded with a PN sequence in
the initial group and once the sequences present in this group are used, the next group will be selected such that
it is totally uncorrelated with the initial group. The third group is selected such that it is totally uncorrelated with
the previously selected group and so on. The groups are selected such that the successive groups are totally
uncorrelated because if they are correlated it becomes easy for the jammer to decode more bits and hence
capture the entire network. The groups that are selected for spreading should not be repeated. With this process
2980 groups are selected for spreading from the group set of 3003. After spreading the initial index is
transmitted along with the spreaded message.
iii) Dispreading process:
The receiver selects the group corresponding to the initial index, which is received along with the
spread message as the initial group, for despreading. Once all the sequences are used in this group the next
group will be selected such that it is totally uncorrelated with the previously selected group and it should not be
repeated. These selected groups are used for despreading the received signal to obtain the original message.Fig.2
shows an example to transmit a message m ={ ml} which has l bits, where1 ≤ l ≤ 10 For this two groups are
required for spreading with 5 sequences in each group. Let G1823 be the initial group and its corresponding index
is I1823 .
This initial group is correlated with other groups present in the group set to find the totally uncorrelated
group which is selected as the next group for spreading. Here the next group will be G2 which has sequences
totally different from the initial group hence they are said to be totally uncorrelated groups. Now the group G2 is
correlated with other groups in the group set excluding those which are previously used for spreading. Finally
the groups used for spreading are {G1823, G2}. After spreading, the index I1823 is sent along with the spreaded
message so that at the receiver side, the same algorithm is repeated to select the groups for dispreading starting
with the initial group corresponding to the index I1823.
The proposed technique is analyzed in terms of probability of groups matched and the traditional DSSS
technique is analyzed in terms of probability of breaking the code. A wireless sensor network is simulated with
hundred nodes in an area of 500x500 m2. As in IEEE 802.15.4 standard DSSS modulation is applied at all
nodes. In traditional DSSS technique the nodes are assumed to use the same 15 chip PN sequence generated
using N=4 shift register. For evaluating the performance of this technique, probability of breaking the code for
the attacker is calculated in the presence of a single jammer and various numbers of jammer.
The probability of breaking the code is given by the number of successful trials to the total number of
trials. Fig.4 shows the probability of breaking the code in the presence of jammers.
Fig 4-No of jammers vs. Probability of group matched
4. An Effective Defensive Node Against …
www.ijesi.org 44 | Page
The probability has reached 0.6 in the presence of 10 jammers. It is inferred that as the numbers of
jammer increases the probability can reach even 1 and once the code is broken the entire network can be
captured. To overcome this drawback an effective technique is proposed. To evaluate the performance of the
proposed technique probability of matching the groups is calculated in the presence of single jammer and
various numbers of jammer. Here the probability of matching the groups is given by the groups matched to the
total number of groups. Fig.5 shows number of trials vs probability of matching groups in the presence of single
jammer.
Fig 5 No of Trials vs Probability Of group matched.
With the previous notes taken into account, two modifications to the SMAC protocol are proposed to
improve the resistance of SMAC protocol against energy efficient jamming while preserving the throughput of
the network. The first is Data Packet Separation Slot Size Randomization (DS-SSR) to reduce the lifetime of
the jammer. The second is Maximum Covers Mixed Integer Programming (MC-MIP).
IV. DATA PACKET SEPARATION
A typical statistical jammer follows a state diagram for the jamming process similar to Fig3 Observing
interarrival times in the network is the basis of the jamming process. After observation, clustering is made to
identify the slot size of the protocol used within the network.
Fig 3 Statistical Jammer cycle
If we manage to mislead the jammer to estimate the slot size smaller than it actually is we would
succeed into forcing the jammer to jam at high frequency, we would make the jammer deplete its power source.
When a legitimate node has data to send and the current slot is its allocated slot, the node sends in the control
packet its desire to send data and the destination. The data part of the node is not necessarily large enough to fill
the entire slot. We can separate the data packet into two or more parts. This works only for packets that are not
too large that when separated the slot will not accommodate the separated parts. The separation process is not
determined ahead of time and it is based on the size of the data packet to be transmitted so under certain
situations, the node may separate data and in other cases, the node may not separate data. When the jammer
observes the interarrival times of packets of the network, he gets the illusion of smaller interarrival time and
hence a miscalculation of the slot size to be smaller hence jamming at higher rate this with have a dramatic
effect on the lifetime advantage of the jammer.
5. An Effective Defensive Node Against …
www.ijesi.org 45 | Page
The length of the jamming signal is time needed to transmit only one byte into the medium (the
smallest size possible to transmit to preserve jammer energy as much as possible) .The power spend by an
attacker PA is the sum of two components the first is power spend for the observation, clustering and slot size
estimation Pc, which is a constant term not related to the rate of jamming, and the second component is the
power needed to transmit jamming signals. The second component is based on the power needed to transmit a
single jamming signal Pj, the estimated slot size μs, and the total jamming time t. the inverse of the estimated
slot size μs represents the rate of jamming in a unit of time.
PA= Pc +t*Pj/ μs
Hence, the power consumed is inversely proportional with the estimated slot size. If for example a jammer
miscalculated the slot size to be μs’= μs /α where α>1. Let ΔP be the difference between the power spent by the
jammer at an estimated slot size μs and the power spent at an estimated slot size μs’.
ΔP= PA' - PA
ΔP = Pc +t*Pj/ μs' – (Pc +t*Pj/ μs)
ΔP = Pc +t* α *Pj/ μs – (Pc +t*Pj/ μs)
ΔP = (α-1)*t*Pj/ μs
We note that ΔP is a considerable amount given and it increases as α increase. This would affect the lifetime
advantage of the jammer, reducing the time that a jammer node can sustain an attack on the network.
When a node controls a time slot, it inspects the data that is about to be transmitted (if any) to decide if it can be
further separated and what would the separation time. If the data packet is to be separated, the separation is
specified in the separation Size attribute within control packet that is sent before transmitting the separated data
packets. If separation Size is set to zero this means no data separation is about to happen.
V. MC-MIP ALGORITHM
Input: (T, D, M);
Output: A feasible schedule ΨLTF with minimal energy consumption;
1: sort all tasks in a non-increasing order of the computation requirements
of tasks;
2: Xi ← φ and Xi ← 0 for i = 1 to M;
3: for i = 1 to |T| do
4: find the smallest Xm; (break ties arbitrarily)
5: Xm ← Xm + {τi} and Xm ← Xm + ci;
6: reorder Xi by a non-decreasing order of their loads and let
XLTF ← {X1, X2, . . . , XM};
7: return the resulted schedule ΨLTF by applying MES (XLTF);
Let T,D, andM denote the task set under discussions, its common deadline, and the number of cores,
respectively. Algorithm LTF always assigns a task to the core with the smallest load, where tasks are picked up
in a non-increasing order of their computation requirements. The seeking of the core with the smallest load
could be done by the manipulation of a heap data structure. The time complexity of Algorithm LTF is O (|T |
(log |T | + logM) +M), which is dominated by the cost for task sorting and heap manipulation.
CONCLUSION
Energy efficient jamming is a real threat to WSNs as it assumes little knowledge about the network
protocols and it can sustain an attack that is very effective, in terms of censorship rate and lifetime advantage,
for relatively long periods due to its low power consumption and jamming attack that is effective against TDMA
protocols such as SMAC, several countermeasures have been proposed to defend against this type of statistical
jamming attack, and they tend to change the timing properties of the protocol used by changing the slot size
randomly. In this paper, we present a novel countermeasure for TDMA protocols to defend against energy
efficient link layer jamming attacks, this countermeasure targets the power consumed by the jammer, the main
idea of the countermeasure is to separate the data packet into two parts. This separation results in misleading the
jammer to estimate the slot size smaller than it actually is and to jam at higher rate hence, lose power faster. The
defense is also equipped with a means to reduce slot size randomization effect on the throughput of the network
by having all slots equal in duration by applying MC-MIP. Typically, slot size randomization results in a
reduced network throughput due to randomized slot sizes among nodes resulting.
REFERENCES
[1]. Mpitziopoulos A; Gavalas D; Pantziou G; Konstantopoulos C; (2007)"Defending Wireless Sensor Networks from Jamming
Attacks," Personal Indoor and Mobile Radio Communications. PIMRC 2007. IEEE 18th International Symposium on , vol., no.,
pp.1-5, 3-7
[2]. A.D.Wood and J.A.Stankovic, (2002) “Denial of service in sensor networks", Computer, 35(10), pp. 54-62.
6. An Effective Defensive Node Against …
www.ijesi.org 46 | Page
[3]. CagaljM;CapkunS;HubauxJ.P; (2007)"Wormhole-BaseAntijamming Techniques in Sensor Networks,"
MobileComputing,IEEETransactions on, vol.6, no.1, pp.100-114.
[4]. Mpitziopoulos A, and Gavalas D, (2009) “An effective defensive node against jamming attacks in sensor networks“Security in
WirelessSensor Networks,vol. 2,Issue 2, pp. 145–163.
[5]. M. Strasser, C. Poper, S. ˇCapkun, and M. ˇCagalj. “Jamming-resistant key establishment using uncoordinated frequency hopping”.
In Proceedings of the 2008 IEEE Symposium on Security and Privacy,pages 64–78, 2008.
[6]. M. Pajic, and R. Mangharam, “Anti-jamming for embedded wireless networks,” in Proc. IPSN '09, 2009, p. 301-312.
[7]. (2011) The OMNET++ website. [Online]. Available: http://www.omnetpp.org
[8]. Jennifer Yick, Biswanath Mukherjee, Dipak Ghosal, “Wireless sensor network survey,” The International Journal of Computer and
Telecommunications Networking, vol. 52, pp. 2292–2330, Aug. 2008
[9]. Ruizhong Lin, Zhi Wang, and Youxian Sun, “Energy Efficient Medium Access Control Protocols for Wireless Sensor Networks and
ItsState-of-Art,” IEEE International Symposium on Industrial Electronics, vol. 1, pp. 669 - 674, May. 2004.