In wireless sensor ne
tworks (WSNs), sensor nodes have stringent energy and computation requirements.
Since they are left unattended, an adversary can generate false report attacks through compromised nodes.
This would result in an increased number of verifications to filter th
ese reports, causing waste of scarce
energy resources. In this paper, we propose energy
-
efficient path configuration method for dynamic en
-
route filtering (EDEF), which uses fuzzy logic to select the forwarding node(s). In order to cater to
compromised nod
es and to detect and filter the false reports, we create alternative paths. Our proposed
method selects forwarding nodes based on the key content of neighbor nodes, the number of neighbor
nodes, and the residual energy. Auth
-
keys are distributed randomly f
rom the global key pool. Simulation
results demonstrate the effectiveness of our proposed method with up to 8.2% energy efficiency as
compared to the dynamic en
-
route filtering (DEF) scheme.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
- The document discusses a fuzzy logic-based method for efficient message routing in wireless sensor networks to prolong the network lifetime. It aims to balance energy load across nodes by selectively tagging nodes at risk of energy exhaustion and rerouting messages around them.
- It proposes using fuzzy logic to evaluate nodes based on their potential importance, energy level, and event occurrence frequency to determine tagging. Tagged nodes avoid routing traffic but still detect and generate reports.
- The method was tested by applying it to a probabilistic voting-based filtering security scheme and was shown to improve energy efficiency, node survival rate, and report transmission success compared to not tagging nodes.
A PROPOSAL FOR IMPROVE THE LIFETIME OF WIRELESS SENSOR NETWORKIJCNCJournal
The document proposes a new routing protocol for wireless sensor networks that aims to improve network lifetime. The protocol is based on LEACH, an existing energy-efficient clustering protocol, but improves on it by electing cluster heads based on both remaining node energy and distance to the base station. Simulation results show the proposed protocol extends network lifetime by up to 75% compared to LEACH alone by distributing energy usage more evenly across nodes.
Comparison of energy efficient data transmission approaches for flat wireless...ijassn
In this paper we have analyzed energy efficient neighbour selection algorithms for routing in wireless
sensor networks. Since energy saving or consumption is an important aspect of wireless sensor networks,
its precise usage is highly desirable both for the faithful performance of network and to increase the
network life time. For this work, we have considered a flat network topology where every node has the
same responsibility and capability. We have compared two energy efficient algorithms and analyzed their
performances when all sensor nodes in a network have either homogeneous or heterogeneous energy with
increase in number of nodes, time rounds and node failures.
Enhancing the Energy Parameter of Leach Protocol For Wireless Sensor NetworkIJERD Editor
This paper presents a very new version of LEACH protocol, called as modified LEACH (MOD_LEACH), which focuses more on reducing the energy consumption within the Wireless Sensor Network. We evaluate both LEACH and LEACH-C through extensive simulation using NS-2.35 and the results shows that MOD_LEACH performs better and more energy efficiency than LEACH protocol
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.
A new method for controlling and maintainingIJCNCJournal
Topology Control is an essential technique in a wireless sensor network to extend the operational time of
the sensor nodes. The goal of this technique is to maintain network connectivity and optimize performance
metrics such as network lifetime and throughput. In this paper we presented a new method for controlling
and maintaining topology in wireless sensor networks that show some improvement over the state of art
methods. The results are analyzed based on objective criteria.
Minimum distance based routing protocol for lifetime improvement in wireless ...eSAT Journals
Abstract Balanced utilization of energy of wireless sensor nodes is a challenge while designing wireless sensor network (WSN). This energy of sensor node is a limited resource and measure for the lifespan of WSN. Communication process consumes most of the energy of sensor node hence; energy of sensor node becomes a major design issue for WSN. Clustering is preferred while designing routing protocols for WSN for its many to one traffic pattern. In our minimum distance based routing protocol for lifetime improvement in WSN (MDBRP) clusters are formed once in a lifetime and their heads are selected rotationally based on minimum communication distance between nodes and their next hop. MDBRP considers minimum energy consumption which aims to increase the overall lifespan of WSN. Keywords— clustering, dynamic clustering, routing protocol, static clustering, wireless sensor network.
SIMULATION PROCESS FOR MOBILE NODES INFORMATION USING LOCATION-AIDED ROUTING ...ijwmn
Location-aided routing protocol (LAR) utilizes the position information for routing. This system is
simulated position information in specific areas by using mobile nodes. Movement of hosts results in
routes, requiring some mechanism for determining new routes. This system finds position information using
Location aided routing algorithm between each nodes. In real application, mobile nodes can apply without
time consuming and saving cost to get location information using wireless sensor network. Each of the
nodes is involved with calculating its position. If the position information is searched in the routing
protocol, then position-based routing protocol is used. After creating the position table, all mobile nodes
can transmit 64B data within active mobile nodes via Base station. The algorithm is determined locations
of nodes based on the connectivity for every node in specific area. This system is demonstrated location
information by using Location-Aided Routing (LAR) protocol for route discovery. This system can assist to
detect location of the specific areas using mobiles nodes. Simulation results are used to draw conclusions
regarding to the proposed routing algorithm. The simulation of system is implemented mobile nodes and
node movement function by using C# programming language.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
- The document discusses a fuzzy logic-based method for efficient message routing in wireless sensor networks to prolong the network lifetime. It aims to balance energy load across nodes by selectively tagging nodes at risk of energy exhaustion and rerouting messages around them.
- It proposes using fuzzy logic to evaluate nodes based on their potential importance, energy level, and event occurrence frequency to determine tagging. Tagged nodes avoid routing traffic but still detect and generate reports.
- The method was tested by applying it to a probabilistic voting-based filtering security scheme and was shown to improve energy efficiency, node survival rate, and report transmission success compared to not tagging nodes.
A PROPOSAL FOR IMPROVE THE LIFETIME OF WIRELESS SENSOR NETWORKIJCNCJournal
The document proposes a new routing protocol for wireless sensor networks that aims to improve network lifetime. The protocol is based on LEACH, an existing energy-efficient clustering protocol, but improves on it by electing cluster heads based on both remaining node energy and distance to the base station. Simulation results show the proposed protocol extends network lifetime by up to 75% compared to LEACH alone by distributing energy usage more evenly across nodes.
Comparison of energy efficient data transmission approaches for flat wireless...ijassn
In this paper we have analyzed energy efficient neighbour selection algorithms for routing in wireless
sensor networks. Since energy saving or consumption is an important aspect of wireless sensor networks,
its precise usage is highly desirable both for the faithful performance of network and to increase the
network life time. For this work, we have considered a flat network topology where every node has the
same responsibility and capability. We have compared two energy efficient algorithms and analyzed their
performances when all sensor nodes in a network have either homogeneous or heterogeneous energy with
increase in number of nodes, time rounds and node failures.
Enhancing the Energy Parameter of Leach Protocol For Wireless Sensor NetworkIJERD Editor
This paper presents a very new version of LEACH protocol, called as modified LEACH (MOD_LEACH), which focuses more on reducing the energy consumption within the Wireless Sensor Network. We evaluate both LEACH and LEACH-C through extensive simulation using NS-2.35 and the results shows that MOD_LEACH performs better and more energy efficiency than LEACH protocol
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.
A new method for controlling and maintainingIJCNCJournal
Topology Control is an essential technique in a wireless sensor network to extend the operational time of
the sensor nodes. The goal of this technique is to maintain network connectivity and optimize performance
metrics such as network lifetime and throughput. In this paper we presented a new method for controlling
and maintaining topology in wireless sensor networks that show some improvement over the state of art
methods. The results are analyzed based on objective criteria.
Minimum distance based routing protocol for lifetime improvement in wireless ...eSAT Journals
Abstract Balanced utilization of energy of wireless sensor nodes is a challenge while designing wireless sensor network (WSN). This energy of sensor node is a limited resource and measure for the lifespan of WSN. Communication process consumes most of the energy of sensor node hence; energy of sensor node becomes a major design issue for WSN. Clustering is preferred while designing routing protocols for WSN for its many to one traffic pattern. In our minimum distance based routing protocol for lifetime improvement in WSN (MDBRP) clusters are formed once in a lifetime and their heads are selected rotationally based on minimum communication distance between nodes and their next hop. MDBRP considers minimum energy consumption which aims to increase the overall lifespan of WSN. Keywords— clustering, dynamic clustering, routing protocol, static clustering, wireless sensor network.
SIMULATION PROCESS FOR MOBILE NODES INFORMATION USING LOCATION-AIDED ROUTING ...ijwmn
Location-aided routing protocol (LAR) utilizes the position information for routing. This system is
simulated position information in specific areas by using mobile nodes. Movement of hosts results in
routes, requiring some mechanism for determining new routes. This system finds position information using
Location aided routing algorithm between each nodes. In real application, mobile nodes can apply without
time consuming and saving cost to get location information using wireless sensor network. Each of the
nodes is involved with calculating its position. If the position information is searched in the routing
protocol, then position-based routing protocol is used. After creating the position table, all mobile nodes
can transmit 64B data within active mobile nodes via Base station. The algorithm is determined locations
of nodes based on the connectivity for every node in specific area. This system is demonstrated location
information by using Location-Aided Routing (LAR) protocol for route discovery. This system can assist to
detect location of the specific areas using mobiles nodes. Simulation results are used to draw conclusions
regarding to the proposed routing algorithm. The simulation of system is implemented mobile nodes and
node movement function by using C# programming language.
Analysis of data transmission in wireless lan for 802.11 e2 eteSAT Journals
Abstract The aim of this paper is to investigate the transmission of data between client and server through different IEEE 802.11 wireless LAN multi- HOP network. To improve this issue, the transmission opportunity (TXOP) mechanism is defined in the IEEE 802.11e standard, with which a wireless node can transmit multiple frames consecutively for a maximum channel occupancy time, called TXOP limit. This paper considers the performance of the TXOP mechanism for multi-hop wireless networks. Focusing on a three-node chain topology, we model it as a tandem queuing network with two nodes. The E2ET is derived and the analysis is validated by simulation. Numerical results show that the TXOP mechanism works well for multi-hop wireless networks. It is also shown that adjusting TXOP limit is significantly important in order to increase the overall throughput. In terms of multi-hop wireless networks, there is little analytical work with regard to the E2ET performance. One of the rationales for the analytical difficulty for multi-hop wireless networks is that IEEE 802.11 MAC protocol is too complex to model the behavior of multi-hop frame transmissions. Keywords: IEEE 802.11e, multi-hop wireless LAN, TXOP, E2ET
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.
Transmission Time and Throughput analysis of EEE LEACH, LEACH and Direct Tran...acijjournal
This paper gives a brief description about some routing protocols like EEE LEACH, LEACH and Direct
Transmission protocol (DTx) in Wireless Sensor Network (WSN) and a comparison study of these
protocols based on some performance matrices. Addition to this an attempt is done to calculate their
transmission time and throughput. To calculate these, MATLAB environment is used. Finally, on the basis
of the obtained results from the simulation, the above mentioned three protocols are compared. The
comparison results show that, the EEE LEACH routing protocol has a greater transmission time than
LEACH and DTx protocol and with smaller throughput.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
Performance Evaluation of a Layered WSN Using AODV and MCF Protocols in NS-2csandit
This document summarizes a study that compares the performance of two routing protocols, AODV and MCF, in a layered wireless sensor network (WSN) using the network simulator NS-2. It first provides background on AODV, describing how it establishes and maintains routes. It then describes the MCF protocol, which formulates lightpath routing as an integer linear program to minimize the impact of fiber failures. The document outlines how both protocols were implemented in NS-2 and compares their performance based on metrics like throughput, packet loss, and end-to-end delay. The simulation results show that MCF generally has better throughput and reliability than AODV in the scenario of a 80-node WSN.
Optimal scheduling algorithm for throughput maximization in multihop wireless...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
This document proposes an energy efficient approach for wireless sensor networks (WSNs) based on zone formation rather than clustering. It involves grouping nodes into zones based on the number of hops to an inviting node, with each zone having a maximum radius R. The algorithm constructs zones virtually by exchanging invitation packets. Nodes track their zone ID and type (normal or border). Border nodes store information about neighboring zones. Experimental results show the approach reduces energy consumption by decreasing unnecessary transmissions compared to other protocols.
Performance Analysis of Clustering Protocols for Wireless Sensor NetworkIRJET Journal
This document analyzes and compares several clustering protocols for wireless sensor networks, including LEACH, DSC, FTEEC, and MEFC. It finds that the MEFC protocol has lower network energy consumption and longer network lifetime than LEACH and DSC protocols through simulations. Specifically, the simulations show that MEFC and FTEEC have similar performance in terms of energy consumption and network lifetime, both of which outperform LEACH and DSC. Additionally, MEFC reduces the number of special packet transmissions compared to FTEEC. In conclusion, the theoretical analysis indicates MEFC has better energy efficiency than FTEEC, DSC and LEACH protocols.
This document proposes a physical-layer network coding (PNC) scheme to improve throughput in wireless networks. PNC takes advantage of the broadcast nature of wireless transmissions by allowing signals from multiple nodes to be combined at the physical layer through modulation and demodulation. It demonstrates PNC for a three-node wireless linear network. With PNC, the three nodes can exchange information in two time slots, improving throughput by 100% over traditional scheduling and 50% over straightforward network coding. PNC mapping provides a way to perform network coding operations on electromagnetic signals directly at the physical layer by mapping their combination to binary additions.
Performance Analysis of Clustering Protocols for Wireless Sensor NetworkIRJET Journal
This document analyzes and compares several clustering protocols for wireless sensor networks, including LEACH, DSC, FTEEC, and MEFC. It finds that the MEFC protocol performs best in terms of network energy consumption and lifetime. Specifically, it summarizes that MEFC and FTEEC protocols have similar performance with higher network lifetimes than LEACH and DSC protocols. Additionally, MEFC slightly outperforms the other protocols by reducing the number of messages transmitted through the use of gateway nodes for inter-cluster communication.
Et3003 sem2-1314-7 network layers iv (ipv4)Tutun Juhana
1) IP packets can be fragmented into smaller pieces if they exceed the Maximum Transmission Unit (MTU) size of a network. Each fragment contains a header with fields like Identification, Flags, and Fragmentation Offset to allow reassembly.
2) The Identification field uniquely identifies the original packet. The Flags field indicates if a packet can be fragmented or is the last fragment. The Fragmentation Offset specifies the position of the fragment.
3) IP packet options like Record Route and Timestamp can be used for debugging but are not required. They have a type-length-value format and options like No-Operation and End-of-Option are used as padding.
This document discusses energy efficient big data gathering in densely distributed sensor networks. It proposes a new mobile sink routing and data gathering method using network clustering based on a modified Expectation-Maximization technique. This aims to minimize energy consumption by deriving an optimal number of clusters to reduce energy used for data requests and wireless transmissions between sensor nodes. Numerical results are presented to validate that the proposed method can efficiently gather big data from sensor networks in an energy efficient manner.
This document summarizes and classifies various routing protocols for wireless sensor networks (WSN). It discusses protocols that are homogenous (all nodes are identical) and heterogeneous (nodes differ). It focuses on clustered protocols where nodes are grouped into clusters to aggregate and transmit data. Specific clustered protocols covered include LEACH (Low-Energy Adaptive Clustering Hierarchy), ALEACH, MR-LEACH, PEGASIS, TEEN, and Re-Cluster LEACH. Each protocol is summarized with its key features and advantages/disadvantages.
The document describes three distributed algorithms for estimating the path loss exponent (PLE) in large wireless networks. The first algorithm uses the mean interference value and assumes knowledge of the network density. The second and third algorithms are based on outage probabilities and connectivity properties, respectively, and do not require knowledge of density or fading parameters. Simulation results demonstrate the performance of the algorithms and quantify the estimation error. The algorithms take into account interference, noise, and fading effects in wireless networks.
The Extended Clustering Ad Hoc Routing Protocol (Ecrp)IJCNCJournal
Ad hoc networks are a collection of mobile nodes communicating via wireless channels without any fixed
infrastructure. Because of their ease and low cost of building, ad hoc networks have a lot of attractive
applications in different fields. The topology of ad hoc networks changes dynamically, and each node in the
network can act as a host or router. With the increase in the number of wireless devices and large amount
of traffic to be exchanged, the demand for scalable routing protocols has increased. This paper presents a
scalable routing protocol, based on AODV protocol, called the Extended Clustering Ad Hoc Routing
Protocol (ECRP). This is a hybrid protocol, which combines reactive and proactive approaches in routing.
The protocol uses the Global Positioning System to determine the position of certain nodes in the network.
The evaluation methodology and simulation results obtained show that the protocol is efficient and scales
well in large networks
Computer Communication Networks-Network LayerKrishna Nanda
The document discusses the network layer in computer networks. It describes that the network layer is responsible for packetizing data by encapsulating it and adding headers, routing packets from source to destination by determining the best path, and forwarding packets through routers along the path. It explains the two main approaches used at the network layer - connectionless datagram service where each packet is routed independently, and connection-oriented virtual circuit service where a connection is established and packets follow the same path.
This document proposes a physical-layer network coding (PNC) scheme to improve capacity in wireless networks. PNC takes advantage of the broadcast nature of wireless transmissions by allowing signals from multiple nodes to be combined at the receiver using network coding principles. Specifically:
- PNC coordinates transmissions so that signals from different nodes arrive simultaneously at the relay node, where they are combined using modulation mapping that performs network coding operations in the physical layer.
- This allows the relay node to transmit a single coded signal, requiring fewer time slots than schemes that avoid or separate interfering signals.
- In a basic three-node example network, PNC allows information exchange between the two outer nodes in two time slots, compared
This document summarizes a research paper that proposes a new Position Based Opportunistic Routing Protocol (POR) to improve reliable data delivery in mobile ad hoc networks. Existing geographic routing protocols have issues with route failures and delays in discovering new routes when nodes move. The proposed POR protocol selects multiple forwarding candidate nodes to opportunistically forward packets. If the primary forwarder fails, backup candidates can forward packets to avoid transmission interruptions. Simulation results show the POR protocol has lower delay and higher packet delivery ratio compared to existing protocols.
This document summarizes a conference on occupational safety and health that took place in Riga, Latvia from April 27-28, 2015. It discusses 6 games that were presented to make occupational safety fun and engaging for workers. The games focused on topics like slips and trips, identifying workplace risks, and calculating the costs of accidents. They were developed in Latvia and other European countries and were available both online and physically. The goal was to creatively teach workers how to behave safely and prevent accidents through an entertaining medium.
Kekeletso Khanye's resume summarizes her education and experience in television production. She received an Honors Degree in Film and Television from AFDA Film School in 2013, where she studied television production, cinematography, sound engineering, and media production. Some of her achievements include winning a Bronze Award for Best Television Production for her work on "My Sister" in 2013. Her resume lists the television productions she has worked on and the companies she has previously gained experience at, and provides contact details for references.
Analysis of data transmission in wireless lan for 802.11 e2 eteSAT Journals
Abstract The aim of this paper is to investigate the transmission of data between client and server through different IEEE 802.11 wireless LAN multi- HOP network. To improve this issue, the transmission opportunity (TXOP) mechanism is defined in the IEEE 802.11e standard, with which a wireless node can transmit multiple frames consecutively for a maximum channel occupancy time, called TXOP limit. This paper considers the performance of the TXOP mechanism for multi-hop wireless networks. Focusing on a three-node chain topology, we model it as a tandem queuing network with two nodes. The E2ET is derived and the analysis is validated by simulation. Numerical results show that the TXOP mechanism works well for multi-hop wireless networks. It is also shown that adjusting TXOP limit is significantly important in order to increase the overall throughput. In terms of multi-hop wireless networks, there is little analytical work with regard to the E2ET performance. One of the rationales for the analytical difficulty for multi-hop wireless networks is that IEEE 802.11 MAC protocol is too complex to model the behavior of multi-hop frame transmissions. Keywords: IEEE 802.11e, multi-hop wireless LAN, TXOP, E2ET
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.
Transmission Time and Throughput analysis of EEE LEACH, LEACH and Direct Tran...acijjournal
This paper gives a brief description about some routing protocols like EEE LEACH, LEACH and Direct
Transmission protocol (DTx) in Wireless Sensor Network (WSN) and a comparison study of these
protocols based on some performance matrices. Addition to this an attempt is done to calculate their
transmission time and throughput. To calculate these, MATLAB environment is used. Finally, on the basis
of the obtained results from the simulation, the above mentioned three protocols are compared. The
comparison results show that, the EEE LEACH routing protocol has a greater transmission time than
LEACH and DTx protocol and with smaller throughput.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
Performance Evaluation of a Layered WSN Using AODV and MCF Protocols in NS-2csandit
This document summarizes a study that compares the performance of two routing protocols, AODV and MCF, in a layered wireless sensor network (WSN) using the network simulator NS-2. It first provides background on AODV, describing how it establishes and maintains routes. It then describes the MCF protocol, which formulates lightpath routing as an integer linear program to minimize the impact of fiber failures. The document outlines how both protocols were implemented in NS-2 and compares their performance based on metrics like throughput, packet loss, and end-to-end delay. The simulation results show that MCF generally has better throughput and reliability than AODV in the scenario of a 80-node WSN.
Optimal scheduling algorithm for throughput maximization in multihop wireless...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
This document proposes an energy efficient approach for wireless sensor networks (WSNs) based on zone formation rather than clustering. It involves grouping nodes into zones based on the number of hops to an inviting node, with each zone having a maximum radius R. The algorithm constructs zones virtually by exchanging invitation packets. Nodes track their zone ID and type (normal or border). Border nodes store information about neighboring zones. Experimental results show the approach reduces energy consumption by decreasing unnecessary transmissions compared to other protocols.
Performance Analysis of Clustering Protocols for Wireless Sensor NetworkIRJET Journal
This document analyzes and compares several clustering protocols for wireless sensor networks, including LEACH, DSC, FTEEC, and MEFC. It finds that the MEFC protocol has lower network energy consumption and longer network lifetime than LEACH and DSC protocols through simulations. Specifically, the simulations show that MEFC and FTEEC have similar performance in terms of energy consumption and network lifetime, both of which outperform LEACH and DSC. Additionally, MEFC reduces the number of special packet transmissions compared to FTEEC. In conclusion, the theoretical analysis indicates MEFC has better energy efficiency than FTEEC, DSC and LEACH protocols.
This document proposes a physical-layer network coding (PNC) scheme to improve throughput in wireless networks. PNC takes advantage of the broadcast nature of wireless transmissions by allowing signals from multiple nodes to be combined at the physical layer through modulation and demodulation. It demonstrates PNC for a three-node wireless linear network. With PNC, the three nodes can exchange information in two time slots, improving throughput by 100% over traditional scheduling and 50% over straightforward network coding. PNC mapping provides a way to perform network coding operations on electromagnetic signals directly at the physical layer by mapping their combination to binary additions.
Performance Analysis of Clustering Protocols for Wireless Sensor NetworkIRJET Journal
This document analyzes and compares several clustering protocols for wireless sensor networks, including LEACH, DSC, FTEEC, and MEFC. It finds that the MEFC protocol performs best in terms of network energy consumption and lifetime. Specifically, it summarizes that MEFC and FTEEC protocols have similar performance with higher network lifetimes than LEACH and DSC protocols. Additionally, MEFC slightly outperforms the other protocols by reducing the number of messages transmitted through the use of gateway nodes for inter-cluster communication.
Et3003 sem2-1314-7 network layers iv (ipv4)Tutun Juhana
1) IP packets can be fragmented into smaller pieces if they exceed the Maximum Transmission Unit (MTU) size of a network. Each fragment contains a header with fields like Identification, Flags, and Fragmentation Offset to allow reassembly.
2) The Identification field uniquely identifies the original packet. The Flags field indicates if a packet can be fragmented or is the last fragment. The Fragmentation Offset specifies the position of the fragment.
3) IP packet options like Record Route and Timestamp can be used for debugging but are not required. They have a type-length-value format and options like No-Operation and End-of-Option are used as padding.
This document discusses energy efficient big data gathering in densely distributed sensor networks. It proposes a new mobile sink routing and data gathering method using network clustering based on a modified Expectation-Maximization technique. This aims to minimize energy consumption by deriving an optimal number of clusters to reduce energy used for data requests and wireless transmissions between sensor nodes. Numerical results are presented to validate that the proposed method can efficiently gather big data from sensor networks in an energy efficient manner.
This document summarizes and classifies various routing protocols for wireless sensor networks (WSN). It discusses protocols that are homogenous (all nodes are identical) and heterogeneous (nodes differ). It focuses on clustered protocols where nodes are grouped into clusters to aggregate and transmit data. Specific clustered protocols covered include LEACH (Low-Energy Adaptive Clustering Hierarchy), ALEACH, MR-LEACH, PEGASIS, TEEN, and Re-Cluster LEACH. Each protocol is summarized with its key features and advantages/disadvantages.
The document describes three distributed algorithms for estimating the path loss exponent (PLE) in large wireless networks. The first algorithm uses the mean interference value and assumes knowledge of the network density. The second and third algorithms are based on outage probabilities and connectivity properties, respectively, and do not require knowledge of density or fading parameters. Simulation results demonstrate the performance of the algorithms and quantify the estimation error. The algorithms take into account interference, noise, and fading effects in wireless networks.
The Extended Clustering Ad Hoc Routing Protocol (Ecrp)IJCNCJournal
Ad hoc networks are a collection of mobile nodes communicating via wireless channels without any fixed
infrastructure. Because of their ease and low cost of building, ad hoc networks have a lot of attractive
applications in different fields. The topology of ad hoc networks changes dynamically, and each node in the
network can act as a host or router. With the increase in the number of wireless devices and large amount
of traffic to be exchanged, the demand for scalable routing protocols has increased. This paper presents a
scalable routing protocol, based on AODV protocol, called the Extended Clustering Ad Hoc Routing
Protocol (ECRP). This is a hybrid protocol, which combines reactive and proactive approaches in routing.
The protocol uses the Global Positioning System to determine the position of certain nodes in the network.
The evaluation methodology and simulation results obtained show that the protocol is efficient and scales
well in large networks
Computer Communication Networks-Network LayerKrishna Nanda
The document discusses the network layer in computer networks. It describes that the network layer is responsible for packetizing data by encapsulating it and adding headers, routing packets from source to destination by determining the best path, and forwarding packets through routers along the path. It explains the two main approaches used at the network layer - connectionless datagram service where each packet is routed independently, and connection-oriented virtual circuit service where a connection is established and packets follow the same path.
This document proposes a physical-layer network coding (PNC) scheme to improve capacity in wireless networks. PNC takes advantage of the broadcast nature of wireless transmissions by allowing signals from multiple nodes to be combined at the receiver using network coding principles. Specifically:
- PNC coordinates transmissions so that signals from different nodes arrive simultaneously at the relay node, where they are combined using modulation mapping that performs network coding operations in the physical layer.
- This allows the relay node to transmit a single coded signal, requiring fewer time slots than schemes that avoid or separate interfering signals.
- In a basic three-node example network, PNC allows information exchange between the two outer nodes in two time slots, compared
This document summarizes a research paper that proposes a new Position Based Opportunistic Routing Protocol (POR) to improve reliable data delivery in mobile ad hoc networks. Existing geographic routing protocols have issues with route failures and delays in discovering new routes when nodes move. The proposed POR protocol selects multiple forwarding candidate nodes to opportunistically forward packets. If the primary forwarder fails, backup candidates can forward packets to avoid transmission interruptions. Simulation results show the POR protocol has lower delay and higher packet delivery ratio compared to existing protocols.
This document summarizes a conference on occupational safety and health that took place in Riga, Latvia from April 27-28, 2015. It discusses 6 games that were presented to make occupational safety fun and engaging for workers. The games focused on topics like slips and trips, identifying workplace risks, and calculating the costs of accidents. They were developed in Latvia and other European countries and were available both online and physically. The goal was to creatively teach workers how to behave safely and prevent accidents through an entertaining medium.
Kekeletso Khanye's resume summarizes her education and experience in television production. She received an Honors Degree in Film and Television from AFDA Film School in 2013, where she studied television production, cinematography, sound engineering, and media production. Some of her achievements include winning a Bronze Award for Best Television Production for her work on "My Sister" in 2013. Her resume lists the television productions she has worked on and the companies she has previously gained experience at, and provides contact details for references.
A High Step Up Hybrid Switch Converter Connected With PV Array For High Volt...ijitjournal
T
his paper
presents
a
ste
p up DC
-
to
-
DC converter with
hybrid switch capacitor technique having
high
voltage conversion ratio with small
switch voltage stress
. The converter is suitable for the applications
where high voltage conversion is required. The proposed
DC
-
DC converter
has low voltage ratted
MOSFET switch and is connected to PV array to get high output voltage at small duty ratios.
Hence it has
high efficiency.
The principles of operations and the theoretical analysis are presented in this paper.
All the
simulations are
done in MATLAB
-
SIMULINK Environment and
results were obtained with voltage
conversion ratio of 4.
In this file, you can ref resume materials for site clerk such as site clerk resume samples, site clerk resume writing tips, site clerk cover letters, site clerk interview questions with answers…
In this file, you can ref resume materials for operations clerk such as operations clerk resume samples, operations clerk resume writing tips, operations clerk cover letters, operations clerk interview questions with answers…
El documento describe el desarrollo inicial de los aviones de guerra. Italia fue la primera nación en usar un avión con fines militares en 1910 durante una guerra contra Turquía. En 1911, un piloto italiano dejó caer 4 granadas de mano sobre tropas turcas desde un avión, siendo este el primer bombardeo aéreo. Los aviones de guerra mejoraron rápidamente debido al desarrollo tecnológico impulsado por las guerras.
Entropy Nucleus a nd Use i n Waste Disposal Policiesijitjournal
The central theme of this article is that the usual Shannon’s entropy [1] is not suff
icient to address the
unknown Gaussian population average. A remedy is necessary. By peeling away entropy junkies, a refined
version is introduced and it is named nucleus entropy in this article. Statistical properties and advantages
of the Gaussian nucleu
s entropy are derived and utilized to interpret 2005 and 2007 waste disposals (in
1,000 tons) by fifty
-
one states (including the District of Columbia) in USA. Each state generates its own,
imports from a state for a revenue, and exports to another state wi
th a payment waste disposal [2]. Nucleus
entropy is large when the population average is large and/or when the population variance is lesser.
Nucleus entropy advocates the significance of the waste policies under four scenarios: (1) keep only
generated, (2
) keep generated with receiving in and shipping out, (3) without receiving in, and (4) without
shipping out. In the end, a few recommendations are suggested for the waste management policy makers
This document discusses how society is evolving from an agricultural to an industrial to a new Society 3.0 model. Key aspects of Society 3.0 include access being more important than ownership, a sharing economy where goods and services are accessed rather than owned, and new platforms and companies like Uber, Airbnb and Alibaba that provide access over assets. Cities will become more important hubs and knowmads or self-employed digital nomads will rise in this new society structured around sharing and access.
Lehendakariaren hitzaldia - Enpresa Ramondin egindako bisita: 125 urteurrena Irekia - EJGV
El documento describe la visita del Lehendakari a la empresa RAMONDIN con motivo de su 125 aniversario. El Lehendakari felicita a la empresa por su trayectoria y compromiso social, y por apostar por la calidad, la innovación y los mercados externos. Señala que RAMONDIN y la economía vasca comparten los pilares de compromiso, apuesta por la empresa moderna y visión de futuro, lo que ha permitido que Euskadi salga de la recesión y cree empleo. Los datos más recientes muestran una reducción del desempleo del 6%
In this file, you can ref resume materials for stores clerk such as stores clerk resume samples, stores clerk resume writing tips, stores clerk cover letters, stores clerk interview questions with answers…
In this file, you can ref resume materials for utility clerk such as utility clerk resume samples, utility clerk resume writing tips, utility clerk cover letters, utility clerk interview questions with answers…
In this file, you can ref resume materials for junior clerk such as junior clerk resume samples, junior clerk resume writing tips, junior clerk cover letters, junior clerk interview questions with answers…
Los fenómenos magnéticos son conocidos desde la antigüedad. En el 1600, William Gilbert contempló la Tierra como un gigantesco imán. En 1838, Gauss probó mediante mediciones precisas que el campo magnético terrestre tiene un origen interno. Actualmente se cree que el campo está determinado por un dipolo axial ubicado en el centro de la Tierra y alineado cerca del eje de rotación.
The document discusses the physician-patient relationship and the concept of the "sick role" according to Parsons. It describes expectations for both parties in the relationship, with the physician holding power/expertise and the patient being dependent. The physician uses techniques like professional prestige, situational authority, and the patient's dependency to promote the goal of improving health. Some argue medicine is used as a means of social control, with physicians defining what is deviant behavior versus illness. The sick role and physician-patient relationship help regulate human behavior and maintain social order.
In Reinventing You, branding expert Dorie Clark explain about step by step guide to help you assess your unique strengths, develop a compelling personal brands.
A SECURITY PERIOD UPDATE METHOD USING EVALUATION FUNCTION FOR IMPROVING ENERG...csandit
In recent years, Wireless Sensor Networks(WSNs) research has been carried out with the goals
of achieving high security and energy efficiency. In a WSN, sensor nodes are vulnerable to
physical attacks because they are deployed in an open environment. An attacker can inject a
false report into networks using these vulnerabilities. F. Ye et al. proposed statistical en-route
filtering to prevent false report injection attacks. In order to effectively use their scheme,
techniques for determining thresholds using fuzzy logic have been studied. To effectively apply
these techniques to the network, an appropriate update period should be set according to the
network environments. In this paper, we propose a security period update method in order to
improve the lifetime of the network in the statistical en-route filtering approach based on a
wireless sensor network of the cluster environment. The experimental results show that up to an
11.96% improvement of the energy efficiency can be achieved when the security threshold is set
to the optimal period.
Fuzzy Logic-based Efficient Message Route Selection Method to Prolong the Net...IJCNCJournal
Recently, sensor networks have been used in a wide range of applications, and interest in sensor node performance has increased. A sensor network is composed of tiny nodes with limited resources. The sensor network communicates between nodes in a configured network through self-organization. An energyefficient security protocol with a hierarchy structure with various advantages has been proposed to prolong the network lifetime of sensor networks. But due to structural problems in traditional protocols, nodes located upstream tend to consume relatively high energy compared to other nodes. A network protocol should be considered to provide minimal security and efficient allocation of energy consumption by nodes to increase the network lifetime. In this paper, we introduce a solution to solve the bottleneck problem through an efficient message route selection method. The proposed method selects an efficient messaging path using GA and fuzzy logic composed of multiple rules. Message route selection plays an important role in controlling the load balancing of nodes. A principal benefit of the proposed scheme is the potential portability of the clustering-based protocol. In addition, the proposed method is updated to find the optimal path through the genetic algorithm to respond to various environments. We demonstrated the effectiveness of the proposed method through an experiment in which the proposed method is applied to a probabilistic voting-based filtering scheme that is one of the cluster-based security schemes.
NUMBER OF NEIGHBOUR NODES BASED NEXT FORWARDING NODES DETERMINATION SCHEME FO...ijcsity
Wireless Sensor Networks (Wsn) Are Used In Various Areas. These Networks Are Deployed In An Open Environment. So, They Are Very Weak Against An Attack, And Easily Damaged.The Wsn Has Limited Resources In Terms Of Battery Life, Computing Power, Communication Bandwidth And So On. Many Attacks Aim At That Point.The False Report Injection Attack Is One Of Them. Yu Et Al. Proposed A Dynamic En-Route Filtering Scheme (Def),To Prevent A False Report Injection Attack.In This Paper, We Propose An Energy Enhancement Scheme For Def Using A Fuzzy System. The Def Is Divided Into Three Phases (Key Pre-Distribution Phase, Key Dissemination Phase, Report Forwarding Phase). We Applied Our Scheme At The Next Forwarding Node Determination. So We Used Three Input Factors Of A Fuzzy System To Make A Determination. These Are The Availability Of Energy, Distance To The Base Station,
And Usage Count.Through The Experiments, Our Proposed Method Shows Up To 8.2% Energy Efficiency,Compared With The Def. If The Networks Consume More Energy, Our Proposed Method Shows More Efficiency For The Energy.
This document presents a clustering approach using a handoff mechanism to enhance network lifetime in wireless sensor networks. It proposes using a mobile-based LEACH-ERE method for clustering and cluster head election to improve energy efficiency. The method considers both fixed and mobile nodes to increase network lifetime, packet delivery ratio, and energy usage effectiveness. It was found that the mobile-based LEACH-ERE approach increases network lifetime and packet delivery ratio compared to the static LEACH protocol, as it consumes less energy over time.
An Enhanced Detection and Energy-Efficient En-Route Filtering Scheme in Wirel...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes (MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%)
AN ENHANCED DETECTION AND ENERGYEFFICIENT EN-ROUTE FILTERING SCHEME IN WIRELE...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a
fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes
(MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network
energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%) against false report attacks in WSNs.
Fuzzy-Based Multiple Path Selection Method for Improving Energy Efficiency in...aciijournal
In wireless sensor networks, adversaries can easily compromise sensors because the sensor resources are
limited. The compromised nodes can inject false data into the network injecting false data attacks. The
injecting false data attack has the goal of consuming unnecessary energy in en-route nodes and causing
false alarms in a sink. A bandwidth-efficient cooperative authentication scheme detects this attack based on
the random graph characteristics of sensor node deployment and a cooperative bit-compressed
authentication technique. Although this scheme maintains a high filtering probability and high reliability in
the sensor network, it wastes energy in en-route nodes due to a multireport solution. In this paper, our
proposed method effectively selects a number of multireports based on the fuzzy rule-based system. We
evaluated the performance in terms of the security level and energy savings in the presence of the injecting
false data attacks. The experimental results indicate that the proposed method improves the energy
efficiency up to 10% while maintaining the same security level as compared to the existing scheme.
The document proposes an improved routing algorithm called I-DRINA for wireless sensor networks. I-DRINA aims to enhance routing performance for energy efficiency and critical event monitoring. It compares I-DRINA to existing routing protocols LEACH and DRINA. Simulation results on the NS2 platform show I-DRINA performs better in terms of average energy consumption, end-to-end delay, throughput, normalized routing load, and packet delivery ratio, especially for larger node configurations. I-DRINA routes data in an energy-efficient way by considering the remaining energy of intermediate relay nodes.
Enhancement of Routing Performance for Energy Efficiency and Critical Event M...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Improved Performance of LEACH using Better CH Selection by Weighted Parametersijsrd.com
In recent era, the research for improving the performance of the WSN is done in the 'speed of light'. LEACH is the protocol which has changed the scenario of using WSN for any application like monitoring physical parameters, measuring parameters surveillance etc. Also LEACH-C can be used for the same with some modifications in LEACH like deciding CH centrally in fixed amount. But there is a con of LEACH; it decides the CH based on random generation value. Therefore, in proposed scheme, threshold is calculated using weighted parameter of residual energy and distance from the base station.
Data aggregation and storage has become very important issue in Sensor
networks for future information retrieval. Storage nodes serve as an intermediate tier
between sensors and a sink for storing data and processing queries in wireless sensor
networks. The importance of storage nodes also makes them attractive to attackers. Data
Storage is happens via the Forwarding nodes and Storage nodes. Storage nodes are
introduced in this paper to store collected data from the sensors in their proximities, it
reduce the energy cost and communication cost induced by network query. Aim of the
project is to deploy the storage nodes and secure data transmission for cluster-based WSNs
(CWSNs), where the clusters are formed dynamically and periodically. We propose two
Secure and Efficient data Transmission (SET) protocols for CWSNs, called SET-IBS and
SET-IBOOS, by using the Identity-Based digital Signature (IBS) scheme and the Identity-
Based Online/Offline digital Signature (IBOOS) scheme, respectively. The cluster routing
protocol LEACH (Low-Energy Adaptive Clustering Hierarchy) is considered and
improved. We propose a clustering routing protocol named Enhanced LEACH, which
extend LEACH protocol for balancing the energy consumption in the network. The output
shows that the comparison of Leach and Enhanced leach protocol for improving the
network life time and power consumption of the network and also provides the safety and
security using those protocols.
COMPARISON OF ENERGY EFFICIENT DATA RANSMISSION APPROACHES FOR FLAT WIRELESS ...ijassn
The document compares two energy efficient routing approaches - highest energy (HE) and minimum energy consumption route (MECRT) - for flat wireless sensor networks. Through simulations, it finds that in homogeneous networks, MECRT outperforms HE in terms of energy consumption and network lifetime. However, in heterogeneous networks, HE performs better than MECRT for medium sized networks. Overall, the document analyzes and compares the performance of these two energy efficient routing techniques for both homogeneous and heterogeneous wireless sensor networks of varying sizes.
LOAD BALANCING MANAGEMENT USING FUZZY LOGIC TO IMPROVE THE REPORT TRANSFER SU...cscpconf
A wireless sensor network (WSN) consists of multiple sensor nodes and base stations (BS) that
collect information over widely deployed sensor nodes. Sensor nodes have limited energy source
and low computing power. Due to those features, there is a disadvantage that user's individual
node management is difficult and they are easily captured by attackers. Therefore, efficient
energy allocation of nodes is important and network security protocol is needed. The
Probabilistic Voting Filtering System (PVFS) is a system that prevents false vote injection
attack and false report attack injected from attackers. The reason for the existence of this
protocol is for energy management of nodes through defence against those attacks and in order
to efficiently manage the network based on PVFS, load balancing of nodes should be performed.
In the proposed scheme, fuzzy logic is applied to each cluster head node (CH) to perform load
balancing by determine whether to perform a role as a verification node and an event
forwarding node. The experiment shows that the event detection rate and the report delivery
success rate are improved in proposed scheme compare with original PVFS.
Energetic Hybrid Routing Protocol (E-HRP) is proposed to improve energy efficiency in wireless sensor networks. E-HRP combines zone-based routing inspired by ZRP with clustering like LEACH. It operates in three steps: 1) construction of zones using gateway nodes, 2) selection of cluster heads based on energy levels, and 3) establishment of intra-zone paths from nodes to cluster heads. E-HRP aims to minimize transmissions and packet sizes to reduce energy consumption from radio usage, which is the main energy drain. Simulations show E-HRP performs better than ZRP in terms of energy efficiency, end-to-end delay, and packet loss.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
in the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
In the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
BLACKLIST MANAGEMENT USING A VERIFICATION REPORT TO IMPROVE THE ENERGY EFFICI...ijwmn
Recently, the applications scope of Wireless Sensor Networks (WSNs) has been broadened. WSN communication security is important because sensor nodes are vulnerable to various security attacks when deployed in an open environment. An adversary could exploit this vulnerability to inject false reports into the network. En-route filtering techniques have been researched to block false reports. The CFFS scheme
filters the false report by collaboratively validating the report by clustering the nodes. However, CFFS is not considered effective against repetitive attacks. Repeated attacks have a significant impact on network lifetime. In this paper, we propose a method to detect repetitive attacks with cluster-based false data
filtering and to identify the compromised nodes and quickly block them. The proposed scheme uses fuzzy logic to determine the distribution of additional keys according to the network conditions, thereby improving energy efficiency.
Introducing a novel fault tolerant routing protocol in wireless sensor networ...ijcsit
Although routing is one of the key network issues, the challenges facing WSN makes the subject even more
demanding. In this study, we propose a novel fault tolerant routing protocol in wireless sensor networks
using fuzzy logic. We approach the problem by breaking it down into two parts. The first sub problem is
designing a routing module and the second one retrofitting the designed module in a way that answering to
these two sub problems leads to the final solution of the main problem. To deal with the first stage, by using
fuzzy logic, we design a routing module; then for the second stage, the module enters fault tolerant routing
in order that it be tolerant against routing faults. In this study, the term "network failure" is figuratively
equal to "node failure".
IRJET - Analytical Study of Hierarchical Routing Protocols for Virtual Wi...IRJET Journal
This document analyzes and compares several hierarchical routing protocols for virtual wireless sensor networks (VWSNs). It first provides background on VWSNs and how virtualization allows a single physical sensor network to serve multiple applications simultaneously. It then reviews several common cluster-based routing protocols for wireless sensor networks, including LEACH, ModLEACH, SEP, and ZSEP. Through simulation and analysis of network lifetime, load balancing, energy consumption, and packets received, the document aims to provide insights on how well different routing protocols can be utilized for VWSNs under various conditions.
Similar to E NERGY - E FFICIENT P ATH C ONFIGURATION M ETHOD FOR DEF IN WSN S (20)
A review on techniques and modelling methodologies used for checking electrom...nooriasukmaningtyas
The proper function of the integrated circuit (IC) in an inhibiting electromagnetic environment has always been a serious concern throughout the decades of revolution in the world of electronics, from disjunct devices to today’s integrated circuit technology, where billions of transistors are combined on a single chip. The automotive industry and smart vehicles in particular, are confronting design issues such as being prone to electromagnetic interference (EMI). Electronic control devices calculate incorrect outputs because of EMI and sensors give misleading values which can prove fatal in case of automotives. In this paper, the authors have non exhaustively tried to review research work concerned with the investigation of EMI in ICs and prediction of this EMI using various modelling methodologies and measurement setups.
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
6th International Conference on Machine Learning & Applications (CMLA 2024)ClaraZara1
6th International Conference on Machine Learning & Applications (CMLA 2024) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Applications.
E NERGY - E FFICIENT P ATH C ONFIGURATION M ETHOD FOR DEF IN WSN S
1. International Journal on Information Theory (IJIT),Vol.4, No.2, April 2015
DOI : 10.5121/ijit.2015.4202 9
ENERGY-EFFICIENT PATH CONFIGURATION
METHOD FOR DEF IN WSNS
Jae Kwon Lee1
, Su Man Nam2
and Tae Ho Cho3
1, 2, 3
School of Information and Communication Engineering Sungkyunkwan University, Su-
won, 440-476, Republic of Korea
ABSTRACT
In wireless sensor networks (WSNs), sensor nodes have stringent energy and computation requirements.
Since they are left unattended, an adversary can generate false report attacks through compromised nodes.
This would result in an increased number of verifications to filter these reports, causing waste of scarce
energy resources. In this paper, we propose energy-efficient path configuration method for dynamic en-
route filtering (EDEF), which uses fuzzy logic to select the forwarding node(s). In order to cater to
compromised nodes and to detect and filter the false reports, we create alternative paths. Our proposed
method selects forwarding nodes based on the key content of neighbor nodes, the number of neighbor
nodes, and the residual energy. Auth-keys are distributed randomly from the global key pool. Simulation
results demonstrate the effectiveness of our proposed method with up to 8.2% energy efficiency as
compared to the dynamic en-route filtering (DEF) scheme.
KEYWORDS
Sensor network, en-route filtering, false report attack, fuzzy logic, detection power, next-hop, energy-
efficiency
1. INTRODUCTION
Wireless sensor networks (WSNs) are being used in numerous applications to carry out tasks
without human intervention [1]. However, WSNs suffer energy and computation limitations and
are left unattended for longer periods of time [2, 3]. Sensor nodes can be compromised and used
by an adversary to generate false report attacks. These false report attacks would result in an
increased number of verifications to filter these reports, thereby causing a reduced network-
lifetime [4]. The dynamic en-route filtering (DEF) was proposed by Yu et al. to defend a false
report injection attack [5]. Various schemes as the statistical en-route filtering (SEF),
commutative cipher based en-route filtering (CCEF) and probabilistic voting-based filtering
(PVFS) as well as the DEF were proposed for the same purpose [6-15]. However, the DEF is
capable of performing best in a dynamic network.
The DEF is basically configured as a cluster-based network. The DEF is divided into three major
phases: key pre-distribution, key dissemination, and report forwarding. The key pre-distribution
phase is executed when the sensor network is first set up. The key dissemination phase is
executed whenever the network topology is changed. The report forwarding phase is executed
whenever a report is generated by a cluster-head (CH). The DEF verifies the validity of a report
using a message authentication code (MAC). To select the next-hop forwarding node, the DEF
does not specify the selection criteria which can be changed by applications. In the proposed
method, we use the key content of neighbor nodes, the number of neighbor nodes, and the
residual energy as criteria for the selection of forwarding nodes. The major contributions of our
scheme are as follows:
2. International Journal on Information Theory (IJIT),Vol.4, No.2, April 2015
10
• Early false report detection power
• Considerable energy improvement over the original scheme
• Fuzzy logic for evaluation of the next-hop
In this paper, in order to use next-hop forwarding nodes, we use the above selection criteria with
fuzzy logic in our implementation. Whenever the network topology changes, criteria for the
selection of forwarding nodes is applied at the key distribution phase. The parameters of the fuzzy
input are as follows: the node with multiple keys, the number of neighbor nodes, and the residual
energy. We determine the next-hop forwarding node through these input values. Any time the
topology of a network is changed, the energy-efficient path configuration method for DEF
(EDEF) executes the key dissemination phase, similar to the DEF for a dynamic network.
Whenever the key dissemination phase is performed, the next-hop node is selected through fuzzy
logic in the EDEF.
The EDEF was organized as a cluster-based sensor network similar to DEF. The cluster-based
network can avoid redundant data transmission [16, 17]. A base station (BS) calculates a fuzzy
value for each node since the sensor network information is handled by the BS. Each CH
determines the forwarding node through the fuzzy values of the neighbor nodes. Using this
information, we demonstrate the EDEF, which results in greater energy efficiency and detection
power in comparison with the DEF.
This paper is organized as follows: in a section 2, we describe the original DEF in detail. In
section 3, we explain the motivation, overview, and the proposed EDEF in detail. Section 4
discusses assumptions and the performance comparison; and the conclusion is given at the end of
the paper.
2. BACKGROUND
In this section, we present related background work.
2.1. Dynamic En-route Filtering Scheme
The DEF was proposed by Yu et al. to defend the false report injection attack in WSNs. The DEF
is composed of a cluster, as in Figure 1, where the nodes v1 ~ v4 represent a sensor node in the
cluster, and a black dot (v3) represents a compromised node. Basically, a CH aggregates the
detected reports of all nodes. The CH then generates a message to forward to the BS. Finally, the
CH sends the message to the BS. Any can be compromised node, including the CH. Additionally,
all nodes can be a forwarding node on a path of the BS.
Figure 1. A simple figure of the DEF
DEF is briefly divided into three phases (key pre-distribution, key dissemination, and report
forwarding) as shown in Figure 2. First, the network is configured and then a key is pre-
3. International Journal on Information Theory (IJIT),Vol.4, No.2, April 2015
11
distributed. The key pre-distribution phase is executed once when the network is first configured.
Following this, the key dissemination phase of a key distribution occurs, which executes the
report forwarding phase. The key dissemination phase would then be executed again based on the
fixed period that is determined at the cluster. The report forwarding phase could be executed at
every round at the each forwarding node.
Figure 2. Three phases of the DEF
Figure 3. Key deployment of each node
Figure 3 shows that node v_i was loaded with the keys in the key pre-distribution phase. Here, the
auth-key chain is generated using the seed key and a hash function. This auth-key is then the first
of the auth-key chain. The y-key would then be randomly selected as a fixed number in the global
key pool. The z-key is then randomly selected as one key of the global key pool; this key is not
duplicated with any other keys. The auth-keys of the node in a cluster are aggregated with the CH
to generate the message, K(n), as in Figure 4. Then the CH sends the message to q number of
forwarding nodes. In the report forwarding phase, a report is aggregated from a node of the
cluster as in the key dissemination phase, and then the CH sends an aggregating message to the
BS. In the DEF, the report is verified with the MAC. This MAC is generated using the event and
auth-key in each node. The DEF re-executes the key dissemination phase and the report
forwarding phase according to a fixed rule.
4. International Journal on Information Theory (IJIT),Vol.4, No.2, April 2015
12
Figure 4. Auth-key is sent to the forwarding node.
The report forwarding phase is newly executed by the forwarding node whenever an event is
generated. The report forwarding phase is executed to forward a newly generated event in report
format to the BS. The key dissemination phase is re-executed for key re-dissemination in case of
network topology changes as such changes can change the nodes of the cluster. It is then
necessary to re-disseminate the node information over the changed cluster. Therefore, the key
dissemination phase can be re-executed.
3. PROPOSED METHOD
3.1. Motivation
When we select the next forwarding node, the DEF does not specify some factors because,
according to various applications, the determining factors may be different. The DEF selects the
next node by combining factors such as the available of energy, the link quality, the speed of
energy consumption, and so on. The DEF does not consider the energy-efficiency of the
forwarding node. The network, therefore, can easily consume the energy of the node. Energy
depletion of a node produces a decrease in the network-lifetime. We evaluated the selection of a
forwarding node using fuzzy logic; this scheme shows efficiency up to 5% [18]. However, we
decide that the 5% efficiency is a weak influence. Hence, we changed to new factors and
evaluated these factors. According to this, we can have more efficient than before factor through
new factors.
3.2. Overview
When determining the next forwarding node in the DEF, we select the next node using the fuzzy
logic from the proposed EDEF. We used three input factors in fuzzy logic: 1) key content, 2) the
number of neighbor nodes, and 3) the residual energy of each candidate node. We can calculate
the result using these three input factors. We then determine the next node based on the result. If
the report reaches the BS in every round, the BS calculates the result of the nodes in the entire
network using fuzzy logic. A CH then determines the next forwarding node on a path to the BS.
We can foresee an increase in the efficiency between the EDEF and the DEF through the
Travelled hop count of the false reports.
3.3. Proposed method
The EDEF uses fuzzy logic in the dissemination phase of the DEF. This is more effective for
extending the network-lifetime. The EDEF has three input factors for the fuzzy logic. The three
input factors are as follows: 1) the key content (KN), 2) the number of neighbor node (NN), and
3) the residual energy (RE) of each contender. When we select the next forwarding node, we use
5. International Journal on Information Theory (IJIT),Vol.4, No.2, April 2015
13
the result from the above three factors. Each input factor is divided into three detailed phases,
allowing 27 different possible results (=3×3×3). We can select the optimum forwarding node
based on 27 different results. The auth-key is disseminated to multiple paths because of the
possibility of 1) data loss, 2) verification, or 3) dynamic topology. The DEF pre-determines the
number of forwarding nodes as „q‟. The DEF then selects q as the forwarding node. In case of 'q
= 2,' two forwarding nodes are selected at the BS. When the q possible forwarding nodes are
selected, the final forwarding node is chosen using fuzzy logic. Fuzzy rule-based system has been
used to approximate reasoning for an imprecision of a data or an uncertainty in reasoning
processes [19].
3.3.1. Further Subsections
The input factor for fuzzy logic and the resulting value are as follows:
KN= {LITTLE, MEDIUM, FULL}
NN= {FEW, MIDDLE, CROWDED}
RE= {LOW, MEDIUM, ENOUGH}
R= {VERY BAD, BAD, NORMAL, GOOD, VERY GOOD}
Each input value is divided into three phases (as shown above), and the resulting value is divided
into five parts. Details of the input factors that are used for the fuzzy logic are as follow.
The key content of node To begin with, the following is the reason for the key content of
node. When a key is disseminated in the DEF, a CH aggregates the keys belonging to each
node, and forwards the aggregate to the node on a path in a fixed hop count. We use these
keys to verify the forwarded report. At this time, if the node was received in duplicate, the
node has multiple keys that are compared with the others. A node with many keys means that
it can be used in multiple clusters. According to this, when the DEF sends a report, the node
with many keys is more efficient than the others.
The number of neighbor nodes The number of neighbor nodes is selected as the next input
factor so that the message can be delivered to the zones of many candidate nodes. In order to
broaden the selection range, the zones of many candidate nodes are selected. If there are few
candidate nodes, then the selection pool is reduced. Therefore, we broaden the selection
range, in order to obtain a more efficient node.
The residual energy In the end, the residual energy is the current usable energy of a
candidate node and is an input factor. When a node with less energy is compared with a node
with a lot of energy, if the node with less energy is selected, the entire network-lifetime is
quickly shortened. According to this, if we select the node with a lot of energy, it can sustain
the network-lifetime. Selecting the node with a lot of energy can then steadily consume the
energy of the whole network. Accordingly, we select it as an input factor for the fuzzy logic.
Figure 5 presents a process in which a CH selects the q forwarding node through a fuzzy rule-
based system. When the q is determined to be '2,' as in the figure, it receives the respective KN,
NN, and RE values of u_1,u_2,〖 and u〗 _3; it then selects a node based on the two highest
ranking results.
6. International Journal on Information Theory (IJIT),Vol.4, No.2, April 2015
14
Figure 5. Fuzzy rule-based system for node selection
A fuzzy computation is computed at a BS; the BS has information for all nodes. The BS
determines that each CH selects a node using the fuzzy rule-based system. This is re-computed
every cycle in order to forward a message.
Figure 6 presents the membership function of the fuzzy input values and result values.
Figure 6. Fuzzy membership function of input values and the result values.
7. International Journal on Information Theory (IJIT),Vol.4, No.2, April 2015
15
Some of the rules are shown below.
Table 1. Some of the fuzzy rules.
R1 : IF KN IS LITTLE R5 : IF KN IS LITTLE
AND NN IS FEW AND NN IS FEW
AND RE IS LOW AND RE IS HIGH
THEN R IS VERY BAD THEN R IS BAD
R2 : IF KN IS LITTLE R6 : IF KN IS FULL
AND NN IS MIDDLE AND NN IS MIDDLE
AND RE IS LOW AND RE IS MEDIUM
THEN R IS VERY BAD THEN R IS GOOD
R3 : IF KN IS LITTLE R7 : IF KN IS FULL
AND NN IS CROWDED AND NN IS MEDIUM
AND RE IS LOW AND RE IS LOW
THEN R IS BAD THEN R IS NORMAL
R4 : IF KN IS LITTLE R8 : IF KN IS FULL
AND NN IS FEW AND NN IS MIDDLE
AND RE IS MEDIUM AND RE IS ENOUGH
THEN R IS VERY BAD THEN R IS VERY
GOOD
3.3.2. The base data for the EDEF
Figure 7. Average of the Travelled hop count for 'q=3'
Figure 7 shows an average of the Travelled hop count for „q = 3‟ according to the attack ratio. It
is expected that the EDEF can detect a false report earlier than the original DEF. Therefore, we
experimented further and obtained the following results.
8. International Journal on Information Theory (IJIT),Vol.4, No.2, April 2015
16
Figure 8. Difference in the total Travelled hops between the EDEF and the DEF.
Figure 9. A filtered report ratio
Figure 8 shows the Travelled hop count without filtering a false report. The following is the
Travelled hop count equation. The hop count is the difference between the value of the Travelled
hop count without filtering using a DEF and the value of the Travelled hop count without filtering
using the proposed method.
Total Travelled hops = Travelled hops in the DEF – Travelled hops in the proposed method
Additionally, Figure 9 presents a graph of the EDEF efficiency against the DEF. As shown in the
figure, greater efficiency is seen with increases in 'q'. According to Figure 8 and 9, the proposed
method is faster than the existing method. Accordingly, we progressed to more detailed
experiments; in the following section, we verify the energy consumption efficiency compared
with the DEF.
4. PERFORMANCE EVALUATION
In this section, we will present the energy-efficiency of the EDEF in comparison with the original
DEF under same environmental setup.
9. International Journal on Information Theory (IJIT),Vol.4, No.2, April 2015
17
4.1. Experiment setup
We assume that the BS has information of all nodes in the sensor network. Every CH has the
information about the key content, the number of neighbor nodes, and the residual energy of all
nodes in its cluster.
The sensor field size is 200 x 200 (m2), and the total number of nodes are 1000, consisting of
100 clusters which are randomly distributed where each cluster consists of 10 nodes.
Each node picks l = 2 y-keys and one z-key, where the size of the y-key and z-key pool
consists of 1000 keys.
Each node forwards the message K(n) to q selected downstream neighbor nodes, until K(n)
reaches to the BS or has been forwarded by hmax hop. Here, hmax = 10. Hence, we adopted
Hill Climbing method [20] to forwards the message K(n).
Each aggregated report contains 10 MACs, and there are at most 10 compromised nodes in
each cluster.
The size of a message is 36 bytes, and 16.25/12.5μJ is consumed for transmitting/receiving a
byte [8].
Each node has fuzzy result values which are calculated by the BS. The BS then broadcasts
the q and fuzzy result of each node to entire network through authenticated broadcast (e.g.,
using μTESLA [21])
To simulate a dynamic network, we apply a simple ON/OFF operation node, where each
node is typically switched to ON or OFF mode.
The DEF and the EDEF adopted a GPSR routing protocol.
4.1. Experiment results
In the above assumption, the announced sensor field size and total number of nodes are the same,
and a CH generates 100 reports during each cycle. Each key pool has 1000 keys. The experiment
was performed with an increasing ratio of false reports and a changing q value. The figure below
shows the efficiency of the proposed method compared with DEF according to the attack ratio.
Figure 10. Total energy efficiency of each „q.‟
10. International Journal on Information Theory (IJIT),Vol.4, No.2, April 2015
18
The figure above shows the energy-efficiency for each „q‟ against the DEF. Each q shown has
efficiency between 4.84% and 6.12%. The greater the number of q or the more complex the
sensor network, the greater is the efficiency. The reason why the efficiency increases as q
increases is because a large, q has a larger number of cases. Therefore, this demonstrates that
selection using the fuzzy system is more efficient than the DEF.
Figure 11. Energy efficiency versus the attack ratio.
By measuring the value for each q, the results show that greater the value of q, the greater the
efficiency as compared to the DEF. An increasing value of q means that more messages are
created to send to the next forwarding nodes. As can be seen in the above figure, when the value
of q is 5, the efficiency is greater than 8%. The attack rate of the 100 generated reports is the ratio
of false reports. The efficiency ratio of false reports of enemy all the time and when there are
many showed similar performance. However, they showed a difference in the 30% to 70%
section. In fact, a false report injection attack cannot occupy the whole message. The results are
confirmed because they were generated for the above experiment. However, the experiment does
not include the number of cases in a real sensor network. However, if the number of q is changed
according to the environment of the DEF, the proposed method showed greater efficiency through
the above experiment.
The figure above compares the efficiency of the proposed method with the DEF with regard to
the total number of filtered false reports in one hop. This graph compares the number of filtered
reports within one hop in the proposed method with that in the DEF. The figure above shows a
slightly more efficient detection for the proposed method compared with the DEF.
5. CONCLUSIONS
In this study, the aim was to increase energy-efficiency with increased detection power by
considering alternative paths. We have presented EDEF, a fuzzy-based next-hop selection
scheme. In order to select the forwarding nodes in next-hop and to distribute keys, we use fuzzy
logic. Our method can detect more false reports as compared to the DEF scheme. By detecting the
false reports early, our method demonstrated considerable energy improvement without
compromising the security of the original scheme.
11. International Journal on Information Theory (IJIT),Vol.4, No.2, April 2015
19
In conclusion, the EDEF has excellent detection power compared with the DEF and improves the
energy efficiency in order to sustain the network-lifetime for a long time. In the future, we can
further enhance the performance through a simulation with suitable fuzzy function values.
ACKNOWLEDGEMENTS
This research was supported by Basic Science Research Program through the National Research
Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (No.
2013R1A2A2A01013971)
REFERENCES
[1] I. F. Akyildiz, Weilian Su, Y. Sankarasubramaniam, & E. Cayirci, (2002) "A survey on sensor
networks," Communications Magazine, IEEE, Vol.40, No.8, pp.102-114.
[2] Jing Deng, R. Han, and S. Mishra, (2005) "Countermeasures against traffic analysis attacks in
wireless sensor networks," Security and Privacy for Emerging Areas in Communications Networks,
pp.113-126.
[3] Moog Inc., "MICAz data sheet," Moog Crossbow, http://www.xbow.com.
[4] C. Karlof and D. Wagner, (2003)"Secure routing in wireless sensor networks: Attacks and
countermeasures," Sensor Network Protocols and Applications, 2003. Proceedings of the First IEEE.
2003 IEEE International Workshop on, pp.113-127.
[5] Zhen Yu and Y. Guan, (2010) "A dynamic en-route filtering scheme for data reporting in wireless
sensor networks," Networking, IEEE/ACM Transactions on, Vol.18, No.1, pp.150-163.
[6] Hao Yang and Songwu Lu, "Commutative cipher based en-route filtering in wireless sensor
networks," Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th, pp.1223-1227.
[7] Feng Li, Avinash Srinivasan, and Jie Wu, (2008) "PVFS: A probabilistic voting-based filtering
scheme in wireless sensor networks," International Journal of Security and Networks, Vol.3, No.3,
pp.173-182.
[8] Fan Ye, Haiyun Luo, Songwu Lu, and Lixia Zhang, "Statistical en-route filtering of injected false data
in sensor networks," Selected Areas in Communications, IEEE Journal on, Vol.23, No.4, pp.839-850.
[9] Jianzhong Li, Lei Yu, Hong Gao, and Shuguang Xiong, "Grouping-enhanced resilient probabilistic
en-route filtering of injected false data in WSNs," Parallel and Distributed Systems, IEEE
Transactions on, Vol.23, No.5, pp.881-889.
[10] T. P. Nghiem, Sang Jin Lee, and Tae Ho Cho, (2009) "An energy-aware fuzzy-based en-route filtering
scheme in wireless sensor networks," Future Networks, 2009 International Conference on, pp.28-32.
[11] A. S. Uluagac, R. A. Beyah, and J. A. Copeland, (2010) "Time-based DynamiC keying and en-route
filtering (TICK) for wireless sensor networks," Global Telecommunications Conference
(GLOBECOM 2010), 2010 IEEE, pp.1-6.
[12] Wensheng Zhang and Guohong Cao, (2005) "Group rekeying for filtering false data in sensor
networks: A predistribution and local collaboration-based approach," INFOCOM 2005. 24th Annual
Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, pp.503-
514 vol. 1.
[13] Hae Young Lee and Tae Ho Cho, (2006) "Key inheritance-based false data filtering scheme in
wireless sensor networks," Distributed Computing and Internet Technology, Lecture Notes in
Computer Science, vol.4317, pp.116-127.
[14] Hae Young Lee and Tae Ho Cho, (2008) "Fuzzy logic based key disseminating in ubiquitous sensor
networks," Advanced Communication Technology, 2008. ICACT 2008. 10th International Conference
on, pp.958-962.
12. International Journal on Information Theory (IJIT),Vol.4, No.2, April 2015
20
[15] Ting Yuan, Shiyong Zhang, Yi-ping Zhong, and Jianqing Ma, (2008) "KAEF: An en-route scheme of
filtering false data in wireless sensor networks," Performance, Computing and Communications
Conference, 2008. IPCCC 2008. IEEE International, pp.193-200.
[16] J. N. Al-Karaki and A. E. Kamal, (2004) "Routing techniques in wireless sensor networks: A survey,"
Wireless Communications, IEEE, vol.11, no.6, pp.6-28.
[17] K. Akkaya and M. Younis, (2005) "A survey on routing protocols for wireless sensor networks," Ad
Hoc Networks, vol.3, no.3, pp.325-349, 5.
[18] Jae Kwon Lee and Tae Ho Cho, (2012) "Selecting next hop nodes for energy efficiency in dynamic
filtering based WSNs using fuzzy system," Information Science and Digital Content Technology
(ICIDT), 2012 8th International Conference on, pp.674-677.
[19] H. S. N. Serrano, (2007) "Landing site selection using fuzzy rule-based reasoning," Proc. ICRA,
pp.4899-4904.
[20] D.B. Skalak, (1994) "Prototype and feature selection by sampling and random mutation hill climbing
algorithms," In Proc. of Eleventh International Machine Learning, pp.293-301, 1994.
[21] Adrian Perrig, Robert Szewczyk, J. D. Tygar, Victor Wen, and David E. Culler, (2002) "SPINS:
Security protocols for sensor networks," Wireless Networks, Vol.8, No.5, pp.521-534.
[22] Lee, S.hyun. & Kim Mi Na, (2008) “This is my paper”, ABC Transactions on ECE, Vol. 10, No. 5,
pp120-122.
[23] Gizem, Aksahya & Ayese, Ozcan (2009) Coomunications & Networks, Network Books, ABC
Publishers.
Authors
Jae Kwon Lee received his B.S. degree in Computer Software Engineering from the
Kumoh National Institute of Technology, Republic of Korea, in 2012, M.S degrees in
Electrical and Computer Engineering from Sungkyunkwan University in 2014,
respectively. His research interests are in the areas of wireless sensor network,
intelligent systems, modelling & simulation, and enterprise resource planning.
Su Man Nam received his B.S. degrees in computer information from Hanseo
University, Korea, in February 2009 and M.S degrees in Electrical and Computer
Engineering from Sungkyunkwan University in 2013, respectively. He is currently a
doctoral student in the College of Information and Communication Engineering at
Sungkyunkwan University, Korea. His research interests include wireless sensor
network, security in wireless sensor networks, and modelling & simulation.
Tae Ho Cho received the Ph.D. degree in Electrical and Computer Engineering from
the University of Arizona, USA, in 1993, and the B.S. and M.S. degrees in Electrical
Engineering from Sungkyunkwan University, Republic of Korea, and the University of
Alabama, USA, respectively. He is currently a Professor in the College of Information
and Communication Engineering, Sungkyunkwan University, Korea. His research
interests are in the areas of wireless sensor network, intelligent systems, modeling &
simulation, and enterprise resource planning.