The document summarizes the SPEED routing protocol for wireless sensor networks. SPEED aims to provide soft real-time communication by maintaining a consistent delivery speed across the network. It uses stateless non-deterministic geographic forwarding and neighborhood feedback to route packets while balancing energy consumption and avoiding congestion. Simulation results using MATLAB show that SPEED achieves low miss ratios and end-to-end delays while balancing energy usage across nodes in the network.
This document compares the SPEED and MMSPEED routing protocols for wireless sensor networks. It begins with background on wireless sensor networks and quality of service (QoS) routing. It then describes the SPEED protocol, including its design goals of supporting soft real-time communication with a guaranteed delivery speed. The SPEED architecture uses geographic routing and congestion control techniques. Next, it covers the MMSPEED protocol, which extends SPEED to provide multiple delivery speeds and probabilistic multipath forwarding for improved reliability and timeliness guarantees. The architectures of both protocols are explained in detail through phases of node selection, path discovery/selection, and data transmission. In summary, the document evaluates and compares SPEED and MMSPE
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 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 describes a fast handoff scheme called NodeScan for IEEE 802.11 wireless networks. NodeScan aims to reduce handoff latency by taking advantage of wireless mesh network architecture. It maintains a list of active mesh nodes on the client and transmits authentication requests to all nodes on the list simultaneously instead of scanning channels. This allows the client to discover and connect to a new mesh node quickly. Experimental results on a wireless mesh testbed show that NodeScan can reduce handoff latency compared to standard scanning methods. The scheme requires only a client-side software upgrade to implement.
Various Techniques Used in Wireless Sensor Networks for Data TransferIJAEMSJORNAL
The document discusses various techniques used for data transfer in wireless sensor networks, including different transport layer protocols and their characteristics such as PSFQ, ESRT, and DST. It also examines challenges for data transfer in WSNs like packet loss and energy depletion. Additionally, the document analyzes reliability mechanisms in WSNs including retransmission, redundancy, and erasure coding schemes like RDTS and FBcast.
Energy Efficient PEGASIS Routing Protocol in Wireless Sensor NetworkIRJET Journal
This document discusses the PEGASIS routing protocol for wireless sensor networks. It begins with an abstract that introduces PEGASIS as an energy-efficient chain-based hierarchical protocol. It then provides background on wireless sensor networks and discusses challenges like energy efficiency and network lifetime. It explains how PEGASIS forms chains between sensor nodes so that each node only communicates with nearby neighbors, extending network lifetime. The document compares PEGASIS to LEACH, finding that PEGASIS provides more balanced energy distribution and longer network lifetime. It then outlines the PEGASIS algorithm and discusses potential improvements like minimizing delay. Simulation results show PEGASIS increases network efficiency and lifespan over LEACH. The conclusion is that
Routing protocols for ad hoc wireless networks Divya Tiwari
The document discusses routing protocols for ad hoc wireless networks. It outlines several key challenges for these protocols, including mobility, bandwidth constraints, error-prone shared wireless channels, and hidden/exposed terminal problems. It also categorizes routing protocols based on how routing information is updated (proactively, reactively, or through a hybrid approach), whether they use past or future temporal network information, the type of network topology supported (flat or hierarchical), and how they account for specific resources like power.
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.
This document compares the SPEED and MMSPEED routing protocols for wireless sensor networks. It begins with background on wireless sensor networks and quality of service (QoS) routing. It then describes the SPEED protocol, including its design goals of supporting soft real-time communication with a guaranteed delivery speed. The SPEED architecture uses geographic routing and congestion control techniques. Next, it covers the MMSPEED protocol, which extends SPEED to provide multiple delivery speeds and probabilistic multipath forwarding for improved reliability and timeliness guarantees. The architectures of both protocols are explained in detail through phases of node selection, path discovery/selection, and data transmission. In summary, the document evaluates and compares SPEED and MMSPE
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 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 describes a fast handoff scheme called NodeScan for IEEE 802.11 wireless networks. NodeScan aims to reduce handoff latency by taking advantage of wireless mesh network architecture. It maintains a list of active mesh nodes on the client and transmits authentication requests to all nodes on the list simultaneously instead of scanning channels. This allows the client to discover and connect to a new mesh node quickly. Experimental results on a wireless mesh testbed show that NodeScan can reduce handoff latency compared to standard scanning methods. The scheme requires only a client-side software upgrade to implement.
Various Techniques Used in Wireless Sensor Networks for Data TransferIJAEMSJORNAL
The document discusses various techniques used for data transfer in wireless sensor networks, including different transport layer protocols and their characteristics such as PSFQ, ESRT, and DST. It also examines challenges for data transfer in WSNs like packet loss and energy depletion. Additionally, the document analyzes reliability mechanisms in WSNs including retransmission, redundancy, and erasure coding schemes like RDTS and FBcast.
Energy Efficient PEGASIS Routing Protocol in Wireless Sensor NetworkIRJET Journal
This document discusses the PEGASIS routing protocol for wireless sensor networks. It begins with an abstract that introduces PEGASIS as an energy-efficient chain-based hierarchical protocol. It then provides background on wireless sensor networks and discusses challenges like energy efficiency and network lifetime. It explains how PEGASIS forms chains between sensor nodes so that each node only communicates with nearby neighbors, extending network lifetime. The document compares PEGASIS to LEACH, finding that PEGASIS provides more balanced energy distribution and longer network lifetime. It then outlines the PEGASIS algorithm and discusses potential improvements like minimizing delay. Simulation results show PEGASIS increases network efficiency and lifespan over LEACH. The conclusion is that
Routing protocols for ad hoc wireless networks Divya Tiwari
The document discusses routing protocols for ad hoc wireless networks. It outlines several key challenges for these protocols, including mobility, bandwidth constraints, error-prone shared wireless channels, and hidden/exposed terminal problems. It also categorizes routing protocols based on how routing information is updated (proactively, reactively, or through a hybrid approach), whether they use past or future temporal network information, the type of network topology supported (flat or hierarchical), and how they account for specific resources like power.
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.
The Optimized Link State Routing Protocol (OLSR) is an IP routing protocol optimized for mobile ad hoc networks, which can also be used on other wireless ad hoc networks. OLSR uses hello and topology control (TC) messages to discover and then disseminate link state information throughout the mobile ad hoc network.
Contents which are covered here:
Classification of Ad-Hoc Routing Protocol
Link State Routing
Problems of Link State Routing
Optimized Link State Routing Protocol
1 Hop and 2 Hop Neighbors
Hello Packet
MPR Selection
Topology Table
MPR Information Declaration
*** Animated figure/diagram might not be visible in PDF view. Please consider it. ***
OLSR Model, OLSR Protocol, Optimized Link-State Routing Protocol
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
In wireless distributed sensor networks, one open problem is how to guarantee the reliable relay
selection based on the quality of services diversity. To address this problem, we focus on the reliable
adaptive relay selection approach and adaptive QoS supported algorithm, based on which we present a
Markov chain model, in consideration of different packet states and error control algorithm assignment.
The mathematical analyses and MATLAB simulation results show that the proposed relay selection
approach could perform better in terms of saturation throughput, reliability, and energy efficiency,
compared with the traditional approaches. More importantly, the quality of real-time multimedia streaming
is improved significantly, in terms of decodable frame ratio and delay.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
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.
The document discusses several routing protocols including HSRP, GLBP, VRRP, SNMP, NetFlow, and syslog. It provides details on:
- The virtual MAC addresses used by HSRP version 1 and 2.
- The states an HSRP router can be in and how only one reaches the active state.
- How GLBP elects an active virtual gateway and assigns virtual MAC addresses to members.
- How VRRP can track interface status through tracked objects.
- The framework and components of SNMP including managers, agents, MIBs, and PDUs.
- What NetFlow tracks to identify flows and how it is used for tasks like monitoring, planning,
Introduction
Background
WSN Design Issues: MAC Protocols, Routing Protocols, Transport Protocols
Performance Modeling of WSNs: Performance Metrics, Basic Models, Network Models
Case Study: Simple Computation of the System Life Span
Practical Example.
Congestion Control in Wireless Sensor Networks- An overview of Current TrendsEditor IJCATR
In WSN congestion occurs when traffic load exceeds the capacity available at any point in a network. Congestion
acts an important role in degrading the performance of the network or failure of the network. So it is essential to detect and
control the congestion in the entire WSN. Thus one can improve the performance of the network. Different factors are involved
in the congestion; the main factor is buffer over flow, packet loss, lowers network throughput and energy wastage. To address
this challenge this is essential for a distributed algorithm that mitigate congestion and allocate appropriate source rate to a sink
node for wireless sensor network. This paper gives some ideas how to control and manage the congestion in a wireless sensor
network.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Performance Analysis and Simulation of OLSR Routing Protocol in MANET ijcnac
Mobile ad hoc network is a collection of wireless nodes that are communicate other
nodes (router) without using access point, infrastructure . Mobile ad-hoc network is an
autonomous system that means no need for depaentd other nodes it have own capability
to handle and controlling all funcitionlity, to sending and receiving all information form
one device to other device. MANET has power full feature that controlling itself by
dynamic nature, multihop,low power and configuration of the system. In this paper we
analyzing, simulation and implements the TC messages and HELLO Message by MPR of
OLSR routing performance checked at 200 nodes on Qualnet 5.0.2 simulator. In Qualnet
simulator to simulate and implement the performance of OLSR routing protocols takes
various performance metrics like hello message sent (HMS) , hello message received
(HMR), TC message generated (TCMG), TC message replied (TCMR), TC messages
received on Constant Bit Rate (CBR) using random waypoint model. In this paper check
the performance OLSR routing protocol gives effective performance for lage networks.
Performance analysis on multihop transmission using arp routing protocol in i...eSAT Journals
This document discusses using the Address Resolution Protocol (ARP) routing protocol for multi-hop transmissions in IEEE 802.11 ad hoc networks. It proposes using ARP messages between nodes to establish routes for sending data when the source and destination nodes are out of radio range of each other. Intermediate nodes receiving ARP requests or replies would act as routers, forwarding the data to the destination. The method aims to reduce overhead compared to other ad hoc routing protocols like AODV. Simulation results showed the ARP routing protocol performed comparably to AODV in terms of throughput, packet loss and round trip time for different distances and environments.
IRJET-A Survey on Red Queue Mechanism for Reduce Congestion in Wireless NetworkIRJET Journal
This document summarizes several queue management mechanisms for congestion control in wireless networks, including Random Early Detection (RED) and variants. RED detects congestion by tracking average queue length and dropping packets probabilistically. Variants like Fuzzy Logic RED (FLRED) and Hemi-Rise Cloud Model (CRED) aim to improve RED by addressing its sensitivity to parameters and nonlinearity. Explicit Congestion Control (ECC) and Explicit Non-Congestion Notification (ENCN) modify TCP headers to signal congestion or non-congestion. Three section Random Early Detection (TRED) divides the queue into three sections to calculate dropping probability nonlinearly. These variants aim to more effectively control congestion and improve performance
GPRS was established by ETSI to provide packet-switched data services in GSM networks. It introduces two new core network nodes, SGSN and GGSN, to route packets between external data networks and mobile stations. GPRS supports bit rates up to 170kbps and quality of service features. It allows dynamic allocation of radio resources and efficient delivery of packet data using concepts like always-on connectivity and burst transmissions. GPRS uses concepts like point-to-point and point-to-multipoint connections to provide services like IP, X.25, SMS and other applications to mobile users.
This document discusses handoff schemes for high-speed mobile internet services. It describes the issues with mobility and different types of handoffs between networks. It proposes two approaches - a prediction-based approach that performs authentication of neighboring access points in advance, and creating a heterogeneous mobile switching and management network (HMSMN) to support seamless vertical handoffs across different wireless technologies. The HMSMN would detect available networks, make handoff decisions, initiate handoffs using mobility protocols like MIP, and support tight integration with mobility protocols for seamless connectivity during vertical handoffs.
This document summarizes and compares three clustering algorithms for wireless sensor networks: LEACH, HEED, and PEGASIS. LEACH is the first protocol to use hierarchical routing to increase network lifetime. It forms clusters with local heads that collect data from members and transmit to the base station. HEED uses residual energy and network topology features to select distributed cluster heads. PEGASIS forms chains between sensors so each transmits to a close neighbor, avoiding hotspots. The document analyzes these algorithms and compares their effects on network lifetime.
Understanding Network Routing Problem and Study of Routing Algorithms and Heu...IRJET Journal
This document discusses network routing and routing algorithms. It begins by defining routing as the process of determining the path that data packets will take from a source to a destination across a network. There are three main functions of routing: path determination, switching, and call setup. The document then discusses several common routing algorithm strategies, including greedy, dynamic programming, and divide-and-conquer approaches. It also describes specific routing algorithms like Dijkstra's algorithm, Bellman-Ford algorithm, and Floyd-Warshall algorithm. Finally, it discusses performance metrics for comparing routing algorithms, such as throughput, latency, hop count, bandwidth, and packet loss.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
The document analyzes and compares the performance of two routing protocols for wireless sensor networks: LEACH and SPIN. LEACH is a hierarchical clustering protocol that randomly selects cluster heads to aggregate and transmit data to the base station. SPIN is a data-centric protocol that uses data negotiation to disseminate data and avoid redundant transmissions. The document simulates both protocols and finds that SPIN has lower overall energy consumption than LEACH due to its negotiation-based approach. Key differences between the protocols include LEACH using clusters and SPIN being flat, with SPIN allowing for possible node mobility and multipath transmission.
Performance Evaluation of LEACH Protocol for Wireless Sensor NetworkAM Publications
This paper gives performance of LEACH protocol. LEACH is the first network protocol that uses hierarchical
routing for wireless sensor networks to increase the life time of network. All the nodes in a network organize themselves into
local clusters, with one node acting as the cluster-head. All non-cluster-head nodes transmit their data to the cluster-head,
while the cluster-head node receive data from all the cluster members, perform signal processing functions on the data (e.g.,
data aggregation), and transmit data to the remote base station. Therefore, being a cluster-head node is much more energyintensive
than being a non-cluster-head node. Thus, when a cluster-head node dies all the nodes that belong to the cluster lose
communication ability. This paper gives performance of LEACH protocol considering parameters i) Packet Delivery Ratio ii)
Throughput iii) Delay iv) lifetime.
This document summarizes a research paper on embedding digital signatures in video for security purposes. It discusses how digital watermarking can be used to authenticate digital video content by inserting copyright information. The paper proposes a method that uses discrete wavelet transform to embed different parts of a watermark image into different video scenes. It describes the watermark embedding process, which involves extracting video frames, applying DWT, dividing the watermark into parts, and embedding parts into DWT coefficients. Experimental results show the watermarked frames are visually similar to originals and maintain adequate quality metrics. The method aims to provide robust video authentication against various attacks.
This document discusses a hand gesture recognition system for underprivileged individuals. It begins by outlining the key steps in hand gesture recognition systems: image capture, pre-processing, segmentation, feature extraction and gesture recognition. It then goes into more detail on specific techniques for each step, such as thresholding and edge detection for segmentation. The document also covers applications like access control, sign language translation and future areas like biometric authentication. In conclusion, it proposes that hand gesture recognition can help disabled individuals communicate through accessible human-computer interaction.
This document discusses semi-supervised text classification using unlabeled data called "Universum". Semi-supervised learning uses both labeled and unlabeled data for training to improve accuracy over supervised learning, which only uses labeled data. The document proposes using unlabeled "Universum" examples that do not belong to any class of interest along with labeled examples. Experimental results on Reuters datasets show the proposed algorithm can benefit from Universum examples, especially when the number of labeled examples is insufficient.
The Optimized Link State Routing Protocol (OLSR) is an IP routing protocol optimized for mobile ad hoc networks, which can also be used on other wireless ad hoc networks. OLSR uses hello and topology control (TC) messages to discover and then disseminate link state information throughout the mobile ad hoc network.
Contents which are covered here:
Classification of Ad-Hoc Routing Protocol
Link State Routing
Problems of Link State Routing
Optimized Link State Routing Protocol
1 Hop and 2 Hop Neighbors
Hello Packet
MPR Selection
Topology Table
MPR Information Declaration
*** Animated figure/diagram might not be visible in PDF view. Please consider it. ***
OLSR Model, OLSR Protocol, Optimized Link-State Routing Protocol
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
In wireless distributed sensor networks, one open problem is how to guarantee the reliable relay
selection based on the quality of services diversity. To address this problem, we focus on the reliable
adaptive relay selection approach and adaptive QoS supported algorithm, based on which we present a
Markov chain model, in consideration of different packet states and error control algorithm assignment.
The mathematical analyses and MATLAB simulation results show that the proposed relay selection
approach could perform better in terms of saturation throughput, reliability, and energy efficiency,
compared with the traditional approaches. More importantly, the quality of real-time multimedia streaming
is improved significantly, in terms of decodable frame ratio and delay.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
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.
The document discusses several routing protocols including HSRP, GLBP, VRRP, SNMP, NetFlow, and syslog. It provides details on:
- The virtual MAC addresses used by HSRP version 1 and 2.
- The states an HSRP router can be in and how only one reaches the active state.
- How GLBP elects an active virtual gateway and assigns virtual MAC addresses to members.
- How VRRP can track interface status through tracked objects.
- The framework and components of SNMP including managers, agents, MIBs, and PDUs.
- What NetFlow tracks to identify flows and how it is used for tasks like monitoring, planning,
Introduction
Background
WSN Design Issues: MAC Protocols, Routing Protocols, Transport Protocols
Performance Modeling of WSNs: Performance Metrics, Basic Models, Network Models
Case Study: Simple Computation of the System Life Span
Practical Example.
Congestion Control in Wireless Sensor Networks- An overview of Current TrendsEditor IJCATR
In WSN congestion occurs when traffic load exceeds the capacity available at any point in a network. Congestion
acts an important role in degrading the performance of the network or failure of the network. So it is essential to detect and
control the congestion in the entire WSN. Thus one can improve the performance of the network. Different factors are involved
in the congestion; the main factor is buffer over flow, packet loss, lowers network throughput and energy wastage. To address
this challenge this is essential for a distributed algorithm that mitigate congestion and allocate appropriate source rate to a sink
node for wireless sensor network. This paper gives some ideas how to control and manage the congestion in a wireless sensor
network.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Performance Analysis and Simulation of OLSR Routing Protocol in MANET ijcnac
Mobile ad hoc network is a collection of wireless nodes that are communicate other
nodes (router) without using access point, infrastructure . Mobile ad-hoc network is an
autonomous system that means no need for depaentd other nodes it have own capability
to handle and controlling all funcitionlity, to sending and receiving all information form
one device to other device. MANET has power full feature that controlling itself by
dynamic nature, multihop,low power and configuration of the system. In this paper we
analyzing, simulation and implements the TC messages and HELLO Message by MPR of
OLSR routing performance checked at 200 nodes on Qualnet 5.0.2 simulator. In Qualnet
simulator to simulate and implement the performance of OLSR routing protocols takes
various performance metrics like hello message sent (HMS) , hello message received
(HMR), TC message generated (TCMG), TC message replied (TCMR), TC messages
received on Constant Bit Rate (CBR) using random waypoint model. In this paper check
the performance OLSR routing protocol gives effective performance for lage networks.
Performance analysis on multihop transmission using arp routing protocol in i...eSAT Journals
This document discusses using the Address Resolution Protocol (ARP) routing protocol for multi-hop transmissions in IEEE 802.11 ad hoc networks. It proposes using ARP messages between nodes to establish routes for sending data when the source and destination nodes are out of radio range of each other. Intermediate nodes receiving ARP requests or replies would act as routers, forwarding the data to the destination. The method aims to reduce overhead compared to other ad hoc routing protocols like AODV. Simulation results showed the ARP routing protocol performed comparably to AODV in terms of throughput, packet loss and round trip time for different distances and environments.
IRJET-A Survey on Red Queue Mechanism for Reduce Congestion in Wireless NetworkIRJET Journal
This document summarizes several queue management mechanisms for congestion control in wireless networks, including Random Early Detection (RED) and variants. RED detects congestion by tracking average queue length and dropping packets probabilistically. Variants like Fuzzy Logic RED (FLRED) and Hemi-Rise Cloud Model (CRED) aim to improve RED by addressing its sensitivity to parameters and nonlinearity. Explicit Congestion Control (ECC) and Explicit Non-Congestion Notification (ENCN) modify TCP headers to signal congestion or non-congestion. Three section Random Early Detection (TRED) divides the queue into three sections to calculate dropping probability nonlinearly. These variants aim to more effectively control congestion and improve performance
GPRS was established by ETSI to provide packet-switched data services in GSM networks. It introduces two new core network nodes, SGSN and GGSN, to route packets between external data networks and mobile stations. GPRS supports bit rates up to 170kbps and quality of service features. It allows dynamic allocation of radio resources and efficient delivery of packet data using concepts like always-on connectivity and burst transmissions. GPRS uses concepts like point-to-point and point-to-multipoint connections to provide services like IP, X.25, SMS and other applications to mobile users.
This document discusses handoff schemes for high-speed mobile internet services. It describes the issues with mobility and different types of handoffs between networks. It proposes two approaches - a prediction-based approach that performs authentication of neighboring access points in advance, and creating a heterogeneous mobile switching and management network (HMSMN) to support seamless vertical handoffs across different wireless technologies. The HMSMN would detect available networks, make handoff decisions, initiate handoffs using mobility protocols like MIP, and support tight integration with mobility protocols for seamless connectivity during vertical handoffs.
This document summarizes and compares three clustering algorithms for wireless sensor networks: LEACH, HEED, and PEGASIS. LEACH is the first protocol to use hierarchical routing to increase network lifetime. It forms clusters with local heads that collect data from members and transmit to the base station. HEED uses residual energy and network topology features to select distributed cluster heads. PEGASIS forms chains between sensors so each transmits to a close neighbor, avoiding hotspots. The document analyzes these algorithms and compares their effects on network lifetime.
Understanding Network Routing Problem and Study of Routing Algorithms and Heu...IRJET Journal
This document discusses network routing and routing algorithms. It begins by defining routing as the process of determining the path that data packets will take from a source to a destination across a network. There are three main functions of routing: path determination, switching, and call setup. The document then discusses several common routing algorithm strategies, including greedy, dynamic programming, and divide-and-conquer approaches. It also describes specific routing algorithms like Dijkstra's algorithm, Bellman-Ford algorithm, and Floyd-Warshall algorithm. Finally, it discusses performance metrics for comparing routing algorithms, such as throughput, latency, hop count, bandwidth, and packet loss.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
The document analyzes and compares the performance of two routing protocols for wireless sensor networks: LEACH and SPIN. LEACH is a hierarchical clustering protocol that randomly selects cluster heads to aggregate and transmit data to the base station. SPIN is a data-centric protocol that uses data negotiation to disseminate data and avoid redundant transmissions. The document simulates both protocols and finds that SPIN has lower overall energy consumption than LEACH due to its negotiation-based approach. Key differences between the protocols include LEACH using clusters and SPIN being flat, with SPIN allowing for possible node mobility and multipath transmission.
Performance Evaluation of LEACH Protocol for Wireless Sensor NetworkAM Publications
This paper gives performance of LEACH protocol. LEACH is the first network protocol that uses hierarchical
routing for wireless sensor networks to increase the life time of network. All the nodes in a network organize themselves into
local clusters, with one node acting as the cluster-head. All non-cluster-head nodes transmit their data to the cluster-head,
while the cluster-head node receive data from all the cluster members, perform signal processing functions on the data (e.g.,
data aggregation), and transmit data to the remote base station. Therefore, being a cluster-head node is much more energyintensive
than being a non-cluster-head node. Thus, when a cluster-head node dies all the nodes that belong to the cluster lose
communication ability. This paper gives performance of LEACH protocol considering parameters i) Packet Delivery Ratio ii)
Throughput iii) Delay iv) lifetime.
This document summarizes a research paper on embedding digital signatures in video for security purposes. It discusses how digital watermarking can be used to authenticate digital video content by inserting copyright information. The paper proposes a method that uses discrete wavelet transform to embed different parts of a watermark image into different video scenes. It describes the watermark embedding process, which involves extracting video frames, applying DWT, dividing the watermark into parts, and embedding parts into DWT coefficients. Experimental results show the watermarked frames are visually similar to originals and maintain adequate quality metrics. The method aims to provide robust video authentication against various attacks.
This document discusses a hand gesture recognition system for underprivileged individuals. It begins by outlining the key steps in hand gesture recognition systems: image capture, pre-processing, segmentation, feature extraction and gesture recognition. It then goes into more detail on specific techniques for each step, such as thresholding and edge detection for segmentation. The document also covers applications like access control, sign language translation and future areas like biometric authentication. In conclusion, it proposes that hand gesture recognition can help disabled individuals communicate through accessible human-computer interaction.
This document discusses semi-supervised text classification using unlabeled data called "Universum". Semi-supervised learning uses both labeled and unlabeled data for training to improve accuracy over supervised learning, which only uses labeled data. The document proposes using unlabeled "Universum" examples that do not belong to any class of interest along with labeled examples. Experimental results on Reuters datasets show the proposed algorithm can benefit from Universum examples, especially when the number of labeled examples is insufficient.
This document presents a comparative study of edge detection techniques for shoeprint recognition. It provides an overview of common edge detection methods like Canny, Sobel, and Prewitt. The paper applies these techniques to sample shoeprint images and calculates the mean and standard deviation of the results under different threshold values. Canny edge detection performed best at preserving geometric features of the shoeprint, while Prewitt and Sobel algorithms worked better overall on the test images. The study aims to help understand and evaluate edge detection algorithms through practical simulations and analysis.
This document describes a GPS-based route navigation system developed for Android that provides real-time traffic information, a parking allocation system, and work reminders. The system uses GPS to determine the user's location and find the shortest path to a destination. It also allows users to check available parking spots on a map, reserve spots, and be reminded of work when entering designated areas. The parking and reminder systems were tested and shown to accurately reserve spots and display reminders based on a user's location. The system aims to help users navigate efficiently and manage tasks and parking.
This document discusses techniques for measuring fuel levels in vehicles. It begins by describing traditional float-based fuel level measurement systems and their accuracy limitations. It then outlines several alternative fuel level sensing techniques including capacitive sensing using electrodes, electronic load cells that measure weight, and ultrasonic sensing using sound waves. The document concludes that while traditional analog systems are cheap, digital techniques using sensors like these would provide more accurate readings and prevent fraud, benefiting both customers and manufacturers.
This document discusses techniques for text analytics in big data. It begins by noting that 80% of big data is unstructured text data from sources like social media, emails, and blogs. Text analytics techniques can extract useful patterns and information from this large volume of text data. The document then discusses some common text analytics algorithms like named entity extraction, latent Dirichlet allocation, and term frequency matrices that can derive meaningful insights from unstructured text at scale. It also notes some challenges of deploying text analytics approaches and extracting information from heterogeneous text sources.
This document discusses the development of a CAD model for a flywheel motor system that can be operated by multiple riders. The flywheel motor is a key component in many manually powered machines that store human energy through pedaling and release it to drive machine processes. Previous flywheel motor designs only accommodated a single rider. The proposed new design includes two bicycle mechanisms mounted on a common shaft that allow two people to pedal and contribute energy simultaneously. The document outlines design considerations for flywheel speed, size, gear ratios, and other parameters based on prior research. It presents the CAD model created in Solid Edge software, which can be used for simulation, analysis and optimization of the multi-rider flywheel motor system.
This document evaluates the performance of 20 radiation-based equations for estimating reference evapotranspiration (ET0) against the FAO Penman-Monteith method using 24 years of weather data from Pantnagar, India. The FAO24-Radiation method provided ET0 values that most closely matched the FAO Penman-Monteith method based on agreement index and RMSE values on daily, weekly, and monthly timescales. The Castaneda-Rao method estimated ET0 values that were almost equal to the FAO Penman-Monteith values. Overall, the FAO24-Radiation method performed the best among the 20 radiation-based equations evaluated for the sub-humid climate
This document summarizes research into the compressive strength of geopolymer mortar made with ground granulated blast furnace slag (GGBFS) and fly ash activated by a 14 molar sodium hydroxide and sodium silicate solution. Cubes of geopolymer mortar were produced with different percentages of GGBFS and tested for compressive strength at ages of 1, 3, and 7 days. The results showed that compressive strength increased with GGBFS percentage and age. The maximum 7-day strength of 32.67 MPa was achieved with 80% GGBFS and a fluid-to-binder ratio of 0.45. Below this ratio strength decreased, indicating 0.45 is the optimum
This document summarizes a research study that examined the attitudes of engineering students towards the semester system and how those attitudes are influenced by management, locality, and gender. Some key findings include:
1) Management, locality, and gender were found to significantly influence engineering students' attitudes towards the semester system. Government college students and those from urban or female backgrounds tended to have more positive attitudes.
2) Educational implications are discussed, such as the need to provide more support to students from private colleges, rural areas, or male backgrounds to improve their attitudes towards semesters.
3) Factors like class sizes, assessment approaches, and teaching methods may need to change to better suit the demands of the semester system.
This document discusses the analysis of different process parameters on the properties of components manufactured using Fused Deposition Modeling (FDM). It aims to study the effect of road width, air gap, and build orientation (0°, 45°, 90°) on properties like accuracy, surface finish, and build time. Samples will be manufactured at different combinations of these parameters and tested to determine their properties, with results analyzed and presented graphically. Prior research has found orientation affects properties like surface quality, accuracy, build time and cost, so optimization of orientation is important for FDM.
This document discusses the design of a kitting trolley for an assembly line. It begins with an abstract that describes kitting as a method of feeding components and subassemblies to an assembly line in predetermined quantities placed in containers. It then provides background on lean manufacturing principles like just-in-time and discusses different materials feeding systems like continuous supply, batching, sequencing, and kitting. It describes the proposed kitting trolley, including 3D models. Reasons for using kitting include saving floor space in parallel assembly lines that require exposing many part numbers at each workstation. The document concludes by discussing the design of a template for evaluating kitted articles.
This document reviews research on using computational fluid dynamics (CFD) to analyze coal/air flow in power plant pipelines in order to maintain uniform fuel feed rates at burners. Several studies are summarized that use CFD to simulate coal/air flow and model the effects of orifice flow restrictors placed in pipes. Correlations developed from CFD results relate pressure drop to factors like geometry, coal/gas loading ratio, and mass flux. CFD is shown to be an effective method for determining the optimal geometry and sizing of orifice flow restrictors to balance flow rates across burners.
This document discusses various methods for selecting optimal input-output pairings for multivariable control systems. It begins with an introduction to the challenges of controlling multivariable systems and the importance of proper input-output pairing. It then reviews several pairing methods including the relative gain array (RGA), relative omega array, dynamic relative gain array, normalized RGA, and relative normalized gain array. It also discusses necessary conditions for decentralized integral controllability and presents rules for eliminating undesirable pairings to achieve this. Overall, the document provides an overview of established and newer techniques for analyzing interactions and selecting input-output pairs for multivariable processes.
This document discusses power quality improvement in a multi-machine system using STATCOM. It begins with an abstract that outlines using STATCOM to maintain voltage stability and improve power factor and harmonic reduction with a wind turbine connected to the grid. It then discusses how wind power injection affects power quality according to IEC standards. The paper studies power quality issues caused by installing a wind turbine and proposes using STATCOM at the point of common connection to mitigate these issues. It simulates the STATCOM control scheme for the wind energy system using MATLAB to show its effectiveness in improving power quality by relieving the main supply of reactive power demands.
This document summarizes various methodologies that have been used for detecting plant leaf diseases through image processing techniques. It provides an overview of common steps used in existing approaches, which typically involve preprocessing the image through tasks like color space conversion, masking green pixels, and segmentation. Features are then extracted, such as texture or color features, which are used as inputs for classification algorithms like neural networks, SVMs, or KNN. The paper also reviews 10 previous studies on plant disease detection, summarizing their methodology, accuracy, and findings. Overall, existing approaches typically achieve over 90% accuracy, but combining multiple features and advanced classifiers may help improve performance.
This document proposes a two-phase system using genetic algorithms and fuzzy logic to classify intrusion detection system (IDS) alerts and reduce false positives. In the first phase, similar alerts are grouped and normalized. Irrelevant alerts are identified through asset verification. In the second phase, labeled alerts are classified using genetic fuzzy rules to efficiently detect intrusions. The system is tested on KDD Cup 99 dataset and effectively reduces false positives through optimized fuzzy rules, reducing analyst workload.
This document discusses a proposed Smart Energy Distribution Management (SEDM) system that uses solar power and battery storage to help reduce power consumption. The SEDM controls power sockets using wireless communication based on the battery status and sets times for power usage. It can supply power from both the commercial grid and stored solar energy. The system prioritizes which devices to power based on preset battery level thresholds to make most efficient use of available energy. A hardware architecture is presented using a microcontroller, relays, wireless communication, and power monitoring to manage energy distribution from the solar and battery sources.
This document presents an extended Kalman filter method for object tracking. It discusses using polynomials to model extended targets observed from imagery sensors to enable tracking of moving objects. The extended Kalman filter framework allows tracking extended targets using state-space models. Simulation results show the estimated position of an object tracked over time using the extended Kalman filter matches closely with the true position, demonstrating the effectiveness of this method for target tracking applications like radar signal processing.
This document presents a QoS-based packet scheduling algorithm for hybrid wireless networks. It proposes using the Earliest Deadline First (EDF) algorithm to schedule packets for online conference applications and the Least Slack Time First algorithm to schedule packets for online video applications. The goal is to reduce transmission delay and improve QoS. It implements this scheduling approach using the NS2 network simulator. The scheduling algorithm classifies packets by application type and places them in queues. EDF and Least Slack Time are then used to schedule packets from each queue to minimize delay for multimedia applications over hybrid wireless networks.
REAL-TIME ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORKS: A SURVEYcscpconf
Wireless sensor networks can be termed as a new generation of distributed embedded systems
that has a capability of meeting broad range of real-time applications. Examples include
radiation monitoring, fire monitoring, border surveillance, and medical care to name but a few.
Wireless sensor networks that are deployed in time/mission-critical applications with highly
dynamic environments have to interact with the physical phenomenon under stringent timing
constraints and severe resource limitations. For such real-time wireless sensor networks,
designing and developing a real-time routing protocol that meets the required real-time
guarantee of data packets communication is a stimulating field of study that raised many
challenges and research issues. In this paper, we present a comprehensive survey of real-time
routing protocols in WSN, by discussing each protocol with its key features. Finally, we concluded this paper with open research issues and challenges of real-time routing in WSN.
This document summarizes a research paper that analyzes end-to-end delay distribution in wireless sensor networks. It first introduces the importance of average delay and end-to-end delay distribution for real-time quality of service in wireless sensor networks. It then discusses previous work that analyzed average delay but failed to consider single hop delay distribution or bursty traffic. The document proposes a comprehensive cross-layer analysis framework to model average delay and end-to-end delay distribution considering both deterministic and random node deployments. It also compares the performance of CSMA/CA and a cross-layer MAC protocol in terms of throughput, packet loss, and delay.
This document summarizes a research paper that analyzes end-to-end delay distribution in wireless sensor networks. It first introduces the importance of average delay and end-to-end delay distribution for real-time quality of service in wireless sensor networks. It then discusses previous work that analyzed average delay but failed to characterize single-hop delay distribution or consider bursty traffic. The document describes the research paper's cross-layer analysis framework for modeling average delay and end-to-end delay distribution through discrete time queueing and Markov chain models. It also compares the performance of CSMA/CA and a proposed cross-layer protocol in terms of throughput, packet loss, and delay.
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.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
This document summarizes a research paper that proposes a new routing algorithm called Quadrant-Based Directional Routing (Q-DIR) for multihop wireless networks. Q-DIR is implemented as a cross-layer with Contention Window Adaptation Mechanism (CWAM) to reduce network power consumption and increase throughput. Q-DIR limits flooding to the quadrant containing the source and destination nodes. CWAM adapts the contention window size based on node traffic to improve throughput. Simulation results show that Q-DIR with CWAM outperforms standard flooding protocols by utilizing fewer nodes and increasing throughput while reducing power consumption.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
This document analyzes the performance of the Dynamic Source Routing (DSR) protocol for mobile ad hoc networks in terms of cache updating. It proposes a distributed cache updating algorithm to proactively disseminate link failure information to nodes with cached routes containing the broken link. Simulation results show that the modified DSR protocol with distributed cache updating has higher packet delivery ratio and throughput, while generating lower normalized routing overhead compared to the standard DSR protocol. The distributed cache updating approach helps remove stale routes from caches faster and improves the performance of the on-demand DSR protocol for highly mobile ad hoc networks.
ANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORKIJCSIT Journal
There are two methods to improve the performance of routing protocols in wireless mesh networks. One way is to improve the methods used for select the path. Second way is to improve the algorithms to add up the new characteristics of wireless mesh networks. We also propose a new protocol that is used for Multi Interfaces and Multiple Channels (MIMC) named as Hybrid Wireless Mesh Protocol.
SPEED is a real-time communication protocol for sensor networks that provides three types of services: real-time unicast, multicast, and anycast. It uses a stateless architecture and relies on neighborhood beacon exchanges and receive delay estimations to provide real-time guarantees, QoS routing, traffic load balancing, and localized behavior for sensor network applications. The SPEED protocol consists of an application programming interface, packet format, neighbor beacon exchange to share location and delay information, and receive delay estimation to select optimal routes.
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...IJECEIAES
At present day’s wireless sensor networks, obtain a lot consideration to researchers. Maximum number of sensor nodes are scattered that can communicate with all others. Reliable data communication and energy consumption are the mainly significant parameters that are required in wireless sensor networks. Many of MAC protocols have been planned to improve the efficiency more by enhancing the throughput and energy consumption. The majority of the presented medium access control protocols to only make available, reliable data delivery or energy efficiency does not offer together at the same time. In this research work the author proposes a novel approach based on Receiver Centric-MAC is implemented using NS2 simulator. Here, the author focuses on the following parametric measures like - energy consumption, reliability and bandwidth. RC-MAC provides high bandwidth without decreasing energy efficiency. The results show that 0.12% of less energy consumption, reliability improved by 20.86% and bandwidth increased by 27.32% of RC-MAC compared with MAC IEEE 802.11.
1) Computer networks allow computers to communicate and share resources by connecting them through communication channels. There are several types of networks including LANs, WANs, and MANs.
2) For communication between computers on a network, both sides must agree on protocols which are sets of rules that govern data transmission. The two main protocol stacks are OSI and TCP/IP.
3) The network layer is responsible for delivering packets from source to destination by choosing appropriate paths through routers. It provides connectionless and connection-oriented services to the transport layer above it.
Priority based bandwidth allocation in wireless sensor networksIJCNCJournal
Most of the sensor network applications need real time communication and the need for deadline aware real time communication is becoming eminent in these applications. These applications have different dead line requirements also. The real time applications of wireless sensor networks are bandwidth sensitive and need higher share of bandwidth for higher priority data to meet the dead line requirements. In this paper we focus on the MAC layer modifications to meet the real time requirements of different priority data.Bandwidth partitioning among different priority transmissions is implemented through MAC layer modifications. The MAC layer implements a queuing model that supports lower transfer rate for lower
priority packets and higher transfer rate for real
time packets with higher priority, minimizing the end to
end delay. The performance of the algorithm is evaluated with varying node distribution
.
Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...acijjournal
This document summarizes a research paper that proposes an enhancement to the Improved Balanced LEACH (IB-LEACH) routing protocol for heterogeneous wireless sensor networks. The proposed enhancement stores residual energy from each routing round in an "energy bank" to increase network lifetime. It also enhances the ACTIVE_ROUTE_TIMEOUT parameter in the underlying AODV routing protocol. Simulation results using MATLAB show the proposed approach improves network lifetime compared to previous methods. The document provides background on wireless sensor networks, routing protocols, LEACH clustering, and IB-LEACH before detailing the proposed enhancement and simulation results.
Comprehensive survey on routing protocols for IoTsulaiman_karim
This document provides an overview of routing protocols for the Internet of Things (IoT). It defines IoT and routing protocols, describes common routing algorithms like distance vector and link state, and discusses specific protocols such as RPL, RIP, and OSPF. It also covers clustering in wireless sensor networks and the LEACH clustering protocol.
This document compares the TDMA and CSMA access techniques for a linear topology of sensor nodes. It first provides background on wireless sensor networks and discusses applications that use a fixed chain topology. It then explains that TDMA is generally more suitable than CSMA for a linear chain topology with a large number of nodes, periodic traffic, and relatively high traffic. The document reviews several existing MAC protocols designed for chain topologies and discusses their advantages and disadvantages. It focuses on comparing the throughput and delay of nodes in a linear topology using TDMA versus CSMA.
A survey on routing algorithms and routing metrics for wireless mesh networksMohammad Siraj
This document summarizes a survey on routing algorithms and metrics for wireless mesh networks. It discusses the requirements of efficient mesh routing protocols including being distributed, adaptable to topology changes, loop-free, secure, scalable, and supporting quality of service. It reviews several important proactive routing protocols including destination-sequenced distance-vector routing, optimized link state routing, and mesh networking routing protocol. It also discusses reactive routing protocols and examples like dynamic source routing and ad hoc on-demand distance vector routing. Finally, it examines routing metrics and their impact on the performance of wireless mesh networks.
Improved SCTP Scheme To Overcome Congestion Losses Over ManetIJERA Editor
Transmission control conventions have been utilized for data transmission process. TCP has been pre-possessed
for information transmission over wired correspondence having diverse transfer speeds and message delays over
the system. TCP gives correspondence utilizing 3-handshake which sends RTS and ACK originate from server
end and information message has been transmitted over the data transmission gave. This does not give security
over flooding assault happened on the system. TCP gives correspondence between distinctive hubs of the wired
correspondence however when multi-spilling happens in a system TCP does not gives legitimate throughput of
the framework which is significant issue that happened in the past framework. In the proposed work, to beat this
issue SCTP and Improved SCTP transmission control convention has been executed for the framework
execution of the framework. SCTP gives 4-handshake correspondence in the message transmit and improved
SCTP gives the performance when the queue length comes to its full value then it divides the message to other
nodes because of which security element get expansions and this likewise gives correspondence administrations
over multi-spilling and multi-homing. Numerous sender and recipients can impart over wired system utilizing
different methodologies of correspondence through same routers, which debases in the TCP convention. In last
we assess parameters for execution assessment. Here, we composed and actualized our proving ground utilizing
Network Simulator (NS-2.35) to test the execution of both Routing conventions.
This document summarizes a research paper that examines pricing strategy in a two-stage supply chain consisting of a supplier and retailer. The supplier offers a credit period to the retailer, who then offers credit to customers. A mathematical model is formulated to maximize total profit for the integrated supply chain system. The model considers three cases based on the relative lengths of the credit periods offered at each stage. Equations are developed to represent the profit functions for the supplier, retailer and overall system in each case. The goal is to determine the optimal selling price that maximizes total integrated profit.
The document discusses melanoma skin cancer detection using a computer-aided diagnosis system based on dermoscopic images. It begins with an introduction to skin cancer and melanoma. It then reviews existing literature on automated melanoma detection systems that use techniques like image preprocessing, segmentation, feature extraction and classification. Features extracted in other studies include asymmetry, border irregularity, color, diameter and texture-based features. The proposed system collects dermoscopic images and performs preprocessing, segmentation, extracts 9 features based on the ABCD rule, and classifies images using a neural network classifier to detect melanoma. It aims to develop an automated diagnosis system to eliminate invasive biopsy procedures.
This document summarizes various techniques for image segmentation that have been studied and proposed in previous research. It discusses edge-based, threshold-based, region-based, clustering-based, and other common segmentation methods. It also reviews applications of segmentation in medical imaging, plant disease detection, and other fields. While no single technique can segment all images perfectly, hybrid and adaptive methods combining multiple approaches may provide better results. Overall, image segmentation remains an important but challenging task in digital image processing and computer vision.
This document presents a test for detecting a single upper outlier in a sample from a Johnson SB distribution when the parameters of the distribution are unknown. The test statistic proposed is based on maximum likelihood estimates of the four parameters (location, scale, and two shape) of the Johnson SB distribution. Critical values of the test statistic are obtained through simulation for different sample sizes. The performance of the test is investigated through simulation, showing it performs well at detecting outliers when the contaminant observation represents a large shift from the original distribution parameters. An example application to census data is also provided.
This document summarizes a research paper that proposes a portable device called the "Disha Device" to improve women's safety. The device has features like live location tracking, audio/video recording, automatic messaging to emergency contacts, a buzzer, flashlight, and pepper spray. It is designed using an Arduino microcontroller connected to GPS and GSM modules. When the button is pressed, it sends an alert message with the woman's location, sets off an alarm, activates the flashlight and pepper spray for self-defense. The goal is to provide women a compact, one-click safety system to help them escape dangerous situations or call for help with just a single press of a button.
- The document describes a study that constructed physical fitness norms for female students attending social welfare schools in Andhra Pradesh, India.
- Researchers tested 339 students in classes 6-10 on speed, strength, agility and flexibility tests. Tests included 50m run, bend and reach, medicine ball throw, broad jump, shuttle run, and vertical jump.
- The results showed that 9th class students had the best average time for the 50m run. 10th class students had the highest flexibility on average. Strength and performance generally improved with increased class level.
This document summarizes research on downdraft gasification of biomass. It discusses how downdraft gasifiers effectively convert solid biomass into a combustible producer gas. The gasification process involves pyrolysis and reactions between hot char and gases that produce CO, H2, and CH4. Downdraft gasifiers are well-suited for biomass gasification due to their simple design and ability to manage the gasification process with low tar production. The document also reviews previous studies on gasifier configuration upgrades and their impact on performance, and the principles of downdraft gasifier operation.
This document summarizes the design and manufacturing of a twin spindle drilling attachment. Key points:
- The attachment allows a drilling machine to simultaneously drill two holes in a single setting, improving productivity over a single spindle setup.
- It uses a sun and planet gear arrangement to transmit power from the main spindle to two drilling spindles.
- Components like gears, shafts, and housing were designed using Creo software and manufactured. Drill chucks, bearings, and bits were purchased.
- The attachment was assembled and installed on a vertical drilling machine. It is aimed at improving productivity in mass production applications by combining two drilling operations into one setup.
The document presents a comparative study of different gantry girder profiles for various crane capacities and gantry spans. Bending moments, shear forces, and section properties are calculated and tabulated for 'I'-section with top and bottom plates, symmetrical plate girder, 'I'-section with 'C'-section top flange, plate girder with rolled 'C'-section top flange, and unsymmetrical plate girder sections. Graphs of steel weight required per meter length are presented. The 'I'-section with 'C'-section top flange profile is found to be optimized for biaxial bending but rolled sections may not be available for all spans.
This document summarizes research on analyzing the first ply failure of laminated composite skew plates under concentrated load using finite element analysis. It first describes how a finite element model was developed using shell elements to analyze skew plates of varying skew angles, laminations, and boundary conditions. Three failure criteria (maximum stress, maximum strain, Tsai-Wu) were used to evaluate first ply failure loads. The minimum load from the criteria was taken as the governing failure load. The research aims to determine the effects of various parameters on first ply failure loads and validate the numerical approach through benchmark problems.
This document summarizes a study that investigated the larvicidal effects of Aegle marmelos (bael tree) leaf extracts on Aedes aegypti mosquitoes. Specifically, it assessed the efficacy of methanol extracts from A. marmelos leaves in killing A. aegypti larvae (at the third instar stage) and altering their midgut proteins. The study found that the leaf extract achieved 50% larval mortality (LC50) at a concentration of 49 ppm. Proteomic analysis of larval midguts revealed changes in protein expression levels after exposure to the extract, suggesting its bioactive compounds can disrupt the midgut. The aim is to identify specific inhibitor proteins in the midg
This document presents a system for classifying electrocardiogram (ECG) signals using a convolutional neural network (CNN). The system first preprocesses raw ECG data by removing noise and segmenting the signals. It then uses a CNN to extract features directly from the ECG data and classify arrhythmias without requiring complex feature engineering. The CNN architecture contains 11 convolutional layers and is optimized using techniques like batch normalization and dropout. The system was tested on ECG datasets and achieved classification accuracy of over 93%, demonstrating its effectiveness at automated ECG classification.
This document presents a new algorithm for extracting and summarizing news from online newspapers. The algorithm first extracts news related to the topic using keyword matching. It then distinguishes different types of news about the same topic. A term frequency-based summarization method is used to generate summaries. Sentences are scored based on term frequency and the highest scoring sentences are selected for the summary. The algorithm was evaluated on news datasets from various newspapers and showed good performance in intrinsic evaluation metrics like precision, recall and F-score. Thus, the proposed method can effectively extract and summarize online news for a given keyword or topic.
1. International Journal of Research in Advent Technology, Vol.3, No.6, June 2015
E-ISSN: 2321-9637
63
SPEED A Real Time Routing Protocol in Wireless
Sensor Networks
Shivani1
, Rajneet kaur2
, Anu sheetal3
Guru Nanak Dev University, Regional Campus, Gurdaspur, Punjab1, 2, 3.
Shivani.kundal21@gmail.com1
, merajneet@gmail.com2
, anusheetal2013@gmail.com3
Abstract- Wireless sensor network is considered as the one of the important technology in today’s world. In this paper a quality of
service based real time communication routing protocol known as SPEED is mainly to be discussed. Real-time unicast, real- time
area-anycast and real-time area-multicast are the three types of real time communication services are to be provided by the protocol.
SPEED is a scalable and the highly efficient protocol for the sensor networks. End to End soft real time communication is gained by
maintaining the proficient speed across network. Speculative analysis and the simulation results are to be calculated to authenticate
our consequences.
Keywords: sensor networks, design issues, SPEED, results.
1. INTRODUCTION
Wireless Sensor Networks consists of very small sensor
nodes that are characterized by restricted giving out power
and energy resources. WSN have emerged as a promising
tool for monitoring the physical world. In sensor networks,
energy is a serious resource, while applications reveal a
limited set of individuality [1]. Thus, there is both an
opportunity and a requirement to optimize the network
architecture for the applications in order to minimize the
consumption of the resources. The necessities and boundaries
of sensor networks make their architecture and protocols both
challenging and divergent from the needs of fixed
architecture [2].
Real-time (RT) wireless sensor systems have many
applications especially in fire monitoring, medical care,
intruder tracking and structural health diagnosis. WSNs have
gained an enormous consideration for their ability in meeting
the real time QoS guarantee in many critical scenarios. In
wide-ranging, real time packet message guarantee can be
categorized as i) Soft Real Time (SRT) ii) Hard Real Time
(HRT). As the hard real time should support a deterministic
dead time which implies, delivery of a message after the dead
time is considered as a failure and sometime it may lead to a
catastrophic effect. On the other hand, SRT supports
probabilistic dead time that means there is some sort of
latency in message delivery. Because of the highly erratic
nature of wireless links, variable data packets relaying,
energy and bandwidth constraints, a real time communication
is a challenging task in case of WSNs [1]. In this paper a
protocol named as SPEED is discussed that supports soft
real-time communication based on stateless algorithms and
feedback control for large-scale sensor networks. SPEED
protocol is evaluated via simulation using MATLAB on the
basis of various parameters like miss ratio, packet delivery
ratio, energy consumption, throughput and delay.
Data delivery is the main function of the sensor networks.
Basically, SPEED protocol distinguishes the three types of
the communication patterns associated with the data delivery.
Those are unicast, multicast and anycast.
2. DESIGN GOALS
1. Stateless Architecture. The large scale, high failure rate,
and constrained memory capacity the physical limitations of
sensor networks that necessitate a stateless approach. In
SPEED there is no need of routing table it only maintains
immediate neighbor in-formation.
2. Soft Real-Time. Sensor networks are mainly used to
monitor and organize the physical world. SPEED protocol
provides a uniform delivery speed across the sensor network
and it meets real-time applications requirements such as
emergency surveillance disaster in sensor networks [3].
2. International Journal of Research in Advent Technology, Vol.3, No.6, June 2015
E-ISSN: 2321-9637
64
3. Minimum MAC Layer Support. The feed-back control is
provided in SPEED protocol. This scheme employed allows
it to be compatible with all existing best effort MAC layers.
4. QoS Routing and Congestion Management. SPEED
protocol is using a backpressure rerouting which reduces the
traffic when blocking occurs. As in most re-active routing
protocols can find routes that avoid network hot spots during
the route acquisition phase and these protocols work well
when traffic doesn’t interrupt. However, these protocols are
not as much of successful when congestion patterns change
rapidly compared to the session lifetime. When a route
becomes congested, such protocols suffer a delay.
5. Localized Behavior. These types of algorithms are
defined as in which any action done by a node should not
affect the whole network system. Mainly in the protocols a
node uses flooding to discover new paths for routing. When
the thousands of nodes in sensor networks wants to
communicate with each other, and they follows the flooding
procedure to find paths it may result in significant power
consumption. To avoid that, all distributed operations in
SPEED are localized to achieve high scalability.
6. Traffic Load Balancing. The band-width and energy are
insufficient resources in sensor networks as compared to a
wired network. Because of this condition, it is precious to
develop a number of real-time paths to take packets from the
source to the destination. SPEED uses non-deterministic
forwarding to balance each flow among multiple
synchronized routes.
3. SPEED PROTOCOL
SPEED, a QoS routing protocol for sensor networks that
provides soft real-time end-to-end guarantee. The protocol
requires each node to maintain information about its
neighbors and uses geographic forwarding to find paths. And
also maintains a preferred delivery speed across sensor
networks by locally regulating packets sent to the MAC layer
and diverting traffic at the networking layer.
The SPEED protocol consists of the various components:
An API
A neighbor beacon exchange scheme
A delay estimation scheme
The Stateless Non-deterministic Geographic
Forwarding algorithm (SNGF)
A Neighborhood Feedback Loop (NFL)
Backpressure Rerouting
Last mile processing
Fig. 1 SPEED Protocol
In figure 1 above the architecture of the SPEED protocol is
shown. SNGF (stateless non-deterministic geographic
forwarding) is known as the routing module in the SPEED
and it works with other four modules at the network layer and
it is responsible in charge for choosing the next hop. Beacon
exchange provides the geographic location of the neighboring
nodes so that SNGF can do geographic based routing. NFL
and the backpressure rerouting are the two modules to reduce
the traffic when blocking occurs [1]. The last mile process is
provided to support the three unicast, multicast and anycast
communication semantics. Delay estimation is the means by
which nodes will determine that whether congestion has been
occurred by waiting for the ACK from the receiving node.
Here below the detail discussion of the components is done.
3.1. Application API
The real time SPEED protocol provides basically three types
of application level API calls:
1) Area Multicast Send: This service depends on the position,
radius and packet to be transferred. It identifies a destination
area by its center position and radius. It sends a replica of the
packet to every node inside the particular area of the network
with a speed above a certain preferred value.
2) Area AnyCast Send: Similar to the area multicast this
service also depends on the position, radius and packet. In
this service to at least one node inside the specified area a
copy of the packet is to be sending with a speed above an
assured preferred value.
3) Unicast Send: In this service the node identified by
Global_ID and the node having a particular Global_ID will
receive the packet with a speed above an assured preferred
value.
API
Unicast Multicast Anycast
Last mile process
Backpressure
Rerouting
Beacon
exchange
SNGF
Neighbor
table
NFL
Delay
estimation
MAC
3. International Journal of Research in Advent Technology, Vol.3, No.6, June 2015
E-ISSN: 2321-9637
65
Real-time applications can estimate end-to-end delay before
making admission decisions. SPEED protocol aims to
provide a uniform packet delivery speed across the sensor
network, such that the end-to-end delay of a packet is
proportional to the distance between the source and
destination. As the SPEED is a real-time protocol, so it can’t
use deadline as a parameter in API.
3.2. Neighbor beacon exchange
Every node in SPEED protocol periodically broadcasts a data
packet to its neighbors. This periodic transmission is only
used for exchanging location information between neighbors
so that SNGF can do routing, Similar to other geographic
routing algorithms. The beaconing rate should be very low
when nodes are stationary or slowly moving inside the sensor
network.
In SPEED protocol each node of the network is having the
neighbor table in which it can store the information that is
passed through the beaconing. The table of each node has the
following identities that are: neighborID, position, expire
time, SendtoDelay. The neighbor entries should be refreshed
after a certain time period if it is not then it will be removed
from the neighbor table. The expire time is used to timeout
this entry.
3.3. Delay estimation
The delay estimation is the module by which nodes can
determine whether or not congestion has been occurred.
when the packets is to be transmitted to receiver node then
after receiving the packet it will transmit the ACK back to the
sender node. The delay is to be calculated at the sender,
which timestamps the packet entering the network output
queue and it will calculate the round trip single hop delay for
his packet when receiving the ACK.
3.4 Stateless Non-deterministic Geographic Forwarding
(SNGF)
The SNGF is the routing module in the SPEED protocol in
charge for choosing the next hop for transmission of data
packets. The three main definitions to be discussed are:
The neighbor set of Node i: NSi the set of the nodes that are
inside the radio range of node i.
The Forwarding Candidate set of Node i: a set of nodes that
belong to the NSi nearer to the destination. Further, the
neighbor set depends on the radio range whereas the
forwarding set of nodes depends on the destination also.
Relay Speed: it is defined as dividing the distance from the
next hop by the estimated delay to forward a packet.
Based on the below discussed rules the SNGF routes the
packets by considering the destination and the FS:
1) SPEED divides the neighbor nodes inside the FSi into two
parts. Firstly the nodes having the relay speed larger than a
desired speed Ssetpoint, the other one in which nodes that
cannot sustain the desired speed.
2) Packets are to be transmitted to the only nodes that belong
to the FSi and if there is no node present in the FSi, packet is
dropped and the backpressure rerouting is applied.
3) The forwarding node is to be selected from the first group
and the highest relay speed node is to be chosen as the
forwarding node.
3.5. Neighborhood feedback loop (NFL)
The NFL is the important component in maintaining the
single hop relay speed. It maintains system performance at a
desired value. Ssetpoint and a drop are extremely essential to
maintain the single hop delay. Such scheme ensures that re-
routing has a advanced precedence than dropping. In other
words, SPEED will not drop a packet as long as there is
another path that can meet the delay requirements [6].
3.6. Back-pressure rerouting
Backpressure rerouting is used in a network to reduce the
congestion, it is network layer adaptation used by SPEED. In
this case there is no packet loss. Network layer adaptation has
a higher priority than MAC layer. MAC adaptation is used by
SNGF and NFL. When the situation becomes so congested a
drop via the feedback loop is necessary and there is no other
substitute to maintaining a single hop speed other than
dropping packets. In this case, the neighborhood feedback
loop is activated to assist backpressure re-routing.
3.7. Last Mile Process
SPEED protocol is only care about the location of the sensor
data where it is generated. Since SPEED is targeted at sensor
networks where the ID of a sensor node is not important. It is
known as the last mile process because it will only be
activated when the packet enters into the destination area.
The SNGF module aforementioned controls all previous
packet relays. It provides two novel services that fit the set-
up of sensor networks: Area-anycast and Area-multicast. The
area in this case is defined by a radius and the centerpoint
(x,y,z), in essence a sphere. More complex area definitions
can be made without design of this last mile process [7].
In case of an anycast packet, the nodes inside the destination
area will deliver the packet to the transport layer without
relaying it onward. In a multicast packet, the nodes of the
destination area which first receive the packet coming from
the outside of the destination area will set a TTL. This setting
up of TTL allows the packet to survive within the diameter of
the destination area and be broadcast within a specified
radius. Other nodes of the destination area will keep a copy
of the packet and re-broadcast it. The nodes outside the
4. International Journal of Research in Advent Technology, Vol.3, No.6, June 2015
E-ISSN: 2321-9637
66
destination area will pay no attention to it. For unicast the last
mile process is nearly the same as multicast, except in unicast
the node is having the global_ID and with the help of the
global_ID the node will deliver the packet to the transport
layer.
4. RESULTS AND DISCUSSION
In this paper SPEED protocol is simulated by using
MATLAB. In our evaluation, we present the following set of
results: 1) miss ratio, 2) energy consumption 3) delay, 4)
throughput, 5) packet delivery ratio.
4.1. Miss ratio calculation
The miss ratio is the most important metrics in the soft real-
time systems. They set the desired delivery speed as Ssetpoint in
the particular network.
Fig. 2 Miss Ratio calculation with SPEED protocol
When the relay speed will be less than the Ssetpoint. The miss
ratio of packets in the network starts increasing it is because
when a large number of packets are transmitting from the
source to the destination node through the various in between
nodes of the network, some packets are lost due to congestion
or forced drops. This dropping of packets is to be considered
as the miss packets [8]. Figure 2 shows the miss ratio is in the
network with the deployment of the nodes and in SPEED
protocol the miss ratio percentage is not much high.
4.2. Energy consumption
The average energy consumption is the average of the energy
consumed by the nodes participating in the transfer of data
packets from the source node to the sink node. In the SPEED
protocol, delay and relay speed are two important parameters
in routing decisions. The nodes on special paths that have the
least delay and the most relay speed die sooner than the
others. As demonstrated in Figure 3 and Figure 4, by
balancing the energy consumption on nodes, the network will
be partitioned later and the network can be used longer.
SPEED has slightly higher energy consumption.
Fig. 3 Energy consumption with SPEED protocol
And the fluctuations in the energy consumption are there
because of the heavy congestion in the network [8]. And to
pass the data packets from that particular node there is a high
value of energy consumption and if the needed energy is not
provided then there is dropping of packets in the network and
it will decrease the efficiency of the whole network.
Fig. 4 Energy consumption with SPEED protocol
5. International Journal of Research in Advent Technology, Vol.3, No.6, June 2015
E-ISSN: 2321-9637
67
4.3. END to END delay
Delay is one important parameter for the real time traffic,
which always must be considered. SPEED protocol
guarantees end-to-end delay for the real time traffic. The end
to end delay is defined as the time required transferring data
successfully from the source node to the sink node. When the
time used to transmit data is more than the actual time needed
it is because of the delay. When node density is high and
bandwidth is scarce, traffic hot spots are easily created. In
turn, such hot spots may interfere with real-time guarantees
of critical traffic in the network [8]. In SPEED, a combined
network and MAC layer congestion control scheme is
applied to alleviate this problem. Here the figure 5 shows the
delay in the network due to congestion.
dend-end= N[ dtrans+dprop+dproc]
Where
dend-end= end-to-end delay
dtrans= transmission delay
dprop= propagation delay
dproc= processing delay
dqueue= Queuing delay
N= number of links (Number of routers + 1)
Fig. 5 END to END Delay
4.4. Routing Overhead
Like the energy consumption, the routing overhead is also a
major consideration in the wireless sensor network. In actual,
the routing overhead is defined as the node failure in the
network. The energy will be depleted in special nodes which
will cause the network to be partitioned and some node didn’t
get the energy that they required to forward the data packets and
hence node failure occurred. Figure 6 shows the value of the
routing overhead in the network as the SPEED protocol uses the
backpressure rerouting and delay estimation, so when the
congestion is will occurred it will be determined earlier by
the delay estimation [9]. Because of which there is less
chances of routing overhead in the network.
Fig. 6 Routing Overhead
4.5. Packet delivery ratio
When data is transmitting from the source to the sink node a
high value of packet delivery ratio is needed. The packet
delivery ratio is defined as the number of packets delivered to
the destination node to the number of packets supposed to be
received. Figure 7 shows the number of data packets
delivered to the destination node and SPEED protocol
provides a high delivery ratio [10].
Fig. 7 Packet Delivery Ratio
6. International Journal of Research in Advent Technology, Vol.3, No.6, June 2015
E-ISSN: 2321-9637
68
5. CONCLUSION AND FUTURE SCOPE
In this paper, SPEED protocol concentrates on energy-
efficient routing. The idea is to decrease the energy
consumption and the high packet delivery ratio. Our result on
the basis of MATLAB software shows that the SPEED
maintains a desired delivery speed across the network
through a novel combination of feedback control and non-
deterministic QoS-aware geographic forwarding. This
combination of MAC and network layer adaptation improves
the end to end delay and provides good response to
congestion and voids.
However, a problem should be considered in the SPEED
protocol, furthermore in future, work can be extended that
how assure the successful delivery of the data packets in a
network and enhancement of these parameters. In future the
routing of SPEED protocol can be optimized with the help of
any algorithm to increase the network lifetime, throughput
and other parameters that will meet the real-time applications
needs.
REFERENCES
[1] Bin Li, Hongxiang Li, Wenjie Wang, Qinye Yin, Hui
Liu, “SPEED: A Stateless Protocol for Real-Time
Communication in Sensor Networks”, IEEE transactions
on wireless communications, vol. 12, no. 9, march 2014.
[2] Niculescu D, Nath B,“ Localized positioning in ad hoc
networks”, Journal of Ad Hoc Networks, Special Issue
on Sensor Network Protocols and Applications, 1(2-3)
pp. 211-349, 2003.
[3] Yick J, Mukherjee B, Ghosal D, “Wireless sensor
network Survey”, Computer Networks, 52(12)pp. 2292-
2330, 2008.
[4] Marjan Radi, Behnam Dezfouli, Kamalrulnizam Abu
Bakar, Shukor Abd Razak, Mohammad Ali
Nematbakhsh, “Interference-Aware Multipath Routing
Protocol for QoS Improvement in Event-Driven Wireless
Sensor Networks”, Tsinghua science and technology
Issnll1007 0214ll03/09llpp 475-490 vol. 16, no.5,
october 2011.
[5] Emad Felemban, Chang-Gun Lee, Eylem Ekici,
“MMSPEED: Multipath Multi-SPEED Protocol for QoS
Guarantee of Reliability and Timeliness in Wireless
Sensor Networks”, IEEE transactions on mobile
computing, vol. 5, no. 6, june 2006.
[7] Abhimanyu Dalal, Pawan kumar, “Real Time Routing
Protocols In WSN:A Review”, International Journal of
Advanced Research in Computer Science and Software
Engineering , Vol. 4, Issue 5, May 2014.
[8] Mohammad Sadegh Kordafshari, Azadeh Pourkabirian
Karim Faez, Ali Movaghar Rahimabadi, “Energy-
efficient SPEED Routing Protocol for Wireless Sensor
Networks”, 2009 Fifth Advanced International
Conference on Telecommunications 978-0-7695-3611-
8/09.
[9] S. Saqaeeyan, M. Roshanzadeh, “Improved Multi-Path
and Multi-Speed Routing Protocol in Wireless Sensor
Networks”, I. J. Computer Network and Information
Security, vol. 2, pp. 8-14, 2012.
[10] Yanjun Li, Chung Shue Chen, Ye-Qiong Song, Zhi
Wang and Youxian Sun, “Enhancing Real-Time
Delivery in Wireless Sensor Networks With Two-Hop
Information”, IEEE transactions on industrial
informatics, vol. 5, no. 2, may 2009.