This document discusses routing protocols in wireless sensor networks. It begins with an introduction to routing challenges in WSNs such as limited energy, processing, and storage in sensor nodes. It then covers different routing techniques including flat routing protocols like SPIN, directed diffusion, and rumor routing. Hierarchical routing protocols discussed include LEACH, PEGASIS, TEEN, and APTEEN. Finally, it briefly mentions location-based routing and the GEAR protocol.
Routing protocols in wireless sensor networks face several unique challenges compared to other wireless networks. The document discusses these challenges and provides an overview of common routing protocol approaches in WSNs, including flat routing protocols like SPIN and Directed Diffusion, hierarchical routing protocols like LEACH, and location-based routing protocols. It also covers routing design issues specific to WSNs such as energy efficiency, data delivery models, fault tolerance, and quality of service.
This document summarizes geographical routing in wireless sensor networks. It begins with an introduction to geographic routing protocols, which route packets based on the geographic position of nodes rather than their network addresses. It then discusses several specific geographic routing protocols, including Greedy Perimeter Stateless Routing (GPSR) and Geographical and Energy Aware Routing (GEAR). The document also covers topics like how nodes obtain location information, security issues in geographic routing like the Sybil attack, and concludes that geographic routing can enable scalable and energy-efficient routing in wireless sensor networks.
Black Hole Attack:
A malicious node advertises the wrong paths as good paths to the source node during the pathfinding process.
When the source selects the path including the attacker node, the traffic starts passing through the adversary node and this node starts dropping the packets selectively or in whole.
Black hole region is the entry point to a large number of harmful attacks.
The document discusses routing challenges and protocols in wireless sensor networks (WSNs). It covers flooding, hierarchical routing protocols like LEACH, data-centric protocols like directed diffusion, and negotiation-based protocols like SPIN. It also discusses resource constraints in WSNs like limited energy and the need for routing protocols to be energy-efficient. Unique characteristics of WSNs like dynamic topology and varying node densities present new challenges for routing protocol design.
The document presents a graduate project on efficient data aggregation from polling points in wireless sensor networks. The proposed system called Mobi-Cluster aims to minimize overall network overhead and energy expenditure associated with multi-hop data retrieval while ensuring balanced energy consumption and prolonged network lifetime. This is achieved through building cluster structures consisting of member nodes that route data to assigned cluster heads, and selecting appropriate polling points to act as intermediaries between clusters and a mobile collector. The key stages of the Mobi-Cluster protocol are described as cluster head selection, polling point selection, cluster head attachment to polling points, data aggregation and forwarding to polling points, and communication between polling points and the mobile collector.
1) Medium Access Control (MAC) protocols regulate access to shared wireless channels and ensure performance requirements of applications are met. They assemble data into frames, append addressing and error detection, and disassemble received frames.
2) Common MAC protocols include Fixed Assignment (e.g. TDMA), Demand Assignment (e.g. polling), and Random Assignment (e.g. ALOHA, CSMA). Schedule-based MAC protocols avoid contention through resource scheduling while contention-based protocols (e.g. CSMA/CA) allocate resources on demand, risking collisions.
3) The document discusses various MAC protocols for wireless sensor networks and their objectives to minimize energy waste from idle listening, collisions,
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.
Routing protocols in wireless sensor networks face several unique challenges compared to other wireless networks. The document discusses these challenges and provides an overview of common routing protocol approaches in WSNs, including flat routing protocols like SPIN and Directed Diffusion, hierarchical routing protocols like LEACH, and location-based routing protocols. It also covers routing design issues specific to WSNs such as energy efficiency, data delivery models, fault tolerance, and quality of service.
This document summarizes geographical routing in wireless sensor networks. It begins with an introduction to geographic routing protocols, which route packets based on the geographic position of nodes rather than their network addresses. It then discusses several specific geographic routing protocols, including Greedy Perimeter Stateless Routing (GPSR) and Geographical and Energy Aware Routing (GEAR). The document also covers topics like how nodes obtain location information, security issues in geographic routing like the Sybil attack, and concludes that geographic routing can enable scalable and energy-efficient routing in wireless sensor networks.
Black Hole Attack:
A malicious node advertises the wrong paths as good paths to the source node during the pathfinding process.
When the source selects the path including the attacker node, the traffic starts passing through the adversary node and this node starts dropping the packets selectively or in whole.
Black hole region is the entry point to a large number of harmful attacks.
The document discusses routing challenges and protocols in wireless sensor networks (WSNs). It covers flooding, hierarchical routing protocols like LEACH, data-centric protocols like directed diffusion, and negotiation-based protocols like SPIN. It also discusses resource constraints in WSNs like limited energy and the need for routing protocols to be energy-efficient. Unique characteristics of WSNs like dynamic topology and varying node densities present new challenges for routing protocol design.
The document presents a graduate project on efficient data aggregation from polling points in wireless sensor networks. The proposed system called Mobi-Cluster aims to minimize overall network overhead and energy expenditure associated with multi-hop data retrieval while ensuring balanced energy consumption and prolonged network lifetime. This is achieved through building cluster structures consisting of member nodes that route data to assigned cluster heads, and selecting appropriate polling points to act as intermediaries between clusters and a mobile collector. The key stages of the Mobi-Cluster protocol are described as cluster head selection, polling point selection, cluster head attachment to polling points, data aggregation and forwarding to polling points, and communication between polling points and the mobile collector.
1) Medium Access Control (MAC) protocols regulate access to shared wireless channels and ensure performance requirements of applications are met. They assemble data into frames, append addressing and error detection, and disassemble received frames.
2) Common MAC protocols include Fixed Assignment (e.g. TDMA), Demand Assignment (e.g. polling), and Random Assignment (e.g. ALOHA, CSMA). Schedule-based MAC protocols avoid contention through resource scheduling while contention-based protocols (e.g. CSMA/CA) allocate resources on demand, risking collisions.
3) The document discusses various MAC protocols for wireless sensor networks and their objectives to minimize energy waste from idle listening, collisions,
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.
This document provides an overview of routing protocols in ad hoc networks. It begins with an abstract describing the objectives of surveying and comparing different classes of ad hoc routing protocols. The document then outlines the topics to be covered, including the characteristics, applications, and types of ad hoc routing protocols. Several representative routing protocols are described in detail, including table-driven, hybrid, source-initiated, location-aware, multipath, hierarchical, multicast, and power-aware protocols. The document concludes by discussing future work related to improving reusability and security of ad hoc routing protocols.
Wireless Sensor Network (WSN) consists of sensor nodes which interact with each other through physical parameters like sunlight, wind, vibration, humidity etc. Routing protocols provide an optimal data transmission route from sensor nodes to sink node to save energy of nodes. From Base Station (BS) Sensor node sends and receives data to or from wireless stations. Clustering mechanism is one of the popular routing mechanisms used in WSN for optimizing the problem in sensor nodes. There are two types of clustering schemes known as homogeneous schemes and heterogeneous schemes. In Homogeneous scheme initial energy is same for each node but in heterogeneous scheme initial energy is different for each node and also used to determine the efficiency of sensor networks. Enhanced Modified LEACH (EMODLEACH) is a reactive protocol which is implemented for homogeneous network model. We have implemented the concept of Efficient Cluster head Replacement scheme and Dual transmitting power level scheme of MODLEACH along with the concept of Efficient Intra Cluster transmission Scheme of TEEN in LEACH. We analyze the PEGASIS protocol and modified the exiting protocol called improved energy balanced routing protocol (IEBRP).This IEBRP is based on cluster formation, cluster routing and other aspects of LEACH protocol.
Routing protocols are essential for wireless sensor networks to efficiently transmit collected sensor data to data sinks. The document discusses several challenges in designing routing protocols for wireless sensor networks and surveys different routing techniques including flat, hierarchical, and geographic routing. It provides LEACH and PEGASIS as examples of hierarchical routing protocols that use clustering and data aggregation to reduce energy consumption.
This document discusses power aware routing protocols for wireless sensor networks. It begins by describing wireless sensor networks and how they are used to monitor environmental conditions. It then classifies routing protocols for sensor networks based on their functioning, node participation style, and network structure. Specific examples are provided for different types of routing protocols, including LEACH, TEEN, APTEEN, SPIN, Rumor Routing, and PEGASIS. Chain-based and clustering routing protocols are also summarized.
The document discusses clustering protocols in wireless sensor networks (WSNs). It begins by introducing WSNs and their applications. It then describes the main types of communication in WSNs: direct, multi-hop, and using clustering. Several issues with clustering in WSNs are identified, such as selecting cluster heads and handling node mobility. Popular clustering protocols like LEACH are examined, noting their advantages like data aggregation but also limitations such as unsuitability for large networks. Proposed solutions for improving LEACH involve considering energy levels and traffic load when selecting cluster heads.
This document discusses and compares various routing protocols for mobile ad hoc networks (MANETs). It covers both topology-based approaches that rely on information about existing links, as well as position-based approaches where nodes determine their own position. Specific protocols discussed in detail include proactive protocols like Destination-Sequenced Distance-Vector (DSDV) and reactive protocols like Dynamic Source Routing (DSR). Hybrid protocols like Zone Routing Protocol (ZRP) that combine proactive and reactive approaches are also examined. The document provides illustrations and comparisons of the routing mechanisms and characteristics of these important MANET routing protocols.
The document summarizes contention-based MAC protocols for wireless sensor networks. It discusses the PAMAS protocol, which provides detailed overhearing avoidance and uses two channels - a data channel and control channel. Signaling packets like RTS, CTS, and busy tones are transmitted on the control channel. It also covers concepts like low duty cycles, wake up mechanisms, and protocols like S-MAC that coordinate node schedules to reduce idle listening. Quizzes are included to test understanding of discussed concepts.
This document summarizes several reactive routing protocols for mobile ad hoc networks (MANETs). Reactive protocols create routes only when needed by a source. Dynamic Source Routing uses route requests and replies to find paths, while Temporally-Ordered Routing Algorithm builds and maintains a directed acyclic graph rooted at destinations. Some protocols aim to improve quality of service or support real-time data streams through techniques like bandwidth estimation and mobility prediction. Source Routing with Local Recovery reduces overhead by allowing intermediate nodes to perform local error recovery using route caches when possible.
The document discusses the LEACH protocol and DECSA improvement for wireless sensor networks. It describes the two phases of LEACH - the set-up phase where cluster heads are chosen and the steady-state phase where data is transmitted. DECSA considers both distance and residual energy to select cluster heads, forming a three-level hierarchy. DECSA prolongs network lifetime by 31% and reduces energy consumption by 40% compared to the original LEACH protocol.
This document provides an overview of wireless sensor networks (WSNs). It discusses the architecture of sensor networks, including sensor node hardware, operating systems, and network density considerations. It also describes several layers of the WSN protocol stack, including the MAC layer and common MAC protocols like S-MAC. Key topics covered include query-based communication in WSNs, classifications of WSNs based on functionality, and energy-efficient operation through low-duty cycling.
A Review of Energy Conservation
in Wireless Sensor Networks:
1.What are WSNs
2.Applications of WSNs
3.Advantages of using WSNs
4.Design Issues of WSNs
5.Power consumption in WSN
6.Sources of energy waste
7.General approaches to energy saving
8.Conclusion
The document discusses the cellular concept in wireless networks. Key points include:
- Cells have a hexagonal shape and neighboring cells reuse frequencies to avoid interference and increase capacity.
- Frequency reuse allows more simultaneous calls by allocating the same set of frequencies to different neighboring cells.
- Cell size is a tradeoff between interference and system capacity - smaller cells mean lower power needs but more cells and handoffs.
This document discusses wireless sensor network applications and energy consumption. It provides examples of WSN applications including disaster relief, environment monitoring, healthcare, and more. It then discusses various factors that influence energy consumption in sensor nodes, including operation states, microcontroller usage, radio transceivers, memory, and the relationship between computation and communication. Specific power consumption numbers are given for different components like radios, sensors, and microprocessors. The goals of optimization for WSNs are discussed as quality of service, energy efficiency, scalability, and robustness.
Mac protocols for ad hoc wireless networks Divya Tiwari
The document discusses MAC protocols for ad hoc wireless networks. It addresses key issues in designing MAC protocols including limited bandwidth, quality of service support, synchronization, hidden and exposed terminal problems, error-prone shared channels, distributed coordination without centralized control, and node mobility. Common MAC protocol classifications and examples are also presented, such as contention-based protocols, sender-initiated versus receiver-initiated protocols, and protocols using techniques like reservation, scheduling, and directional antennas.
Mobile ad-hoc networks have frequent host and topology changes with no cellular infrastructure and require multi-hop wireless links for data transmission between nodes. Routing protocols must discover routes between nodes that may not be directly connected. Table-driven protocols like Destination Sequenced Distance Vector (DSDV) and Wireless Routing Protocol (WRP) maintain up-to-date routing tables through periodic broadcasts but generate significant control overhead. DSDV uses sequence numbers to distinguish stale routes and avoid loops while WRP maintains four tables for routing information.
This document provides an overview of MIMO (Multiple Input Multiple Output) technology and its use in 802.11n wireless networks. MIMO works by using multiple antennas at both the transmitter and receiver to improve communication in three ways: by providing signal diversity to increase range and resilience, by enabling spatial multiplexing to increase data rates, and by allowing beamforming to focus signals in certain directions. The 802.11n standard will incorporate MIMO to achieve data rates up to 600Mbps using techniques like multi-path mitigation, modulation schemes, channel coding, and frame formatting adapted for MIMO transmissions. MIMO thus allows 802.11n to continue advancing wireless LAN speeds and performance.
Routing protocol on wireless sensor networkshashankcsnits
The document summarizes routing protocols for wireless sensor networks. It first defines wireless sensor networks and describes their key characteristics. It then surveys traditional routing techniques like flooding and gossiping, as well as current techniques including flat routing protocols like SPIN and directed diffusion, hierarchical routing protocols like LEACH and PEGASIS, and location-based routing protocols like GEAR. For each protocol, it provides a brief overview of how it works and compares their advantages and disadvantages. In conclusion, it states that hierarchical routing protocols generally outperform flat routing protocols, and references several papers on sensor network routing.
Sensor Protocols for Information via Negotiation (SPIN)rajivagarwal23dei
Wireless sensor networks consist of large numbers of sensor nodes that monitor parameters and communicate wirelessly. The SPIN protocol family was developed to address the limitations of sensor nodes, particularly their limited energy, computation, and communication capabilities. SPIN uses meta-data negotiation and resource awareness to disseminate data between nodes more efficiently than flooding protocols. SPIN-1 is a simple three-stage handshake protocol that reduces energy costs. SPIN-2 builds upon SPIN-1 with an additional energy conservation heuristic to further prolong network lifetime. Evaluation shows SPIN consumes significantly less energy than flooding for data dissemination in wireless sensor networks.
This document provides an overview of routing protocols in ad hoc networks. It begins with an abstract describing the objectives of surveying and comparing different classes of ad hoc routing protocols. The document then outlines the topics to be covered, including the characteristics, applications, and types of ad hoc routing protocols. Several representative routing protocols are described in detail, including table-driven, hybrid, source-initiated, location-aware, multipath, hierarchical, multicast, and power-aware protocols. The document concludes by discussing future work related to improving reusability and security of ad hoc routing protocols.
Wireless Sensor Network (WSN) consists of sensor nodes which interact with each other through physical parameters like sunlight, wind, vibration, humidity etc. Routing protocols provide an optimal data transmission route from sensor nodes to sink node to save energy of nodes. From Base Station (BS) Sensor node sends and receives data to or from wireless stations. Clustering mechanism is one of the popular routing mechanisms used in WSN for optimizing the problem in sensor nodes. There are two types of clustering schemes known as homogeneous schemes and heterogeneous schemes. In Homogeneous scheme initial energy is same for each node but in heterogeneous scheme initial energy is different for each node and also used to determine the efficiency of sensor networks. Enhanced Modified LEACH (EMODLEACH) is a reactive protocol which is implemented for homogeneous network model. We have implemented the concept of Efficient Cluster head Replacement scheme and Dual transmitting power level scheme of MODLEACH along with the concept of Efficient Intra Cluster transmission Scheme of TEEN in LEACH. We analyze the PEGASIS protocol and modified the exiting protocol called improved energy balanced routing protocol (IEBRP).This IEBRP is based on cluster formation, cluster routing and other aspects of LEACH protocol.
Routing protocols are essential for wireless sensor networks to efficiently transmit collected sensor data to data sinks. The document discusses several challenges in designing routing protocols for wireless sensor networks and surveys different routing techniques including flat, hierarchical, and geographic routing. It provides LEACH and PEGASIS as examples of hierarchical routing protocols that use clustering and data aggregation to reduce energy consumption.
This document discusses power aware routing protocols for wireless sensor networks. It begins by describing wireless sensor networks and how they are used to monitor environmental conditions. It then classifies routing protocols for sensor networks based on their functioning, node participation style, and network structure. Specific examples are provided for different types of routing protocols, including LEACH, TEEN, APTEEN, SPIN, Rumor Routing, and PEGASIS. Chain-based and clustering routing protocols are also summarized.
The document discusses clustering protocols in wireless sensor networks (WSNs). It begins by introducing WSNs and their applications. It then describes the main types of communication in WSNs: direct, multi-hop, and using clustering. Several issues with clustering in WSNs are identified, such as selecting cluster heads and handling node mobility. Popular clustering protocols like LEACH are examined, noting their advantages like data aggregation but also limitations such as unsuitability for large networks. Proposed solutions for improving LEACH involve considering energy levels and traffic load when selecting cluster heads.
This document discusses and compares various routing protocols for mobile ad hoc networks (MANETs). It covers both topology-based approaches that rely on information about existing links, as well as position-based approaches where nodes determine their own position. Specific protocols discussed in detail include proactive protocols like Destination-Sequenced Distance-Vector (DSDV) and reactive protocols like Dynamic Source Routing (DSR). Hybrid protocols like Zone Routing Protocol (ZRP) that combine proactive and reactive approaches are also examined. The document provides illustrations and comparisons of the routing mechanisms and characteristics of these important MANET routing protocols.
The document summarizes contention-based MAC protocols for wireless sensor networks. It discusses the PAMAS protocol, which provides detailed overhearing avoidance and uses two channels - a data channel and control channel. Signaling packets like RTS, CTS, and busy tones are transmitted on the control channel. It also covers concepts like low duty cycles, wake up mechanisms, and protocols like S-MAC that coordinate node schedules to reduce idle listening. Quizzes are included to test understanding of discussed concepts.
This document summarizes several reactive routing protocols for mobile ad hoc networks (MANETs). Reactive protocols create routes only when needed by a source. Dynamic Source Routing uses route requests and replies to find paths, while Temporally-Ordered Routing Algorithm builds and maintains a directed acyclic graph rooted at destinations. Some protocols aim to improve quality of service or support real-time data streams through techniques like bandwidth estimation and mobility prediction. Source Routing with Local Recovery reduces overhead by allowing intermediate nodes to perform local error recovery using route caches when possible.
The document discusses the LEACH protocol and DECSA improvement for wireless sensor networks. It describes the two phases of LEACH - the set-up phase where cluster heads are chosen and the steady-state phase where data is transmitted. DECSA considers both distance and residual energy to select cluster heads, forming a three-level hierarchy. DECSA prolongs network lifetime by 31% and reduces energy consumption by 40% compared to the original LEACH protocol.
This document provides an overview of wireless sensor networks (WSNs). It discusses the architecture of sensor networks, including sensor node hardware, operating systems, and network density considerations. It also describes several layers of the WSN protocol stack, including the MAC layer and common MAC protocols like S-MAC. Key topics covered include query-based communication in WSNs, classifications of WSNs based on functionality, and energy-efficient operation through low-duty cycling.
A Review of Energy Conservation
in Wireless Sensor Networks:
1.What are WSNs
2.Applications of WSNs
3.Advantages of using WSNs
4.Design Issues of WSNs
5.Power consumption in WSN
6.Sources of energy waste
7.General approaches to energy saving
8.Conclusion
The document discusses the cellular concept in wireless networks. Key points include:
- Cells have a hexagonal shape and neighboring cells reuse frequencies to avoid interference and increase capacity.
- Frequency reuse allows more simultaneous calls by allocating the same set of frequencies to different neighboring cells.
- Cell size is a tradeoff between interference and system capacity - smaller cells mean lower power needs but more cells and handoffs.
This document discusses wireless sensor network applications and energy consumption. It provides examples of WSN applications including disaster relief, environment monitoring, healthcare, and more. It then discusses various factors that influence energy consumption in sensor nodes, including operation states, microcontroller usage, radio transceivers, memory, and the relationship between computation and communication. Specific power consumption numbers are given for different components like radios, sensors, and microprocessors. The goals of optimization for WSNs are discussed as quality of service, energy efficiency, scalability, and robustness.
Mac protocols for ad hoc wireless networks Divya Tiwari
The document discusses MAC protocols for ad hoc wireless networks. It addresses key issues in designing MAC protocols including limited bandwidth, quality of service support, synchronization, hidden and exposed terminal problems, error-prone shared channels, distributed coordination without centralized control, and node mobility. Common MAC protocol classifications and examples are also presented, such as contention-based protocols, sender-initiated versus receiver-initiated protocols, and protocols using techniques like reservation, scheduling, and directional antennas.
Mobile ad-hoc networks have frequent host and topology changes with no cellular infrastructure and require multi-hop wireless links for data transmission between nodes. Routing protocols must discover routes between nodes that may not be directly connected. Table-driven protocols like Destination Sequenced Distance Vector (DSDV) and Wireless Routing Protocol (WRP) maintain up-to-date routing tables through periodic broadcasts but generate significant control overhead. DSDV uses sequence numbers to distinguish stale routes and avoid loops while WRP maintains four tables for routing information.
This document provides an overview of MIMO (Multiple Input Multiple Output) technology and its use in 802.11n wireless networks. MIMO works by using multiple antennas at both the transmitter and receiver to improve communication in three ways: by providing signal diversity to increase range and resilience, by enabling spatial multiplexing to increase data rates, and by allowing beamforming to focus signals in certain directions. The 802.11n standard will incorporate MIMO to achieve data rates up to 600Mbps using techniques like multi-path mitigation, modulation schemes, channel coding, and frame formatting adapted for MIMO transmissions. MIMO thus allows 802.11n to continue advancing wireless LAN speeds and performance.
Routing protocol on wireless sensor networkshashankcsnits
The document summarizes routing protocols for wireless sensor networks. It first defines wireless sensor networks and describes their key characteristics. It then surveys traditional routing techniques like flooding and gossiping, as well as current techniques including flat routing protocols like SPIN and directed diffusion, hierarchical routing protocols like LEACH and PEGASIS, and location-based routing protocols like GEAR. For each protocol, it provides a brief overview of how it works and compares their advantages and disadvantages. In conclusion, it states that hierarchical routing protocols generally outperform flat routing protocols, and references several papers on sensor network routing.
Sensor Protocols for Information via Negotiation (SPIN)rajivagarwal23dei
Wireless sensor networks consist of large numbers of sensor nodes that monitor parameters and communicate wirelessly. The SPIN protocol family was developed to address the limitations of sensor nodes, particularly their limited energy, computation, and communication capabilities. SPIN uses meta-data negotiation and resource awareness to disseminate data between nodes more efficiently than flooding protocols. SPIN-1 is a simple three-stage handshake protocol that reduces energy costs. SPIN-2 builds upon SPIN-1 with an additional energy conservation heuristic to further prolong network lifetime. Evaluation shows SPIN consumes significantly less energy than flooding for data dissemination in wireless sensor networks.
Wireless sensors networks protocols part 2Rushin Shah
The document discusses routing protocols for wireless sensor networks. It describes why routing protocols are needed in WSNs to efficiently transmit sensor data to data sinks. It outlines several challenges for routing in WSNs, including limited resources, large network scales, dynamic environments, and different data traffic models. The document then examines different routing strategies like proactive, reactive, and hybrid approaches. It also discusses routing techniques that use flat networks, clustering, data-centric approaches, and geographic location-based routing. Flooding and gossiping are presented as common information dissemination techniques with issues like implosion and resource blindness.
This document provides guidance on writing a research paper, beginning with choosing a topic and developing a thesis statement. It outlines the steps of writing a paper, including selecting and analyzing primary and secondary sources, compiling information, avoiding plagiarism through proper paraphrasing and citation, and including a bibliography. The document emphasizes writing an outline before starting the paper, using multiple credible source types, and thoroughly proofreading the final draft. Research papers require following a process of topic selection, research, organization, citation, and revision to effectively communicate new information and ideas.
The document discusses secure routing protocols for wireless sensor networks. It begins by describing the components and design challenges of wireless sensor networks, including limited resources and security issues. It then discusses various attacks on wireless sensor networks like spoofing, selective forwarding, and sinkhole attacks. The document analyzes several secure routing protocols that aim to prevent such attacks, including Distributed Security Framework, Multipath Data Transfer Protocol, Secure and Energy Efficient Disjoint Route, and Bio-inspired Self-Organized Secure Autonomous Routing Protocol. It concludes by discussing future work to develop a new routing approach with low energy consumption, high delivery ratio, and strong security against possible threats.
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.
Wireless sensor networks (WSNs) consist of distributed sensor nodes that communicate wirelessly. Routing protocols for WSNs include flooding, gossiping, SPIN, and GEAR. Flooding broadcasts data to all neighbors while gossiping randomly selects neighbors, avoiding duplicated data. SPIN and GEAR use data negotiation and geographical information to route packets efficiently. Common networking technologies in WSNs are Bluetooth, ZigBee, UWB, and Wi-Fi, with each having advantages for different applications depending on data rates and power requirements. TinyOS and Contiki are lightweight operating systems used in WSNs. WSNs have a variety of applications including environmental monitoring, pollution monitoring, and detection of fires, landslides
The document discusses routing protocols for wireless sensor networks (WSNs). It provides an overview of routing challenges in WSNs, including energy constraints, data delivery models, fault tolerance, and quality of service issues. It then describes two common flat routing protocols for WSNs: SPIN and Directed Diffusion. SPIN uses data negotiation to disseminate information and avoid redundant transmissions. Directed Diffusion establishes interest gradients to route data from sources to a sink based on attribute-value pairs.
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 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.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document presents a comparative study of flat-based/data-centric wireless sensor network (WSN) specific routing protocols. It first provides background on data-centric approaches in WSNs and discusses some popular flat-based/data-centric routing protocols, including Directed Diffusion, Minimum Cost Forwarding Algorithm (MCFA), Threshold sensitive Energy Efficient sensor Network protocol (TEEN), Adaptive Periodic Threshold sensitive Energy Efficient sensor Network protocol (APTEEN), Energy Aware Data (EAD) Centric Routing Protocol, RUMOR Routing, Sensor Protocols for Information via Negotiation (SPIN), Constrained Anisotropic Diffusion Routing (CADR), COUGAR,
Data aggregation in important issue in WSN’s. Because with the help of data aggregation; we are
reduce energy consumption in the network. In the Ad-hoc sensor network have the most challenging task
is to maintain a life time of the node. due to efficient data aggregation increase the life of the network. In
this paper, we are going to provide the information about the type of the network and which data
aggregation algorithm is best. In big scale sensor network, energy economical, data collection and query
distribution in most important.
Keywords — data aggregation; wireless sensor network
This document discusses wireless sensor network protocols. It covers multi-hop routing, where sensor nodes act as relays to propagate data to the base station. Common routing protocols are discussed, including reactive protocols like AODV that establish routes on demand and proactive protocols like DSDV that maintain routing tables with periodic updates. MAC protocols help manage access to the shared wireless medium and examples covered include S-MAC and B-MAC. The OSI model layers and responsibilities are also summarized.
Energy efficient neighbour selection for flat wireless sensor networkscsandit
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 with increase in
number of nodes, time rounds and node failures.
The document provides an overview of routing protocols in wireless sensor networks. It discusses several categories of routing protocols including data-centric, hierarchical, and location-based. For hierarchical routing protocols, it summarizes LEACH, PEGASIS, HEED, P-LEACH, H-LEACH, and other variants that aim to improve energy efficiency. It provides brief descriptions of how each protocol operates and highlights drawbacks. The document also summarizes several data-centric routing protocols including Directed Diffusion, Rumor Routing, and their limitations.
IMPROVING THE PERFORMACE OF DATA AGGREGATION IN WIRELESS SENSOR NETWORKEditor IJMTER
In this paper data aggregation using multipath routing is proposed. In existing system, under hybrid scheme, it each sensor nodes generates information by sensing its physical environment and transmit to sink by multi hop communication. In network aggregation computation intermediate forwarding nodes can substantially increase the network life time but amount of data contained in single packet and make the system vulnerability to packet loss. Instead of retransmission it takes the additional time. Ad hoc On Demand Distance Vector routing protocol is used to improving the performance of data aggregation due to avoiding these problems.
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. In a Wireless Sensor Network (WSN), nodes are scattered densely in a large area. Sensor nodes can communicate with the sink node directly or through other nodes. Data transmission is the major issue in WSN. Each node has limited energy which is used in transmitting and receiving the data. Various routing protocols have been proposed to save the energy during the transmission of data. data centric approach based routing protocol which efficiently propagates information between sensor nodes in an energy constrained mode. This paper proposes a data centric routing Using evolutionary apporoach in WSN.The main objective of this protocol with evolutionary apporoach is to use artificial intelligence, to reduce the energy consumption by the nodes in transmitting and receiving the data. Implementation of Basic SEP, intelligence cluster routing and proposed protocols will be done using MATLAB.
Network architecture documents the key differences between ad hoc and sensor networks. Ad hoc networks allow nodes to communicate directly with each other in a peer-to-peer fashion, while sensor networks have dedicated source nodes that sense data and sink nodes that receive the data. Sensor networks also employ in-network processing techniques like data aggregation to reduce energy costs of transmitting all raw data. Routing in wireless sensor networks faces challenges from limited node resources, topology changes, and energy constraints that require routing protocols to be scalable, fault-tolerant and energy-efficient.
The development of the wireless sensor networks (WSNs) in various applications like Defense, Health,
Environment monitoring, Industry etc. always attract many researchers in this field. WSN is the network
which consists of collection of tiny devices called sensor nodes. Sensor node typically combines wireless
radio transmitter-receiver and limited energy, restricted computational processing capacity and
communication band width. These sensor node sense some physical phenomenon using different
transduces. The current improvement in sensor technology has made possible WSNs that have wide and
varied applications. While selecting the right sensor for application a number of characteristics are
important. This paper provides the basics of WSNs including the node characteristics. It also throws light
on the different routing protocols.
A Reliable Routing Technique for Wireless Sensor NetworksEditor IJCATR
Wireless Sensor Network (WSN) consists of very large number of sensor nodes which are deployed close to the area which
is to be monitored so as to sense various environmental conditions. WSN is a data-driven network which produces large amount of data
and also sensor nodes are energy-limited devices and their energy consumption is mainly associated with data routing. Therefore it is
necessary to perform redundant data aggregation so as to save energy. In this work data aggregation is achieved with the help of two key
approaches namely Clustering approach and In-network data aggregation. These two approaches help to save energy and thereby
increasing the lifetime of the network. The proposed work has some key features like reliable cluster formation, high data aggregation
rate, priority of packets, minimized overhead, multiple routes, reduced energy consumption which enhance the network lifetime. The
performance evaluation of the proposed approach is carried out using Network Simulator- version 2
A Reliable Routing Technique for Wireless Sensor NetworksEditor IJCATR
Wireless Sensor Network (WSN) consists of very large number of sensor nodes which are deployed close to the area which
is to be monitored so as to sense various environmental conditions. WSN is a data-driven network which produces large amount of data
and also sensor nodes are energy-limited devices and their energy consumption is mainly associated with data routing. Therefore it is
necessary to perform redundant data aggregation so as to save energy. In this work data aggregation is achieved with the help of two key
approaches namely Clustering approach and In-network data aggregation. These two approaches help to save energy and thereby
increasing the lifetime of the network. The proposed work has some key features like reliable cluster formation, high data aggregation
rate, priority of packets, minimized overhead, multiple routes, reduced energy consumption which enhance the network lifetime. The
performance evaluation of the proposed approach is carried out using Network Simulator- version 2.
Node Deployment Technique using Wireless Sensor NetworksIRJET Journal
This document discusses node deployment techniques in wireless sensor networks to improve network lifetime. Wireless sensor networks consist of spatially distributed sensor nodes with limited battery power. The proposed technique uses a multi-objective optimization algorithm based on energy consumption and connectivity to prolong network lifetime. The algorithm aims to find optimal solutions that minimize energy consumption while maintaining network connectivity. It analyzes factors like node deployment, energy consumption, fault tolerance, and data aggregation to efficiently route data from sensor nodes to a base station.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
This document discusses routing strategies in delay tolerant networks (DTNs) using wireless sensor network (WSN) nodes for localization applications. It first provides background on WSNs and DTNs, and then reviews common DTN routing protocols like epidemic routing, PROPHET, spray and wait, and MaxProp. The aim of the dissertation is to propose a new routing protocol for DTNs using WSN nodes where GPS is unavailable. It discusses using a hybrid of knowledge-based and additional node-based routing. The document outlines simulating the proposed filtered flooding protocol in NS-2 to evaluate delivery ratio and delay for a mining activity scenario. Results show delivery ratio is high for small networks but decreases with more nodes, while delay is
CEDA
Agenda
Ahmed Hamed, Hussein Abd Elrahman, and Rizk Tawfik
Ain Shams University - Faculty of Engineering
2826-Apr-18
- The Cross-layer Energy-Delay Aware (CEDA) protocol aims to optimize energy consumption and end-to-end delay in WSNs.
- It allows interaction between the network layer, MAC layer, and physical layer to share information that can help optimize the protocol's objectives.
- For example, the physical layer shares link quality and energy level information with the MAC layer to help in channel allocation. The network layer considers this along with routing to minimize delay.
- Simulation
The document discusses service level agreements (SLAs) between network service providers and customers. It covers the motivation for SLAs, defining service level parameters and objectives, developing the SLA, and ongoing management to meet the SLA. Key points include identifying meaningful, measurable parameters; setting realistic objectives; monitoring performance; and outlining consequences for not meeting objectives like restoring service or financial penalties. The goal is an agreed understanding between parties on expected network service levels.
The document discusses energy harvesting for sensor nodes. It describes various energy harvesting architectures and technologies that can power sensor nodes, such as solar, piezoelectric, wind, and radio frequency. It provides examples of sensor node implementations that use different energy storage solutions like batteries, supercapacitors, and tiered storage. The document also discusses implications for sensor network design, including performance adaptation techniques at the node and network levels to enable energy neutral operation of harvesting-powered sensor networks.
This document presents an experimental study that compares the performance of ensemble classifiers and single classifiers on four breast cancer datasets using three open source data mining tools: KNIME, ORANGE, and TANAGRA. The study finds that using ensemble classifiers techniques improved the accuracy on three of the four datasets. It also finds that some open source tools performed better than others when using ensemble techniques, with analysis showing that the type of dataset and how classifiers are applied within each tool can impact results. Previous related work comparing classification techniques on breast cancer datasets is also discussed.
Robust Breast Cancer Diagnosis on Four Different Datasets Using Multi-Classif...ahmad abdelhafeez
The goal of this paper is to compare between different classifiers or multi-classifiers fusion with respect to accuracy in discovering breast cancer for four different data sets. We present an implementation among various classification techniques which represent the most known algorithms in this field on four different datasets of breast cancer two for diagnosis and two for prognosis. We present a fusion between classifiers to get the best multi-classifier fusion approach to each data set individually. By using confusion matrix to get classification accuracy which built in 10-fold cross validation technique. Also, using fusion majority voting (the mode of the classifier output). The experimental results show that no classification technique is better than the other if used for all datasets, since the classification task is affected by the type of dataset. By using multi-classifiers fusion the results show that accuracy improved in three datasets out of four.
Robust Breast Cancer Diagnosis on Four Different Datasets Using Multi-Classif...ahmad abdelhafeez
Abstract- The goal of this paper is to compare between different classifiers or multi-classifiers fusion with respect to accuracy in discovering breast cancer for four different data sets. We present an implementation among various classification techniques which represent the most known algorithms in this field on four different datasets of breast cancer two for diagnosis and two for prognosis. We present a fusion between classifiers to get the best multi-classifier fusion approach to each data set individually. By using confusion matrix to get classification accuracy which built in 10-fold cross validation technique. Also, using fusion majority voting (the mode of the classifier output). The experimental results show that no classification technique is better than the other if used for all datasets, since the classification task is affected by the type of dataset. By using multi-classifiers fusion the results show that accuracy improved in three datasets out of four.
The document discusses energy conservation techniques in wireless sensor networks. It begins with an introduction to wireless sensor networks and identifies power consumption as a major challenge. It then outlines the typical architecture of a wireless sensor node and examines the power breakdown across different components. The document proceeds to discuss basic approaches to energy conservation, including duty cycling, data-driven, and mobility-based techniques. It also mentions future work in integrating different approaches into a single solution and addresses questions.
The document discusses localization techniques in wireless sensor networks (WSNs). It begins with an introduction to WSNs and why GPS is not suitable for localization in these networks. It then covers taxonomy of localization methods, including target/source localization, node self-localization techniques like range-based and range-free methods. Specific techniques discussed include DV-Hop, pattern matching localization, and classifications like centralized vs distributed localization. The summary restates key points about distance estimation methods, single/multiple localization, and classifications of localization approaches.
This document discusses security issues in wireless sensor networks (WSNs). It notes that WSNs require a high level of security due to operating in hostile environments, but their limited resources pose a challenge. It outlines various WSN security requirements and categorizes common attacks based on the attacker's capabilities and the protocol stack layer targeted. Finally, it acknowledges that while some challenges have been addressed, many open problems remain due to conflicts between security, survivability, and resource constraints in WSNs.
This document discusses trusted systems and the concept of a Trojan horse. It defines trusted systems as systems used to enhance security defenses against intruders and malware. It describes multilevel security as allowing multiple data classification levels, with mandatory access control enforcing that information does not flow to unauthorized users. The document also discusses how Trojan horses can provide unauthorized remote access if installed on a user's computer.
The document provides an overview of OPNET Modeler, a network simulation tool. It describes OPNET Modeler's architecture, which includes tools for model specification, data collection and simulation, and analysis. It also discusses how to locate models and components using the model library and its organization. The goal is to help users understand what problems can be solved with OPNET Modeler and how to get started using it.
This document discusses security issues in wireless sensor networks (WSNs). It notes that WSNs require a high level of security due to operating in hostile environments, but their limited resources pose a challenge. It outlines various WSN security requirements and categorizes common attacks based on the attacker's capabilities and the protocol stack layer targeted. Finally, it acknowledges that while some challenges have been addressed, many open problems remain due to conflicts between security, survivability, and resource constraints in WSNs.
This document discusses SDN security. It outlines how SDN allows for centralized control of network flows and security policies. However, the centralized nature of SDN also introduces new threats, such as attacks on controllers or switches. Potential threats are discussed, such as DoS attacks, traffic manipulation, or vulnerabilities in controllers/applications. Mitigation techniques are proposed, such as monitoring for abnormal behavior, access control, and replication of controllers. Future work may focus on improving the security and dependability of SDN through techniques like dynamic switch association and diversity.
The document discusses intrusion prevention and intrusion detection systems. It defines intrusion as unauthorized access aimed at compromising network security assets. Intrusion detection systems (IDS) monitor network traffic to detect intrusions, while intrusion prevention systems (IPS) can also block attacks in real-time. An IPS provides increased visibility beyond a firewall by using techniques like signature detection, anomaly detection, and protocol analysis to identify intrusions and threats. The document outlines challenges faced by IPS like evasion techniques, and discusses next-generation IPS features like intelligent correlation, anomaly detection, and using global threat intelligence.
Digital forensics is the application of science to solve legal problems involving digital evidence. It has emerged since the 1980s as computer crimes have grown. There are challenges to reliability such as standards, controls, and new technologies like cloud and solid state drives. Case studies demonstrate how digital evidence can solve old cases, as with the BTK killer through metadata on a word document. The field faces ongoing challenges but continued research supports its validity in courts of law.
Digital forensics is the science of recovering and investigating digital evidence from devices related to computer crimes such as fraud, hacking, and intellectual property theft. It involves acquiring data from devices without alteration, preserving the original state, identifying relevant information through tools, evaluating what can be used as evidence, and presenting findings in an understandable way. Challenges include ensuring authenticity, preventing data damage, and meeting legal standards for evidence admissibility in court. Forensic experts use various software and hardware tools at each step of the process.
This document provides an overview of cloud computing. It begins with an introduction and defines cloud computing, discussing its history and key attributes. It then covers the different cloud models including Infrastructure as a Service (IaaS), Platform as a Service (PaaS), and Software as a Service (SaaS). The document also discusses cloud security and privacy concerns, outlining various security threats and solutions. It concludes by emphasizing the importance of cloud computing and its future.
The document discusses incident handling and provides details about each step of the incident handling life cycle. It begins with an introduction on the importance of incident handling plans. It then defines what constitutes an incident and provides examples of different incident types and categories. The document outlines the key steps in the incident handling life cycle as preparation, identification, detection, analysis, containment, eradication, recovery, and follow up. For each step, it provides details on goals, definitions, and best practices.
The document discusses malware analysis and provides an overview of key topics including:
- Types of malware analysis including static (code) analysis and behavioral analysis
- The goals of malware analysis are to understand how malware functions and infects systems to help build defenses
- Tools used in malware analysis include disassemblers, debuggers, and sandboxes to observe malware behavior
Penetration testing presentation given to Dr. Ashraf Tamam by Mohamed Abd El-Azeem, Ahmed Yousef Eissa, and Ahmed Alaa El-Din. The presentation covered penetration testing and was delivered to the named professor and students.
Software Engineering and Project Management - Introduction, Modeling Concepts...Prakhyath Rai
Introduction, Modeling Concepts and Class Modeling: What is Object orientation? What is OO development? OO Themes; Evidence for usefulness of OO development; OO modeling history. Modeling
as Design technique: Modeling, abstraction, The Three models. Class Modeling: Object and Class Concept, Link and associations concepts, Generalization and Inheritance, A sample class model, Navigation of class models, and UML diagrams
Building the Analysis Models: Requirement Analysis, Analysis Model Approaches, Data modeling Concepts, Object Oriented Analysis, Scenario-Based Modeling, Flow-Oriented Modeling, class Based Modeling, Creating a Behavioral Model.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...IJECEIAES
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...shadow0702a
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
artificial intelligence and data science contents.pptxGauravCar
What is artificial intelligence? Artificial intelligence is the ability of a computer or computer-controlled robot to perform tasks that are commonly associated with the intellectual processes characteristic of humans, such as the ability to reason.
› ...
Artificial intelligence (AI) | Definitio
Batteries -Introduction – Types of Batteries – discharging and charging of battery - characteristics of battery –battery rating- various tests on battery- – Primary battery: silver button cell- Secondary battery :Ni-Cd battery-modern battery: lithium ion battery-maintenance of batteries-choices of batteries for electric vehicle applications.
Fuel Cells: Introduction- importance and classification of fuel cells - description, principle, components, applications of fuel cells: H2-O2 fuel cell, alkaline fuel cell, molten carbonate fuel cell and direct methanol fuel cells.
Comparative analysis between traditional aquaponics and reconstructed aquapon...bijceesjournal
The aquaponic system of planting is a method that does not require soil usage. It is a method that only needs water, fish, lava rocks (a substitute for soil), and plants. Aquaponic systems are sustainable and environmentally friendly. Its use not only helps to plant in small spaces but also helps reduce artificial chemical use and minimizes excess water use, as aquaponics consumes 90% less water than soil-based gardening. The study applied a descriptive and experimental design to assess and compare conventional and reconstructed aquaponic methods for reproducing tomatoes. The researchers created an observation checklist to determine the significant factors of the study. The study aims to determine the significant difference between traditional aquaponics and reconstructed aquaponics systems propagating tomatoes in terms of height, weight, girth, and number of fruits. The reconstructed aquaponics system’s higher growth yield results in a much more nourished crop than the traditional aquaponics system. It is superior in its number of fruits, height, weight, and girth measurement. Moreover, the reconstructed aquaponics system is proven to eliminate all the hindrances present in the traditional aquaponics system, which are overcrowding of fish, algae growth, pest problems, contaminated water, and dead fish.
2. Agenda
2
Introduction
Routing challenges in WSN
Flat Routing
Hierarchical Routing
Location-based Routing
Routing Protocols Based on Protocol Operation
some Routing protocols
Conclusion
References
3. 3
Routing is a process of selecting paths in a
network along which to send data traffic
First, it is not possible to build a global addressing
scheme for a large number of sensor nodes. Thus,
traditional IP-based protocols may not be applied to
WSNs. In WSNs, sometimes getting the data is more
important than knowing the IDs of which nodes sent the
data.
Second, in contrast to typical communication networks,
almost all applications of sensor networks require the
flow of sensed data from multiple sources to a particular
Introduction
4. 4
Routing protocols in WSNs Differ depending on the
application and network architecture
sensor nodes are tightly constrained in terms of energy,
processing, and storage capacities. Thus, they require carefully
resource management.
position awareness of sensor nodes is important since data
collection is normally based on the location.
data collected by many sensors in WSNs is typically based
on common phenomena, hence there is a high probability
that this data has some redundancy
Trade-offs between energy and communication overhead
savings
5. Routing challenges and design
issues
5
Node deployment
Energy consumption without losing accuracy
Data reporting method
Node/link heterogeneity
Scalability
Data aggregation
Quality of service
6. Routing challenges and design
issues
6
Node deployment
Manual deployment
Sensors are manually deployed
Data is routed through predetermined path
Random deployment
Optimal clustering is necessary to allow connectivity &
energy-efficiency
Multi-hop routing
7. Routing challenges and design
issues
7
Data reporting method
Application-specific:
• Time-driven: Periodic monitoring
• Event-driven: Respond to sudden changes
• Query-driven: Respond to queries
• Hybrid (combination of delivery models)
8. Routing challenges and design
issues
8
Node/link heterogeneity
Depending on the application, a sensor node can
have a different role or capability such as relaying,
sensing and aggregation
three functionalities at the same time on a node
might quickly drain the energy of that node.
Combining these capabilities on one node raises a
challenge for routing protocols.
For example, hierarchical protocols designate a
cluster head node
9. Routing challenges and design
issues
9
Fault tolerance
The failure of sensor nodes should not affect the
overall task of the sensor network
10. Routing challenges and design
issues
10
Network dynamics
Routing messages from or to moving nodes is
more challenging since route and topology
stability become important issues
Moreover, the phenomenon can be mobile
(e.g., a target detection/ tracking application).
11. Routing challenges and design
issues
11
Connectivity
High density high connectivity
Some sensors may die after consuming their
battery power
Connectivity depends on possibly random
deployment
12. Routing challenges and design
issues
12
Coverage
An individual sensor’s view is limited
Area coverage is an important design factor
Data aggregation Since sensor nodes may generate
significant redundant data, similar packets from
multiple nodes can be aggregated to reduce the
number of transmissions.
Data aggregation is the combination of data from
different sources according to a certain
aggregation function.
Quality of Service
Bounded delay
Energy efficiency for longer network lifetime
14. 14
Proactive protocols :compute all the routes before they
are really needed and then store these routes in a
routing table in each node. When a route changes, the
change has to be propagated throughout the network.
Since a WSN could consist of thousands of nodes, the
routing table that each node would have to keep could
be huge and therefore proactive protocols are not suited
to WSNs.
Reactive protocols compute routes only when they are
needed.
Hybrid protocols use a combination of these two ideas.
15. Routing protocol survey
15
Traditional technique
Flooding
Gossiping
Current routing technique
Flat-routing
Hierarchical-routing
Location-based routing
[1]Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, and Erdal Cayirci Georgia Institute of Technology” A Survey on Sensor Networks” IEEE
Communications Magazine • August 2002
16. Flooding(1/4)
16
• Flooding is the classic approach for dissemination
without the need for any routing algorithms and
topology maintenance
• Source node sends data to all neighbors
• Receiving node stores and sends data to all its
neighbors
• Disseminate data quickly
drawbacks:
• Implosion
• Overlap
• Resource blindness
18. Overlap(3/4)
1
8
q
r
s
(q, r) (s, r)
Node
The direction
of data sending
The connect
between nodes
The searching
range of the
node
A B
C
19. Resource blindness(4/4)
1
9
In flooding, nodes do not modify their activities
based on the amount of energy available to them.
A network of embedded sensors can be
resource-aware and adapt its communication
and computation to the state of its energy
resource.
20. Gossiping
20
A slightly enhanced version of flooding where
the receiving node sends the packet to a
randomly selected neighbor which picks
another neighbor to forward the packet to and
so on.
Advantage: avoid the implosion
Drawback: Transmission delay
21. Router protocol survey
21
Traditional routing technique
Flooding
Gossiping
Current routing technique[1]
Flat-routing
Hierarchical-routing
Location-based routing
[1]JAMAL N. AL-KARAKI, AHMED E. KAMAL,” ROUTING TECHNIQUES IN WIRELESS SENSOR NETWORKS: A SURVEY”,
IEEE Wireless Communications • December 2004
22. 22
Each node plays the same role (Each node needs to
know only its neighbors)
Data-centric routing
In data-centric routing, the sink sends queries to certain
regions and waits for data from the sensors located in
the selected regions.
Save energy through data negotiation and elimination of
redundant data
Protocols
SPIN (Sensor Protocols for Information via Negotiation)
DD (Directed diffusion)
Rumor routing
Flat-routing (Data centric )
23. Sensor protocols for information via
negotiation (SPIN)
23
Features
Negotiation
Before transmitting data, nodes negotiate with each other to
overcome implosion and overlap
Only useful information will be transferred
Observed data must be described using a meta-data
Resource adaptation
Each sensor node has resource manager
monitoring their own energy resources may reduce certain
activities when energy is low
To extend the operating lifetime of the system
SPIN Message
ADV – new data advertisement
REQ – request for ADV data
DATA – actual data message Contain actual sensor data with a
meta-data header
ADV, REQ messages contain only meta-data
24. Sensor protocols for information via
negotiation (SPIN)
24
• Operation process
Step1
ADV
Step3
DATA
Step2
REQ
Step4
ADV
Step5
REQ
Step6
DATA
25. Sensor protocols for information via
negotiation (SPIN)
25
Resource adaptive algorithm
When energy is plentiful
Communicate using the 3-stage handshake protocol
When energy is approaching a low-energy threshold
If a node receives ADV, it does not send out REQ
Energy is reserved to sensing the event
Advantage
Each node only needs to know its one-hop neighbors
Significantly reduce energy consumption compared to flooding
Drawback
- If the node interested in the data are far from the source, data will not
be delivered
- Large overhead
Data broadcasting
-cannot guarantee delivery of data.
27. Directed Diffusion (DD) Feature
Data-centric routing protocol
A path is established between sink node and source
node
Localized interactions
The propagation and aggregation procedures are
all based on local information
Four elements
Interest
A task description which is named by a list of
attribute-value pairs that describe a task
Gradient
Path direction, data transmission rate
Data message
Reinforcement
To select a single path from multiple paths
27
29. Directed Diffusion (DD)
29
Advantage
Small delay
Always transmit the data through shortest path
Robust to failed path
Drawback
Imbalance of node lifetime
The energy of node on shortest path is drained faster than
another
Time synchronization technique
To implement data aggregation
Matching data to queries might require some extra overhead
30. Rumor Routing
Variation of directed diffusion
Don’t flood interests (or queries)
Flood events when the number of events is small
but the number of queries large
Route the query to the nodes that have observed
a particular event
Long-lived packets, called agents(Set up path by
random walk, Aggregate paths), flood events
through the network
When a node detects an event, it adds the event
to its events table, and generates an agent
Agents travel the network to propagate info about
local events
An agent is associated with TTL (Time-To-Live) 30
31. Rumor Routing
31
Basic scheme
Each node maintain
A lists of neighbors
An event table
When a node detects an event
Generate an agent
Let it travel on a random path
The visited node form a gradient to the
event
When a sink needs an event
Transmit a query
a node knowing the route to a
corresponding event can respond by
looking up its events table
When a node receives query checks
its table and returns source –
destination path
32. Rumor Routing
32
No need for query flooding
Only one path between the source and sink
Rumor routing works well only when the number of events is
small
Cost of maintaining a large number of agents and large event
tables will be prohibitive
Heuristic for defining the route of an event agent highly affects
the performance of next-hop selection
34. Hierarchical-routing
34
LEACH (Low Energy Adaptive Clustering
Hierarchy)
PEGASIS (Power-Efficient Gathering in Sensor
Information Systems)
TEEN(APTEEN) (Threshold-Sensitive Energy
Efficient Protocols)
35. LEACH (Low Energy Clustering Hierarchy)
35
Cluster-based protocol
Each node randomly decides to become a cluster heads (CH)
CH chooses the code to be used in its cluster
CDMA between clusters
CH broadcasts Adv; Each node decides to which cluster it belongs
based on the received signal strength of Adv
Nodes can sleep when its not their turn to xmit
CH compresses data received from the nodes in the cluster and
sends the aggregated data to BS
CH is rotated randomly
36. LEACH
36
Advantages
Increases the lifetime of the network
Even drain of energy
Energy saving due to aggregation by CHs
Disadvantages
LEACH assumes all nodes can transmit with enough power
to reach BS if necessary (e.g., elected as CHs)
Each node should support both TDMA & CDMA
Need to do time synchronization
Nodes use single-hop communication
37. Comparison between SPIN, LEACH &
Directed Diffusion
SPIN LEACH Directed
Diffusion
Optimal
Route
No No Yes
Network
Lifetime
Good Very good Good
Resource
Awareness
Yes Yes Yes
Use of
meta-data
Yes No Yes
37
38. Power-Efficient Gathering in Sensor
Information Systems (PEGASIS)
38
Only one node transmits to BS
When a node dies, the chain is reconstructed in the same
manner to bypass the dead node.
• Data aggregation in the chain one node sends the data to
the base station
Performance
PEGASIS Outperforms LEACH
By eliminating the overhead of dynamic cluster formation
By minimizing the total sum of transmission distances
Decrease the delay for the packets during transmission to the base
station
Problem
the single leader can become a bottleneck.
Scalability problem
Excessive delay for distant nodes in the chain
39. The TEEN Protocol
39
Threshold sensitive Energy Efficient sensor Network
protocol.
Proactive Protocols (LEACH)
The nodes in this network periodically switch on their sensors
and transmitters, sense the environment and transmit the data
of interest.
Reactive Protocols (TEEN)
The nodes react immediately to sudden and drastic changes
in the value of a sensed attribute.
41. TEEN - Functioning
41
the cluster-head broadcasts two thresholds to
its members:
Hard Threshold (HT)
This is a threshold value for the sensed attribute.
It is the absolute value of the attribute beyond which, the
node sensing this value must switch on its transmitter and
report to its cluster head.
Soft Threshold (ST)
This is a small change in the value of the sensed attribute
which triggers the node to switch on its transmitter and
transmit.
42. TEEN - Hard Threshold
42
The first time a parameter from the attribute set
reaches its hard threshold value, the node
switches on its transmitter and sends the sensed
data.
The sensed value is stored in an internal variable
in the node, called the sensed value (SV).
43. TEEN - Soft Threshold
43
The nodes will next transmit data in the current
cluster period, only when both the following
conditions are true:
The current value of the sensed attribute is greater
than the hard threshold.
The current value of the sensed attribute differs
from SV by an amount equal to or greater than the
soft threshold.
44. TEEN
44
Good for time-critical applications
If the thresholds are not reached, the user will
not get any data from the network at all and
will not come to know even if all the nodes die.
This scheme practical implementation would
have to ensure that there are no collisions in
the cluster.
45. APTEEN (Adaptive Threshold sensitive
Energy Efficient Network protocol)
45
APTEEN has been proposed just as an improvement
to TEEN in order to overcome its limitations and
shortcomings.
APTEEN guarantees lower energy dissipation and a
helps in ensuring a larger number of sensors alive.
Compared to LEACH, TEEN & APTEEN consumes
less energy (TEEN consumes the least)
Network lifetime: TEEN ≥ APTEEN ≥ LEACH
46. Router protocol survey
46
Traditional routing technique
Flooding
Gossiping
Current routing technique
Flat-routing
Hierarchical-routing
Location-based routing
48. Geographic and Energy Aware Routing
48
Geographic and Energy Aware Routing
Routing based on a cost function depending on the
distance to the target and the remaining energy.
A node N receive from a neighbor Ni its cost function
and then updates its own cost function:
H(N,T) = H( Ni , T) + C(N , Ni)
If no cost function received from the node, then
compute a default cost function:C(N,T)= αd(N,T) + (1- α) Er
49. Geographic and Energy Aware
Routing
49
Suppose α = 1
S is sending a packet to T
C is the closer neighbor to
T
S receive new learned cost
function from C.
Now, B’s cost function is
less than C
T
B C
S
S Sends the packet
through C
Next packet will be sent
through B
50. Routing Protocols Based on Protocol
Operation
50
Multipath Routing Protocols
Query-Based Routing
Negotiation-Based Routing Protocols
QoS-based Routing
Coherent and Noncoherent Processing
51. Multipath Routing Protocols
51
Use multiple paths in order to enhance network
performance
Fault tolerance
Balance energy consumption
Energy-efficient
Reliability
52. Query-Based Routing
52
Destination nodes propagate a query for data
Usually theses queries are described in
natural language or high-level query language
E.g.
Directed diffusion
Rumor routing protocol
53. Negotiation-Based Routing Protocols
53
Use high-level data descriptors in order to
eliminate redundant data transmissions
through negotiation
Communication decisions are also made
based on the resources available to them
E.g.
SPIN
54. QoS-based Routing
54
Has to balance between energy consumption and
data quality
E.g.
SPEED (congestion avoidance)
55. Conclusion
55
based on the network structure divide three
categories: flat, hierarchical, and location-based
routing protocols.
The advantages and disadvantages of each
routing technique
In general hierarchical routing are outperform
than flat routing
56. reference
56
I. Akyildiz et al., “A Survey on Sensor Networks,” IEEE Commun.
Mag., vol. 40, no. 8, Aug. 2002, pp. 102–14.
W. Heinzelman, A. Chandrakasan and H. Balakrishnan,“Energy-
Efficient Communication Protocol for Wireless Microsensor
Networks,” Proc. 33rd Hawaii Int’l. Conf. Sys. Sci., Jan. 2000.
F. Ye et al., “A Two-Tier Data Dissemination Model for Large-
Scale Wireless S. Hedetniemi and A. Liestman, “A Survey of
Gossiping and broadcasting in Communication Networks,” IEEE
Network, vol. 18, no. 4, 1988, pp. 319–49.
57. reference
57
C. Intanagonwiwat, R. Govindan, and D. Estrin, “Directed
Diffusion: a Scalable and Robust Communication Paradigm
for Sensor Networks,” Proc. ACM Mobi- Com 2000, Boston,
MA, 2000, pp. 56–67.
D. Braginsky and D. Estrin, “Rumor Routing Algorithm for
Sensor Networks,” Proc. 1st Wksp. Sensor Networks and
Apps., Atlanta, GA, Oct. 2002.
C. Schurgers and M.B. Srivastava, “Energy Efficient Routing
in Wireless Sensor Networks,” MILCOM Proc. Commun. for
Network-Centric Ops.: Creating the Info. Force, McLean, VA,
2001.
M. Chu, H. Haussecker, and F. Zhao, “Scalable Information
Driven Sensor Querying and Routing for Ad Hoc
Heterogeneous Sensor Networks,” Int’l. J. High Perf. Comp.
Apps., vol. 16, no. 3, Aug. 2002.