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.
Dynamic Slot Allocation for Improving Traffic Performance in Wireless Sensor ...IRJET Journal
This document proposes a dynamic slot allocation algorithm to improve traffic performance in wireless sensor networks. It aims to reduce energy consumption and improve network lifetime by dynamically allocating channels based on traffic load. The algorithm works as follows:
1. Nodes initialize parameters like queue thresholds and check their congestion level based on queue length, channel utilization, and energy.
2. Based on the congestion level, nodes determine the frequency of transmitting data packets. If congestion is low, no action is taken. If medium, low data transmission is allowed. If high, an alternate path is established.
3. The algorithm also monitors the data packet distribution ratio and dynamically establishes an alternate path if it drops below a threshold, to
Survey on energy efficiency in wireless sensor network using mac protocol wit...Editor Jacotech
Dynamic feature evaluation and concept evaluation is major challenging task in the field of data classification. The continuity of data induced a new feature during classification process, but the classification process is predefined task for assigning data into class. Data comes into multiple feature sub-set format into infinite length. The infinite length not decided the how many class are assigned. Support vector machine is well recognized method for data classification. For the process of support vector machine evaluation of new feature during classification is major problem. The problem of feature evaluation decreases the performance of Support Vector Machine (SVM). For the improvement of support vector machine, particle of swarm optimization technique is used. Particle of swarm optimization controls the dynamic feature evaluation process and decreases the possibility of confusion in selection of class and increase the classification ratio of support vector machine. Particle of swarm optimization work in two phases one used as dynamic population selection and another are used for optimization process of evolved new feature.
we find out various power aware and data packet rate control with-collision-avoidance (CSMA/CA)-based ad hoc wireless network communication. And identifies that CSMA
Wireless sensors networks protocols part 2Rushin Shah
The document discusses routing protocols for wireless sensor networks. It describes why routing protocols are needed in WSNs to efficiently transmit sensor data to data sinks. It outlines several challenges for routing in WSNs, including limited resources, large network scales, dynamic environments, and different data traffic models. The document then examines different routing strategies like proactive, reactive, and hybrid approaches. It also discusses routing techniques that use flat networks, clustering, data-centric approaches, and geographic location-based routing. Flooding and gossiping are presented as common information dissemination techniques with issues like implosion and resource blindness.
The document discusses the performance requirements and fundamentals of medium access control (MAC) protocols for wireless sensor networks. It notes that MAC protocols must regulate access to the shared wireless medium to satisfy application requirements. Key challenges include the distributed nature of sensor networks which prevents nodes from knowing the status of other nodes, requiring a tradeoff between coordination overhead and decision quality. MAC protocols aim to maximize throughput while minimizing delay, and must provide robustness, scalability, and support for deterministic or probabilistic delay guarantees depending on application needs. The physical and MAC layers in the OSI model work to transmit frames over the wireless medium in a coordinated manner.
Higher Throughput Maintenance Using Average Time Standard for Multipath Data ...Eswar Publications
Wireless network has come out as one of the key enablers for reliable data delivery for different types of applications.Ad-hoc
network consists of self-actuated node that collaborates in order to transfer the information.Trajectory-based Statistical
Forwarding (TSF) method used optimal target point selection algorithm to forward packets in order to satisfy probability of
packet delivery over multi-hopbut failed provide higher throughput on the multipath data delivery. TheVoid Aware Pressure Routing (VAPR) method used hop count and intensity information to build a directional data delivery system but
performance of specialized geographic routing based multipath data delivery was not attained. To maintain the higher
throughput level on ad-hoc network data delivery, Median Multicast Throughput Data Delivery (MMTDD) mechanism is
proposed in thispaper.The basic idea of MMTDD mechanism is to divide a message into multiple shares and deliver them via
multiple independent source paths to the destination. MMTDD mechanism with the average time standard takes the best
threshold value for every data (i.e.,) packet partitioning by avoiding packet loss. By this means, MMTDD mechanism uses
the Average Time Standard (ATS) to guarantee the required packet allocationwith higher throughput level. With the application of ATS, the MMTDD mechanism derives the theoretical model by attainingapproximately 4% higher throughput level on the multipath data delivery in ad-hoc network. MMTDD mechanism makes use of time scheduling
schemes to discover and maintain data delivery paths with minimal time consumption.Median Multicast in MMTDD
mechanism used the balanced state flow model to deliver data on multiple paths and experiment is conducted on factors such
as time consumption, data delivery rate,average delivery delay and throughput level.
Survey and Analysis of Medium Access Control Protocols for Wireless Sensor Ne...IOSR Journals
This document summarizes and compares four medium access control (MAC) protocols for wireless sensor networks: T-MAC, B-MAC, S-MAC, and DSMAC. It discusses the key constraints and characteristics of wireless sensor networks that impact MAC protocol design, including limited energy resources. For each protocol, it describes the protocol's operation, analyzes its power consumption and latency performance, and compares the protocols. It finds that T-MAC is more energy efficient than S-MAC due to its adaptive active period, but S-MAC has lower latency. DSMAC achieves lower power consumption than B-MAC through adaptive duty cycling.
Energy-efficient MAC protocols for wireless sensor networks: a surveyTELKOMNIKA JOURNAL
MAC Protocols enables sensor nodes of the same WSN to access a common shared
communication channel. Many researchers have proposed different solutions explaining how to design and
implement these protocols. The main goal of most MACs protocols is how to prolong lifetime of the WSN
as long as possible by reducing energy consumption since it is often impossible to change or to recharge
sensors’ batteries. The majority of these protocols designed for WSN are based on “duty-cycle” technique.
Every node of the WSN operates on two periods: active period and sleep period to save energy. Until now
(to our knowledge) there is no ideal protocol for this purpose. The main reason relies on the lack of
standardization at lower layers (physical layer) and (physical) sensor hardware. Therefore, the MAC
protocol choice remains application-dependent. A useful MAC protocol should be able to adapt to network
changes (topology, nodes density and network size). This paper surveys MAC protocols for WSNs and
discusses the main characteristics, advantages and disadvantages of currently popular protocols.
Dynamic Slot Allocation for Improving Traffic Performance in Wireless Sensor ...IRJET Journal
This document proposes a dynamic slot allocation algorithm to improve traffic performance in wireless sensor networks. It aims to reduce energy consumption and improve network lifetime by dynamically allocating channels based on traffic load. The algorithm works as follows:
1. Nodes initialize parameters like queue thresholds and check their congestion level based on queue length, channel utilization, and energy.
2. Based on the congestion level, nodes determine the frequency of transmitting data packets. If congestion is low, no action is taken. If medium, low data transmission is allowed. If high, an alternate path is established.
3. The algorithm also monitors the data packet distribution ratio and dynamically establishes an alternate path if it drops below a threshold, to
Survey on energy efficiency in wireless sensor network using mac protocol wit...Editor Jacotech
Dynamic feature evaluation and concept evaluation is major challenging task in the field of data classification. The continuity of data induced a new feature during classification process, but the classification process is predefined task for assigning data into class. Data comes into multiple feature sub-set format into infinite length. The infinite length not decided the how many class are assigned. Support vector machine is well recognized method for data classification. For the process of support vector machine evaluation of new feature during classification is major problem. The problem of feature evaluation decreases the performance of Support Vector Machine (SVM). For the improvement of support vector machine, particle of swarm optimization technique is used. Particle of swarm optimization controls the dynamic feature evaluation process and decreases the possibility of confusion in selection of class and increase the classification ratio of support vector machine. Particle of swarm optimization work in two phases one used as dynamic population selection and another are used for optimization process of evolved new feature.
we find out various power aware and data packet rate control with-collision-avoidance (CSMA/CA)-based ad hoc wireless network communication. And identifies that CSMA
Wireless sensors networks protocols part 2Rushin Shah
The document discusses routing protocols for wireless sensor networks. It describes why routing protocols are needed in WSNs to efficiently transmit sensor data to data sinks. It outlines several challenges for routing in WSNs, including limited resources, large network scales, dynamic environments, and different data traffic models. The document then examines different routing strategies like proactive, reactive, and hybrid approaches. It also discusses routing techniques that use flat networks, clustering, data-centric approaches, and geographic location-based routing. Flooding and gossiping are presented as common information dissemination techniques with issues like implosion and resource blindness.
The document discusses the performance requirements and fundamentals of medium access control (MAC) protocols for wireless sensor networks. It notes that MAC protocols must regulate access to the shared wireless medium to satisfy application requirements. Key challenges include the distributed nature of sensor networks which prevents nodes from knowing the status of other nodes, requiring a tradeoff between coordination overhead and decision quality. MAC protocols aim to maximize throughput while minimizing delay, and must provide robustness, scalability, and support for deterministic or probabilistic delay guarantees depending on application needs. The physical and MAC layers in the OSI model work to transmit frames over the wireless medium in a coordinated manner.
Higher Throughput Maintenance Using Average Time Standard for Multipath Data ...Eswar Publications
Wireless network has come out as one of the key enablers for reliable data delivery for different types of applications.Ad-hoc
network consists of self-actuated node that collaborates in order to transfer the information.Trajectory-based Statistical
Forwarding (TSF) method used optimal target point selection algorithm to forward packets in order to satisfy probability of
packet delivery over multi-hopbut failed provide higher throughput on the multipath data delivery. TheVoid Aware Pressure Routing (VAPR) method used hop count and intensity information to build a directional data delivery system but
performance of specialized geographic routing based multipath data delivery was not attained. To maintain the higher
throughput level on ad-hoc network data delivery, Median Multicast Throughput Data Delivery (MMTDD) mechanism is
proposed in thispaper.The basic idea of MMTDD mechanism is to divide a message into multiple shares and deliver them via
multiple independent source paths to the destination. MMTDD mechanism with the average time standard takes the best
threshold value for every data (i.e.,) packet partitioning by avoiding packet loss. By this means, MMTDD mechanism uses
the Average Time Standard (ATS) to guarantee the required packet allocationwith higher throughput level. With the application of ATS, the MMTDD mechanism derives the theoretical model by attainingapproximately 4% higher throughput level on the multipath data delivery in ad-hoc network. MMTDD mechanism makes use of time scheduling
schemes to discover and maintain data delivery paths with minimal time consumption.Median Multicast in MMTDD
mechanism used the balanced state flow model to deliver data on multiple paths and experiment is conducted on factors such
as time consumption, data delivery rate,average delivery delay and throughput level.
Survey and Analysis of Medium Access Control Protocols for Wireless Sensor Ne...IOSR Journals
This document summarizes and compares four medium access control (MAC) protocols for wireless sensor networks: T-MAC, B-MAC, S-MAC, and DSMAC. It discusses the key constraints and characteristics of wireless sensor networks that impact MAC protocol design, including limited energy resources. For each protocol, it describes the protocol's operation, analyzes its power consumption and latency performance, and compares the protocols. It finds that T-MAC is more energy efficient than S-MAC due to its adaptive active period, but S-MAC has lower latency. DSMAC achieves lower power consumption than B-MAC through adaptive duty cycling.
Energy-efficient MAC protocols for wireless sensor networks: a surveyTELKOMNIKA JOURNAL
MAC Protocols enables sensor nodes of the same WSN to access a common shared
communication channel. Many researchers have proposed different solutions explaining how to design and
implement these protocols. The main goal of most MACs protocols is how to prolong lifetime of the WSN
as long as possible by reducing energy consumption since it is often impossible to change or to recharge
sensors’ batteries. The majority of these protocols designed for WSN are based on “duty-cycle” technique.
Every node of the WSN operates on two periods: active period and sleep period to save energy. Until now
(to our knowledge) there is no ideal protocol for this purpose. The main reason relies on the lack of
standardization at lower layers (physical layer) and (physical) sensor hardware. Therefore, the MAC
protocol choice remains application-dependent. A useful MAC protocol should be able to adapt to network
changes (topology, nodes density and network size). This paper surveys MAC protocols for WSNs and
discusses the main characteristics, advantages and disadvantages of currently popular protocols.
Investigation of Clock Synchronization Techniques and its Performance Impact ...ijctet
This document summarizes research on clock synchronization techniques in mobile ad hoc networks (MANETs). It begins by defining MANETs and explaining why time synchronization is important. It then discusses challenges in time synchronization due to clock imperfections and variable network delays. The document reviews existing clock synchronization methods like burst transmission and clock sampling. It also covers characteristics of MANETs like dynamic topology. Finally, it surveys previous research on time synchronization algorithms for MANETs, including a decentralized algorithm that achieves fast convergence times and high accuracy.
Distributed Operation
Synchronization
Hidden Terminals
Exposed terminals
Throughput
Access delay
Fairness
Real-time Traffic support
Resource reservation
Ability to measure resource availability
Capability for power control
Adaptive rate control
Use of directional antennas
A Cross Layer Based Scalable Channel Slot Re-Utilization Technique for Wirele...csandit
Due to tremendous growth of the wireless based application services are increasing the demand
for wireless communication techniques that use bandwidth more effectively. Channel slot reutilization
in multi-radio wireless mesh networks is a very challenging problem. WMNs have
been adopted as back haul to connect various networks such as Wi-Fi (802.11), WI-MAX
(802.16e) etc. to the internet. The slot re-utilization technique proposed so far suffer due to high
collision due to improper channel slot usage approximation error. To overcome this here the
author propose the cross layer optimization technique by designing a device classification
based channel slot re-utilization routing strategy which considers the channel slot and node
information from various layers and use some of these parameters to approximate the risk
involve in channel slot re-utilization in order to improve the QoS of the network. The simulation
and analytical results show the effectiveness of our proposed approach in term of channel slot
re-utilization efficiency and thus helps in reducing latency for data transmission and reduce
channel slot collision.
Control aspects in Wireless sensor networks Rushin Shah
The document discusses various aspects of control in wireless sensor networks (WSNs), including admission control, connection control, power control, baud rate control, congestion control, and quality of service (QoS) control. It then focuses on predictive congestion control for WSNs, describing how it aims to minimize queue overflow and regulate incoming traffic flow by taking into account predicted outgoing flow rates, wireless link states, and queue utilization levels. Finally, the document covers energy harvesting in WSNs, how ambient energy sources can be captured and stored to power sensor nodes indefinitely without relying on batteries.
Localization & management of sensor networksRushin Shah
The document discusses network management for wireless sensor networks. It describes the need for network management due to faults, optimization of performance, and analyzing user behavior. It also outlines some key requirements and design issues for network management in WSNs, including the need for adaptive and resource-efficient algorithms. Finally, it discusses using aspects of SNMP and TOM as possible approaches for network management in WSNs, noting challenges in directly applying them due to the unique properties of WSNs.
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.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Publishing House
This document summarizes a research paper that proposes using the Leaky Bucket Algorithm to enhance quality of service (QoS) in multi-hop wireless networks delivering constant bit rate (CBR) traffic. The Leaky Bucket Algorithm aims to reduce transmission delay by delivering packets at a constant rate even when packets arrive in bursts. It combines joint congestion control and a scheduling algorithm to not only achieve provable throughput guarantees, but also place explicit upper bounds on the end-to-end delay of each flow. Simulation results show the proposed approach reduces transmission time and improves throughput compared to existing scheduling algorithms that do not consider delay performance.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Journals
Abstract One of the most complicated issues is to measuring the delay performance of end to end nodes in Multi-hop Wireless Networks. The two nodes are communicating via hopping over the multiple wireless links. The fact that is each node has to concentrate not only its own generated traffic, but also relayed one. Observing unfairness particularly for transmissions among nodes that are more than one hop Most of the existing works deals with the joint congestion control and scheduling algorithm, which does not focusing the delay performance. In turn, considering the throughput metric alone although for congestion control flows, throughput is the repeated difficult performance metric Packet delay is also important because practical congestion control protocols need to establish the timeouts for the retransmissions based on the packet delay, such parameters could significantly impact the speed of recovery when loss of packets occurred. The related issues on the delay-performance First, for long flows, the end to end delay may grow in terms of square with based on the number of hops. Second, it is difficult to control the end-to-end delay of each flows. TDMA schedules the transmissions in a fair way, in terms of throughput per connection, considering the communication requirements of the active flows of the network. It does not work properly in the multi-hop scenario, because it is generated only for single hop networks, We propose The Leaky Bucket Algorithm, in addition to joint congestion control and scheduling algorithm in multi-hop wireless networks. The proposed algorithm not only achieves the provable throughput and also considering the upper bounds of the delay of each flow. It reduces the transmission time by delivering packets at a constant bit rate even it receives the packet at a busty way. Keywords- Multi-hop wireless networks, congestion control, Performance, Delay, Flow, Throughput.
The document proposes a WFQ-based dynamic bandwidth allocation framework for mobile WiMAX applications. It uses a packet scheduler scheme, call admission policy, and dynamic bandwidth allocation mechanism. Bandwidth is dynamically allocated based on a BVal parameter, which considers fairness, utilization, and delay bound. Packet scheduling is done in two tiers - the first uses EDF, WFQ, WFQ, and RR for different traffic classes, while the second uses WFQ. This architecture aims to provide quality of service support in a fair manner for different traffic types.
Elastic hybrid MAC protocol for wireless sensor networks IJECEIAES
This document summarizes an article that proposes an elastic hybrid medium access control (MAC) protocol for wireless sensor networks. The protocol aims to improve performance for diverse quality of service requirements by dynamically adapting between contention-based CSMA/CA and scheduled TDMA transmission schemes depending on traffic conditions. It allows nodes to transmit using CSMA/CA for low traffic, reserves more slots for TDMA scheduling as traffic increases, and provides an emergency contention-free period at the start of frames for urgent data. Simulation results showed improved performance over typical protocols in terms of queue delay, packet delivery ratio, and frame drops. The proposed elastic hybrid approach aims to balance efficiencies across various QoS metrics by flexibly distributing the transmission strategies in response
Scheduling schemes for carrier aggregation in lte advanced systemseSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
DYNAMIC CURATIVE MECHANISM FOR GEOGRAPHIC ROUTING IN WIRELESS MULTIMEDIA SENS...csandit
Maintaining network stability and extending network lifetime to cope with breaking links and topology changes remain nowadays a unsolved issues in Wireless Multimedia Sensor Networks (WMSNs), which aim to ensure flow delivery while guaranteeing QoS requirements, particularly, during data transmission phase. Therefore, in this paper, we jointly consider multipath transmission, load balancing and fault tolerance, to enhance the reliability of transmitted data. We propose a Dynamic Curative Mechanism for Geographic Routing in WMSNs. Theoricals results and those obtained from simulation study demonstrate the validity and efficiency of our proposed mechanism, and indicate that it is highly advised for multimedia transmission and network stability
A Survey of Various Routing and Channel Assignment Strategies for MR-MC WMNsijsrd.com
One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. A WMN node needs to share a common channel with each of its neighbours in the communication range, requiring it to set up a virtual link. Moreover, to reduce network interference, a node should minimize the number of neighbours that it shares a common channel with. The objective of a channel assignment strategy is to ensure efficient utilization of the available channels (e.g., by minimizing interference) while maximizing connectivity in the network. However, since these two requirements are conflicting with each other, the goal is to achieve a balance between these two. The major constraints which need to be satisfied by a channel assignment scheme include fixed number of channels in the network, limited number of radios in mesh nodes, common channel between two communicating nodes, and limited channel capacity. Also, a channel assignment scheme should take the amount of traffic load supported by each mesh node into consideration.
Efficient and Fair Bandwidth Allocation AQM Scheme for Wireless NetworksCSCJournals
Heterogeneous Wireless Networks are considered nowadays as one of the potential areas in research and development. The traffic management’s schemes that have been used at the fusion points between the different wireless networks are classical and conventional. This paper is focused on developing a novel scheme to overcome the problem of traffic congestion in the fusion point router interconnected the heterogeneous wireless networks. The paper proposed an EF-AQM algorithm which provides an efficient and fair allocation of bandwidth among different established flows. Finally, the proposed scheme developed, tested and validated through a set of experiments to demonstrate the relative merits and capabilities of a proposed scheme
Handover Behaviour of Transparent Relay in WiMAX NetworksIDES Editor
The knowledge on handover behaviour in WiMAX
network is essential for network management and planning
in order to achieve optimum system throughput. In this paper
we have analysed the handover behaviour of transparent relay
in several configurations for the IEEE 802.16j Mobile Multihop
Relay (MMR) WiMAX network. The simulation was
performed using NCTUns tool and adopted the hard handover
mechanism for three different relay network topologies with
varying mobile station speeds. The result shows the handover
for internal network is faster than the external network and
by appropriate relay deployment the system throughput can
be increased up to 14.39%.
Quality of Service in bandwidth adapted hybrid UMTS/WLAN interworking networkTELKOMNIKA JOURNAL
Integration of Universal Mobile Telecommunications System (UMTS) and Wireless Local Area Network (WLAN) result in ubiquitous connection for end users. In the integrated network, ensuring the quality of service to users and enhancing capacity of network are prominent issues. Bandwidth adaptation technique is one of the solutions to overcome these issues. Bandwidth adaptation based on per flow and per class schemes were proposed for loosely coupled interworking network. In this paper, hybrid coupled UMTS and WLAN interworking network is analyzed with bandwidth adaptation based on per flow and per class schemes and the performances have been compared. Simulation result shows that the proposed hybrid coupled interworking network with bandwidth adaptation based on per class scheme performs better with enhanced quality of service and network capacity.
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
.
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.
Optical network is an emerging technology for data communication
inworldwide. The information is transmitted from the source to destination
through the fiber optics. All optical network (AON) provides good
transmission transparency, good expandability, large bandwidth, lower bit
error rate (BER), and high processing speed. Link failure and node failure
haveconsistently occurred in the traditional methods. In order to overcome
the above mentioned issues, this paper proposes a robust software defined
switching enabled fault localization framework (SDSFLF) to monitor the
node and link failure in an AON. In this work, a novel faulty node
localization (FNL) algorithm is exploited to locate the faulty node. Then, the
software defined faulty link detection (SDFLD) algorithm that addresses the
problem of link failure. The failures are localized in multi traffic stream
(MTS) and multi agent system (MAS). Thus, the throughput is improved in
SDSFLF compared than other existing methods like traditional routing and
wavelength assignment (RWA), simulated annealing (SA) algorithm, attackaware RWA (A-RWA) convex, longest path first (LPF) ordering, and
biggest source-destination node degree (BND) ordering. The performance of
the proposed algorithm is evaluated in terms of network load, wavelength
utilization, packet loss rate, and burst loss rate. Hence, proposed SDSFLF
assures that high performance is achieved than other traditional techniques.
PERFORMANCE ANALYSIS OF CHANNEL ACCESS MODEL FOR MAC IN RANDOMLY DISTRIBUTED ...IJCNCJournal
Medium Access control (MAC) is one of the fundamental problems in wireless sensor networks. The performance of wireless sensor network depends on it. The main objective of a medium access control method is to provide high throughput, minimize the delay, and conservers the energy consumption by avoiding the collisions. In this paper, a general model for MAC protocol to reduce the delay, maximize throughput and conserve the energy consumption in channel accessing in high density randomly distributed wireless sensor network is presented. The proposed model is simulated using MATLAB. The simulation results show that the average delay for sensors with sufficient memory is lower than sensors without
memory. Further, the throughput of the channel access method with memory is better than without memory.
Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNsijsrd.com
The multi-hop routing in wireless sensor networks (WSNs) offers little protection against identity deception through replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating attacks against the routing protocols, including sinkhole attacks, wormhole attacks and Sybil attacks. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multi-hop routing, we have designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TARF provides trustworthy and energy-efficient route. Most importantly, TARF proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF-shielding network conditions. Further, we have implemented a low-overhead TARF module in Tiny OS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TARF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an anti-detection mechanism.
Investigation of Clock Synchronization Techniques and its Performance Impact ...ijctet
This document summarizes research on clock synchronization techniques in mobile ad hoc networks (MANETs). It begins by defining MANETs and explaining why time synchronization is important. It then discusses challenges in time synchronization due to clock imperfections and variable network delays. The document reviews existing clock synchronization methods like burst transmission and clock sampling. It also covers characteristics of MANETs like dynamic topology. Finally, it surveys previous research on time synchronization algorithms for MANETs, including a decentralized algorithm that achieves fast convergence times and high accuracy.
Distributed Operation
Synchronization
Hidden Terminals
Exposed terminals
Throughput
Access delay
Fairness
Real-time Traffic support
Resource reservation
Ability to measure resource availability
Capability for power control
Adaptive rate control
Use of directional antennas
A Cross Layer Based Scalable Channel Slot Re-Utilization Technique for Wirele...csandit
Due to tremendous growth of the wireless based application services are increasing the demand
for wireless communication techniques that use bandwidth more effectively. Channel slot reutilization
in multi-radio wireless mesh networks is a very challenging problem. WMNs have
been adopted as back haul to connect various networks such as Wi-Fi (802.11), WI-MAX
(802.16e) etc. to the internet. The slot re-utilization technique proposed so far suffer due to high
collision due to improper channel slot usage approximation error. To overcome this here the
author propose the cross layer optimization technique by designing a device classification
based channel slot re-utilization routing strategy which considers the channel slot and node
information from various layers and use some of these parameters to approximate the risk
involve in channel slot re-utilization in order to improve the QoS of the network. The simulation
and analytical results show the effectiveness of our proposed approach in term of channel slot
re-utilization efficiency and thus helps in reducing latency for data transmission and reduce
channel slot collision.
Control aspects in Wireless sensor networks Rushin Shah
The document discusses various aspects of control in wireless sensor networks (WSNs), including admission control, connection control, power control, baud rate control, congestion control, and quality of service (QoS) control. It then focuses on predictive congestion control for WSNs, describing how it aims to minimize queue overflow and regulate incoming traffic flow by taking into account predicted outgoing flow rates, wireless link states, and queue utilization levels. Finally, the document covers energy harvesting in WSNs, how ambient energy sources can be captured and stored to power sensor nodes indefinitely without relying on batteries.
Localization & management of sensor networksRushin Shah
The document discusses network management for wireless sensor networks. It describes the need for network management due to faults, optimization of performance, and analyzing user behavior. It also outlines some key requirements and design issues for network management in WSNs, including the need for adaptive and resource-efficient algorithms. Finally, it discusses using aspects of SNMP and TOM as possible approaches for network management in WSNs, noting challenges in directly applying them due to the unique properties of WSNs.
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.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Publishing House
This document summarizes a research paper that proposes using the Leaky Bucket Algorithm to enhance quality of service (QoS) in multi-hop wireless networks delivering constant bit rate (CBR) traffic. The Leaky Bucket Algorithm aims to reduce transmission delay by delivering packets at a constant rate even when packets arrive in bursts. It combines joint congestion control and a scheduling algorithm to not only achieve provable throughput guarantees, but also place explicit upper bounds on the end-to-end delay of each flow. Simulation results show the proposed approach reduces transmission time and improves throughput compared to existing scheduling algorithms that do not consider delay performance.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Journals
Abstract One of the most complicated issues is to measuring the delay performance of end to end nodes in Multi-hop Wireless Networks. The two nodes are communicating via hopping over the multiple wireless links. The fact that is each node has to concentrate not only its own generated traffic, but also relayed one. Observing unfairness particularly for transmissions among nodes that are more than one hop Most of the existing works deals with the joint congestion control and scheduling algorithm, which does not focusing the delay performance. In turn, considering the throughput metric alone although for congestion control flows, throughput is the repeated difficult performance metric Packet delay is also important because practical congestion control protocols need to establish the timeouts for the retransmissions based on the packet delay, such parameters could significantly impact the speed of recovery when loss of packets occurred. The related issues on the delay-performance First, for long flows, the end to end delay may grow in terms of square with based on the number of hops. Second, it is difficult to control the end-to-end delay of each flows. TDMA schedules the transmissions in a fair way, in terms of throughput per connection, considering the communication requirements of the active flows of the network. It does not work properly in the multi-hop scenario, because it is generated only for single hop networks, We propose The Leaky Bucket Algorithm, in addition to joint congestion control and scheduling algorithm in multi-hop wireless networks. The proposed algorithm not only achieves the provable throughput and also considering the upper bounds of the delay of each flow. It reduces the transmission time by delivering packets at a constant bit rate even it receives the packet at a busty way. Keywords- Multi-hop wireless networks, congestion control, Performance, Delay, Flow, Throughput.
The document proposes a WFQ-based dynamic bandwidth allocation framework for mobile WiMAX applications. It uses a packet scheduler scheme, call admission policy, and dynamic bandwidth allocation mechanism. Bandwidth is dynamically allocated based on a BVal parameter, which considers fairness, utilization, and delay bound. Packet scheduling is done in two tiers - the first uses EDF, WFQ, WFQ, and RR for different traffic classes, while the second uses WFQ. This architecture aims to provide quality of service support in a fair manner for different traffic types.
Elastic hybrid MAC protocol for wireless sensor networks IJECEIAES
This document summarizes an article that proposes an elastic hybrid medium access control (MAC) protocol for wireless sensor networks. The protocol aims to improve performance for diverse quality of service requirements by dynamically adapting between contention-based CSMA/CA and scheduled TDMA transmission schemes depending on traffic conditions. It allows nodes to transmit using CSMA/CA for low traffic, reserves more slots for TDMA scheduling as traffic increases, and provides an emergency contention-free period at the start of frames for urgent data. Simulation results showed improved performance over typical protocols in terms of queue delay, packet delivery ratio, and frame drops. The proposed elastic hybrid approach aims to balance efficiencies across various QoS metrics by flexibly distributing the transmission strategies in response
Scheduling schemes for carrier aggregation in lte advanced systemseSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
DYNAMIC CURATIVE MECHANISM FOR GEOGRAPHIC ROUTING IN WIRELESS MULTIMEDIA SENS...csandit
Maintaining network stability and extending network lifetime to cope with breaking links and topology changes remain nowadays a unsolved issues in Wireless Multimedia Sensor Networks (WMSNs), which aim to ensure flow delivery while guaranteeing QoS requirements, particularly, during data transmission phase. Therefore, in this paper, we jointly consider multipath transmission, load balancing and fault tolerance, to enhance the reliability of transmitted data. We propose a Dynamic Curative Mechanism for Geographic Routing in WMSNs. Theoricals results and those obtained from simulation study demonstrate the validity and efficiency of our proposed mechanism, and indicate that it is highly advised for multimedia transmission and network stability
A Survey of Various Routing and Channel Assignment Strategies for MR-MC WMNsijsrd.com
One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. A WMN node needs to share a common channel with each of its neighbours in the communication range, requiring it to set up a virtual link. Moreover, to reduce network interference, a node should minimize the number of neighbours that it shares a common channel with. The objective of a channel assignment strategy is to ensure efficient utilization of the available channels (e.g., by minimizing interference) while maximizing connectivity in the network. However, since these two requirements are conflicting with each other, the goal is to achieve a balance between these two. The major constraints which need to be satisfied by a channel assignment scheme include fixed number of channels in the network, limited number of radios in mesh nodes, common channel between two communicating nodes, and limited channel capacity. Also, a channel assignment scheme should take the amount of traffic load supported by each mesh node into consideration.
Efficient and Fair Bandwidth Allocation AQM Scheme for Wireless NetworksCSCJournals
Heterogeneous Wireless Networks are considered nowadays as one of the potential areas in research and development. The traffic management’s schemes that have been used at the fusion points between the different wireless networks are classical and conventional. This paper is focused on developing a novel scheme to overcome the problem of traffic congestion in the fusion point router interconnected the heterogeneous wireless networks. The paper proposed an EF-AQM algorithm which provides an efficient and fair allocation of bandwidth among different established flows. Finally, the proposed scheme developed, tested and validated through a set of experiments to demonstrate the relative merits and capabilities of a proposed scheme
Handover Behaviour of Transparent Relay in WiMAX NetworksIDES Editor
The knowledge on handover behaviour in WiMAX
network is essential for network management and planning
in order to achieve optimum system throughput. In this paper
we have analysed the handover behaviour of transparent relay
in several configurations for the IEEE 802.16j Mobile Multihop
Relay (MMR) WiMAX network. The simulation was
performed using NCTUns tool and adopted the hard handover
mechanism for three different relay network topologies with
varying mobile station speeds. The result shows the handover
for internal network is faster than the external network and
by appropriate relay deployment the system throughput can
be increased up to 14.39%.
Quality of Service in bandwidth adapted hybrid UMTS/WLAN interworking networkTELKOMNIKA JOURNAL
Integration of Universal Mobile Telecommunications System (UMTS) and Wireless Local Area Network (WLAN) result in ubiquitous connection for end users. In the integrated network, ensuring the quality of service to users and enhancing capacity of network are prominent issues. Bandwidth adaptation technique is one of the solutions to overcome these issues. Bandwidth adaptation based on per flow and per class schemes were proposed for loosely coupled interworking network. In this paper, hybrid coupled UMTS and WLAN interworking network is analyzed with bandwidth adaptation based on per flow and per class schemes and the performances have been compared. Simulation result shows that the proposed hybrid coupled interworking network with bandwidth adaptation based on per class scheme performs better with enhanced quality of service and network capacity.
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
.
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.
Optical network is an emerging technology for data communication
inworldwide. The information is transmitted from the source to destination
through the fiber optics. All optical network (AON) provides good
transmission transparency, good expandability, large bandwidth, lower bit
error rate (BER), and high processing speed. Link failure and node failure
haveconsistently occurred in the traditional methods. In order to overcome
the above mentioned issues, this paper proposes a robust software defined
switching enabled fault localization framework (SDSFLF) to monitor the
node and link failure in an AON. In this work, a novel faulty node
localization (FNL) algorithm is exploited to locate the faulty node. Then, the
software defined faulty link detection (SDFLD) algorithm that addresses the
problem of link failure. The failures are localized in multi traffic stream
(MTS) and multi agent system (MAS). Thus, the throughput is improved in
SDSFLF compared than other existing methods like traditional routing and
wavelength assignment (RWA), simulated annealing (SA) algorithm, attackaware RWA (A-RWA) convex, longest path first (LPF) ordering, and
biggest source-destination node degree (BND) ordering. The performance of
the proposed algorithm is evaluated in terms of network load, wavelength
utilization, packet loss rate, and burst loss rate. Hence, proposed SDSFLF
assures that high performance is achieved than other traditional techniques.
PERFORMANCE ANALYSIS OF CHANNEL ACCESS MODEL FOR MAC IN RANDOMLY DISTRIBUTED ...IJCNCJournal
Medium Access control (MAC) is one of the fundamental problems in wireless sensor networks. The performance of wireless sensor network depends on it. The main objective of a medium access control method is to provide high throughput, minimize the delay, and conservers the energy consumption by avoiding the collisions. In this paper, a general model for MAC protocol to reduce the delay, maximize throughput and conserve the energy consumption in channel accessing in high density randomly distributed wireless sensor network is presented. The proposed model is simulated using MATLAB. The simulation results show that the average delay for sensors with sufficient memory is lower than sensors without
memory. Further, the throughput of the channel access method with memory is better than without memory.
Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNsijsrd.com
The multi-hop routing in wireless sensor networks (WSNs) offers little protection against identity deception through replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating attacks against the routing protocols, including sinkhole attacks, wormhole attacks and Sybil attacks. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multi-hop routing, we have designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TARF provides trustworthy and energy-efficient route. Most importantly, TARF proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF-shielding network conditions. Further, we have implemented a low-overhead TARF module in Tiny OS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TARF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an anti-detection mechanism.
Constellation Shared Multiple Access - A Noma Scheme for Increased User Capac...IJCNCJournal
While the legacy cyclic prefix orthogonal frequency division multiple access is retained as the preferred multiple access scheme for 5G enhanced mobile broadband the research is now focussed on the multiple access schemes for massive machine type communication (mMTC) and ultra-reliable low latency communication .Though orthogonal multiple access schemes provide simple reception, they limit number of simultaneous user equipment as against the primary requirement of mMTC. On the other hand, the various non-orthogonal multiple access schemes which have been proposed so far as the likely solution, need complex successive interference cancellation receivers. So a simplified scheme named constellation shared multiple access is proposed here which substantially increases the number of simultaneous users to be served within a single resource block (RB) in LTE or 5G New Radio, thus aiding the massive connectivity requirement of mMTC. This is achieved by differentiating among the users in constellation domain. Moreover, the simple architecture compatible with 5G eMBB makes it a strong contender multiple access contender for 5G mMTC.
CONSTELLATION SHARED MULTIPLE ACCESS - A NOMA SCHEME FOR INCREASED USER CAPAC...IJCNCJournal
While the legacy cyclic prefix orthogonal frequency division multiple access is retained as the preferred
multiple access scheme for 5G enhanced mobile broadband the research is now focussed on the multiple
access schemes for massive machine type communication (mMTC) and ultra-reliable low latency
communication .Though orthogonal multiple access schemes provide simple reception, they limit number
of simultaneous user equipment as against the primary requirement of mMTC. On the other hand, the
various non-orthogonal multiple access schemes which have been proposed so far as the likely solution,
need complex successive interference cancellation receivers. So a simplified scheme named constellation
shared multiple access is proposed here which substantially increases the number of simultaneous users to
be served within a single resource block (RB) in LTE or 5G New Radio, thus aiding the massive
connectivity requirement of mMTC. This is achieved by differentiating among the users in constellation
domain. Moreover, the simple architecture compatible with 5G eMBB makes it a strong contender multiple
access contender for 5G mMTC.
Performance analysis of multilayer multicast MANET CRN based on steiner minim...TELKOMNIKA JOURNAL
In this study, the multicast mobile ad hoc (MANET) CRN has been developed, which involves multi-hop and multilayer consideration and Steiner minimal tree (SMT) algorithm is employed as the router protocol. To enhance the network performance with regards to throughput and packet delivery rate (PDR), as channel assignment scheme, the probability of success (POS) is employed that accounts for the channel availability and the time needed for transmission when selecting the best channel from the numerous available channels for data transmission from the source to all destinations nodes effectively. Within Rayleigh fading channels under various network parameters, a comparison is done for the performance of SMT multicast (MANET) CRN with POS scheme versus maximum data rate (MDR), maximum average spectrum availability (MASA) and random channel assignment schemes. Based on the simulation results, the SMT multicast (MANET) CRN with POS scheme was seen to demonstrate the best performance versus other schemes. Also, the results proved that the throughput and PDR performance are improved as the number the primary channels and the channel’s bandwidth increased while dropped as the value of packet size D increased. The network’s performance grew with rise in the value of idle probability (푃퐼) since the primary user’s (PU) traffic load is low when the value of 푃퐼 is high.
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.
OPTIMIZED ROUTING AND DENIAL OF SERVICE FOR ROBUST TRANSMISSION IN WIRELESS N...IRJET Journal
This document proposes a system to optimize routing and prevent denial of service attacks in wireless networks. It aims to detect distributed denial of service (DDoS) attacks using a classifier system called CS_DDoS that classifies packets as malicious or normal. Malicious packets will be blocked and their IP addresses blacklisted. It also aims to use a hybrid optimization system (HOS) for efficient, quality routing to increase network lifetime and user communication. The system is designed to differentiate between genuine and malicious traffic, transfer data via alternative paths if attacks are detected, and balance network load for stable data transfer while improving packet delivery and throughput.
This document summarizes a research paper on medium access control (MAC) protocols for wireless sensor networks. It discusses how MAC protocols are needed to manage shared access to communication channels in wireless sensor networks and outlines some key characteristics and requirements for efficient MAC protocols, including energy efficiency, scalability, and supporting variable traffic loads. It then reviews some traditional MAC protocols, including time division multiple access (TDMA), frequency division multiple access (FDMA), and code division multiple access (CDMA). The full paper provides a more in-depth survey and comparison of schedule-based and contention-based MAC protocols designed specifically for wireless sensor networks.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
The document describes a new routing protocol called Route Optimization and Load-balancing (ROL) for wireless sensor networks. ROL aims to balance several objectives like prolonging network lifetime, providing timely message delivery, and improving network robustness. It uses a combination of routing metrics that can be configured according to application priorities to optimize overall network performance. Simulation results show that ROL maintains balanced cluster sizes and populations, reduces overhead, end-to-end delays, and improves data delivery ratios compared to other protocols like Mires++.
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.
Quick Routing for Communication in MANET using Zone Routing Protocolijceronline
rnational Journal of Computational Engineering Resaerch 2014, Volume 4 ~ Issue 11 (November 2014)
Abstract
The paper discusses the voltage control of a critical load bus using dynamic voltage restorer (DVR) in a distribution system. The critical load requires a balanced sinusoidal waveform across its terminals preferably at system nominal frequency of 50Hz .It is assumed that the frequency of the supply voltage can be varied and it is different from the system nominal frequency. The DVR is operated such that it holds the voltage across critical load bus terminals constant at system nominal frequency irrespective of the frequency of the source voltage. In case of a frequency mismatch, the total real power requirement of the critical load bus has to be supplied by the DVR. Proposed method used to compensate for frequency variation, the DC link of the DVR is supplied through an uncontrolled rectifier that provides a path for the real power required by the critical load to flow .A simple frequency estimation technique is discussed which are Discrete Fourier transform (DFT), ANN controller. The present work study the compensation principle and different control strategies of DVR used here are based on DFT, and ANN Controller .Through detailed analysis and simulation studies using MATLAB. It is shown that the voltage is completely controlled across the critical load.
A CROSS-LAYER BASED SCALABLE CHANNEL SLOT RE-UTILIZATION TECHNIQUE FOR WIRELE...cscpconf
Due to tremendous growth of the wireless based application services are increasing the demand for wireless communication techniques that use bandwidth more effectively. Channel slot reutilization in multi-radio wireless mesh networks is a very challenging problem. WMNs have been adopted as back haul to connect various networks such as Wi-Fi (802.11), WI-MAX (802.16e) etc. to the internet. The slot re-utilization technique proposed so far suffer due to high collision due to improper channel slot usage approximation error. To overcome this here the author propose the cross layer optimization technique by designing a device classification based channel slot re-utilization routing strategy which considers the channel slot and node information from various layers and use some of these parameters to approximate the risk involve in channel slot re-utilization in order to improve the QoS of the network. The simulation and analytical results show the effectiveness of our proposed approach in term of channel slot re-utilization efficiency and thus helps in reducing latency for data transmission and reduce
channel slot collision.
The document discusses the Minimum Cost Forwarding (MCF) routing protocol for wireless sensor networks. MCF establishes optimal routing paths with few message exchanges and is scalable and simple to implement. The authors formally model MCF as timed automata and use model checking to verify its properties. Their analysis identified weaknesses in MCF concerning equal-cost paths and node failures. The authors present improvements to address deficiencies in the original MCF protocol.
The Minimum Cost Forwarding Using MAC Protocol for Wireless Sensor NetworksIJMER
The document discusses the Minimum Cost Forwarding (MCF) routing protocol for wireless sensor networks. MCF establishes optimal routing paths with few message exchanges and is scalable and simple to implement. The authors formally model MCF as timed automata and use model checking to verify its properties. Their analysis identified weaknesses in MCF concerning equal-cost paths and node failures. The authors present improvements to address deficiencies in the original MCF protocol.
Design of optimal system level for embedded wireless sensor unitIAEME Publication
This document describes the design of an optimal wireless sensor unit system for embedded applications. It presents an architecture that allows for flexible and efficient implementation of communication protocols to optimize performance under power constraints. The key aspects of the design include a central microcontroller connected to an RF transceiver, secondary storage, sensors, and power management. Hardware accelerators are used alongside the microcontroller to improve protocol efficiency while maintaining flexibility. The system is evaluated through implementation of sample communication protocols and demonstrations of system-level optimizations, such as a protocol that reduces receiver power consumption by 90% through preamble-based transmission.
A REAL TIME PRIORITY BASED SCHEDULER FOR LOW RATE WIRELESS SENSOR NETWORKSIJCNCJournal
This document summarizes a research paper that proposes a new priority-based scheduling algorithm called RTPS for low data rate wireless sensor networks. RTPS aims to prioritize time-sensitive data over regular monitoring data by dynamically assigning priority weights to packets based on hop count and propagation time. It evaluates packets in priority queues at router nodes and updates their reporting rates to prevent congestion. The algorithm differentiates traffic into priority levels and allows flexible retransmission of priority flows to reduce delays and energy usage compared to traditional approaches. Testbed results showed RTPS improved data reporting for time-critical applications over multiple topologies.
Introduction of Cybersecurity with OSS at Code Europe 2024Hiroshi SHIBATA
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
OpenID AuthZEN Interop Read Out - AuthorizationDavid Brossard
During Identiverse 2024 and EIC 2024, members of the OpenID AuthZEN WG got together and demoed their authorization endpoints conforming to the AuthZEN API
Generating privacy-protected synthetic data using Secludy and MilvusZilliz
During this demo, the founders of Secludy will demonstrate how their system utilizes Milvus to store and manipulate embeddings for generating privacy-protected synthetic data. Their approach not only maintains the confidentiality of the original data but also enhances the utility and scalability of LLMs under privacy constraints. Attendees, including machine learning engineers, data scientists, and data managers, will witness first-hand how Secludy's integration with Milvus empowers organizations to harness the power of LLMs securely and efficiently.
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slackshyamraj55
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
Taking AI to the Next Level in Manufacturing.pdfssuserfac0301
Read Taking AI to the Next Level in Manufacturing to gain insights on AI adoption in the manufacturing industry, such as:
1. How quickly AI is being implemented in manufacturing.
2. Which barriers stand in the way of AI adoption.
3. How data quality and governance form the backbone of AI.
4. Organizational processes and structures that may inhibit effective AI adoption.
6. Ideas and approaches to help build your organization's AI strategy.
Ocean lotus Threat actors project by John Sitima 2024 (1).pptxSitimaJohn
Ocean Lotus cyber threat actors represent a sophisticated, persistent, and politically motivated group that poses a significant risk to organizations and individuals in the Southeast Asian region. Their continuous evolution and adaptability underscore the need for robust cybersecurity measures and international cooperation to identify and mitigate the threats posed by such advanced persistent threat groups.
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdfChart Kalyan
A Mix Chart displays historical data of numbers in a graphical or tabular form. The Kalyan Rajdhani Mix Chart specifically shows the results of a sequence of numbers over different periods.
Salesforce Integration for Bonterra Impact Management (fka Social Solutions A...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on integration of Salesforce with Bonterra Impact Management.
Interested in deploying an integration with Salesforce for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
Fueling AI with Great Data with Airbyte WebinarZilliz
This talk will focus on how to collect data from a variety of sources, leveraging this data for RAG and other GenAI use cases, and finally charting your course to productionalization.
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
5th LF Energy Power Grid Model Meet-up SlidesDanBrown980551
5th Power Grid Model Meet-up
It is with great pleasure that we extend to you an invitation to the 5th Power Grid Model Meet-up, scheduled for 6th June 2024. This event will adopt a hybrid format, allowing participants to join us either through an online Mircosoft Teams session or in person at TU/e located at Den Dolech 2, Eindhoven, Netherlands. The meet-up will be hosted by Eindhoven University of Technology (TU/e), a research university specializing in engineering science & technology.
Power Grid Model
The global energy transition is placing new and unprecedented demands on Distribution System Operators (DSOs). Alongside upgrades to grid capacity, processes such as digitization, capacity optimization, and congestion management are becoming vital for delivering reliable services.
Power Grid Model is an open source project from Linux Foundation Energy and provides a calculation engine that is increasingly essential for DSOs. It offers a standards-based foundation enabling real-time power systems analysis, simulations of electrical power grids, and sophisticated what-if analysis. In addition, it enables in-depth studies and analysis of the electrical power grid’s behavior and performance. This comprehensive model incorporates essential factors such as power generation capacity, electrical losses, voltage levels, power flows, and system stability.
Power Grid Model is currently being applied in a wide variety of use cases, including grid planning, expansion, reliability, and congestion studies. It can also help in analyzing the impact of renewable energy integration, assessing the effects of disturbances or faults, and developing strategies for grid control and optimization.
What to expect
For the upcoming meetup we are organizing, we have an exciting lineup of activities planned:
-Insightful presentations covering two practical applications of the Power Grid Model.
-An update on the latest advancements in Power Grid -Model technology during the first and second quarters of 2024.
-An interactive brainstorming session to discuss and propose new feature requests.
-An opportunity to connect with fellow Power Grid Model enthusiasts and users.
1. Mrs. S. Jeevitha / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.2147-2152
2147 | P a g e
Variable Workload Scheduling With Increased Throughput in
Wireless Sensor Networks
Mrs. S. Jeevitha
M.E Software Engineering, Mount Zion College of Engineering and Technology, Pudukkottai, Tamilnadu, India
Abstract
Wireless sensor networks are appealing to
researchers due to their wide range of application
potential in areas such as target detection and
tracking, environmental monitoring, industrial
process monitoring, and tactical systems. Existing
approaches are insufficient for developers to
determine whether system's requirements concern
the communication latency, bandwidth utilization,
reliability, or energy consumption. Since the data
of sensors are expressed in form of expressive
queries, the performance of query services should
be increased especially for high data rate sensor
network applications. In this paper it is decided to
propose Real Time Conflict-free Query
Scheduling (RTCQS), an enhanced transmission
scheduling technique for real time queries in
wireless sensor networks. The query preemption
algorithm is used to achieve high throughput
while scheduling without preemption is used for
the queries that are able to execute concurrent.
Keywords—Wireless Sensor Networks, throughput,
Scheduling, Interference-Communication graph, Inter
release time
I. INTRODUCTION
Sensor Networks have emerged as one of
the dominant technology trends of decade (2000-
2010) that has potential usage in defense and
scientific applications [1]. A Wireless Sensor
Network' (WSN) can be described as a network of
sensors which communicate with each other
wirelessly. These sensors may be installed in an
unattended environment with limited computation
and sensing capabilities. A typical node in the WSN
consists of a sensor, embedded processor, moderate
amount of memory and transmitter/receiver circuitry.
These sensor nodes are normally battery powered and
they coordinate among themselves to perform a
common task [2]. The ability to communicate not
only allows information and control to be
communicated across the network of nodes, but
nodes to cooperate in performing more complex
tasks, like statistical sampling, data aggregation, and
system health and status monitoring [3,4].
A. Wireless Sensor Network Protocol Stack
The communication architecture of a
wireless sensor network, implemented by a protocol
stack, is shown in Fig.1 [5] built out of 5 layers and 3
cross-layer planes. Medium access protocols reside in
the Data Link Layer, which itself not only is
responsible for a fair distribution of resources, but
also for providing data stream multiplexing, frame
detection and error control. Parts of these goals are
accomplished by MAC protocols.
The main duties of the medium access
protocol are firstly to assist the construction of a
network infrastructure, and secondly to control the
medium access, so that all sensor nodes in the
network have equal access to the resources and use
them as efficiently as possible[5]. In order to be able
to implement time-slotted MAC protocols, clock
synchronization between the sensor nodes in the
wireless network is an important requirement. This
task can be rendered possible by the Sensor
Management Protocol on the Application Layer.
B. Real Time Applications
Initial applications supported by WSNs were
mostly in environment monitoring, such as
temperature monitoring for a specific area, house
alarming, and so on. The main objectives in such
applications only involved simple data processing.
Energy consumption needed to be considered for
specific applications, so little attention was taken on
data delivery and reliability related issues [6] [7] and
[8]. WSNs have been extended and their design have
been advanced to support more hard design and
complex applications, such as security, military, fire
detection and health care related applications. In these
applications, data delivery and reliability must be
taken as important parameters in addition to energy
efficiency, because data must be collected from the
sources of events and be forwarded to the sink in real
time with high reliability, otherwise the application
will be useless. Some most important design factors
for protocols in WSN that need to be considered while
designing and deploying energy efficient MAC
protocols for any applications are the following:
network topology, type of antenna and clustering
related issues.
Sensor Networks serve many diverse
applications starting from the research on Great Duck
Island (GDI) [1] for monitoring the maine to high data
rate real time structural health monitoring, the query
services requires the improvement of performance in
terms of query throughput and latency. For meeting
this communication need, Real Time Conflict free
query scheduling (RTCQS) is designed as a WSN
2. Mrs. S. Jeevitha / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.2147-2152
2148 | P a g e
protocol which includes the common properties of
WSN query services. It provides the effective
Fig.1 Protocol Stack of WSN
prioritization between traffic classes meeting various
deadlines and supports high throughput since they
generate a very high workload. It is proposed to have
the following properties such as: 1) Adapting the
query schedule for every workload change 2)
Achieving a high throughput and low latency 3)
Ability to work on resource constrain devices 4)
Predictability in query rate and power consumption
II. RELATED WORKS
A common Medium Access Control (MAC)
paradigm used in wireless network is Carrier Sense
Multiple Access (CSMA) [9]. It is simple and flexible
not requiring any complex infrastructure, clock
synchronization or global topology. Any CSMA
based medium access scheme has two important
components, the listening mechanism and the backoff
scheme. But it doesn’t work beyond one hop causing
problem called hidden terminal problem which may
leads to degradation of throughput especially in high
data rate sensor application.
Time division multiple access (TDMA) is a
potential candidate for WSNs. It can be defined as the
process of allocating time slots to the nodes or links
between each pair of neighboring nodes, to ensure
collision free channel access. It is most attractive for
high data rate sensor networks because it is energy-
efficient and may provide higher throughput than
CSMA/CA protocols under heavy load. The two types
of scheduling carried out in TDMA are node
scheduling where the scheduler assigns slots to nodes
and link scheduling where slots are assigned to links
through which pairs of nodes communicate. Though it
is efficient than CSMA, it has many disadvantages
making less suitable for use of sensor network [10].
First, finding an efficient time schedule in a scalable
fashion is not trivial. Second TDMA needs clock
synchronization which may incur high energy
overhead because it requires frequent message
exchanges. Third, it is very expensive to handle when
sensor networks undergo frequent topology changes
because of time-varying channel conditions, physical
environmental changes, and battery outage and node
failures. Fourth, during low contention TDMA gives
much lower channel utilization and higher delays than
CSMA In addition it is not suitable for real time
applications with variable workloads as it maintains
an explicit schedule for transmission. Thus the MAC
scheme for sensor network should include a variant of
TDMA [11].
Z-MAC (Zebra MAC) is a hybrid MAC
scheme that combines the ascents of TDMA and
CSMA for sensor networks while offsetting their
descents [12]. The main feature of Z-MAC is its
adaptability to the level of contention in the network.
It is robust to dynamic topology changes and time
synchronization failures commonly occurring in
sensor networks. Z-MAC uses CSMA as the baseline
MAC scheme, but uses a TDMA schedule as a hint to
enhance contention resolution. In Z-MAC, a time slot
assignment is performed at the time of deployment
therefore a higher overhead is incurred at the
beginning. As the maximum slot number is
broadcasted in Z-MAC, security issue is to be taken
into account.
Distributed Randomized TDMA Scheduling
(DRAND) is fully distributed, efficient scalable
channel scheduling algorithm [13]. It is the first
scalable implementation of RAND which is a famous
centralized channel scheduling scheme. DRAND
calculates a TDMA schedule in time linear to the
maximum node degree in form of time slot. After the
slot assignment, each node reuses its assigned slot
periodically in every predetermined period, called
frame. A node assigned to a time slot acts as an owner
of that slot and the others be the non-owners of that
slot. It gives a chance of being more than one owner
per slot. It is useful in scheduling protocols such as Z-
MAC, FDMA, CDMA etc.,
TRaffic-Adaptive Medium Access
(TRAMA) protocol provides energy-efficient conflict
free channel access in wireless sensor networks [14].
Energy efficiency is attained by using the
transmission schedules that avoid collisions of data
packets at the receivers having nodes switch to low
power radio mode when there is no data packets
intended for those nodes. It supports for unicast,
broadcast and multicast traffic and more adaptive for
sensor network and monitoring applications. But it is
not suited for delay sensitive transmission.
Several protocols aim at supporting real-time
communication in multi-hop networks by proposing
real-time transmission scheduling for robots [15].
Both protocols may assume that at least one robot has
complete knowledge of the robots’ positions and
network topology. Though these protocols are suited
for small teams of robots, they are not suitable for
queries in multi-hop WSNs.
3. Mrs. S. Jeevitha / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.2147-2152
2149 | P a g e
In Dynamic Conflict Free Query Scheduling
(DCQS) [16], a transmission scheduling technique for
WSN queries is designed to support variable
workloads and to exploit specific communication
patterns and temporal properties of queries in WSNs.
This allows DCQS to achieve high throughput. But it
does not support query prioritization or real-time
communication.
III. SYSTEM ARCHITECTURE
RTCQS adopts a variant of node/link
scheduling called query scheduling in contrast to
earlier TDMA protocols. In query scheduling, the
time slots are assigned to transmission on specific
communication. This helps to achieve the high
throughput, low power consumption, scalability and
to adopt topology changes.
Fig.2 shows the system architecture of
RTCQS. It mainly aims at executing the real time
queries in efficient manner. For this, it is designed to
use the data aggregation functions such as packet
merging, data compression or stationary function.
Fig.2 System architecture of RTCQS
It may use the packet merging [18] as a default
aggregation function to reduce the energy
consumption and transmits workload. The two
parameters influencing the performance of query
services are throughput and real time capacity. The
former is summation of execution frequencies of all
the queries while the latter is the maximum
throughput for which the query service does not drop
packets and meets the query deadlines.
A. Components.
The two main components used in the
system are query planner and query scheduler. The
query planner decides the transmissions for each
query and scheduler for scheduling the corresponding
plans.
1) Query Planner:
The query planner is responsible for
constructing the plans which is the sequential order of
transmission steps for executing a query instance.
Each step should consist of set of transmissions which
should be free from both the primary and secondary
conflict. Primary conflict is said to occur when one
node transmits and receives at the same time slot or
receives more than one transmission destined to it at
same time slot. Secondary conflict occurs when an
intended receiver of particular transmission is also
within the transmission range of another transmission
intended for other nodes. Conflict free path can be
determined by planning the transmission with help of
Interference Communication (IC) graph.
Let G (V,E) be the IC graph where V are the
set of vertices representing sensor nodes and E are the
set of edges represents the communication edges and
interference edges. The link between the nodes for
packet transmission is termed as the Communication
edges and the link which interrupts the any
communication in time is Interference edge. For
example, PQ and RS are said to be conflict free
if PS and RS are not the edges and P, Q,
R, S are distinct. The realistic method for constructing
the IC graph is Radio Interference Detection (RID)
based on Receiver Signal Strength (RSS) [17]. An
example IC graph is shown in Fig.3
The plan with the steps 0 to 6 is shown for
the example IC graph in Fig.4. In each step the
transmissions assigned are conflict free. For example,
in step 2 the nodes v and p may transmit
simultaneously as their transmission and are
conflict free i.e, they do not conflict with each other
( ). It provides the transmission to satisfy the
precedence constraints such that t and u transmits
before its parent p.
A node may communicate with its one hop
neighbour to construct a plan at local. If the plan
involves more number of hops then the plan is
formulated by a node n with higher priority and sends
PRequest packet. Upon receiving PRequest from node
n it may check for its own one hop neighbour. If no
such node exists the receiver may respond with
PFeedback packet along with its local plan. In next
stage node n disseminates its local plan to its one hop
neighbour using PSend. On receiving the PSend
packet, it acknowledge with PCommit packet. In order
to balance the uneven workload demands across the
Sensor
network
Query
Sensor
network
Sensor nodes
Client
nodes
Base Station
Query Planner
Query Scheduler
Selecting
Conflict Free
path
Constructing the
plan for query
Evaluating Inter-release time
Priority Scheduling of the Query
IC
graph
4. Mrs. S. Jeevitha / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.2147-2152
2150 | P a g e
Fig. 3 IC graph
nodes, the planner would assign multiple steps for
these nodes to transmit to achieve their workload
demand. The minimized transmission plan may
results in reduced latency.
Fig. 4 Constructed Plan for IC graph in Fig.3
2) Query Scheduler:
As the data transmission in WSN makes use
of expressive queries, query scheduling is used to
avoid the wastage of time when the nodes or links are
idle for a period of time. Instead of assigning the time
slot for node or links, slot should be assigned for the
query. The slot is a period of time allotted for
workload on demand. Scheduling should ensure that
all the steps executed are conflict free with the relative
order being preserved.
Each node is having a local scheduler to
schedule the transmission steps. The Scheduler may
contain the start time, period of queries, plan’s length
and min. inter-release time. The min. inter-release
time is defined as the minimum time step between the
subsequent instances of query to be executed.
The algorithm for scheduling without Pre-
emption is used when the two instances of a query is
executed concurrently. The scheduler uses two
different queues called wait and execute queue. The
instance of query waiting to be executed are stored in
wait queue but are not being executed and those
instance to be executed is placed in execute queue.
The min. inter-release time is taken as between any
two instances. When no instances are executed and
the step distance between the head of wait queue and
tail of execute queue is larger than an instance of
query is started.
When an instance starts, it is moved from
wait queue to execute queue. Being simple and
efficient, it is feasible on resource constraint devices.
The operation of determining the starting time of
query instance takes time of O (1). The algorithm for
query pre-emption is used to pre-empt the instance of
query that conflict with the execution of higher
priority instance. The algorithm is shown using
Algorithm1.
begin
new instance i is released
wait = wait i
begin
start a new slot s
for each i in wait
if (may-continue(i) = true) then
continue (i)
for each i execute
run (i)
end
end
continue (i):
execute = execute i;
wait = wait – i add instances to all occurConflict
preempt(S):
execute = execute − S;
wait = wait S;
remove i from all occurConflict
may-continue(i):
if (occurConflict = null) then
return true
if (i has higher priority all instances in
occurConflict)
preempt(occurConflict);
return true
return false
run(i):
determine if node should send/recv
i = i + 1
if i = query length then execute = execute – i
occurConflict = occurConflict – i
occurConflict = occurConflict i
Algorithm1. Query Pre emption Algorithm
Senders
Steps
x y r z s q p
0 u
1 t
2 v p
3 s
4 z
5 r
6 y
y
q z
s
s
x
t
p v
r
u
5. Mrs. S. Jeevitha / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.2147-2152
2151 | P a g e
When the query instance is pre-empted, it
determines whether the query instance to be pre-
empted is conflict with existing instance. It maintains
a wait and execute queue by the priority of instances.
When a new instance is released for execution, it
should be stored in wait queue. It starts/continues an
instance i in two cases: (1) If the next step s+1 may be
executed concurrently with all instances in the execute
queue without conflict, it starts/resumes it. Then it
checks if occurConflict (set having instance conflict
with instance at execution) is empty. When an
instance is started or continued, it is moved from the
wait to execute. (2) i is also started/resumed if it has
higher priority than all the instances in occurConflict.
For i to be executed without conflict, all instances in
occurConflict must be preempted. When an instance
is preempted, it is moved from the wait to the execute
queue and it is removed from all occurConflict sets.
IV. PERFORMANCE EVALUATION
The performance of DRAND is compared
with the performance of the proposed RTCQS system
in terms of query throughput and query latency.
DRAND is a state of art protocol which does not
include any interference relationship among nodes.
Hence the results of it may produce collision. RTCQS
enforces the conflict free transmission and achieves a
high throughput and reduced latency.
Fig. 5 Performance comparison using query
Throughput for DRAND and RTCQS
A) Performance Metric. The query throughput and
query latency of the proposed system is compared
with that of DRAND which are defined as follows:
1) Query Throughput: It is the number of query
instances completed per second. It is expressed in
Hertz (Hz)
2) Query Latency: It is the response time for every
query instance after sending the query request. It is
represented by seconds (s).
B) Results.
Figure 5 shows the performance comparison of
DRAND and RTCQS in terms of throughput. Clearly
shown, RTCQS achieves the maximum throughput of
5.2Hz which is about 57% higher than DRAND. From
this it is concluded that fair allocation of slots to nodes
is unsuitable for WSN.
Figure 6 shows the performance comparison of
DRAND and RTCQS in terms of latency. Even
though the query rate
Fig. 6 Performance comparison using query latency
for DRAND and RTCQS
is low, the RTCQS performs significantly better
latency on comparing DRAND. For example, when
query rate is 3.4, DRAND has the latency of 6.4 in
contrast to RTCQS with latency of 1.5 which is about
77% lower than DRAND. The long latency period for
DRAND is due to increased waiting duration a node
to transmit entire frame to its parent.
V. CONCLUSION
The scheduling technique RTCQS is
specifically designed for real time query services in
wireless sensor networks. With the query planner,
query latency is reduced by constructing conflict free
transmission plans based on the precedence
constraints. By the query scheduler throughput is
improved by over-lapping the transmissions of
multiple query instances concurrently. Scheduler
makes use of both preemption and non preemption
technique to enable the real time applications.
Scheduler without the preemption controls only the
start of an instance; In contrast, a preemption
technique may preempt an instance to allow a higher
priority instance to execute when the two cannot be
executed concurrently. Thus RTCQS has low runtime
overhead and limited memory requirements making it
suitable for resource constrained devices and produce
high throughput. In future, the proposed technique can
0
1
2
3
4
5
6
2.5 3.4 4.3 5.2 6.1 7
QueryThroughput(Hz)
Query Rate (Hz)
Query Throughput
DRAND
RTDCQS
0
2
4
6
8
10
2.5 3.4 4.3 5.2 6.1 7
Querylatency(s)
Query rate (Hz)
Query Latency
DRAND
RTDCQS
6. Mrs. S. Jeevitha / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.2147-2152
2152 | P a g e
be applied in WSN with higher topology change to
have better performance.
ACKNOWLEDGMENT
Author express thanks to their friends and
family members for encouraging her in good manner
for completing this work.
REFERENCES
[1] I. Akyildiz, W. Su, Y. Sankarasubramaniam
and E. Cayirci: A Survey on Sensor
Networks, IEEE Communication Magazine,
pp. 102-114 (August 2002).
[2] A. Mainwaring, D. Culler, J. Polastre, R.
Szewczyk, and J.Anderson, “Wireless Sensor
Networks for Habitat Monitoring,”Proc. First
ACM Int’l Workshop Wireless Sensor
Networks and Applications (WSNA), 2002.
[3] D. Estrin, L. Girod, G. Pottie, and M.
Srivastava. “Instrumenting the world with
wireless sensornetworks”. In International
Conference on Acoustics,Speech, May 2001.
[4] D. Estrin, R. Govindan, J. S. Heidemann, and
S. Kumar.” Next century challenges:
Scalable coordination in sensor networks”. In
Mobile Computing and Networking, pages
263–270, 1999.
[5] M. A. Rahman and S. Hussain, “Optimizing
a data routing protocol’s influence on
communication connectivity,” in IEEE
Consumer Communications and Networking
Conference (CCNC’07), Jan. 11-13 2007.
[6] P. Suriyachai, U. Roedig, and A. Scott, “A
survey of mac protocols for mission-critical
applications in wireless sensor networks,”
Communications Surveys Tutorials, IEEE,
vol. PP, no. 99, pp. 1 –25, 2011.
[7] E. Felemban, C.-G. Lee, and E. Ekici,
“Mmspeed: multipath multi-speed protocol
for qos guarantee of reliability and.
timeliness in wireless sensor networks,”
Mobile Computing, IEEE Transactions on,
vol. 5, no. 6, pp. 738 – 754, June 2006.
[8] M. Soyturk and D. Altilar, “Reliable real-
time data acquisition for rapidly deployable
mission-critical wireless sensor networks,” in
INFOCOM Workshops 2008, IEEE, April
2008, pp. 1 –6.
[9] A. Woo, D. Culler, “A transmission control
scheme for media access in sensor
networks”, Proceedings of ACM
MobiCom’01, Rome, Italy, July 2001, pp.
221–235.
[10] W. Ye, J. Heidemann, and D. Estrin.
“Medium access control with coordinated
adaptive sleeping for wireless sensor
networks”, IEEE/ACM Trans. Netw.,
12(3):493{506, 2004.
[11] K. Sohrabi, J. Gao, V. Ailawadhi, G.J. Pottie,
“Protocols for self-organization of a wireless
sensor network”, IEEE Personal
Communications, October 2000, pp. 16
[12] I. Rhee, A. Warrier, M. Aia, and J. Min, “Z-
MAC: A Hybrid MAC for Wireless Sensor
Networks,” Proc. Third Int’l Conf.
Embedded Networked Sensor Systems
(SenSys), 2005.–27.
[13] I. Rhee, A. Warrior, J. Min, and L. Xu,
“DRAND: Distributed Randomized TDMA
Scheduling for Wireless Ad Hoc Networks,”
Proc. ACM MobiHoc, 2006.
[14] V. Rajendran, K. Obraczka, and J.J. Garcia-
Luna-Aceves, “Energy- Efficient Collision-
Free Medium Access Control for Wireless
Sensor Networks,” Proc. First Int’l Conf.
Embedded Networked Sensor Systems
(SenSys), 2003.
[15] A. Koubaa, M. Alves, and E. Tovar, “i-
GAME: an implicit GTS allocation
mechanism in IEEE 802.15.4 for time-
sensitive wireless sensor networks,” in
Euromicro Conference on Real-Time
Systems, 2006.
[16] O. Chipara, C. Lu, J. Stankovic, and G.
Roman, “Dynamic conflict-free transmission
scheduling for sensor network queries,”
IEEE Transactionson Mobile Computing,
vol. 10, no. 5, 2011.
[17] G. Zhou, T. He, J.A. Stankovic, and T.F.
Abdelzaher, “RID: Radio Interference
Detection in Wireless Sensor Networks,”
Proc. IEEE
[18] J. Polastre, J. Hui, P. Levis, J. Zhao, D.
Culler, S. Shenker, and I. Stoica, “A unifying
link abstraction for wireless sensor
networks,” in Embedded Networked Sensor
Systems, 2005.