A flooding attack in wireless sensor networks is a type of threat that shortens the lifetimes of the sensor
networks. Although flooding attack prevention techniques have been proposed, if a continuous flooding
attack occurs, the sensor node energy is depleted during detection. In this paper, we use multi-path routing
to solve this problem. In order to balance the load of the sensor node, energy balancing of the sensor node
is controlled by determining the number of pathways using fuzzy logic. By adjusting the energy balancing
of the sensor nodes, the number of energy-exhausting sensor nodes can be reduced. As a result, when a
flooding attack occurs, the energy efficiency of the sensor node is increased by determining the number of
pathways.
Reference broadcast synchronization and time division multiple access impleme...TELKOMNIKA JOURNAL
Various kinds of technology have been developed to assist obtain information. One of them is a Wireless Sensor Network (WSN). WSN is a wireless network consisting of multiple nodes connected wirelessly. WSN nodes on a device have small resources in the form of batteries. The main problem which owned by WSN was in the data collection process possible collisions data, there are nodes that transmit data at the same time. Time Division Multiple Access (TDMA) was able to provide data on the delivery schedule of each node. So no nodes that transmit data at the same time. But in order to apply the system each node should have equal time. One method that able to provide equalization time was Reference Broadcast Synchronization (RBS). This method synchronizes multiple nodes that have different local time (on the receiver) with the help of node that provides synchronization marks (beacons). Hence this each node was able to transmit data in accordance with the TDMA method that has been implemented. In addition time synchronization performed using RBS give equal time with accuracy up to microseconds. That case certainly makes the WSN node able to provide accurate information to guarantee the absence of errors due to data collisions. This research succesfully sending data delivery schedule by time slots that provided by RBS and time synchronization by TDMA average time delay 2285.9 microseconds.
GEOGRAPHIC INFORMATION-BASED ROUTING OPTIMIZATION USING GA FOR CLUSTER-BASED ...ijwmn
Wireless sensor networks are used for data collection and event detection in various fields such as homenetworks, military systems, and forest fire monitoring, and are composed of many sensor nodes and a basestation. Sensor nodes have limited computing power, limited energy, are randomly distributed in an open environment that operates independently, and have difficulties in individual management. Taking advantage of those weaknesses, attackers can compromise sensor nodes for various kinds of network attacks. Several security protocols have been proposed to prevent these attacks. Most of the security protocols form routings with cluster head nodes. In the case of routing using only cluster head nodes, it is difficult to re-route when the size of the cluster is increased or the number of the surviving nodes is reduced. To prevent these attacks, the proposed scheme maintains security in a cluster-based security protocol and shows energy efficient routing using genetic algorithm by selecting the appropriate cluster head nodes and
utilizing the characteristics of the sensor node with different transmission outputs based on the distance between each node. In this paper, we use a probabilistic voting-based filtering scheme, one of the clusterbased security protocols, and the shortest path, which is a hierarchical routing protocol that the original probabilistic voting-based filtering scheme is using, to test the proposed scheme. This experiment shows the performance comparison of the routing success rate and routing cost according to the number of nodes on the field, as well as the performance comparison according to the cluster size per number of nodes.
This document summarizes research on reference broadcast time synchronization in wireless sensor networks. It discusses how previous protocols like flooding time synchronization and gradient time synchronization have drawbacks like slow propagation speed and inability to maintain synchronization when nodes crash. It then introduces the reference broadcast synchronization protocol which chooses a reference node using an agreement algorithm and broadcasts time information to synchronize the network. It presents the system architecture and algorithm for how reference broadcast synchronization works to flood time information, perform synchronization based on messages from the parent node, and timestamp events in the network. Evaluation results showing the protocol implemented on line and distributed topologies are also included.
IRJET- Energy Optimization in Wireless Sensor Networks using Trust-Aware Rout...IRJET Journal
This document summarizes a research paper on optimizing energy usage in wireless sensor networks through a trust-aware routing algorithm. The paper proposes the Cost Aware Secure Routing (CASER) protocol, which aims to balance energy consumption across all sensor nodes to maximize network lifetime. CASER supports multiple routing strategies to extend lifetime while increasing routing security. Simulation results show CASER achieves excellent energy balance and increases network lifetime by more than four times under non-uniform energy deployment compared to other approaches. The paper also discusses detecting and recovering from node failures in wireless sensor networks.
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
This document summarizes several data-centric routing protocols for wireless sensor networks. It begins by outlining the challenges of routing in WSNs, including energy consumption, scalability, addressing, robustness, topology, and application-specific needs. It then describes several data-centric routing protocols, including flooding, directed flooding, constrained flooding, gossiping, fuzzy gossiping, location-based gossiping, and others. It notes advantages and disadvantages of these protocols for efficiently routing data in wireless sensor networks while minimizing energy consumption.
Energy efficient routing in wireless sensor networksSpandan Spandy
The document summarizes several energy efficient multicast routing protocols for wireless sensor networks. It begins with an introduction to wireless sensor networks and routing challenges. It then summarizes the following protocols: MAODV, TEEN, APTEEN, SPEED, MMSPEED, RPAR, and LEACH. For each protocol, it provides a brief overview of the protocol's design, objectives, components, and how it aims to improve energy efficiency in wireless sensor network routing. The document concludes that providing energy-efficient multicast routing is important for wireless sensor network applications and that the protocols presented aim to achieve lower energy requirements through approaches like clustering, adaptive thresholding, and congestion control.
Directed diffusion for wireless sensor networkingHabibur Rahman
This document summarizes the key ideas of the "Directed Diffusion for Wireless Sensor Networking" paper. It introduces directed diffusion as a data-centric paradigm for wireless sensor networks that is designed for robustness, scalability, and energy efficiency. The core concepts of directed diffusion are interests, data, gradients, and reinforcement, which work together to efficiently route queries to sensor data in the network. Through localized interactions and data aggregation, directed diffusion is shown to significantly reduce energy consumption compared to flooding-based approaches in wireless sensor networks.
Hexagonal based Clustering for Reducing Rebroadcasts in Mobile Ad Hoc NetworksIJTET Journal
Abstract— In mobile ad hoc networks multihop routing is performed in order to communicate the packets from the source to destination. The nodes within these networks are dynamic due which frequent path change occurs which can cause frequent link breakages and induces route discoveries. These route discoveries can introduce overhead in terms of contention, collision and rebroadcasts which are non-negligible. Here, the paper discusses a hexagonal based clustering for reducing rebroadcasts thus maximizing the lifetime of the networks and providing coverage area thus reducing the end – end delays.
Reference broadcast synchronization and time division multiple access impleme...TELKOMNIKA JOURNAL
Various kinds of technology have been developed to assist obtain information. One of them is a Wireless Sensor Network (WSN). WSN is a wireless network consisting of multiple nodes connected wirelessly. WSN nodes on a device have small resources in the form of batteries. The main problem which owned by WSN was in the data collection process possible collisions data, there are nodes that transmit data at the same time. Time Division Multiple Access (TDMA) was able to provide data on the delivery schedule of each node. So no nodes that transmit data at the same time. But in order to apply the system each node should have equal time. One method that able to provide equalization time was Reference Broadcast Synchronization (RBS). This method synchronizes multiple nodes that have different local time (on the receiver) with the help of node that provides synchronization marks (beacons). Hence this each node was able to transmit data in accordance with the TDMA method that has been implemented. In addition time synchronization performed using RBS give equal time with accuracy up to microseconds. That case certainly makes the WSN node able to provide accurate information to guarantee the absence of errors due to data collisions. This research succesfully sending data delivery schedule by time slots that provided by RBS and time synchronization by TDMA average time delay 2285.9 microseconds.
GEOGRAPHIC INFORMATION-BASED ROUTING OPTIMIZATION USING GA FOR CLUSTER-BASED ...ijwmn
Wireless sensor networks are used for data collection and event detection in various fields such as homenetworks, military systems, and forest fire monitoring, and are composed of many sensor nodes and a basestation. Sensor nodes have limited computing power, limited energy, are randomly distributed in an open environment that operates independently, and have difficulties in individual management. Taking advantage of those weaknesses, attackers can compromise sensor nodes for various kinds of network attacks. Several security protocols have been proposed to prevent these attacks. Most of the security protocols form routings with cluster head nodes. In the case of routing using only cluster head nodes, it is difficult to re-route when the size of the cluster is increased or the number of the surviving nodes is reduced. To prevent these attacks, the proposed scheme maintains security in a cluster-based security protocol and shows energy efficient routing using genetic algorithm by selecting the appropriate cluster head nodes and
utilizing the characteristics of the sensor node with different transmission outputs based on the distance between each node. In this paper, we use a probabilistic voting-based filtering scheme, one of the clusterbased security protocols, and the shortest path, which is a hierarchical routing protocol that the original probabilistic voting-based filtering scheme is using, to test the proposed scheme. This experiment shows the performance comparison of the routing success rate and routing cost according to the number of nodes on the field, as well as the performance comparison according to the cluster size per number of nodes.
This document summarizes research on reference broadcast time synchronization in wireless sensor networks. It discusses how previous protocols like flooding time synchronization and gradient time synchronization have drawbacks like slow propagation speed and inability to maintain synchronization when nodes crash. It then introduces the reference broadcast synchronization protocol which chooses a reference node using an agreement algorithm and broadcasts time information to synchronize the network. It presents the system architecture and algorithm for how reference broadcast synchronization works to flood time information, perform synchronization based on messages from the parent node, and timestamp events in the network. Evaluation results showing the protocol implemented on line and distributed topologies are also included.
IRJET- Energy Optimization in Wireless Sensor Networks using Trust-Aware Rout...IRJET Journal
This document summarizes a research paper on optimizing energy usage in wireless sensor networks through a trust-aware routing algorithm. The paper proposes the Cost Aware Secure Routing (CASER) protocol, which aims to balance energy consumption across all sensor nodes to maximize network lifetime. CASER supports multiple routing strategies to extend lifetime while increasing routing security. Simulation results show CASER achieves excellent energy balance and increases network lifetime by more than four times under non-uniform energy deployment compared to other approaches. The paper also discusses detecting and recovering from node failures in wireless sensor networks.
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
This document summarizes several data-centric routing protocols for wireless sensor networks. It begins by outlining the challenges of routing in WSNs, including energy consumption, scalability, addressing, robustness, topology, and application-specific needs. It then describes several data-centric routing protocols, including flooding, directed flooding, constrained flooding, gossiping, fuzzy gossiping, location-based gossiping, and others. It notes advantages and disadvantages of these protocols for efficiently routing data in wireless sensor networks while minimizing energy consumption.
Energy efficient routing in wireless sensor networksSpandan Spandy
The document summarizes several energy efficient multicast routing protocols for wireless sensor networks. It begins with an introduction to wireless sensor networks and routing challenges. It then summarizes the following protocols: MAODV, TEEN, APTEEN, SPEED, MMSPEED, RPAR, and LEACH. For each protocol, it provides a brief overview of the protocol's design, objectives, components, and how it aims to improve energy efficiency in wireless sensor network routing. The document concludes that providing energy-efficient multicast routing is important for wireless sensor network applications and that the protocols presented aim to achieve lower energy requirements through approaches like clustering, adaptive thresholding, and congestion control.
Directed diffusion for wireless sensor networkingHabibur Rahman
This document summarizes the key ideas of the "Directed Diffusion for Wireless Sensor Networking" paper. It introduces directed diffusion as a data-centric paradigm for wireless sensor networks that is designed for robustness, scalability, and energy efficiency. The core concepts of directed diffusion are interests, data, gradients, and reinforcement, which work together to efficiently route queries to sensor data in the network. Through localized interactions and data aggregation, directed diffusion is shown to significantly reduce energy consumption compared to flooding-based approaches in wireless sensor networks.
Hexagonal based Clustering for Reducing Rebroadcasts in Mobile Ad Hoc NetworksIJTET Journal
Abstract— In mobile ad hoc networks multihop routing is performed in order to communicate the packets from the source to destination. The nodes within these networks are dynamic due which frequent path change occurs which can cause frequent link breakages and induces route discoveries. These route discoveries can introduce overhead in terms of contention, collision and rebroadcasts which are non-negligible. Here, the paper discusses a hexagonal based clustering for reducing rebroadcasts thus maximizing the lifetime of the networks and providing coverage area thus reducing the end – end delays.
Energy Efficient Data Transmission through Relay Nodes in Wireless Sensor Net...IDES Editor
In a Wireless Sensor Network (WSN) having a single
sink, information is given to the distant nodes from beacons
by overhearing. Since it is out of the communication range,
information is not sent directly to the static sink (SS). If a
distant node is not able to communicate directly, then it should
send its own packet to another node which is closer to the
Base Station (BS) so that the received packets are relayed to
the BS by this node. In this paper, we propose a relay node
selection algorithm to reduce contention and improve energy
efficiency. In this algorithm, each data packet of direct
communication should include the received signal strength
(RSS) of the beacon packet. The distant node selects a node
with the maximum RSS value as a relay. The algorithm also
assigns transmitting intervals to each relay node. By our
simulation results, we show that our proposed algorithm
improves the packet delivery ratio and energy efficiency.
This document discusses wireless sensor networks and routing protocols for wireless sensor networks. It defines what a wireless sensor network is and its key characteristics. It then discusses objectives like understanding ad hoc network basics and various routing protocols. It covers topics like the differences between WSNs and ad hoc networks, what a network simulator is and reasons for using NS2, various routing techniques like flooding, gossiping, and hierarchical routing. It also discusses routing challenges, wireless nodes, packet transmission, applications and the future scope of WSNs.
A fuzzy based congestion controller for control and balance congestion in gri...csandit
A Wireless Sensor Network (WSN) is deployed with a large number of sensors with limited
power supply in a wide geographically area. These sensors collect information depending on
application. The sensors transmit the data towards a base station called sink. Due to the
relatively high node density and source-to-sink communication pattern, congestion is a critical
issue in WSN. Congestion not only causes packet loss, but also leads to excessive energy
consumption as well as delay. To address this problem, in this paper we propose a new fuzzy
logic based mechanism to detect and control congestion in WSN. In the proposed approach, a
Monitor Node for each grid in congestion candidate region performs a fuzzy control to avoid
increasing congestion. Fuzzy controller’s inputs are continually fetched from the network by the
Monitor Node. Simulation results show that our approach has higher packet delivery ratio and
lower packet loss than existing approaches.
Power control in mobile ad hoc network using NS2 simulatorIRJET Journal
This document proposes a cross-layer design approach called CLPC (Cross Layer Power Control) to improve power control in mobile ad hoc networks. The CLPC approach allows for interaction between the physical, MAC, and network layers to dynamically control transmission power based on received signal strength values. It was tested using the NS2 simulator and found to perform better than AODV in terms of packet delivery ratio, end-to-end delay, and routing overhead. The CLPC approach aims to find reliable routes between source and destination nodes by averaging RSS values and adjusting transmission power accordingly.
Performance Analysis of Routing Metrics for Wireless Sensor NetworksIJMER
This document summarizes and compares various routing metrics that have been proposed for wireless sensor networks. It categorizes the routing metrics into five groups: topology based, signal strength based, active probing based, mobility aware, and energy aware. Topology based metrics like hop count consider only connectivity information without additional measurements. Signal strength and active probing based metrics directly measure link quality through signal strength or probe packets. The document provides detailed descriptions of several popular routing metrics, such as expected transmission time (ETT), medium time metric (MTM), round-trip time (RTT), and packet pair delay. It analyzes the characteristics of different routing metrics and compares their performance.
A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc ...IOSR Journals
This document presents a novel rebroadcast technique called Neighbor Coverage based Probabilistic Rebroadcast (NCPR) protocol to reduce routing overhead in mobile ad hoc networks. The NCPR protocol calculates a rebroadcast delay based on the number of common neighbors between nodes to prioritize dissemination of neighbor information. It also calculates a rebroadcast probability based on additional neighbor coverage ratio and connectivity factor to reduce unnecessary rebroadcasts while maintaining network connectivity. The protocol is implemented by enhancing the AODV routing protocol in NS-2 to reduce overhead from hello packets and neighbor lists in route requests. Its performance is evaluated under varying network sizes, traffic loads, and packet loss conditions.
Energy efficient routing_in_wireless_sensor_networksGr Patel
This document summarizes two energy efficient routing protocols for wireless sensor networks: MAODV and TEEN.
MAODV is an on-demand multicast routing protocol that maintains routing entries only for destinations currently in use. It uses route requests and replies to establish paths within a multicast group. TEEN is a hierarchical protocol that uses hard and soft thresholds to reduce transmissions. Cluster heads broadcast the thresholds and nodes transmit data only when the sensed value exceeds the thresholds. Both protocols aim to reduce energy use through techniques like on-demand routing and limiting unnecessary transmissions.
BeeSensor routing protocol for wireless sensor networkSonam Jain
This document describes a seminar submitted by Sonam Jain for their Master's degree. The seminar focuses on BeeSensor, a routing protocol for wireless sensor networks inspired by bee communication behaviors. It discusses how bees communicate through dances to share information, and how this inspired the design of BeeSensor. The document outlines the key components of BeeSensor, including the different agent roles, protocol phases, and how it evaluates performance metrics like energy efficiency and packet delivery when compared to other routing protocols like AODV.
Routing protocols for wireless sensor networks face several unique challenges compared to other wireless networks. This document discusses routing challenges in wireless sensor networks and provides an overview of different routing protocol approaches, including flat routing, hierarchical routing, location-based routing, and QoS-based routing. It specifically describes two flat routing protocols: directed diffusion, which uses data negotiation and aggregation to reduce energy costs, and SPIN, which employs data description messages to avoid redundant transmissions through negotiation between sensor nodes.
The document proposes an Enhanced Heuristic Function based Energy Aware (EHF-EA) routing protocol for wireless sensor networks. EHF-EA aims to extend network lifetime and improve link quality by using a heuristic function to find optimal routes while considering longevity factor, link quality, and bandwidth. It constructs a network of 50 mobile homogeneous sensor nodes in clusters. EHF-EA computes heuristic and cost values to determine the best next hop to the destination, aiming to efficiently transfer data and conserve energy. Simulation results show EHF-EA achieves a 93.85% packet delivery ratio while reducing bandwidth and number of hops compared to other protocols.
This document proposes a novel sleep scheduling method for event monitoring in wireless sensor networks to achieve low broadcasting delay. The method uses a level-by-level offset schedule where when a node detects a critical event, it transmits an alarm message along a predetermined path with offsets between nodes to avoid collisions. It then uses a colored connected dominant set to establish paths for the center node to broadcast the alarm to other nodes. The proposed system is intended for applications like military and forest fire monitoring where quick dissemination of alarm messages is important.
The document discusses routing protocols in wireless sensor networks. It outlines several key challenges for routing protocols including node deployment, network dynamics, energy conservation, fault tolerance, scalability, and hardware constraints. It then describes several common routing techniques used in wireless sensor networks, including proactive, reactive, and hybrid path establishment approaches, as well as flat, hierarchical, and location-based network structures. Finally, it discusses different protocol operations such as multipath routing, query-based routing, negotiation-based routing, and supporting quality of service metrics.
A survey of real-time routing protocols For wireless sensor networksijcses
This document summarizes a survey of real-time routing protocols for wireless sensor networks. It discusses several existing real-time routing protocols, including AODV, DSR, RAP, SPEED, and MMSPEED. For each protocol, it describes the key mechanisms, advantages, and disadvantages. It focuses on factors like end-to-end delay, energy consumption, mobility, scalability, and challenges for future research in real-time routing protocols for wireless sensor networks. The document provides a comparative analysis of the protocols to highlight their strengths and weaknesses in meeting the demands of real-time applications.
Clock synchronization estimation of non deterministic delays in wireless mess...IJCNCJournal
Clock synchronization is significantly essential as they require universal time on WSN nodes for time measurement, event ordering and coordinated actions, and power management. This paper gives an insight of solving the problem of the non-deterministic delays that exist in the wireless message delivery. Sensor nodes consisting of Arduino Mega and 2.4 GHz nRF24L01+ radio modules are used, and based on the estimation of non-deterministic delays a clock synchronization protocol for WSN is proposed. The results obtained are quiet promising compared to the existing synchronization protocols for WSNs.
Achieving Efficient Data Acquisition Techniques in Wireless Sensor NetworksRutvik Pensionwar
This document summarizes several techniques for achieving efficient data acquisition in wireless sensor networks (WSNs), including an adaptive rate control algorithm, the Enhanced Congestion Detection and Avoidance (ECODA) technique, and the Event-to-Sink Reliable Transport (ESRT) protocol. ECODA uses dual buffer thresholds and weighted buffer differences for congestion detection. ESRT runs primarily on the sink node and aims to configure sensor reporting frequencies to achieve reliable event detection while minimizing energy usage through congestion control. The document evaluates these techniques through simulation and finds they can effectively tackle issues like congestion detection/avoidance and controlling fluctuating data reporting rates.
An optimistic sector oriented approach to mitigate broadcast storm problem in...IAEME Publication
In mobile ad hoc networks (MANETs), due to frequent changes in topology there exist more
link breakages which lead to high rate of path failures and route discoveries, which cause an
increased routing control overhead. Thus, it is necessary to reduce the overhead of route discovery in
the design of routing protocols for MANETs. In a route discovery, broadcasting may be an
elementary and effective data dissemination mechanism, wherever a mobile node blindly
rebroadcasts the first received route request packets unless it has a route to the destination, and
therefore it causes the broadcast storm problem. This paper proposes an optimistic approach OpSOA
to mitigate the broadcasting storm problem and to scale back the communication overheads of
routing protocols by forming sectors within the network and finding the route to destination by two
sectors at a time. The simulation result shows that the proposed mechanism substantially reduces
route requests. Since the proposed protocol searches for the destination sector wise thereby reducing
network wide broadcast of routing requests, traffic, collision and contention. There by there can be
an increase in the packet delivery ratio and decrease in the average end-to-end delay
A FUZZY-BASED CONGESTION CONTROLLER FOR CONTROL AND BALANCE CONGESTION IN GRI...cscpconf
A Wireless Sensor Network (WSN) is deployed with a large number of sensors with limited power supply in a wide geographically area. These sensors collect information depending on application. The sensors transmit the data towards a base station called sink. Due to the relatively high node density and source-to-sink communication pattern, congestion is a critical issue in WSN. Congestion not only causes packet loss, but also leads to excessive energy
consumption as well as delay. To address this problem, in this paper we propose a new fuzzy logic based mechanism to detect and control congestion in WSN. In the proposed approach, a
Monitor Node for each grid in congestion candidate region performs a fuzzy control to avoid increasing congestion. Fuzzy controller’s inputs are continually fetched from the network by the Monitor Node. Simulation results show that our approach has higher packet delivery ratio and lower packet loss than existing approaches.
Spatial Correlation Based Medium Access Control Protocol Using DSR & AODV Rou...IOSR Journals
The document summarizes a proposed spatial correlation-based medium access control protocol for wireless sensor networks that aims to improve energy efficiency. It discusses how sensor nodes are spatially distributed and correlated in detecting events. An iterative node selection algorithm is used to select a minimum set of representative sensor nodes based on a distortion constraint, in order to reduce redundant transmissions. The protocol uses vector quantization to calculate distances between nodes and a mobile element. It then evaluates the performance of using the DSR and AODV routing protocols with this spatial correlation-based MAC protocol in terms of energy consumption and packet drop ratio through simulations. The simulation results show that the protocol with AODV routing performs better than with DSR routing.
A MULTI-PATH ROUTING DETERMINATION METHOD FOR IMPROVING THE ENERGY EFFICIENCY...ijwmn
A selective forwarding attack in mobile wireless sensor networks is an attack that selectively drops or delivers event packets as the compromised node moves. In such an attack, it is difficult to detect the compromised node compared with the selective forwarding attack occurring in the wireless sensor network
because all sensor nodes move. In order to detect selective forwarding attacks in mobile wireless sensor networks, a fog computing-based system for a selective forwarding detection scheme has been proposed. However, since the proposed detection scheme uses a single path, the energy consumption of the sensor node for route discovery when the sensor node moves is large. To solve this problem, this paper uses fuzzy
logic to determine the number of multi-paths needed to improve the energy efficiency of sensor networks. Experimental results show that the energy efficiency of the sensor network is improved by 9.5737% compared with that of the existing scheme after 200 seconds when using the proposed scheme
A fuzzy congestion controller to detect and balance congestion in wsnijwmn
This document proposes a fuzzy logic-based approach to detect and control congestion in wireless sensor networks (WSNs). The approach divides the WSN into grids monitored by designated Monitor Nodes. These nodes use fuzzy logic and three input metrics (transmission delay, grid density, dropped packets) to determine the congestion level of their grid. Based on the congestion level, packets are either forwarded through the grid or through alternative relay nodes to avoid congestion. Simulation results show this approach achieves higher packet delivery and lower packet loss compared to an existing baseline approach.
This document summarizes a research paper that evaluates the effect of network scalability for a token bucket-based congestion control protocol in wireless sensor networks. The paper introduces congestion control challenges in wireless sensor networks and discusses existing approaches. It then proposes improving an existing priority-based application-specific congestion control clustering protocol called PASCCC by utilizing a token bucket algorithm rather than queues to better control congestion. The paper aims to evaluate how this token bucket-based approach improves network performance as scale increases.
ENERGY EFFICIENT, LIFETIME IMPROVING AND SECURE PERIODIC DATA COLLECTION PROT...ijcsa
The most emerging prominent sensor network applications collect data from sensor nodes and monitors
periodically. Resource constraint Sensor motes sense the environment and transit data to the remote sink
via multiple hops. Minimum energy dissipation and secure data transmission are crucial to such
applications. This paper delivers an energy efficient, lifetime improving, secure periodic Data Gathering
scheme that is a hybrid of heuristic path establishment and secure data transmission. This protocol uses
artificial intelligence (AI) based A* heuristic search algorithm to establish energy efficient admissible
optimal path to sink in terms of high residual energy, minimum hop counts and high link quality. This
scheme also adopts block encryption Rivest Cipher (RC6) Algorithm to secure the transmission of packets.
This code and speed optimized block encryption provides confidentiality against critical data and
consumes less energy for encryption. This proposed method increases the network lifetime there by
reducing the total traffic load. Evaluation of performance analysis of this algorithm using Network
Simulator (NS2) shows the superiority of the proposed scheme
Energy Efficient Data Transmission through Relay Nodes in Wireless Sensor Net...IDES Editor
In a Wireless Sensor Network (WSN) having a single
sink, information is given to the distant nodes from beacons
by overhearing. Since it is out of the communication range,
information is not sent directly to the static sink (SS). If a
distant node is not able to communicate directly, then it should
send its own packet to another node which is closer to the
Base Station (BS) so that the received packets are relayed to
the BS by this node. In this paper, we propose a relay node
selection algorithm to reduce contention and improve energy
efficiency. In this algorithm, each data packet of direct
communication should include the received signal strength
(RSS) of the beacon packet. The distant node selects a node
with the maximum RSS value as a relay. The algorithm also
assigns transmitting intervals to each relay node. By our
simulation results, we show that our proposed algorithm
improves the packet delivery ratio and energy efficiency.
This document discusses wireless sensor networks and routing protocols for wireless sensor networks. It defines what a wireless sensor network is and its key characteristics. It then discusses objectives like understanding ad hoc network basics and various routing protocols. It covers topics like the differences between WSNs and ad hoc networks, what a network simulator is and reasons for using NS2, various routing techniques like flooding, gossiping, and hierarchical routing. It also discusses routing challenges, wireless nodes, packet transmission, applications and the future scope of WSNs.
A fuzzy based congestion controller for control and balance congestion in gri...csandit
A Wireless Sensor Network (WSN) is deployed with a large number of sensors with limited
power supply in a wide geographically area. These sensors collect information depending on
application. The sensors transmit the data towards a base station called sink. Due to the
relatively high node density and source-to-sink communication pattern, congestion is a critical
issue in WSN. Congestion not only causes packet loss, but also leads to excessive energy
consumption as well as delay. To address this problem, in this paper we propose a new fuzzy
logic based mechanism to detect and control congestion in WSN. In the proposed approach, a
Monitor Node for each grid in congestion candidate region performs a fuzzy control to avoid
increasing congestion. Fuzzy controller’s inputs are continually fetched from the network by the
Monitor Node. Simulation results show that our approach has higher packet delivery ratio and
lower packet loss than existing approaches.
Power control in mobile ad hoc network using NS2 simulatorIRJET Journal
This document proposes a cross-layer design approach called CLPC (Cross Layer Power Control) to improve power control in mobile ad hoc networks. The CLPC approach allows for interaction between the physical, MAC, and network layers to dynamically control transmission power based on received signal strength values. It was tested using the NS2 simulator and found to perform better than AODV in terms of packet delivery ratio, end-to-end delay, and routing overhead. The CLPC approach aims to find reliable routes between source and destination nodes by averaging RSS values and adjusting transmission power accordingly.
Performance Analysis of Routing Metrics for Wireless Sensor NetworksIJMER
This document summarizes and compares various routing metrics that have been proposed for wireless sensor networks. It categorizes the routing metrics into five groups: topology based, signal strength based, active probing based, mobility aware, and energy aware. Topology based metrics like hop count consider only connectivity information without additional measurements. Signal strength and active probing based metrics directly measure link quality through signal strength or probe packets. The document provides detailed descriptions of several popular routing metrics, such as expected transmission time (ETT), medium time metric (MTM), round-trip time (RTT), and packet pair delay. It analyzes the characteristics of different routing metrics and compares their performance.
A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc ...IOSR Journals
This document presents a novel rebroadcast technique called Neighbor Coverage based Probabilistic Rebroadcast (NCPR) protocol to reduce routing overhead in mobile ad hoc networks. The NCPR protocol calculates a rebroadcast delay based on the number of common neighbors between nodes to prioritize dissemination of neighbor information. It also calculates a rebroadcast probability based on additional neighbor coverage ratio and connectivity factor to reduce unnecessary rebroadcasts while maintaining network connectivity. The protocol is implemented by enhancing the AODV routing protocol in NS-2 to reduce overhead from hello packets and neighbor lists in route requests. Its performance is evaluated under varying network sizes, traffic loads, and packet loss conditions.
Energy efficient routing_in_wireless_sensor_networksGr Patel
This document summarizes two energy efficient routing protocols for wireless sensor networks: MAODV and TEEN.
MAODV is an on-demand multicast routing protocol that maintains routing entries only for destinations currently in use. It uses route requests and replies to establish paths within a multicast group. TEEN is a hierarchical protocol that uses hard and soft thresholds to reduce transmissions. Cluster heads broadcast the thresholds and nodes transmit data only when the sensed value exceeds the thresholds. Both protocols aim to reduce energy use through techniques like on-demand routing and limiting unnecessary transmissions.
BeeSensor routing protocol for wireless sensor networkSonam Jain
This document describes a seminar submitted by Sonam Jain for their Master's degree. The seminar focuses on BeeSensor, a routing protocol for wireless sensor networks inspired by bee communication behaviors. It discusses how bees communicate through dances to share information, and how this inspired the design of BeeSensor. The document outlines the key components of BeeSensor, including the different agent roles, protocol phases, and how it evaluates performance metrics like energy efficiency and packet delivery when compared to other routing protocols like AODV.
Routing protocols for wireless sensor networks face several unique challenges compared to other wireless networks. This document discusses routing challenges in wireless sensor networks and provides an overview of different routing protocol approaches, including flat routing, hierarchical routing, location-based routing, and QoS-based routing. It specifically describes two flat routing protocols: directed diffusion, which uses data negotiation and aggregation to reduce energy costs, and SPIN, which employs data description messages to avoid redundant transmissions through negotiation between sensor nodes.
The document proposes an Enhanced Heuristic Function based Energy Aware (EHF-EA) routing protocol for wireless sensor networks. EHF-EA aims to extend network lifetime and improve link quality by using a heuristic function to find optimal routes while considering longevity factor, link quality, and bandwidth. It constructs a network of 50 mobile homogeneous sensor nodes in clusters. EHF-EA computes heuristic and cost values to determine the best next hop to the destination, aiming to efficiently transfer data and conserve energy. Simulation results show EHF-EA achieves a 93.85% packet delivery ratio while reducing bandwidth and number of hops compared to other protocols.
This document proposes a novel sleep scheduling method for event monitoring in wireless sensor networks to achieve low broadcasting delay. The method uses a level-by-level offset schedule where when a node detects a critical event, it transmits an alarm message along a predetermined path with offsets between nodes to avoid collisions. It then uses a colored connected dominant set to establish paths for the center node to broadcast the alarm to other nodes. The proposed system is intended for applications like military and forest fire monitoring where quick dissemination of alarm messages is important.
The document discusses routing protocols in wireless sensor networks. It outlines several key challenges for routing protocols including node deployment, network dynamics, energy conservation, fault tolerance, scalability, and hardware constraints. It then describes several common routing techniques used in wireless sensor networks, including proactive, reactive, and hybrid path establishment approaches, as well as flat, hierarchical, and location-based network structures. Finally, it discusses different protocol operations such as multipath routing, query-based routing, negotiation-based routing, and supporting quality of service metrics.
A survey of real-time routing protocols For wireless sensor networksijcses
This document summarizes a survey of real-time routing protocols for wireless sensor networks. It discusses several existing real-time routing protocols, including AODV, DSR, RAP, SPEED, and MMSPEED. For each protocol, it describes the key mechanisms, advantages, and disadvantages. It focuses on factors like end-to-end delay, energy consumption, mobility, scalability, and challenges for future research in real-time routing protocols for wireless sensor networks. The document provides a comparative analysis of the protocols to highlight their strengths and weaknesses in meeting the demands of real-time applications.
Clock synchronization estimation of non deterministic delays in wireless mess...IJCNCJournal
Clock synchronization is significantly essential as they require universal time on WSN nodes for time measurement, event ordering and coordinated actions, and power management. This paper gives an insight of solving the problem of the non-deterministic delays that exist in the wireless message delivery. Sensor nodes consisting of Arduino Mega and 2.4 GHz nRF24L01+ radio modules are used, and based on the estimation of non-deterministic delays a clock synchronization protocol for WSN is proposed. The results obtained are quiet promising compared to the existing synchronization protocols for WSNs.
Achieving Efficient Data Acquisition Techniques in Wireless Sensor NetworksRutvik Pensionwar
This document summarizes several techniques for achieving efficient data acquisition in wireless sensor networks (WSNs), including an adaptive rate control algorithm, the Enhanced Congestion Detection and Avoidance (ECODA) technique, and the Event-to-Sink Reliable Transport (ESRT) protocol. ECODA uses dual buffer thresholds and weighted buffer differences for congestion detection. ESRT runs primarily on the sink node and aims to configure sensor reporting frequencies to achieve reliable event detection while minimizing energy usage through congestion control. The document evaluates these techniques through simulation and finds they can effectively tackle issues like congestion detection/avoidance and controlling fluctuating data reporting rates.
An optimistic sector oriented approach to mitigate broadcast storm problem in...IAEME Publication
In mobile ad hoc networks (MANETs), due to frequent changes in topology there exist more
link breakages which lead to high rate of path failures and route discoveries, which cause an
increased routing control overhead. Thus, it is necessary to reduce the overhead of route discovery in
the design of routing protocols for MANETs. In a route discovery, broadcasting may be an
elementary and effective data dissemination mechanism, wherever a mobile node blindly
rebroadcasts the first received route request packets unless it has a route to the destination, and
therefore it causes the broadcast storm problem. This paper proposes an optimistic approach OpSOA
to mitigate the broadcasting storm problem and to scale back the communication overheads of
routing protocols by forming sectors within the network and finding the route to destination by two
sectors at a time. The simulation result shows that the proposed mechanism substantially reduces
route requests. Since the proposed protocol searches for the destination sector wise thereby reducing
network wide broadcast of routing requests, traffic, collision and contention. There by there can be
an increase in the packet delivery ratio and decrease in the average end-to-end delay
A FUZZY-BASED CONGESTION CONTROLLER FOR CONTROL AND BALANCE CONGESTION IN GRI...cscpconf
A Wireless Sensor Network (WSN) is deployed with a large number of sensors with limited power supply in a wide geographically area. These sensors collect information depending on application. The sensors transmit the data towards a base station called sink. Due to the relatively high node density and source-to-sink communication pattern, congestion is a critical issue in WSN. Congestion not only causes packet loss, but also leads to excessive energy
consumption as well as delay. To address this problem, in this paper we propose a new fuzzy logic based mechanism to detect and control congestion in WSN. In the proposed approach, a
Monitor Node for each grid in congestion candidate region performs a fuzzy control to avoid increasing congestion. Fuzzy controller’s inputs are continually fetched from the network by the Monitor Node. Simulation results show that our approach has higher packet delivery ratio and lower packet loss than existing approaches.
Spatial Correlation Based Medium Access Control Protocol Using DSR & AODV Rou...IOSR Journals
The document summarizes a proposed spatial correlation-based medium access control protocol for wireless sensor networks that aims to improve energy efficiency. It discusses how sensor nodes are spatially distributed and correlated in detecting events. An iterative node selection algorithm is used to select a minimum set of representative sensor nodes based on a distortion constraint, in order to reduce redundant transmissions. The protocol uses vector quantization to calculate distances between nodes and a mobile element. It then evaluates the performance of using the DSR and AODV routing protocols with this spatial correlation-based MAC protocol in terms of energy consumption and packet drop ratio through simulations. The simulation results show that the protocol with AODV routing performs better than with DSR routing.
A MULTI-PATH ROUTING DETERMINATION METHOD FOR IMPROVING THE ENERGY EFFICIENCY...ijwmn
A selective forwarding attack in mobile wireless sensor networks is an attack that selectively drops or delivers event packets as the compromised node moves. In such an attack, it is difficult to detect the compromised node compared with the selective forwarding attack occurring in the wireless sensor network
because all sensor nodes move. In order to detect selective forwarding attacks in mobile wireless sensor networks, a fog computing-based system for a selective forwarding detection scheme has been proposed. However, since the proposed detection scheme uses a single path, the energy consumption of the sensor node for route discovery when the sensor node moves is large. To solve this problem, this paper uses fuzzy
logic to determine the number of multi-paths needed to improve the energy efficiency of sensor networks. Experimental results show that the energy efficiency of the sensor network is improved by 9.5737% compared with that of the existing scheme after 200 seconds when using the proposed scheme
A fuzzy congestion controller to detect and balance congestion in wsnijwmn
This document proposes a fuzzy logic-based approach to detect and control congestion in wireless sensor networks (WSNs). The approach divides the WSN into grids monitored by designated Monitor Nodes. These nodes use fuzzy logic and three input metrics (transmission delay, grid density, dropped packets) to determine the congestion level of their grid. Based on the congestion level, packets are either forwarded through the grid or through alternative relay nodes to avoid congestion. Simulation results show this approach achieves higher packet delivery and lower packet loss compared to an existing baseline approach.
This document summarizes a research paper that evaluates the effect of network scalability for a token bucket-based congestion control protocol in wireless sensor networks. The paper introduces congestion control challenges in wireless sensor networks and discusses existing approaches. It then proposes improving an existing priority-based application-specific congestion control clustering protocol called PASCCC by utilizing a token bucket algorithm rather than queues to better control congestion. The paper aims to evaluate how this token bucket-based approach improves network performance as scale increases.
ENERGY EFFICIENT, LIFETIME IMPROVING AND SECURE PERIODIC DATA COLLECTION PROT...ijcsa
The most emerging prominent sensor network applications collect data from sensor nodes and monitors
periodically. Resource constraint Sensor motes sense the environment and transit data to the remote sink
via multiple hops. Minimum energy dissipation and secure data transmission are crucial to such
applications. This paper delivers an energy efficient, lifetime improving, secure periodic Data Gathering
scheme that is a hybrid of heuristic path establishment and secure data transmission. This protocol uses
artificial intelligence (AI) based A* heuristic search algorithm to establish energy efficient admissible
optimal path to sink in terms of high residual energy, minimum hop counts and high link quality. This
scheme also adopts block encryption Rivest Cipher (RC6) Algorithm to secure the transmission of packets.
This code and speed optimized block encryption provides confidentiality against critical data and
consumes less energy for encryption. This proposed method increases the network lifetime there by
reducing the total traffic load. Evaluation of performance analysis of this algorithm using Network
Simulator (NS2) shows the superiority of the proposed scheme
Analysis of Cluster Based Anycast Routing Protocol for Wireless Sensor NetworkIJMER
A wireless sensor network is a collection of nodes organized into a cooperative network.
Each node consists of processing capability, may contain multiple types of memory, have a RF
transceiver, have a power source, and accommodate various sensors and actuators. The nodes
communicate wirelessly and often self-organize after being deployed in an ad hoc fashion.
Routing protocols for wireless sensor networks are responsible for maintaining the routes in the
network and have to ensure reliable multi-hop communication .The performance of the network is
greatly influenced by the routing techniques. Routing is to find out the path to route the sensed data to
the base station. In this paper the features of WSNs are introduced and routing protocols are reviewed
for Wireless Sensor Network.
This document discusses improving the performance of mobile wireless sensor networks using a modified DBSCAN clustering algorithm. It first provides background on wireless sensor networks and discusses challenges related to mobility. It then reviews several existing works related to clustering, mobility, and extending network lifetime. The paper proposes using a modified DBSCAN algorithm that takes into account mobility, remaining energy, and distance to base station to select cluster heads. It evaluates the performance of this approach based on throughput, delay, and packet delivery ratio, finding improvements over other methods.
International Journal of Engineering and Science Invention (IJESI) inventionjournals
This document summarizes a research paper that proposes a scheme to protect the location privacy of source nodes in wireless sensor networks against hotspot-locating attacks. The scheme creates an irregularly shaped "cloud" of fake traffic around the real source node to camouflage its location. Cryptographic techniques are used to change packet appearances at each hop. This prevents packet correlation and makes the source node indistinguishable. Simulations show the scheme provides stronger privacy than routing-based schemes while requiring less energy than global-adversary schemes. The proposed neighbor discovery distance algorithm aims to find the minimum traffic path to efficiently transmit data without loss.
Effective Pipeline Monitoring Technology in Wireless Sensor NetworksIJTET Journal
Wireless detector nodes are a promising technology to play three-dimensional applications. Even it
will sight correct lead to could on top of ground and underground. In solid underground watching system makes
some challenges are there to propagating the signals. The detector node is moving entire the underground
pipeline and sending information to relay node that's placed within the on top of ground. If any relay node is
unsuccessful during this condition suggests that it'll not sending the info. In this watching system can specially
designed as a heterogeneous networks. Every high power relay nodes most covers minimum 2 low power relay
node. If any relay node is unsuccessful within the network, the constellation can modification mechanically
supported the heterogeneous network. The high power relay node is change the unsuccessful node and sending
the condition of pipeline. The benefits are thought-about to be extremely distributed, improved packet delivery
This document summarizes a research paper that proposes two methods called EFFORT and ANYCAST to maximize the lifetime of wireless sensor networks. EFFORT is an opportunistic routing protocol that improves path diversity and transmission reliability. ANYCAST is an asynchronous sleep-wake scheduling mechanism that arranges sensor nodes to sleep to reduce energy consumption. The document describes how EFFORT selects forwarder nodes based on an opportunistic energy cost metric (OECS) that considers several energy costs. It also explains how ANYCAST works by having sensor nodes wake independently during probing periods to relay data, then return to sleep if no response is received. Simulation results showed both EFFORT and ANYCAST effectively extend network lifetime compared to other routing
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
The main tasks of a Wireless Sensor Network
(WSN) are data collection from its nodes and communication
of this data to the base station (BS). The protocols used for
communication among the WSN nodes and between the WSN
and the BS, must consider the resource constraints of nodes,
battery energy, computational capabilities and memory. The
WSN applications involve unattended operation of the network
over an extended period of time. In order to extend the lifetime
of a WSN, efficient routing protocols need to be adopted. The
proposed low power routing protocol based on tree-based
network structure reliably forwards the measured data towards
the BS using TDMA. An energy consumption analysis of the
WSN making use of this protocol is also carried out. It is
found that the network is energy efficient with an average
duty cycle of 0:7% for the WSN nodes. The OmNET++
simulation platform along with MiXiM framework is made
use of.
The document discusses a fault tolerance mechanism for wireless sensor networks (WSNs) using recovery nodes. It proposes detecting faulty sensor nodes by calculating the round trip delay (RTD) time for discrete round trip paths (RTPs) and comparing them to a threshold value. Once a faulty node is identified, neighboring nodes with higher energy ("recovery nodes") are selected to take over transmission duties and maintain quality of service. The method is tested through simulations with different numbers of sensor nodes to evaluate scalability.
Multiagent based multipath routing in wireless sensor networksijwmn
This paper proposes a Multiagent Based Multipath Routing (MBMR) using a set of static and mobile agents
by employing localization technique. The operation of proposed routing technique can be briefly explained
as follows. (1) Anchor nodes are deployed evenly over the network environment. (2) Unknown sensor nodes
are deployed randomly over network environment and these nodes perform localization. (3) Source node
computes the shortest route to destination node through arbitrary midpoint node and intermediate nodes.
(4) Source node generates mobile agents for partial route discovery, which traverses to destination node
through the midpoint and intermediate nodes by carrying information. (5) Mobile agents update the
destination node with carried information. (6) Destination node computes route weight factor for all the
routes discovered by mobile agents. (7) Destination node computes the node disjoint routes and it selects
routes depending on the criticalness of event for communication. The performance of the proposed scheme
is evaluated in terms of performance parameters such as localization error, network lifetime, energy
consumption, cost factor, packet delivery ratio, and latency.
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.
A comparative study in wireless sensor networksijwmn
This document summarizes and compares several routing algorithms proposed for wireless sensor networks. It discusses algorithms that aim to improve reliability, power efficiency, lifetime, and fault tolerance. The evaluation section compares how each algorithm addresses challenges like reliability, energy conservation, and adapting to topology changes. While various algorithms achieve improvements in areas like power efficiency and lifetime, most still have limitations and do not fully address all the key challenges for wireless sensor networks.
Iaetsd quick detection technique to reduce congestion inIaetsd Iaetsd
This document proposes a quick detection technique (QDT) to avoid congestion in wireless sensor networks. QDT uses the queue buffer length of sensor nodes to estimate impending congestion and diffuses traffic across multiple paths to the base station. By dynamically routing traffic away from congested areas, QDT aims to improve packet delivery ratios and event reporting while avoiding congestion. The technique detects inactive nodes that do not properly forward or drop packets, and routes around them to reduce delays and maximize network lifetime. Simulation results show QDT significantly improves event reporting and packet delivery compared to other techniques.
This document discusses techniques for data dissemination and caching in wireless sensor networks. It aims to reduce energy consumption by minimizing unnecessary data transmission through cooperative caching. Sensor nodes can store data in their local cache or use nearby nodes' caches through cooperative caching. One node close to the sink is selected as the Immediate Dissemination Node to cache data, while other nodes along the path act as dissemination nodes. By caching data closer to the sink, this approach reduces network traffic and prolongs the battery life of sensor nodes. The paper also reviews several routing protocols and discusses how data negotiation, change expectancy, and discarding duplicate data can further improve energy efficiency in wireless sensor networks.
Detection of Vampire Attacks in Ad-Hoc Wireless Sensor Network Evaluation and...ijtsrd
Wireless Sensor Networks WSNs in todays world are the means of communication. These contain nodes that act as transmitter and receivers are prone to different attacks leading to different types of losses. The resource depletion attack that is called vampire attack drains out the energy from the nodes leaving them useless. These attacks are protocol compliant, they are easy to implement. Since they are orthogonal in nature they can easily intrude into any routing protocol. They affect the entire network causing large loss of energy and A vampire attack is caused by the malicious node on the decentralized ad hoc wireless network. The paper analyses how protocols faces these attacks. Vampire attacks are not protocol specific rather uses its compliant message. The current security measures to prevent these attacks are been reviewed along with result of simulation of representative protocols in the presence of a vampire attack is been presented. The paper also describes how the existing sensor network protocol is been modified for protection from the vampire attacks for which PLGP Parno, Luk, Gaustad and Perrig solution is also been proposed. Anand. M "Detection of Vampire Attacks in Ad-Hoc Wireless Sensor Network Evaluation and Protection" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-2 , February 2019, URL: https://www.ijtsrd.com/papers/ijtsrd20300.pdf
Paper URL: https://www.ijtsrd.com/computer-science/computer-network/20300/detection-of-vampire-attacks-in-ad-hoc-wireless-sensor-network-evaluation-and-protection/anand-m
Similar to MULTI-PATH ROUTE DETERMINATION METHOD FOR NETWORK LOAD BALANCING IN FAP-BASED WSNS USING FUZZY LOGIC (20)
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar Kanvaria
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.
Main Java[All of the Base Concepts}.docxadhitya5119
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.
How to Make a Field Mandatory in Odoo 17Celine George
In Odoo, making a field required can be done through both Python code and XML views. When you set the required attribute to True in Python code, it makes the field required across all views where it's used. Conversely, when you set the required attribute in XML views, it makes the field required only in the context of that particular view.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UPRAHUL
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
MULTI-PATH ROUTE DETERMINATION METHOD FOR NETWORK LOAD BALANCING IN FAP-BASED WSNS USING FUZZY LOGIC
1. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
DOI:10.5121/ijcsit.2017.9607 67
MULTI-PATH ROUTE DETERMINATION METHOD
FOR NETWORK LOAD BALANCING IN FAP-BASED
WSNS USING FUZZY LOGIC
Won-Jin Chung1
and Tea-Ho Cho2
1
College of Information and Communication Engineering, Sungkyunkwan University,
Suwon, Republic of Korea
2
College of Software, Sungkyunkwan University, Suwon, Republic of Korea
ABSTRACT
A flooding attack in wireless sensor networks is a type of threat that shortens the lifetimes of the sensor
networks. Although flooding attack prevention techniques have been proposed, if a continuous flooding
attack occurs, the sensor node energy is depleted during detection. In this paper, we use multi-path routing
to solve this problem. In order to balance the load of the sensor node, energy balancing of the sensor node
is controlled by determining the number of pathways using fuzzy logic. By adjusting the energy balancing
of the sensor nodes, the number of energy-exhausting sensor nodes can be reduced. As a result, when a
flooding attack occurs, the energy efficiency of the sensor node is increased by determining the number of
pathways.
KEYWORDS
Wireless Sensor Network, Multi-path Routing, Fuzzy Logic, Flooding Attack Prevention, Network Load
Balancing
1. INTRODUCTION
Wireless sensor networks (WSNs) consist of a number of small sensor nodes that detect various
types of information, such as temperature, sound, and vibration. Additionally, a base station (BS)
is used to collect information detected by the sensor nodes. In addition, the sensor nodes are
deployed randomly over a wide area and autonomously configure their communication. WSNs
are used in various fields, including battlefields, smart cities, and intelligent transportation
systems. A sensor node can transmit monitored information to the BS through wireless
communication, allowing the results to be checked periodically or in real time [1]. However,
since WSNs are networks in which sensor nodes are randomly placed and communicate with each
other, regions where sensor nodes are arranged in a concentrated manner or where sensor nodes
are missing may occur. Furthermore, since sensor nodes use limited computing power and
wireless communication, malicious attackers can easily capture and compromise the sensor
nodes. Additionally, the sensor nodes have a limited amount of energy and it is difficult to
recharge them. When an attacker uses a compromised node for an attack, the sensor node
consumes more energy than when a normal packet is dropped due to an attack or when a sensor
node transmits and receives a normal packet [2-3]. Therefore, if the residual energy of the sensor
node is low, the sensor node energy is exhausted by the attack. If the number of energy-exhausted
sensor nodes is large, shadowed areas occur and network life is shortened. Additionally, attackers
can use a compromised node to attempt other attacks, such as selective forwarding attacks,
sinkhole attacks, and Sybil attacks. Among these types of attacks, flooding attacks shortens the
lifetime of the sensor network. To prevent such attacks, flooding attack prevention (FAP) has
2. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
68
been proposed [4]. FAP uses the ad-hoc on-demand distance vector (AODV) routing protocol and
finds the destination node through the expanding ring search (ERS) algorithm [5]. ERS is an
algorithm that finds a destination node through multiple route request (RREQ) and route reply
(RREP) retransmissions. The ERS algorithm was proposed to help find the destination node by
sending an RREQ from the beginning in a wide range of networks. The ERS algorithm is a
method that can be used to expand the range of the search sequentially [6]. Therefore, the
destination node is found through a small number of RREQ retransmissions. However, a large
amount of energy is consumed in the sensor node during the destination detection process of the
AODV protocol. For this reason, the energy of a low-energy sensor node in the detector can be
exhausted during the flooding attack detection process. Also, if the number of depleted sensor
nodes is large, the sensor network’s lifetime is shortened. In this paper, we improve the energy
efficiency of the sensor nodes by distributing the load of sensor nodes using multiple pathways
and by balancing the sensor nodes. In order to distribute the load of the sensor nodes efficiently,
we propose a method that uses a fuzzy system to determine the number paths. Section 2 of this
paper discusses flooding attacks, FAP, and multi-path routing. Section 3 describes the proposed
method through fuzzy logic, and section 4 includes the experimental results of the proposed
method. In the last section, our conclusions and suggested future research are presented.
2. RELATED WORKS
2.1. Flooding attack
A flooding attack is a type of denial of service attack (DOS) that floods a large number of packets
and consumes sensor network resources [7]. When a flooding attack occurs, the sensor network is
paralyzed because a sensor node fails to process all of its packets in a short period of time. In
addition, the sensor node is affected by an attack that continuously consumes energy by imposing
a load on the sensor node in the process of transmitting a large number of packets caused by a
flooding attack. A flooding attack in WSNs generates a large number of false packets from a
compromised node and transmits these along various paths. Since a sensor node receiving a false
packet stores various transmission paths, the storage space of the path table is filled with an
incorrect path. This is because, when a new event packet is transmitted, the path of a false packet
is filled in the path table; thus, a situation occurs in which the packet cannot be transmitted. Also,
since the sensor node transmits the packet received by the BS when the packet is received, the
sensor nodes included in the path consume energy continuously while receiving the false packet
and transmitting it to the BS. For this reason, a load is generated on the sensor node during the
process of transmitting and receiving false packets. Also, since sending a large number of false
packets results in continuous energy consumption, a low-energy sensor will undergo energy
depletion. If there are many energy-exhausted nodes when an event occurs, a packet may not be
transmitted to the BS due to the presence of depleted nodes. Thus, the sensor network’s lifetime is
shortened.
3. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
69
2.2. FAP
Herein, we use the FAP scheme proposed by Y. Ping to prevent flooding attacks from WSNs.
This scheme effectively prevents flooding attacks in ad hoc networks. Therefore, the constraints
of the sensor nodes should be considered before applying this technique to WSNs. To prevent
flooding attacks, each node has two tables. The first table is the blacklist table. When a flooding
attack occurs, the blacklist table identifies the flooding attack through the FAP scheme and adds
the suspicious node ID of the flooding attack to the blacklist. The second table is the rate-RREQ
table. This table has two columns: the node-ID and the RREQ-time. The node-ID includes the
neighbor node ID and the RREQ-time records the time when the neighbor node transmits the
RREQ packet. After the sensor node has the blacklist table and the rate-RREQ table, the FAP
scheme checks the source node ID and the packet generation time at the BS when an attacker
attempts a flooding attack. If a large number of packets arrive, and packets with the same node
IDs and similar creation times are larger than a preset threshold value, it is determined that a
flooding attack is underway. In the BS, a source node ID that is suspected to be the origin of the
flooding attack is entered into the blacklist and the updated blacklist is transmitted to all sensor
nodes. If the blacklist is transmitted to all of the sensor nodes and the continuous packet is
transmitted, the lower node can be compared to the node ID belonging to the blacklist. If this
node ID is in the blacklist, it is determined that the attack is a flooding attack and all packets
transmitted from the sensor node belonging to the blacklist are blocked. In contrast, if there is no
matching node ID in the blacklist, it is treated as a normal packet and forwarded to the BS.
Figure 1. Flooding attack
4. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
70
Figure 2. Flooding attack prevention
2.3. Multipath routing
The routing of the sensor networks uses multi-hop routing via packet forwarding rather than
single-hop routing; this is done because the distribution of sensor nodes is dense. Single-path
routing enables rapid routing and data transfer because each sensor node establishes only one path
before sending the collected data [8-9]. However, a single path can be rendered inoperable by a
defect in the sensor node during packet forwarding. Therefore, the use of multi-path routing
provides improved transmission reliability, fault tolerance, congestion control, and quality of
service. The multi-path routing scheme establishes multiple pathways, distributes the packets to
the established path, and transmits the packets sequentially to balance sensor nodes that are
included in the path. The multi-path routing scheme reduces the load on a sensor node and
extends the lifespan of a sensor network. However, when multiple paths are set up, the number of
hops increases compared to when a packet is transmitted using a single path. In multi-path
routing, multiple paths are maintained for data routing. Therefore not only the shortest path but
also relatively long distance paths are also available for data routing. Therefore, as the distance
increases, the number of hops from the event occurrence area to the BS increases, and data
transmission in delayed than using a single shortest path in the data transmission process. Also,
by reducing the energy of the sensor nodes periodically, the overall network energy efficiency is
reduced.
5. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
71
3. PROPOSED SCHEME
3.1. Assumptions
Sensor nodes are placed randomly and the BS either estimates or knows the remaining energy,
status, and hop counts for each sensor node. The preset sensor node ID cannot be changed.
Flooding attacks occur on compromised nodes.
3.2. Fuzzy system
The proposed scheme in this paper uses multi-path routing to disperse the sensor nodes, improve
the sensor node energy efficiency if a flooding attack occurs, and reduce the number of exhausted
sensor nodes to extend the sensor network lifetime. When the number of multi-paths is set small,
the load balancing efficiency is low. On the other hand, if a large number of multi-paths is set, a
path in which the number of hops is increased can be selected for data routing. In this case, the
sensor network energy efficiency deteriorates. Therefore, the proposed method improves the load
balancing efficiency and the sensor network energy efficiency by setting the number of suitable
multi-path through the fuzzy system. Therefore, we use fuzzy logic to determine the appropriate
number of pathways and distribute a number of false packets (generated by the flooding attack)
on as many paths as the determined number of pathways. During the flooding attack detection
process of the FAP scheme, the energy depletion of a sensor node that has low residual energy is
prevented. The input parameters are the hop count (HC), residual energy (RE), and the number of
participating paths in the sensor node (NPP). The output parameter is the number of multiple
pathways (NMP).
Input parameter
HC = {VL (VeryLarge), L (Large), M (Medium), S (Small)}
RE = {VL (VeryLarge), L (Large), M (Medium), S (Small), VS (VerySmall)}
NPP = {H (High), M (Medium), L (Low)}
Output parameter
NMP = {VS (VerySmall), S (Small), M (Medium), L (Large), VL (VeryLarge)}
Figure 3. Multi-path routing
6. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
72
The number of hops is an important factor when determining the number of pathways. If multiple
paths are used, the number of hops increases relative to when a single path is used. In such cases,
energy consumption occurs along the path, influencing the energy efficiency of the sensor
network. Additionally, when the residual energy of the sensor node is small, energy is exhausted
in the routing setting and the flooding attack detection process should be rerouted. In this case,
additional energy consumption by the sensor networks occurs. Finally, if the same sensor node is
included in several paths, an increased load will occur on the sensor node. Therefore, in order to
balance the load of the sensor node, the number of paths that a sensor node can participate in
should be set. Table 1 shows a brief overview of the fuzzy rules.
Table 1. Fuzzy rules
Rule Input Output
(NMP)HC RE NPP
0 VL VL H VS
1 VL VL M VS
2 VL VL L S
. . . . .
. . . . .
. . . . .
15 L VL H VS
16 L VL M VS
17 L VL L S
18 L L H VS
19 L L M S
. . . . .
. . . . .
. . . . .
31 L VS L L
32 M VL H S
33 M VL M S
34 M VL L M
. . . . .
. . . . .
. . . . .
43 M VS M L
44 M VS L VL
45 S VL H S
46 S VL M M
. . . . .
. . . . .
. . . . .
Figure 4. Fuzzy system
7. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
73
The following is a fuzzy membership function.
(a) HC
(b) RE
(c) NPP
8. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
74
(d) NMP
4. EXPERIMENTAL RESULTS
The sensor field size used in this experiment is 1000 × 1000 (m2
) and the number of sensor nodes
is 500. The type of the sensor node used in this experiment follows the specifications of the mica2
model and is simulated via C++. The initial energy of the mica2 model is powered by two AA
batteries. However, since the installation of the sensor node is applied in an older area, there is
also energy consumption resulting from energy discharge. Also, energy consumption of the
sensor node occurs due to packet transmission that occurred previously. Thus, the energy of the
sensor nodes remains below the initial energy. Therefore, the energy of each sensor node is
randomly set at a value that is lower than the initial energy (1 J). The false packet sizes used in
flooding attacks are set to the maximum packet size used in TinyOS, which is 29 bytes [10].
When transmitting packets from a sensor node to the BS, the energy consumed per byte is 16.25
µJ. When a packet is received, 12.25 µJ per byte is consumed [11].
Figure 5. Membership function
Figure 6. Energy consumption due to flooding attacks in sensor networks
9. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
75
Figure 6 shows the sensor network energy decrease due to the number of flooding attacks; a
similar energy reduction occurs in the FAP and proposed schemes. In addition, Figure 7 shows
the residual energy amount of the sensor node installed around the BS when a flooding attack
occurs. It is assumed that the flooding attack occurs 15 times during the experiments. The
proposed method and the FAP method are again compared by analyzing the energy of the sensor
nodes installed around the BS. The experimental results show that the proposed scheme
consumes less energy than the FAP scheme. Thus, if a flooding attack occurs, the proposed
scheme shows a sensor node energy efficiency that has been improved by approximately 10%
compared to the FAP scheme. Additionally, when the FAP scheme is used, two more sensor
nodes (relative to the proposed scheme) in the path experience energy depletion.
5. CONCLUSIONS
The FAP scheme can be effectively used to prevent flooding attacks. However, it does not
consider the residual energy of the sensor node. As a result, FAP leads to energy depletion in low-
energy sensor nodes during the flooding attack detection process. When a sensor field has a
depleted sensor node, the sensor network requires a new route reset. Thus, the sensor network
consumes additional energy. To address these problems, we used multiple paths to distribute and
balance the load on the sensor node. However, the sensor network consumes additional energy
due to the fact that the number of hops increases when using multiple pathways instead of a single
path. Therefore, we propose a scheme to increase the energy efficiency of sensor nodes by
determining the number of paths through fuzzy logic. By determining the appropriate number of
multi-paths, we can balance the energy of the sensor nodes and reduce the number of nodes that
undergo energy depletion. Additionally, the energy efficiency of the sensor network is improved
by limiting the number of hops generated in multi-path routing. Experimental results show that
the energy efficiency of the BS peripheral sensor nodes is increased by about 10% compared to
the FAP scheme. This reduces the energy depletion of sensor nodes through efficient energy
balancing. However, if the attacker changes the source node ID every time a flooding attack
occurs, the normal sensor node ID is included in the blacklist, even if the flooding attack is
prevented by the FAP method. If the packet is transmitted, the normal sensor node is blocked. If
this happens repeatedly, the sensor network can become paralyzed. Therefore, in future research,
mutual verification will be conducted to block the change if the sensor node ID is altered.
Figure 7. BS energy efficiency of adjacent sensor nodes
10. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
76
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.
NRF-2015R1D1A1A01059484)
REFERENCES
[1] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, "A survey on sensor networks,"
Communications Magazine, IEEE, vol. 40, pp. 102-114, 2002.
[2] C. Karlof and D. Wagner, "Secure routing in wireless sensor networks: Attacks and
countermeasures," Ad Hoc Networks, Vol. 1, No. 2, pp. 293-315, 2003
[3] Y. Wang, G. Attebury and B. Ramamurthy, “A survey of security issues in wireless sensor
networks,” IEEE Communications Surveys & Tutorials, vol. 8, pp. 2-23, 2007
[4] Y. Ping, H. Yafei, Z. Yiping, Z. Shiyong and D. Zhoulin, “Flooding attack and defence in ad hoc
networks,” Journal of Systems Engineering and Electronics, Vol. 17, No.2, pp. 410-416, 2006
[5] C. Perkins, E. Belding-Royer, and S. Das, "Ad hoc on-demand distance vector (AODV) routing,"
IETF RFC 3561, 2003
[6] N. D. Pham and H. Choo, "Energy efficient expanding ring search for route discovery in
MANETs," Communications, 2008
[7] D. R. Raymond and S. F. Midkiff, “Denial-of-Service in Wireless Sensor Networks: Attacks and
Defenses,” IEEE Pervasive Computing, vol. 7, pp. 74-81, 2008
[8] J. N. Al-Karaki and A. E. Kamal, “Routing techniques in wireless sensor networks: a survey,”
IEEE wireless communications, vol. 11, pp. 6-28, 2004
[9] M. Radi, B. Dezfouli, K. A. Bakar and M. Lee, “Multipath routing in wireless sensor networks:
survey and research challenges,” Sensors, vol. 12, pp. 650-685, Jan. 2012
[10] J. Deng, R. Han, and S. Mishra, "Defending against path-based DoS attacks in wireless sensor
networks," In Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
pp. 89-96, 2005
[11] F. Ye, H. Luo, S. Lu, and L. Zhang, "Statistical en-route filtering of injected false data in sensor
networks," IEEE Journal on Selected Areas in Communications, Vol. 23, No. 4, pp. 839-850, 2005
Authors
Won Jin Chung
Received a B.S. degree in Information Security from Baekseok University in 2016,
and is now working toward an M.S. degree in the Department of Electrical and
Computer Engineering at Sungkyunkwan University.
Tea Ho Cho
Received a Ph.D. degree in Electrical and Computer Engineering from the University
of Arizona, USA, in 1993, and B.S. and M.S.degrees in Electrical and Computer
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.