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.
A Survey on Neural Network Based Minimization of Data Center in Power Consump...IJSTA
This document summarizes a survey on using neural networks to minimize data center power consumption. It discusses how load prediction using neural networks can balance server loads and optimize energy usage by selectively powering down unused servers. The document reviews several related works applying neural network prediction to schedule virtual machines and transition servers to low-power sleep states. The survey concludes neural network models trained on historical load data can accurately predict future loads to enable reliable and optimized load balancing across servers.
This document summarizes a research paper on developing an improved LEACH (Low-Energy Adaptive Clustering Hierarchy) communication protocol for energy efficient data mining in multi-feature sensor networks. It begins with background on wireless sensor networks and issues like energy efficiency. It then discusses the existing LEACH protocol and its drawbacks. The proposed improved LEACH protocol includes cluster heads, sub-cluster heads, and cluster nodes to address LEACH's limitations. This new version aims to minimize energy consumption during cluster formation and data aggregation in multi-feature sensor networks.
Multilink Routing in Wireless Sensor Networks with Integrated Approach for Hi...rahulmonikasharma
Now a day’s people make use of sensors in order to have a distant communication without any intervention and to avoid the use of wires so that our communication will be mobile, but these sensors suffers a problem of battery drainage. There are various Energy Efficient Protocols for WSN that are being created which aspire to successfully deliver the data packets from sensor node (source) to the Base Station. These protocols have certain parameters like distance to identify the route. These protocols have a considerable amount of energy to find the minimum distance. Our aim is to formulate a protocol which has a target to calculate an efficient path at the same time save the energy of sensors in order to enhance the lifetime of network. In our project we proposed an Optimum Path and Energy Aware Sensor Routing Protocol (OPEASRP) which makes use of load as a parameter for calculation of optimal path and LEACH for conservation of energy of the nodes. At the same time we are providing the strong security to the network for preventing the network from different attacks. The main function of this protocol is for authorized multiple network user. So, with the help of different security parameters the system provides a high security to the wireless sensor network. Energy efficient new algorithm is also used because it is difficult to crack.
COMPRESSIVE DATA GATHERING TECHNIQUE BY AVOIDING CORRELATED DATA IN WSNpharmaindexing
This document proposes a technique for compressive data gathering in wireless sensor networks using mobile data collectors. It involves identifying correlated sensor data within clusters near polling points and defining a tour plan for mobile collectors that avoids visiting these correlated sensors. This is done using a spatial correlation method. The goal is to identify new optimal polling points by avoiding correlated sensors, which reduces the tour length of mobile collectors and the number of polling points needed. This extends the lifetime of the wireless sensor network. The document provides background on related work using mobile data collectors and discusses how the proposed approach improves upon prior methods.
The document discusses wireless sensor networks and describes their key characteristics. It notes that wireless sensor networks consist of low-power smart sensor nodes distributed over a large field to enable wireless sensing and data networking. The sensor nodes contain sensors, processors, memory, and radios. Wireless sensor networks can be either unstructured with dense node distribution or structured with few scattered nodes.
A Cooperative Cache Management Scheme for IEEE802.15.4 based Wireless Sensor ...IJECEIAES
Wireless Sensor Networks (WSNs) based on the IEEE 802.15.4 MAC and PHY layer standards is a recent trend in the market. It has gained tremendous attention due to its low energy consumption characteristics and low data rates. However, for larger networks minimizing energy consumption is still an issue because of the dissemination of large overheads throughout the network. This consumption of energy can be reduced by incorporating a novel cooperative caching scheme to minimize overheads and to serve data with minimal latency and thereby reduce the energy consumption. This paper explores the possibilities to enhance the energy efficiency by incorporating a cooperative caching strategy.
Qos group based optimal retransmission medium access protocol for wireless se...IJCNCJournal
This paper presents, a Group Based Optimal Retransmission Medium Access (GORMA) Protocol is
designed that combines protocol of Collision Avoidance (CA) and energy management for low-cost, shortrange,
low-data rate and low-energy sensor nodes applications in environment monitoring, agriculture,
industrial plants etc. In this paper, the GORMA protocol focuses on efficient MAC protocol to provide
autonomous Quality of Service (QoS) to the sensor nodes in one-hop QoS retransmission group and two
QoS groups in WSNs where the source nodes do not have receiver circuits. Hence, they can only transmit
data to a sink node, but cannot receive any control signals from the sink node. The proposed protocol
GORMA provides QoS to the nodes which work independently on predefined time by allowing them to
transmit each packet an optimal number of times within a given period. Our simulation results shows that
the performance of GORMA protocol, which maximize the delivery probability of one-hop QoS group and
two QoS groups and minimize the energy consumption.
This document discusses approaches to improve reliability in wireless sensor networks. It proposes a dynamic sectoring scheme where the network area is divided into sectors with a sensor node assigned as sector head for each. When an event occurs, only that sector is activated, reducing congestion and energy use. This is expected to enhance packet delivery ratio and reduce losses. Prior work on using data fusion and opportunistic flooding algorithms to improve reliability is also reviewed. The dynamic sectoring approach aims to reliably transmit data with low congestion and energy usage.
A Survey on Neural Network Based Minimization of Data Center in Power Consump...IJSTA
This document summarizes a survey on using neural networks to minimize data center power consumption. It discusses how load prediction using neural networks can balance server loads and optimize energy usage by selectively powering down unused servers. The document reviews several related works applying neural network prediction to schedule virtual machines and transition servers to low-power sleep states. The survey concludes neural network models trained on historical load data can accurately predict future loads to enable reliable and optimized load balancing across servers.
This document summarizes a research paper on developing an improved LEACH (Low-Energy Adaptive Clustering Hierarchy) communication protocol for energy efficient data mining in multi-feature sensor networks. It begins with background on wireless sensor networks and issues like energy efficiency. It then discusses the existing LEACH protocol and its drawbacks. The proposed improved LEACH protocol includes cluster heads, sub-cluster heads, and cluster nodes to address LEACH's limitations. This new version aims to minimize energy consumption during cluster formation and data aggregation in multi-feature sensor networks.
Multilink Routing in Wireless Sensor Networks with Integrated Approach for Hi...rahulmonikasharma
Now a day’s people make use of sensors in order to have a distant communication without any intervention and to avoid the use of wires so that our communication will be mobile, but these sensors suffers a problem of battery drainage. There are various Energy Efficient Protocols for WSN that are being created which aspire to successfully deliver the data packets from sensor node (source) to the Base Station. These protocols have certain parameters like distance to identify the route. These protocols have a considerable amount of energy to find the minimum distance. Our aim is to formulate a protocol which has a target to calculate an efficient path at the same time save the energy of sensors in order to enhance the lifetime of network. In our project we proposed an Optimum Path and Energy Aware Sensor Routing Protocol (OPEASRP) which makes use of load as a parameter for calculation of optimal path and LEACH for conservation of energy of the nodes. At the same time we are providing the strong security to the network for preventing the network from different attacks. The main function of this protocol is for authorized multiple network user. So, with the help of different security parameters the system provides a high security to the wireless sensor network. Energy efficient new algorithm is also used because it is difficult to crack.
COMPRESSIVE DATA GATHERING TECHNIQUE BY AVOIDING CORRELATED DATA IN WSNpharmaindexing
This document proposes a technique for compressive data gathering in wireless sensor networks using mobile data collectors. It involves identifying correlated sensor data within clusters near polling points and defining a tour plan for mobile collectors that avoids visiting these correlated sensors. This is done using a spatial correlation method. The goal is to identify new optimal polling points by avoiding correlated sensors, which reduces the tour length of mobile collectors and the number of polling points needed. This extends the lifetime of the wireless sensor network. The document provides background on related work using mobile data collectors and discusses how the proposed approach improves upon prior methods.
The document discusses wireless sensor networks and describes their key characteristics. It notes that wireless sensor networks consist of low-power smart sensor nodes distributed over a large field to enable wireless sensing and data networking. The sensor nodes contain sensors, processors, memory, and radios. Wireless sensor networks can be either unstructured with dense node distribution or structured with few scattered nodes.
A Cooperative Cache Management Scheme for IEEE802.15.4 based Wireless Sensor ...IJECEIAES
Wireless Sensor Networks (WSNs) based on the IEEE 802.15.4 MAC and PHY layer standards is a recent trend in the market. It has gained tremendous attention due to its low energy consumption characteristics and low data rates. However, for larger networks minimizing energy consumption is still an issue because of the dissemination of large overheads throughout the network. This consumption of energy can be reduced by incorporating a novel cooperative caching scheme to minimize overheads and to serve data with minimal latency and thereby reduce the energy consumption. This paper explores the possibilities to enhance the energy efficiency by incorporating a cooperative caching strategy.
Qos group based optimal retransmission medium access protocol for wireless se...IJCNCJournal
This paper presents, a Group Based Optimal Retransmission Medium Access (GORMA) Protocol is
designed that combines protocol of Collision Avoidance (CA) and energy management for low-cost, shortrange,
low-data rate and low-energy sensor nodes applications in environment monitoring, agriculture,
industrial plants etc. In this paper, the GORMA protocol focuses on efficient MAC protocol to provide
autonomous Quality of Service (QoS) to the sensor nodes in one-hop QoS retransmission group and two
QoS groups in WSNs where the source nodes do not have receiver circuits. Hence, they can only transmit
data to a sink node, but cannot receive any control signals from the sink node. The proposed protocol
GORMA provides QoS to the nodes which work independently on predefined time by allowing them to
transmit each packet an optimal number of times within a given period. Our simulation results shows that
the performance of GORMA protocol, which maximize the delivery probability of one-hop QoS group and
two QoS groups and minimize the energy consumption.
This document discusses approaches to improve reliability in wireless sensor networks. It proposes a dynamic sectoring scheme where the network area is divided into sectors with a sensor node assigned as sector head for each. When an event occurs, only that sector is activated, reducing congestion and energy use. This is expected to enhance packet delivery ratio and reduce losses. Prior work on using data fusion and opportunistic flooding algorithms to improve reliability is also reviewed. The dynamic sectoring approach aims to reliably transmit data with low congestion and energy usage.
Iaetsd extending sensor networks into the cloud using tpss and lbssIaetsd Iaetsd
The document proposes two schemes, TPSS and LBSS, to improve the usefulness of sensory data and reliability of wireless sensor networks (WSNs) integrated with mobile cloud computing (MCC). TPSS uses a time and priority-based approach to selectively transmit sensor data to the cloud based on user requests. LBSS schedules sensor sleep states based on user location histories to optimize energy efficiency while maintaining reliable data collection. The schemes aim to balance useful data collection from WSNs with reliable delivery to mobile cloud users.
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
This document proposes a secure clock synchronization technique for wireless sensor networks used in event-driven measurement applications. The technique aims to 1) provide high synchronization accuracy around detected events, 2) ensure long network lifetime, and 3) provide secure packet transmission. It divides nodes into an improved synchronization subset (ISS) with high accuracy around events, and a default synchronization subset (DSS) with lower accuracy elsewhere. When an event is detected, neighboring nodes in the ISS exchange synchronization packets more frequently for better accuracy. Authentication is used to securely transmit packets and identify intercepted messages. Simulation results show the technique accurately records event occurrence times while maintaining network lifetime through efficient energy usage.
Concealed Data Aggregation with Dynamic Intrusion Detection System to Remove ...csandit
Data Aggregation is a vital aspect in WSNs (Wireless Sensor Networks) and this is because it
reduces the quantity of data to be transmitted over the complex network. In earlier studies
authors used homomorphic encryption properties for concealing statement during aggregation
such that encrypted data can be aggregated algebraically without decrypting them. These
schemes are not applicable for multi applications which lead to proposal of Concealed Data
Aggregation for Multi Applications (CDAMA). It is designed for multi applications, as it
provides secure counting ability. In wireless sensor networks SN are unarmed and are
susceptible to attacks. Considering the defence aspect of wireless environment we have used
DYDOG (Dynamic Intrusion Detection Protocol Model) and a customized key generation
procedure that uses Digital Signatures and also Two Fish Algorithms along with CDAMA for
augmentation of security and throughput. To prove our proposed scheme’s robustness and
effectiveness, we conducted the simulations, inclusive analysis and comparisons at the ending.
Comparison of Health Care System ArchitecturesIJEACS
Body area sensor network is an important
technology which is suitable for monitoring the patient’s health
and real time diagnosing the diseases. The body area network
includes the sensors which can be spread over the body or the
wearable cloth and a coordinator node which can be a mobile
or a tablet or a PDA, which receives the signal of a person’s
sensors. In the new architecture the coordinator node sends the
information to the central data server via internet or GPRS or
MANET. The central data server is responsible for saving and
analyzing and representing the received data in the text and
graphical mode and sending SMS to the patient’s family or the
nearest ambulance or physician, or the operator can call them.
The received information is analyzed by the data mining tools.
The necessary information will be sent to the physician’s
computer. Every patient has a GPS, and it is supposed that the
encryption is used for transferring information. In this paper
the new architecture is compared with the traditional one
which includes the base station and relay nodes. It is shown
that the new architecture has less delay than the traditional
one.
The document summarizes an enhanced version of the GPSR routing protocol for wireless sensor networks. It begins by describing the GPSR protocol and some of its limitations in wireless sensor network environments, such as asymmetric links and situations where the destination is outside the network boundary. It then proposes modifications to GPSR to address these issues. The enhanced protocol introduces aggregation nodes that are responsible for transmitting messages to distant base stations. It also utilizes a "head set" concept where a set of nodes takes turns transmitting data to save energy compared to always using the same node. The enhanced protocol is claimed to help ensure successful data delivery, reduce packet delay, and optimize energy consumption for wireless sensor networks.
This document summarizes a research paper that analyzes end-to-end delay distribution in wireless sensor networks. It first introduces the importance of average delay and end-to-end delay distribution for real-time quality of service in wireless sensor networks. It then discusses previous work that analyzed average delay but failed to consider single hop delay distribution or bursty traffic. The document proposes a comprehensive cross-layer analysis framework to model average delay and end-to-end delay distribution considering both deterministic and random node deployments. It also compares the performance of CSMA/CA and a cross-layer MAC protocol in terms of throughput, packet loss, and delay.
This document summarizes a survey of clustering algorithms for improving the lifetime of wireless sensor networks. It discusses how clustering partitions sensor networks into groups called clusters, with high-energy nodes acting as cluster heads. Clustering aims to reduce energy utilization and extend network lifetime by having cluster heads aggregate and transmit data to the base station on behalf of nodes in their clusters. The document reviews different types of clustering algorithms and heterogeneity in wireless sensor networks, noting that heterogeneity can further improve network lifetime, response time, and reliable data transmission through clustering.
Performance Analysis of Routing Protocols of Wireless Sensor NetworksDarpan Dekivadiya
The document summarizes different types of routing protocols that can be used in wireless sensor networks. It categorizes the protocols based on their mode of functioning, participation style of nodes, and network structure. Some key routing protocols discussed include LEACH, which is a proactive clustering protocol, SPIN that uses direct communication, and TEEN which is a reactive clustering protocol. The document also discusses challenges in routing for wireless sensor networks given the constraints of sensor nodes.
This document discusses improving the performance of mobile wireless sensor networks using a modified DBSCAN clustering algorithm. It first provides background on wireless sensor networks and discusses challenges related to mobility. It then reviews several existing works related to clustering, mobility, and extending network lifetime. The paper proposes using a modified DBSCAN algorithm that takes into account mobility, remaining energy, and distance to base station to select cluster heads. It evaluates the performance of this approach based on throughput, delay, and packet delivery ratio, finding improvements over other methods.
Efficient IOT Based Sensor Data Analysis in Wireless Sensor Networks with Cloudiosrjce
This summary provides the key details from the document in 3 sentences:
The document proposes an efficient IoT-based sensor data analysis system in wireless sensor networks using cloud computing. It utilizes the Greedy Perimeter Stateless Routing (GPSR) algorithm to route sensor data to cloud storage. The system is evaluated through simulations analyzing parameters like packet delivery ratio, energy consumption, and delay.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
The document proposes an improved data routing protocol for wireless sensor networks. It aims to address deficiencies in existing chain-based routing protocols like Chiron and PEGASIS that can cause longer transmission delays and redundant paths. The key aspects of the proposed protocol are:
1) The sensing area is divided into fan-shaped groups using beamforming from the base station, instead of concentric clusters. Shorter chains are formed within each group for data transmission.
2) The node with maximum residual energy in each chain is elected as the chain leader, rather than taking turns, to aggregate and transmit data to the base station.
3) Transmission between chain leaders is optimized to avoid longer distances and redundant paths.
Energy efficient routing in wireless sensor networksSpandan Spandy
The document summarizes several energy efficient multicast routing protocols for wireless sensor networks. It begins with an introduction to wireless sensor networks and routing challenges. It then summarizes the following protocols: MAODV, TEEN, APTEEN, SPEED, MMSPEED, RPAR, and LEACH. For each protocol, it provides a brief overview of the protocol's design, objectives, components, and how it aims to improve energy efficiency in wireless sensor network routing. The document concludes that providing energy-efficient multicast routing is important for wireless sensor network applications and that the protocols presented aim to achieve lower energy requirements through approaches like clustering, adaptive thresholding, and congestion control.
CODE AWARE DYNAMIC SOURCE ROUTING FOR DISTRIBUTED SENSOR NETWORKIJNSA Journal
Sensor network facilitates monitoring and controlling of physical environments. These wireless networks consist of dense collection of sensors capable of collection and dissemination of data. They have application in variety of fields such as military purposes, environment monitoring etc. Typical deployment of sensor network assumes central processing station or a gateway to which all other nodes route their data using dynamic source routing (DSR). This causes congestion at central station and thus reduces the efficiency of the network. In this work we will propose a better dynamic source routing technique using network coding to reduce total number of transmission in sensor networks resulting in better efficiency.
Routing protocols for wireless sensor networks face several unique challenges compared to other wireless networks. This document discusses routing challenges in wireless sensor networks and provides an overview of different routing protocol approaches, including flat routing, hierarchical routing, location-based routing, and QoS-based routing. It specifically describes two flat routing protocols: directed diffusion, which uses data negotiation and aggregation to reduce energy costs, and SPIN, which employs data description messages to avoid redundant transmissions through negotiation between sensor nodes.
An Efficient Approach for Data Gathering and Sharing with Inter Node Communi...cscpconf
In today’s era Wireless sensor networks (WSNs) have emerged as a solution for a wide range of
applications. Most of the traditional WSN architectures consist of static nodes which are densely deployed
over a sensing area. Recently, several WSN architectures based on mobile elements (MEs) have been
proposed. Most of them exploit mobility to address the problem of data collection in WSNs. The common
drawback among them is to data sharing between interconnected nodes. In this paper we propose an
Efficient Approach for Data Gathering and Sharing with Inter Node Communication in Mobile-Sink. Our
algorithm is divided into seven parts: Registration Phase, Authentication Phase, Request and Reply Phase,
Setup Phase, Setup Phase (NN), Data Gathering, and Forwarding to Sink. Our approach provides an
efficient way to handle data in between the intercommunication nodes. By the above approach we can
access the data from the node which is not in the list, by sharing the data from the node which is
approachable to the desired node. For accessing and sharing we need some security so that the data can
be shared between authenticated nodes. For this we use two way security approach one for the accessing
node and other for the sharing.
This document proposes an energy efficient three-level model for query optimization in wireless sensor networks (WSNs). At the three levels are: base station, cluster heads, and sensor nodes. The base station maintains metadata about cluster heads and sensor nodes. When a query is received, it first checks if the result is cached. If not, it checks the status of cluster heads and selects a new cluster head if needed. The query is then disseminated to cluster heads using a modified Bellman-Ford algorithm. Cluster heads aggregate data from relevant sensor nodes and send the result to the base station. This model aims to minimize communication costs during query processing in WSNs.
LOAD BALANCED CLUSTERING WITH MIMO UPLOADING TECHNIQUE FOR MOBILE DATA GATHER...Munisekhar Gunapati
A three-layer framework is proposed for mobile data collection in wireless sensor networks, which includes the sensor layer, cluster head layer, and mobile collector (called SenCar) layer. The framework employs distributed load balanced clustering and dual data uploading, which is referred to as LBC-MIMO. The objective is to achieve good scalability, long network lifetime and low data collection latency. At the sensor layer, a distributed load balanced clustering (LBC) algorithm is proposed for sensors to self-organize themselves into clusters. In contrast to existing clustering methods, our scheme generates multiple cluster heads in each cluster to balance the work load and facilitate dual data uploading. At the cluster head layer, the inter-cluster transmission range is carefully chosen to guarantee the connectivity among the clusters. Multiple cluster heads within a cluster cooperate with each other to perform energy-saving inter-cluster communications. Through inter-cluster transmissions, cluster head information is forwarded to SenCar for its moving trajectory planning. At the mobile collector layer, SenCar is equipped with two antennas, which enables two cluster heads to simultaneously upload data to SenCar in each time by utilizing multi-user multiple-input and multiple-output (MU-MIMO) technique. The trajectory planning for SenCar is optimized to fully utilize dual data uploading capability by properly selecting polling points in each cluster. By visiting each selected polling point, SenCar can efficiently gather data from cluster heads and transport the data to the static data sink. Extensive simulations are conducted to evaluate the effectiveness of the proposed LBC-MIMO scheme. The results show that when each cluster has at most two cluster heads, LBC-MIMO achieves over 50 percent energy saving per node and 60 percent energy saving on cluster heads comparing with data collection through multi-hop relay to the static data sink, and 20 percent shorter data collection time compared to traditional mobile data gathering.
An innovative idea to discover the trend on multi dimensional spatio-temporal...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Performance analysis of a liquid column in a chemical plant by using mpceSAT Publishing House
This document discusses the use of model predictive control (MPC) to control the composition of a liquid column in a chemical plant. It provides background on MPC and how it can be used for multivariable processes like liquid columns. The document describes modeling a liquid column process in MATLAB Simulink and comparing the performance of MPC and PID control of the column. The results show that MPC provides better control of the column composition and liquid level than PID control.
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.
Iaetsd extending sensor networks into the cloud using tpss and lbssIaetsd Iaetsd
The document proposes two schemes, TPSS and LBSS, to improve the usefulness of sensory data and reliability of wireless sensor networks (WSNs) integrated with mobile cloud computing (MCC). TPSS uses a time and priority-based approach to selectively transmit sensor data to the cloud based on user requests. LBSS schedules sensor sleep states based on user location histories to optimize energy efficiency while maintaining reliable data collection. The schemes aim to balance useful data collection from WSNs with reliable delivery to mobile cloud users.
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
This document proposes a secure clock synchronization technique for wireless sensor networks used in event-driven measurement applications. The technique aims to 1) provide high synchronization accuracy around detected events, 2) ensure long network lifetime, and 3) provide secure packet transmission. It divides nodes into an improved synchronization subset (ISS) with high accuracy around events, and a default synchronization subset (DSS) with lower accuracy elsewhere. When an event is detected, neighboring nodes in the ISS exchange synchronization packets more frequently for better accuracy. Authentication is used to securely transmit packets and identify intercepted messages. Simulation results show the technique accurately records event occurrence times while maintaining network lifetime through efficient energy usage.
Concealed Data Aggregation with Dynamic Intrusion Detection System to Remove ...csandit
Data Aggregation is a vital aspect in WSNs (Wireless Sensor Networks) and this is because it
reduces the quantity of data to be transmitted over the complex network. In earlier studies
authors used homomorphic encryption properties for concealing statement during aggregation
such that encrypted data can be aggregated algebraically without decrypting them. These
schemes are not applicable for multi applications which lead to proposal of Concealed Data
Aggregation for Multi Applications (CDAMA). It is designed for multi applications, as it
provides secure counting ability. In wireless sensor networks SN are unarmed and are
susceptible to attacks. Considering the defence aspect of wireless environment we have used
DYDOG (Dynamic Intrusion Detection Protocol Model) and a customized key generation
procedure that uses Digital Signatures and also Two Fish Algorithms along with CDAMA for
augmentation of security and throughput. To prove our proposed scheme’s robustness and
effectiveness, we conducted the simulations, inclusive analysis and comparisons at the ending.
Comparison of Health Care System ArchitecturesIJEACS
Body area sensor network is an important
technology which is suitable for monitoring the patient’s health
and real time diagnosing the diseases. The body area network
includes the sensors which can be spread over the body or the
wearable cloth and a coordinator node which can be a mobile
or a tablet or a PDA, which receives the signal of a person’s
sensors. In the new architecture the coordinator node sends the
information to the central data server via internet or GPRS or
MANET. The central data server is responsible for saving and
analyzing and representing the received data in the text and
graphical mode and sending SMS to the patient’s family or the
nearest ambulance or physician, or the operator can call them.
The received information is analyzed by the data mining tools.
The necessary information will be sent to the physician’s
computer. Every patient has a GPS, and it is supposed that the
encryption is used for transferring information. In this paper
the new architecture is compared with the traditional one
which includes the base station and relay nodes. It is shown
that the new architecture has less delay than the traditional
one.
The document summarizes an enhanced version of the GPSR routing protocol for wireless sensor networks. It begins by describing the GPSR protocol and some of its limitations in wireless sensor network environments, such as asymmetric links and situations where the destination is outside the network boundary. It then proposes modifications to GPSR to address these issues. The enhanced protocol introduces aggregation nodes that are responsible for transmitting messages to distant base stations. It also utilizes a "head set" concept where a set of nodes takes turns transmitting data to save energy compared to always using the same node. The enhanced protocol is claimed to help ensure successful data delivery, reduce packet delay, and optimize energy consumption for wireless sensor networks.
This document summarizes a research paper that analyzes end-to-end delay distribution in wireless sensor networks. It first introduces the importance of average delay and end-to-end delay distribution for real-time quality of service in wireless sensor networks. It then discusses previous work that analyzed average delay but failed to consider single hop delay distribution or bursty traffic. The document proposes a comprehensive cross-layer analysis framework to model average delay and end-to-end delay distribution considering both deterministic and random node deployments. It also compares the performance of CSMA/CA and a cross-layer MAC protocol in terms of throughput, packet loss, and delay.
This document summarizes a survey of clustering algorithms for improving the lifetime of wireless sensor networks. It discusses how clustering partitions sensor networks into groups called clusters, with high-energy nodes acting as cluster heads. Clustering aims to reduce energy utilization and extend network lifetime by having cluster heads aggregate and transmit data to the base station on behalf of nodes in their clusters. The document reviews different types of clustering algorithms and heterogeneity in wireless sensor networks, noting that heterogeneity can further improve network lifetime, response time, and reliable data transmission through clustering.
Performance Analysis of Routing Protocols of Wireless Sensor NetworksDarpan Dekivadiya
The document summarizes different types of routing protocols that can be used in wireless sensor networks. It categorizes the protocols based on their mode of functioning, participation style of nodes, and network structure. Some key routing protocols discussed include LEACH, which is a proactive clustering protocol, SPIN that uses direct communication, and TEEN which is a reactive clustering protocol. The document also discusses challenges in routing for wireless sensor networks given the constraints of sensor nodes.
This document discusses improving the performance of mobile wireless sensor networks using a modified DBSCAN clustering algorithm. It first provides background on wireless sensor networks and discusses challenges related to mobility. It then reviews several existing works related to clustering, mobility, and extending network lifetime. The paper proposes using a modified DBSCAN algorithm that takes into account mobility, remaining energy, and distance to base station to select cluster heads. It evaluates the performance of this approach based on throughput, delay, and packet delivery ratio, finding improvements over other methods.
Efficient IOT Based Sensor Data Analysis in Wireless Sensor Networks with Cloudiosrjce
This summary provides the key details from the document in 3 sentences:
The document proposes an efficient IoT-based sensor data analysis system in wireless sensor networks using cloud computing. It utilizes the Greedy Perimeter Stateless Routing (GPSR) algorithm to route sensor data to cloud storage. The system is evaluated through simulations analyzing parameters like packet delivery ratio, energy consumption, and delay.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
The document proposes an improved data routing protocol for wireless sensor networks. It aims to address deficiencies in existing chain-based routing protocols like Chiron and PEGASIS that can cause longer transmission delays and redundant paths. The key aspects of the proposed protocol are:
1) The sensing area is divided into fan-shaped groups using beamforming from the base station, instead of concentric clusters. Shorter chains are formed within each group for data transmission.
2) The node with maximum residual energy in each chain is elected as the chain leader, rather than taking turns, to aggregate and transmit data to the base station.
3) Transmission between chain leaders is optimized to avoid longer distances and redundant paths.
Energy efficient routing in wireless sensor networksSpandan Spandy
The document summarizes several energy efficient multicast routing protocols for wireless sensor networks. It begins with an introduction to wireless sensor networks and routing challenges. It then summarizes the following protocols: MAODV, TEEN, APTEEN, SPEED, MMSPEED, RPAR, and LEACH. For each protocol, it provides a brief overview of the protocol's design, objectives, components, and how it aims to improve energy efficiency in wireless sensor network routing. The document concludes that providing energy-efficient multicast routing is important for wireless sensor network applications and that the protocols presented aim to achieve lower energy requirements through approaches like clustering, adaptive thresholding, and congestion control.
CODE AWARE DYNAMIC SOURCE ROUTING FOR DISTRIBUTED SENSOR NETWORKIJNSA Journal
Sensor network facilitates monitoring and controlling of physical environments. These wireless networks consist of dense collection of sensors capable of collection and dissemination of data. They have application in variety of fields such as military purposes, environment monitoring etc. Typical deployment of sensor network assumes central processing station or a gateway to which all other nodes route their data using dynamic source routing (DSR). This causes congestion at central station and thus reduces the efficiency of the network. In this work we will propose a better dynamic source routing technique using network coding to reduce total number of transmission in sensor networks resulting in better efficiency.
Routing protocols for wireless sensor networks face several unique challenges compared to other wireless networks. This document discusses routing challenges in wireless sensor networks and provides an overview of different routing protocol approaches, including flat routing, hierarchical routing, location-based routing, and QoS-based routing. It specifically describes two flat routing protocols: directed diffusion, which uses data negotiation and aggregation to reduce energy costs, and SPIN, which employs data description messages to avoid redundant transmissions through negotiation between sensor nodes.
An Efficient Approach for Data Gathering and Sharing with Inter Node Communi...cscpconf
In today’s era Wireless sensor networks (WSNs) have emerged as a solution for a wide range of
applications. Most of the traditional WSN architectures consist of static nodes which are densely deployed
over a sensing area. Recently, several WSN architectures based on mobile elements (MEs) have been
proposed. Most of them exploit mobility to address the problem of data collection in WSNs. The common
drawback among them is to data sharing between interconnected nodes. In this paper we propose an
Efficient Approach for Data Gathering and Sharing with Inter Node Communication in Mobile-Sink. Our
algorithm is divided into seven parts: Registration Phase, Authentication Phase, Request and Reply Phase,
Setup Phase, Setup Phase (NN), Data Gathering, and Forwarding to Sink. Our approach provides an
efficient way to handle data in between the intercommunication nodes. By the above approach we can
access the data from the node which is not in the list, by sharing the data from the node which is
approachable to the desired node. For accessing and sharing we need some security so that the data can
be shared between authenticated nodes. For this we use two way security approach one for the accessing
node and other for the sharing.
This document proposes an energy efficient three-level model for query optimization in wireless sensor networks (WSNs). At the three levels are: base station, cluster heads, and sensor nodes. The base station maintains metadata about cluster heads and sensor nodes. When a query is received, it first checks if the result is cached. If not, it checks the status of cluster heads and selects a new cluster head if needed. The query is then disseminated to cluster heads using a modified Bellman-Ford algorithm. Cluster heads aggregate data from relevant sensor nodes and send the result to the base station. This model aims to minimize communication costs during query processing in WSNs.
LOAD BALANCED CLUSTERING WITH MIMO UPLOADING TECHNIQUE FOR MOBILE DATA GATHER...Munisekhar Gunapati
A three-layer framework is proposed for mobile data collection in wireless sensor networks, which includes the sensor layer, cluster head layer, and mobile collector (called SenCar) layer. The framework employs distributed load balanced clustering and dual data uploading, which is referred to as LBC-MIMO. The objective is to achieve good scalability, long network lifetime and low data collection latency. At the sensor layer, a distributed load balanced clustering (LBC) algorithm is proposed for sensors to self-organize themselves into clusters. In contrast to existing clustering methods, our scheme generates multiple cluster heads in each cluster to balance the work load and facilitate dual data uploading. At the cluster head layer, the inter-cluster transmission range is carefully chosen to guarantee the connectivity among the clusters. Multiple cluster heads within a cluster cooperate with each other to perform energy-saving inter-cluster communications. Through inter-cluster transmissions, cluster head information is forwarded to SenCar for its moving trajectory planning. At the mobile collector layer, SenCar is equipped with two antennas, which enables two cluster heads to simultaneously upload data to SenCar in each time by utilizing multi-user multiple-input and multiple-output (MU-MIMO) technique. The trajectory planning for SenCar is optimized to fully utilize dual data uploading capability by properly selecting polling points in each cluster. By visiting each selected polling point, SenCar can efficiently gather data from cluster heads and transport the data to the static data sink. Extensive simulations are conducted to evaluate the effectiveness of the proposed LBC-MIMO scheme. The results show that when each cluster has at most two cluster heads, LBC-MIMO achieves over 50 percent energy saving per node and 60 percent energy saving on cluster heads comparing with data collection through multi-hop relay to the static data sink, and 20 percent shorter data collection time compared to traditional mobile data gathering.
An innovative idea to discover the trend on multi dimensional spatio-temporal...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Performance analysis of a liquid column in a chemical plant by using mpceSAT Publishing House
This document discusses the use of model predictive control (MPC) to control the composition of a liquid column in a chemical plant. It provides background on MPC and how it can be used for multivariable processes like liquid columns. The document describes modeling a liquid column process in MATLAB Simulink and comparing the performance of MPC and PID control of the column. The results show that MPC provides better control of the column composition and liquid level than PID control.
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.
Ultrasonic investigation of bio liquid mixtures of methanol with cinnamaldehy...eSAT Publishing House
This document summarizes an ultrasonic investigation of binary liquid mixtures of methanol and cinnamaldehyde. The ultrasonic absorption, classical absorption, excess absorption, and ratio of observed to classical absorption were studied over varying compositions and temperatures from 1-10 MHz. Ultrasonic absorption was found to be higher than classical absorption, characteristic of this binary system. The increase in ultrasonic absorption with concentration is due to possible structural relaxation processes playing an important role in studying molecular and structural properties of the components in the mixture. Thermodynamic and acoustic parameters were computed and comparisons were made between experimental and theoretically calculated ultrasonic velocities.
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
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
Conception of a water level detector (tide gauge) based on a electromagnetic ...eSAT Publishing House
1. The document describes the conception of a water level detector (tide gauge) that uses an electromagnetic sensor to measure force.
2. It works based on Archimedes' principle - the sensor measures the difference between the weight of a glass cylinder and the buoyant force of water on the submerged portion.
3. As the water level changes, the submerged portion and buoyant force change, causing a variation in force detected by the electromagnetic sensor which is converted to a voltage.
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
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
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
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
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
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.
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
Enhancing proxy based web caching system using clustering based pre fetching ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
A geophysical insight of earthquake occurred on 21 st may 2014 off paradip, b...eSAT Publishing House
1) A 6.0 magnitude earthquake occurred off the coast of Paradip, Odisha in the Bay of Bengal on May 21, 2014 at a depth of around 40 km.
2) Analysis of magnetic and bathymetric data from the area revealed the presence of major lineaments in NW-SE and NE-SW directions that may be responsible for seismic activity through stress release.
3) Movements along growth faults at the margins of large Bengal channels, due to large sediment loads, could also contribute to seismic events by triggering movements along the faults.
The document proposes a Congestion Control Anonymous Gossip (CCAG) protocol to improve reliable packet delivery in multicast routing protocols for mobile ad-hoc networks (MANETs). The CCAG protocol uses a two phase approach, first using an existing multicast protocol like MAODV to disseminate messages unreliably, then using a gossip protocol in the background to reliably recover any lost messages. The gossip protocol implements anonymous gossip, locality of gossip, cached gossip, and pull-based message exchange to provide reliability while minimizing overhead. Simulation results show the CCAG protocol achieves a 22% improvement in packet delivery ratio over MAODV, while also reducing congestion and variation in packets received by nodes.
This document summarizes a study on the performance of different coagulants for water treatment. Alum (C1), poly aluminum chloride (PAC) (C2), and sodium aluminate (C3) were evaluated individually and in mixtures. Jar tests were conducted to determine optimum dosages for turbidities of 50, 100, 200, and 400 NTU. C1 and a mixture of C1 and C3 (CM3) removed 100% of turbidity up to 50 NTU. Above 50 NTU, C1, C2, and a mixture of C1 and C2 (CM1) removed 100% turbidity. Residual aluminum was lowest for CM1 at 0.02 mg/L and
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.
Secured client cache sustain for maintaining consistency in manetseSAT 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
Mobile data gathering with load balanced clustering and dual data uploading i...Shakas Technologies
In this paper, a three-layer framework is proposed for mobile data collection in wireless sensor networks, which includes the sensor layer, cluster head layer, and mobile collector (called SenCar) layer.
This document discusses performance analysis and fault tolerance in software environments. It begins by introducing the importance of performance analysis and fault tolerance for software, as faults can lead to losses. It then discusses different fault tolerance techniques, which generally involve some type of replication to handle node and network failures. The two main approaches are replication and coordination, which rely on modeling computation as a deterministic state machine. The document will analyze performance and fault tolerance of software environments.
A NOVEL CACHE RESOLUTION TECHNIQUE FOR COOPERATIVE CACHING IN WIRELESS MOBILE...cscpconf
Cooperative caching is used in mobile ad hoc networks to reduce the latency perceived by the mobile clients while retrieving data and to reduce the traffic load in the network. Caching also increases the availability of data due to server disconnections. The implementation of a cooperative caching technique essentially involves four major design considerations (i) cache placement and resolution, which decides where to place and how to locate the cached data (ii) Cache admission control which decides the data to be cached (iii) Cache replacement which makes the replacement decision when the cache is full and (iv) consistency maintenance, i.e. maintaining consistency between the data in server and cache. In this paper we propose an effective cache resolution technique, which reduces the number of messages flooded in to the network to find the requested data. The experimental results gives a promising result based on the metrics of studies.
A novel cache resolution technique for cooperative caching in wireless mobile...csandit
Cooperative caching is used in mobile ad hoc networks to reduce the latency perceived by the
mobile clients while retrieving data and to reduce the traffic load in the network. Caching also
increases the availability of data due to server disconnections. The implementation of a
cooperative caching technique essentially involves four major design considerations (i) cache
placement and resolution, which decides where to place and how to locate the cached data (ii)
Cache admission control which decides the data to be cached (iii) Cache replacement which
makes the replacement decision when the cache is full and (iv) consistency maintenance, i.e.
maintaining consistency between the data in server and cache. In this paper we propose an
effective cache resolution technique, which reduces the number of messages flooded in to the
network to find the requested data. The experimental results gives a promising result based on
the metrics of studies.
Energy Efficient Data Mining in Multi-Feature Sensor Networks Using Improved...IOSR Journals
This document proposes an improved LEACH (Low-Energy Adaptive Clustering Hierarchy) communication protocol for energy efficient data mining in multi-feature sensor networks. The original LEACH protocol has drawbacks like random cluster head selection and uneven energy consumption. The improved protocol designates both a cluster head and sub-cluster head to take over if the head dies. This addresses the issues with the cluster head dying and the cluster becoming useless. The improved LEACH protocol is proposed to cluster sensor nodes in multi-feature networks to enhance energy efficiency and reliability of data transfer compared to the original LEACH protocol.
In this paper we explore the issue of store determination in a portable shared specially appointed system. In our vision reserve determination ought to fulfill the accompanying prerequisites: (i) it ought to bring about low message overhead and (ii) the data ought to be recovered with least postponement. In this paper, we demonstrate that these objectives can be accomplished by part the one bounce neighbors into two sets in view of the transmission run. The proposed approach lessens the quantity of messages overflowed into the system to discover the asked for information. This plan is completely circulated and comes requiring little to no effort as far as store overhead. The test comes about gives a promising outcome in view of the measurements of studies.
Mobile Data Gathering with Load Balanced Clustering and Dual Data Uploading i...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Mobile data gathering with load balanced clustering and dual data uploading i...shanofa sanu
We provide project guidance for final year MTech, BTech, MSc, MCA, ME, BE, BSc, BCA & Diploma students in Electronics, Computer Science, Information Technology, Instrumentation, Electrical & Electronics, Power electronics, Mechanical, Automobile etc. We provide live project assistance and will make the students involve throughout the project. We specialize in Matlab, VLSI, CST, JAVA, .NET, ANDROID, PHP, NS2, EMBEDDED, ARDUINO, ARM, DSP, etc based areas. We research in Image processing, Signal Processing, Wireless communication, Cloud computing, Data mining, Networking, Artificial Intelligence and several other areas. We provide complete support in project completion, documentation and other works related to project.Success is a lousy teacher. It seduces smart people into thinking they can't lose.we have better knowledge in this field and updated with new innovative technologies.
Call me at: 9037291113.
Maintain load balancing in wireless sensor networks using virtual grid based ...zaidinvisible
This document summarizes a routing protocol called the Virtual Grid Based Routing Protocol (VGRP) that aims to maximize the lifetime of wireless sensor networks by balancing the data traffic load evenly among sensor nodes. The VGRP splits the sensor field into a grid of equal sized sub-cells and uses clustering and chain techniques to collect sensed data. It is compared to the CFDASC routing protocol through simulation, and results show VGRP outperforms CFDASC in terms of network stability and load balancing. The document provides background on wireless sensor networks and reviews several related grid-based and load balancing routing protocols.
CONCEALED DATA AGGREGATION WITH DYNAMIC INTRUSION DETECTION SYSTEM TO REMOVE ...cscpconf
Data Aggregation is a vital aspect in WSNs (Wireless Sensor Networks) and this is because it
reduces the quantity of data to be transmitted over the complex network. In earlier studies
authors used homomorphic encryption properties for concealing statement during aggregation
such that encrypted data can be aggregated algebraically without decrypting them. These
schemes are not applicable for multi applications which lead to proposal of Concealed Data
Aggregation for Multi Applications (CDAMA). It is designed for multi applications, as it
provides secure counting ability. In wireless sensor networks SN are unarmed and are
susceptible to attacks. Considering the defence aspect of wireless environment we have used
DYDOG (Dynamic Intrusion Detection Protocol Model) and a customized key generation
procedure that uses Digital Signatures and also Two Fish Algorithms along with CDAMA for
augmentation of security and throughput. To prove our proposed scheme’s robustness and
effectiveness, we conducted the simulations, inclusive analysis and comparisons at the ending.
Peer to peer cache resolution mechanism for mobile ad hoc networksijwmn
In this paper we investigate the problem of cache resolution in a mobile peer to peer ad hoc network. In our
vision cache resolution should satisfy the following requirements: (i) it should result in low message
overhead and (ii) the information should be retrieved with minimum delay. In this paper, we show that
these goals can be achieved by splitting the one hop neighbours in to two sets based on the transmission
range. The proposed approach reduces the number of messages flooded in to the network to find the
requested data. This scheme is fully distributed and comes at very low cost in terms of cache overhead. The
experimental results gives a promising result based on the metrics of studies
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
A TIME INDEX BASED APPROACH FOR CACHE SHARING IN MOBILE ADHOC NETWORKS cscpconf
Initially wireless networks were fully infrastructure based and hence imposed the necessity to
install base station. Base station leads to single point of failure and causes scalability problems.
With the advent of mobile adhoc networks, these problems are mitigated, by allowing certain
mobile nodes to form a dynamic and temporary communication network without any preexisting
infrastructure. Caching is an important technique to enhance the performance in any network. Particularly, in MANETs, it is important to cache frequently accessed data not only to reduce average latency and wireless bandwidth but also to avoid heavy traffic near the data centre. With data being cached by mobile nodes, a request to the data centre can easily be serviced by a nearby mobile node instead of the data centre alone. In this paper we propose a system , Time Index Based Approach that focuses on providing recent data on demand basis. In this system, the data comes along with a time stamp. In our work we propose three policies namely Item Discovery, Item Admission and Item Replacement, to provide data availability even with limited resources. Data consistency is ensured here since if the mobile client receives the same data item with an updated time, the previous content along with time is replaced to provide only recent data. Data availability is promised by mobile nodes, instead of the data server. We enhance the space availability in a node by deploying automated replacement policy.
Minimum Process Coordinated Checkpointing Scheme For Ad Hoc Networks pijans
The wireless mobile ad hoc network (MANET) architecture is one consisting of a set of mobile hosts
capable of communicating with each other without the assistance of base stations. This has made possible
creating a mobile distributed computing environment and has also brought several new challenges in
distributed protocol design. In this paper, we study a very fundamental problem, the fault tolerance
problem, in a MANET environment and propose a minimum process coordinated checkpointing scheme.
Since potential problems of this new environment are insufficient power and limited storage capacity, the
proposed scheme tries to reduce the amount of information saved for recovery. The MANET structure used
in our algorithm is hierarchical based. The scheme is based for Cluster Based Routing Protocol (CBRP)
which belongs to a class of Hierarchical Reactive routing protocols. The protocol proposed by us is nonblocking coordinated checkpointing algorithm suitable for ad hoc environments. It produces a consistent
set of checkpoints; the algorithm makes sure that only minimum number of nodes in the cluster are
required to take checkpoints; it uses very few control messages. Performance analysis shows that our
algorithm outperforms the existing related works and is a novel idea in the field. Firstly, we describe an
organization of the cluster. Then we propose a minimum process coordinated checkpointing scheme for
cluster based ad hoc routing protocols.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A DDS-Based Scalable and Reconfigurable Framework for Cyber-Physical Systemsijseajournal
Cyber-Physical Systems (CPSs) involve the interconnection of heterogeneous computing devices which are
closely integrated with the physical processes under control. Often, these systems are resource-constrained
and require specific features such as the ability to adapt in a timeliness and efficient fashion to dynamic
environments. Also, they must support fault tolerance and avoid single points of failure. This paper
describes a scalable framework for CPSs based on the OMG DDS standard. The proposed solution allows
reconfiguring this kind of systems at run-time and managing efficiently their resources.
This document summarizes an article from the International Journal of Electronics and Communication Engineering & Technology about implementing a scalable queue manager on an FPGA. It discusses how traditional per-flow queue managers require a large number of queues that scales with the number of flows, consuming significant memory. The proposed architecture uses dynamic queue sharing to allocate a limited number of physical queues for active flows only. It can operate in per-flow or per-class modes depending on traffic conditions to reduce queue exhaustion. The algorithms were implemented on an FPGA and showed reductions in required memory and device utilization compared to only using dynamic queue sharing.
Similar to Sdci scalable distributed cache indexing for cache consistency for mobile environments (20)
Hudhud cyclone caused extensive damage in Visakhapatnam, India in October 2014, especially to tree cover. This will likely impact the local environment in several ways: increased air pollution as trees absorb less; higher temperatures without tree canopy; increased erosion and landslides. It also created large amounts of waste from destroyed trees. Proper management of solid waste is needed to prevent disease spread. Suggested measures include restoring damaged plants, building fountains to reduce heat, mandating light-colored buildings, improving waste management, and educating public on health risks. Overall, changes are needed to water, land, and waste practices to rebuild the environment after the cyclone removed green cover.
Impact of flood disaster in a drought prone area – case study of alampur vill...eSAT Publishing House
1) In September-October 2009, unprecedented heavy rainfall and dam releases caused widespread flooding in Alampur village in Mahabub Nagar district, a historically drought-prone area.
2) The flood damaged or destroyed homes, buildings, infrastructure, crops, and documents. It displaced many residents and cut off the village.
3) The socioeconomic conditions and mud-based construction of homes in the village exacerbated the flood's impacts, making damage more severe and recovery more difficult.
The document summarizes the Hudhud cyclone that struck Visakhapatnam, India in October 2014. It describes the cyclone's formation, rapid intensification to winds of 175 km/h, and landfall near Visakhapatnam. The cyclone caused extensive damage estimated at over $1 billion and at least 109 deaths in India and Nepal. Infrastructure like buildings, bridges, and power lines were destroyed. Crops and fishing boats were also damaged. The document then discusses coping strategies and improvements needed to disaster management plans to better prepare for future cyclones.
Groundwater investigation using geophysical methods a case study of pydibhim...eSAT Publishing House
This document summarizes the results of a geophysical investigation using vertical electrical sounding (VES) methods at 13 locations around an industrial area in India. The VES data was interpreted to generate geo-electric sections and pseudo-sections showing subsurface resistivity variations. Three main layers were typically identified - a high resistivity topsoil, a weathered middle layer, and a basement rock. Pseudo-sections revealed relatively more weathered areas in the northwest and southwest. Resistivity sections helped identify zones of possible high groundwater potential based on low resistivity anomalies sandwiched between more resistive layers. The study concluded the electrical resistivity method was useful for understanding subsurface geology and identifying areas prospective for groundwater exploration.
Flood related disasters concerned to urban flooding in bangalore, indiaeSAT Publishing House
1. The document discusses urban flooding in Bangalore, India. It describes how factors like heavy rainfall, population growth, and improper land use have contributed to increased flooding in the city.
2. Flooding events in 2013 are analyzed in detail. A November rainfall caused runoff six times higher than the drainage capacity, inundating low-lying residential areas.
3. Impacts of urban flooding include disrupted daily life, damaged infrastructure, and decreased economic activity in affected areas. The document calls for improved flood management strategies to better mitigate urban flooding risks in Bangalore.
Enhancing post disaster recovery by optimal infrastructure capacity buildingeSAT Publishing House
This document discusses enhancing post-disaster recovery through optimal infrastructure capacity building. It presents a model to minimize the cost of meeting demand using auxiliary capacities when disaster damages infrastructure. The model uses genetic algorithms to select optimal capacity combinations. The document reviews how infrastructure provides vital services supporting recovery activities and discusses classifying infrastructure into six types. When disaster reduces infrastructure services, a gap forms between community demands and available support, hindering recovery. The proposed research aims to identify this gap and optimize capacity selection to fill it cost-effectively.
Effect of lintel and lintel band on the global performance of reinforced conc...eSAT Publishing House
This document analyzes the effect of lintels and lintel bands on the seismic performance of reinforced concrete masonry infilled frames through non-linear static pushover analysis. Four frame models are considered: a frame with a full masonry infill wall; a frame with a central opening but no lintel/band; a frame with a lintel above the opening; and a frame with a lintel band above the opening. The results show that the full infill wall model has 27% higher stiffness and 32% higher strength than the model with just an opening. Models with lintels or lintel bands have slightly higher strength and stiffness than the model with just an opening. The document concludes lintels and lintel
Wind damage to trees in the gitam university campus at visakhapatnam by cyclo...eSAT Publishing House
1) A cyclone with wind speeds of 175-200 kph caused massive damage to the green cover of Gitam University campus in Visakhapatnam, India. Thousands of trees were uprooted or damaged.
2) A study assessed different types of damage to trees from the cyclone, including defoliation, salt spray damage, damage to stems/branches, and uprooting. Certain tree species were more vulnerable than others.
3) The results of the study can help in selecting more wind-resistant tree species for future planting and reducing damage from future storms.
Wind damage to buildings, infrastrucuture and landscape elements along the be...eSAT Publishing House
1) A visual study was conducted to assess wind damage from Cyclone Hudhud along the 27km Visakha-Bheemli Beach road in Visakhapatnam, India.
2) Residential and commercial buildings suffered extensive roof damage, while glass facades on hotels and restaurants were shattered. Infrastructure like electricity poles and bus shelters were destroyed.
3) Landscape elements faced damage, including collapsed trees that damaged pavements, and debris in parks. The cyclone wiped out over half the city's green cover and caused beach erosion around protected areas.
1) The document reviews factors that influence the shear strength of reinforced concrete deep beams, including compressive strength of concrete, percentage of tension reinforcement, vertical and horizontal web reinforcement, aggregate interlock, shear span-to-depth ratio, loading distribution, side cover, and beam depth.
2) It finds that compressive strength of concrete, tension reinforcement percentage, and web reinforcement all increase shear strength, while shear strength decreases as shear span-to-depth ratio increases.
3) The distribution and amount of vertical and horizontal web reinforcement also affects shear strength, but closely spaced stirrups do not necessarily enhance capacity or performance.
Role of voluntary teams of professional engineers in dissater management – ex...eSAT Publishing House
1) A team of 17 professional engineers from various disciplines called the "Griha Seva" team volunteered after the 2001 Gujarat earthquake to provide technical assistance.
2) The team conducted site visits, assessments, testing and recommended retrofitting strategies for damaged structures in Bhuj and Ahmedabad. They were able to fully assess and retrofit 20 buildings in Ahmedabad.
3) Factors observed that exacerbated the earthquake's impacts included unplanned construction, non-engineered buildings, improper prior retrofitting, and defective materials and workmanship. The professional engineers' technical expertise was crucial for effective post-disaster management.
This document discusses risk analysis and environmental hazard management. It begins by defining risk, hazard, and toxicity. It then outlines the steps involved in hazard identification, including HAZID, HAZOP, and HAZAN. The document presents a case study of a hypothetical gas collecting station, identifying potential accidents and hazards. It discusses quantitative and qualitative approaches to risk analysis, including calculating a fire and explosion index. The document concludes by discussing hazard management strategies like preventative measures, control measures, fire protection, relief operations, and the importance of training personnel on safety.
Review study on performance of seismically tested repaired shear wallseSAT Publishing House
This document summarizes research on the performance of reinforced concrete shear walls that have been repaired after damage. It begins with an introduction to shear walls and their failure modes. The literature review then discusses the behavior of original shear walls as well as different repair techniques tested by other researchers, including conventional repair with new concrete, jacketing with steel plates or concrete, and use of fiber reinforced polymers. The document focuses on evaluating the strength retention of shear walls after being repaired with various methods.
Monitoring and assessment of air quality with reference to dust particles (pm...eSAT Publishing House
This document summarizes a study on monitoring and assessing air quality with respect to dust particles (PM10 and PM2.5) in the urban environment of Visakhapatnam, India. Sampling was conducted in residential, commercial, and industrial areas from October 2013 to August 2014. The average PM2.5 and PM10 concentrations were within limits in residential areas but moderate to high in commercial and industrial areas. Exceedance factor levels indicated moderate pollution for residential areas and moderate to high pollution for commercial and industrial areas. There is a need for management measures like improved public transport and green spaces to combat particulate air pollution in the study areas.
Low cost wireless sensor networks and smartphone applications for disaster ma...eSAT Publishing House
This document describes a low-cost wireless sensor network and smartphone application system for disaster management. The system uses an Arduino-based wireless sensor network comprising nodes with various sensors to monitor the environment. The sensor data is transmitted to a central gateway and then to the cloud for analysis. A smartphone app connected to the cloud can detect disasters from the sensor data and send real-time alerts to users to help with early evacuation. The system aims to provide low-cost localized disaster detection and warnings to improve safety.
Coastal zones – seismic vulnerability an analysis from east coast of indiaeSAT Publishing House
This document summarizes an analysis of seismic vulnerability along the east coast of India. It discusses the geotectonic setting of the region as a passive continental margin and reports some moderate seismic activity from offshore in recent decades. While seismic stability cannot be assumed given events like the 2004 tsunami, no major earthquakes have been recorded along this coast historically. The document calls for further study of active faults, neotectonics, and implementation of improved seismic building codes to mitigate vulnerability.
Can fracture mechanics predict damage due disaster of structureseSAT Publishing House
This document discusses how fracture mechanics can be used to better predict damage and failure of structures. It notes that current design codes are based on small-scale laboratory tests and do not account for size effects, which can lead to more brittle failures in larger structures. The document outlines how fracture mechanics considers factors like size effect, ductility, and minimum reinforcement that influence the strength and failure behavior of structures. It provides examples of how fracture mechanics has been applied to problems like evaluating shear strength in deep beams and investigating a failure of an oil platform structure. The document argues that fracture mechanics provides a more scientific basis for structural design compared to existing empirical code provisions.
This document discusses the assessment of seismic susceptibility of reinforced concrete (RC) buildings. It begins with an introduction to earthquakes and the importance of vulnerability assessment in mitigating earthquake risks and losses. It then describes modeling the nonlinear behavior of RC building elements and performing pushover analysis to evaluate building performance. The document outlines modeling RC frames and developing moment-curvature relationships. It also summarizes the results of pushover analyses on sample 2D and 3D RC frames with and without shear walls. The conclusions emphasize that pushover analysis effectively assesses building properties but has limitations, and that capacity spectrum method provides appropriate results for evaluating building response and retrofitting impact.
Effect of hudhud cyclone on the development of visakhapatnam as smart and gre...eSAT Publishing House
This document discusses the effects of Cyclone Hudhud on the development of Visakhapatnam as a smart and green city through a case study and preliminary surveys. The surveys found that 31% of participants had experienced cyclones, 9% floods, and 59% landslides previously in Visakhapatnam. Awareness of disaster alarming systems increased from 14% before the 2004 tsunami to 85% during Cyclone Hudhud, while awareness of disaster management systems increased from 50% before the tsunami to 94% during Hudhud. The surveys indicate that initiatives after the tsunami improved awareness and preparedness. Developing Visakhapatnam as a smart, green city should consider governance
This document summarizes a product called H-HUTS that aims to provide sustainable disaster recovery housing. H-HUTS uses cardboard and origami-inspired modular construction to quickly provide temporary shelters after disasters. The cardboard shelters are designed to be upgraded into permanent homes over time using low-cost materials like shotcrete or concrete. The modular design allows for flexibility and community participation in construction. Testing has shown the shelters can withstand wind loads and provide adequate insulation. The goal of H-HUTS is to not just provide initial shelter but help disaster-affected communities regain permanency in housing and recover in the long-term.
Batteries -Introduction – Types of Batteries – discharging and charging of battery - characteristics of battery –battery rating- various tests on battery- – Primary battery: silver button cell- Secondary battery :Ni-Cd battery-modern battery: lithium ion battery-maintenance of batteries-choices of batteries for electric vehicle applications.
Fuel Cells: Introduction- importance and classification of fuel cells - description, principle, components, applications of fuel cells: H2-O2 fuel cell, alkaline fuel cell, molten carbonate fuel cell and direct methanol fuel cells.
Null Bangalore | Pentesters Approach to AWS IAMDivyanshu
#Abstract:
- Learn more about the real-world methods for auditing AWS IAM (Identity and Access Management) as a pentester. So let us proceed with a brief discussion of IAM as well as some typical misconfigurations and their potential exploits in order to reinforce the understanding of IAM security best practices.
- Gain actionable insights into AWS IAM policies and roles, using hands on approach.
#Prerequisites:
- Basic understanding of AWS services and architecture
- Familiarity with cloud security concepts
- Experience using the AWS Management Console or AWS CLI.
- For hands on lab create account on [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
# Scenario Covered:
- Basics of IAM in AWS
- Implementing IAM Policies with Least Privilege to Manage S3 Bucket
- Objective: Create an S3 bucket with least privilege IAM policy and validate access.
- Steps:
- Create S3 bucket.
- Attach least privilege policy to IAM user.
- Validate access.
- Exploiting IAM PassRole Misconfiguration
-Allows a user to pass a specific IAM role to an AWS service (ec2), typically used for service access delegation. Then exploit PassRole Misconfiguration granting unauthorized access to sensitive resources.
- Objective: Demonstrate how a PassRole misconfiguration can grant unauthorized access.
- Steps:
- Allow user to pass IAM role to EC2.
- Exploit misconfiguration for unauthorized access.
- Access sensitive resources.
- Exploiting IAM AssumeRole Misconfiguration with Overly Permissive Role
- An overly permissive IAM role configuration can lead to privilege escalation by creating a role with administrative privileges and allow a user to assume this role.
- Objective: Show how overly permissive IAM roles can lead to privilege escalation.
- Steps:
- Create role with administrative privileges.
- Allow user to assume the role.
- Perform administrative actions.
- Differentiation between PassRole vs AssumeRole
Try at [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...IJECEIAES
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
artificial intelligence and data science contents.pptxGauravCar
What is artificial intelligence? Artificial intelligence is the ability of a computer or computer-controlled robot to perform tasks that are commonly associated with the intellectual processes characteristic of humans, such as the ability to reason.
› ...
Artificial intelligence (AI) | Definitio
An improved modulation technique suitable for a three level flying capacitor ...IJECEIAES
This research paper introduces an innovative modulation technique for controlling a 3-level flying capacitor multilevel inverter (FCMLI), aiming to streamline the modulation process in contrast to conventional methods. The proposed
simplified modulation technique paves the way for more straightforward and
efficient control of multilevel inverters, enabling their widespread adoption and
integration into modern power electronic systems. Through the amalgamation of
sinusoidal pulse width modulation (SPWM) with a high-frequency square wave
pulse, this controlling technique attains energy equilibrium across the coupling
capacitor. The modulation scheme incorporates a simplified switching pattern
and a decreased count of voltage references, thereby simplifying the control
algorithm.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
Comparative analysis between traditional aquaponics and reconstructed aquapon...bijceesjournal
The aquaponic system of planting is a method that does not require soil usage. It is a method that only needs water, fish, lava rocks (a substitute for soil), and plants. Aquaponic systems are sustainable and environmentally friendly. Its use not only helps to plant in small spaces but also helps reduce artificial chemical use and minimizes excess water use, as aquaponics consumes 90% less water than soil-based gardening. The study applied a descriptive and experimental design to assess and compare conventional and reconstructed aquaponic methods for reproducing tomatoes. The researchers created an observation checklist to determine the significant factors of the study. The study aims to determine the significant difference between traditional aquaponics and reconstructed aquaponics systems propagating tomatoes in terms of height, weight, girth, and number of fruits. The reconstructed aquaponics system’s higher growth yield results in a much more nourished crop than the traditional aquaponics system. It is superior in its number of fruits, height, weight, and girth measurement. Moreover, the reconstructed aquaponics system is proven to eliminate all the hindrances present in the traditional aquaponics system, which are overcrowding of fish, algae growth, pest problems, contaminated water, and dead fish.
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...shadow0702a
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
Sdci scalable distributed cache indexing for cache consistency for mobile environments
1. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 428
SDCI: SCALABLE DISTRIBUTED CACHE INDEXING FOR CACHE
CONSISTENCY FOR MOBILE ENVIRONMENTS
G. Lingamaiah1
, S. G. Nawaz2
, B. Dhanunjaya3
, G. Peddi Raju4
, K. Somasena Reddy5
Gujjala.lingamaiah@gmail.com, sngnawaz@gmail.com, Bandidhanunjaya700@gmail.com, peddi.raju15@gmail.com,
Somasena12@gmail.com
Abstract
In this paper, we suggest a new cache consistency maintenance scheme, namely Scalable distributed cache indexing for Cache
Consistency (SDCI), for mobile environments. It mainly depends on 3 key features. They are: (1) Utilization of standard bits at server
and Mobile Node's cache for maintaining cache consistency; (2) Utilization of Local Cache Standard (LC-standard) for all entries in
Mobile Node's cache after its invalidation for maximizing the broadcast bandwidth efficiency; (3) Making every valid entry of Mobile
Node's cache to whenever it wakes up. These features make the SDCI a good scalable algorithm with minimum database management
overhead. By observing Comprehensive simulation results we can see that the performance of SDCI is superior to those of existing
algorithms.
Keywords: indexing, cache updating, mobile network, SDCI, SSUM
-----------------------------------------------------------------------***-----------------------------------------------------------------------
1. INTRODUCTION
The use of wireless communication has been increasing day-
by-day and has become a significant means for people to
access different kinds dynamically changing data objects, such
as news, stock price, and traffic information. But, wireless
mobile computing environments are restricted by
communication bandwidth and battery power [1], and have to
survive with Mobile Node's disconnectedness and mobility.
So, data communication in wireless mobile networks is
difficult compared to that of wired networks.
Caching frequently used data objects at the local buffer of a
Mobile Node is a better way to decrease query delay, save
bandwidth and ameliorate system performance. However, in
wireless mobile computing environments, difficulty in cache
consistency arises with the frequent disconnection and
roaming of an Mobile Node. A strategy that is successful must
be able to efficiently handle both disconnectedness and
mobility. The advantage with the broadcast is that it is able to
serve an arbitrary number of Mobile Nodes with minimum
bandwidth consumption. So, efficient mobile data
transmission architecture should prudently design its broadcast
and cache management schemes to maximize and minimize
delay. Efficient mobile data transmission architecture should
also be scalable, such that it works efficiently for large
database systems and also upholds a large number of Mobile
Nodes.
In the literature, there exist 2 types of cache consistency
maintenance algorithms for wireless mobile computing envi-
ronments. They are stateless and state-full. In the case of
stateless approach, the server doesn’t know the client's cache
content. The client requires for verifying the validity of cached
entries from the server before each and every query. Even
though stateless approaches use simple database management,
their scalability and capacity to uphold disconnectedness are
poor. On the other hand, approaches are scalable. However,
they cause significant overhead because of server database
management. So, there is a necessity to develop scalable and
efficient algorithms for maintaining cache consistency in
mobile environments.
Inspired by the necessity for a scalable and efficient cache
consistency maintenance mechanism, we put forward a new
algorithm, namely scalable asynchronous cache consistency
schema (SDCI) that maintains cache consistency between the
Central Data Provider (CDP) and Mobile Node's caches. SDCI
is a highly scalable, efficient, and low complexity algorithm
because of the 3 key features: (1) Utilization of standard bits at
server and Mobile Node's cache for maintaining cache
consistency; (2) Utilization of an iD for each and every entry
in Mobile Node's cache after its invalidation for maximizing
the broadcast bandwidth efficiency; (3) Making all valid
entries of Mobile Node's cache to uncertain state when it
wakes up.
Comprehensive simulation results reveal that SDCI gives
superior performance than existing algorithms. Taking an
example, in a system having different types of Mobile Node
access patterns and data object update frequencies, SDCI will
be able to support about 44 percent and 270 percent more
Mobile Nodes than Timestamp (SSUM) schemes,
respectively. It also makes sure that the average access delay
is no larger than seconds.
2. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 429
Remaining part of the paper is organized as given below.
Section ii is a brief overview of the related work. In Section
III, complete description of the SDCI algorithm is given.
Section IV gives comprehensive simulation results of the
algorithm and after that compares it with already existing
procedures. Section V is about the conclusions drawn.
2. RELATED WORK
We summarize existing stateless and stateful processes in this
section. In the stateless approach [2]-[7], a CDP presumes no
knowledge of Mobile Node's cache contents. CDP sends
CUAs to its Mobile Nodes sporadically. At an Mobile Node, a
data object request cannot be serviced until the next IR from
the CDP is received. In the stateful approach [8], an CDP
preserves object state for each Mobile Node's cache and only
broadcasts CUAs for those objects.
Barbara and Imielinksi [2] put forwarded 3 stateless algo-
rithms: Timestamps (SSUM), Amnesic Terminals (AT) and
Signature (SIG). In these algorithms, the CDP broadcasts
CUAs, that consist all data object IDs that are updated during
the past seconds (where is a positive integer), every seconds.
The benefit of these algorithms is that an CDP does not
maintain any state information about its Mobile Node's
caches, and this makes the management of CDP database very
easy. But, there are many disadvantages with these algorithms.
The first problem is that they do not scale well to large
databases and/or fast updating data systems, because of
increased number of IR messages. The second one is that the
average access latency is usually longer than half of the
broadcast period. This is because all requests can be answered
only after the next IR. Lastly all cached data objects are
dropped in the case of the sleep time is longer than.
For handling the long sleep-wake up patterns, various
algorithms have been suggested. Going by example, in the bit-
sequence (BS) algorithm because of Jing, et al. [3], every
cache entry is deleted only when half or more of the data
entries in the cache have been nullified. But, the model needs
the broadcast of a very large number of IR messages
compared to that of SSUM and AT schemes. Wu et al. [5]
suggested an uplink validation check scheme which will be
able to deal with long sleep-wake up themes better than
SSUM and AT. However the problem with this approach is
that this approach needs more uplink bandwidth and cannot
deal with long sleep-wake up patterns.
A very few stateful cache consistency maintenance algorithms
have been suggested for wireless mobile computing
environments. Khaleel Mershad et al[12] proposed a smart
server update mechanism for Maintaining Cache Consistency
in Mobile Environments. Though the solution is impressive
when compared to most frequently cited solutions in earlier
literature, but still it is probabilistic to make available data in
cache for nodes,.
In AS, an CDP records all retrieved data object for each and
every Mobile Node. After an Mobile Node first gets back a
data object after it wakes up, the CDP sends an IR, depending
on the Mobile Node's cache content record and sleep-wake up
time, to that respective Mobile Node. When an CDP gets an
update from the original server for all the recorded data
objects, it broadcasts that data object's IR to Mobile Nodes.
The benefit of the AS scheme is that the CDP averts needless
broadcast of CUAs to Mobile Nodes and also it can deal with
any sleep-wake-up pattern without losing any valid data ob-
ject. But, for maintaining each Mobile Node's cache state in
the CDP, the CDP must and should record all cached data
objects for each and every Mobile Node. So an Mobile Node
can be able to download data objects which it requested using
the uplink. This renders the channel utility inefficient and
sensitive to the number of Mobile Nodes.
3. SCALABLE DISTRIBUTED CACHE INDEXING FOR
CACHE CONSISTENCY (SDCI)
In this particular paper, we suggest a new Scalable distributed
cache indexing for Cache Consistency (SDCI) for maintaining
Mobile Node's cache consistency that is used in a read-only
system. SDCI is a hybrid of stateless and stateful procedures
which means that it maintains minimum state information.
But, unlike the stateful algorithm [12] that makes the CDP to
remember all data objects for all Mobile Node's cache, SDCI
needs only the CDP to recognize which data objects in its
database might be valid in Mobile Node's caches, making the
management of the CDP database much simpler than usual.
However, unlike prevailing synchronous stateless processes,
SDCI does not need periodic broadcast of CUAs, decreasing
IR messages that are required to be sent through the downlink
broadcast channel. Also, by appending uncertain and Local-
Cache states in Mobile Node's caches, SDCI makes easy
handling of arbitrary sleep-wake-up patterns and mobility, and
good cooperation among all Mobile Nodes that greatly
enhances broadcast channel efficiency. The subsections that
follow explain the suggested algorithm in detail.
A. Data Structures and Message Formats
For each and every data object having distinct identifier x , the
data structure for CDP and Mobile Node's cache are as given
below:
• ( , , )x x xd t f Data entry format for each data object in
CDP. Here xd , is the data object, xt is the last update time
for the data object and xf is a flag bit.
• ( , , )x x xd ts s :data entry format in an Mobile Node's
cache. Here xd is defined above, xts is the time stamp
showing the last updated time for the cached data object
xd dx, and xs is a two-bit flag recognizing 4 data entry
3. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 430
states: stable , uncertain, waiting And
LC standard respectively.
B. Mobile Node Cache Management
As this paper is mainly about the cache consistency mainte-
nance design, we utilize the LRU (Least Recently Used) based
replacement algorithm for managing Mobile Node's caches.
The effect of the cache replacement algorithms on SDCI is
studied later.
In LRU based replacement scheme, a data object that is
recently cached or a cached data object that gets a hit is
relocated to the head of the cache list. Whenever a data object
requires to be cached and the cache is full, data entries with sx
2 from the tail are removed for creating enough space in
order to accommodate this new data object (the data object
with sx = 2 must be kept so that some requests are waiting for
its confirmation).
Any refreshed data objects from uncertain state or Local-
Cache state are moved to their original location and again, if
required, sufficient data entries from the tail are deleted.
C. Algorithm Description
We have given 2 procedures, i.e., CDP-trans () and Mobile
Node transactions, for the SDCI. The CDP continuously
performs the CDP-trans () and each Mobile Node
continuously performs the Mobile Node Transactions method
during its awake period.
The pseudo codes for CDP-trans () and Mobile Node
Transactions are as shown in Figures 1 and 2.
CDP-trans ( ( )request x ) {
( )sts findStatus x
( )if sts available begin
Broadcast , ,x xd t x
rValue available
( 0)xif f
1xf
End;
( )if sts uncertain
( )x xif t ts
Broadcast ( , )xx t
rValue confirm
else
Broadcast , ,x xd t x
rValue available
( 0)xif f
1xf
( )if sts update
Update the database entry (
'&& 'x x x xd d t t )
( 1)xif f begin
Broadcast
( )cua x
0xf
End;
Fig1:CDP-trans
D. Cache Consistency Maintenance
We explain in detail how SDCI sustains consistency between
an CDP database and Mobile Node caches. We presume that
the consistency between the CDP database and original
servers is sustained using wired network consistency
algorithms [9], [10].
For each and every cached data object, SDCI utilizes a single
flag bit xf , for maintaining the consistency between the CDP
and Mobile Node caches. Whenever xd is recovered by an
Mobile Node, fx is set, showing that a valid copy of xd may
be ready to use in an Mobile Node's cache. Whenever the
CDP gets an updated xd
, it broadcasts and resets. This action
shows that there are no valid copies of xd in any Mobile
Node's caches. Also, further updates do not necessitate
broadcast of IR(x).
The flag is set again whenever the CDP services restoration
(comprising request and confirmation) for xd
by an Mobile
Node.
In mobile environments, an Mobile Node's cache is in either
of two states: (i) awake or (ii) sleep. In the case of an Mobile
Node is awake at the time of IR(x) broadcast, the xd
copy is
invalidated and an ID-only
4. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 431
mnRequestHandler(
( )xreq d ) {
( )xsts reqStatus d
( )if sts stable
Update cache list
Return
( )xcached d
( )if sts uncertain
Add x to waiting
list
Set 2xs
Update cache list
head with this entry
Return
( , )xuncertain x ts
( )if sts unavailble
send request to
CDP
add x to query
waiting list
}
mnResponseHandler(
( )xresp d ){
( )sts status x
( )if sts available
Remove x from cache
Add x to cache head
return xd
( )if sts waiting
//ELSE IF (entry x is ID-
only entry in cache )
mnRequestHandler(
( )xreq d
( )elseif sts uncertain
( )x xif ts t
0
x x
x
ts t
s
mnRequestHandler(
( )xreq d
else
0xs
}
mnCacheUpdateAlertHand
ler( ( )cua x ){
( ( ))msg reqStatus cua x
( )xsts reqStatus d
(( )&&( ||if msg update sts available sts uncerta
begin
3xs
( )xremove d
end
}
( )&&( )&&( xelseif msg confirm sts uncertain ts
0xs
( )&&( )elseif msg confirm sts waiting
Return xd
else
( )xdelete d
3xs
}
Fig2: Mobile Node Transactions
Entry is sustained by the Mobile Node. The data objects of a
Mobile Node in the sleep state are not affected until it wakes
up. Whenever an Mobile Node wakes up, it sets all cached
valid data objects (including) into the uncertain state. As a
result sleeping Mobile Nodes and the cached objects are not
affected by missing broadcast.
E. Efficiency and Cooperation
As stated earlier, a good cache consistency maintenance
algorithm must be able to get scaled and also must be efficient
in terms of the database size and the number of Mobile Nodes.
SDCI are able to handle large and fast updating data systems
as the CDP has some knowledge of Mobile Node's cache.
Only data entries that have standard bits set result in the
broadcast of IBs whenever data objects get updated. As a
result, the IR broadcast frequency is the minimum of the
uplink query/confirmation frequency and the data object
update frequency. Similarly, the broadcast channel bandwidth
consumption for CUAs is minimized.
mnWakeupHandler(){
( 0)
1
foreach s
s
}
5. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 432
In addition to IR traffic, all other traffic in SDCI is also mini-
mized because of the strong cooperation among the Mobile
Node's caches. Specifically, this is because of the introduction
of the uncertain state and the Local-Cache state for the Mobile
Node's caches. The recovery of a data object, xd from the
CDP allotted by any given Mobile Node makes the x entries in
the uncertain or Local-Cache state in all the awake Mobile
Node's caches to a valid state. Also, a single uplink con-
firmation for in the uncertain state makes the entries in
uncertain state for all the awake Mobile Node's caches to
either valid or Local-Cache state. The addition of the uncertain
state also helps an Mobile Node's cache in order to keep all the
valid data objects after it wakes up from duration of sleep
time. In contrast, for SSUM algorithms, every invalidated
data object is completely removed from the Mobile Node's
cache. This helps in bringing little cooperation among the
Mobile Nodes, creating a dramatic increase of traffic volume
between the CDP and the Mobile Nodes as the number of
Mobile Nodes increases (see in Section V). Even though it
improves the scalability of SSUM by holding the invalid data
objects, it decreases the cache efficiency by keeping the
invalid data objects, instead of IDs as is the case in our SDCI
approach, in the Mobile Node's cache.
In variance with the AS scheme that needs O(MN) buffer
space in the CDP for keeping all the Mobile Node's cache
state, our procedure only requires one bit per data object in the
CDP showing that if the broadcast is necessary whenever the
data object is updated. Also, the added management overhead
is minimal as it needs only a single bit check and set/reset.
F. Mobility
Generally, synchronous stateless procedures handle Mobile
Node's mobility by presuming that all CDPs broadcast the
same CUAs .But, in the case of the number of CDPs being
large, those systems cannot be scaled. There is no other
alternate way for handling the Mobile Node's mobility in the
literature. In our approach, an Mobile Node roaming into a
new cell is considered as if it just woke up from the sleep
state, i.e., every valid data object is set to the uncertain state.
The consistency is guaranteed by using this approach and
every valid data object is retained. Moreover, SDCI is simple
because it is transparent to the CDPs engaged. In this
approach, the roaming effect is nothing but the addition of a
new sleep-wake-up pattern and should not have any
substantial impact on the overall performance. This paper
emulates the roaming effect by a sleep-wake-up pattern.
4. PERFORMANCE EVALUATION BY
SIMULATION
A. simulation setup
We take into consideration a single cell system with one CDP
database and multiple Mobile Nodes having identical cache
size. The request process for each Mobile Node is presumed to
be Poisson distributed and the update processes for data
objects are also Poisson distributed. Moreover, the sleep-
wake-up process is made into a model having a two-state
Markov chain.
In our simulation, we utilized a single channel with bandwidth
CB for both downlink as well as uplink data transmission.
Every message is queued and serviced based on a first-come-
first- serve basis. Every request is neglected whenever an
Mobile Node is in the sleep state. Error recovering cost and
software overhead are also neglected. Whenever a requested
data object is available at an Mobile Node's local cache, the
delay AQD is counted as 0. A Zip f—like distribution Mobile
Node access pattern [11] is utilized in the simulation.
The following subsections give a comprehensive comparison
of the suggested SDCI with SSUM algorithms by means of
metrics and for 3 distinct cases. The average access delay is a
significant measurement of system performance, a shorter
AQD, a better performance. The uplink per query is associated
to cache hit ratio. Whenever an Mobile Node receives a query,
in the case of the queried data object being valid in the cache,
a cache hit is counted, and no uplink is required for the query.
So, higher hit ratio, fewer uplink per query.
B. Case Studies
Three cases are given here. In each case, ub =64 and bd = 64
for both SDCI, and bu = 10 and bd = 10 for SSUM[12].
The bandwidth is set as CB=10000bps. Cache size is in units
of the number of data objects and the maximum number of ID-
only entries is also set to in the first two cases. Data object
sizes and data object update frequencies. They will be
provided later in detail and @ is used to denote them in Table
II. Each and every case study correlates to a parameter effect
that is shown by * in the column.
Case 1: Effect of CDP Database Size
Table 1 shows the simulation results of AQD and UPQS for
two algorithms with distinct database sizes.
From Table III, we see that SDCI outperforms the SSUM [12]
on both performance metrics for distinct database sizes (N).
Whenever the database size reaches approx 13000, AQD for
SSUM is over 160 sec. But in case of SDCI, we can observe a
slow increase of the performance metrics as increases all the
way up to approx N value 13000.
In brief, the performances of SDCI are insensitive to the
database size N and so it can be used to scale large database
sizes. But, the performance of SSUM is responsive to the
database size, specifically in terms of the delay
performance, and so SSUM cannot be used to scale large
database sizes.
Case 2: Effect of Data Update Rate
6. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 433
Table IV shows the simulation results of the effect of update
interval ut . Moreover, it is observed SDCI outperforms SSUM
[12] for all these performance metrics. As assumed, as ut
declines, both performance metrics increase for all these
algorithms. But, SDCI show slower rates of increase
compared to SSUM for all the metrics. Particularly, whenever
ut is declined to 10 sec, the delay performance of SSUM is
very large (about 50 sec) beyond acceptance. At this update
interval, SDCI gets considerable delay performance gain over
SSUM. For uplink per query, SDCI outperforms SSUM in the
range of 5 to 30 percent.
Case 3: Effect of the Number of Mobile Nodes. In this case
study, we take into consideration a system identical to a real
situation. We presume that a cell has 5 distinct Mobile Node
query patterns as
1
(10 50* )i
and s=0.9-0.2*I and Ts =
500 * (i + 1) sec with i = 0,1,2,3 and 4.
Each and every query pattern group has M/5 Mobile Nodes in
it. We presume the query patterns for all the groups follow Zip
f-like (z=1 ) distribution. The access popularity ranking for the
neighboring groups is moved by 10, i.e., group I has declining
popularity from data object 1 to 1000 and group 2from 11to
1000 and then from 1to 10, and so on.
We also presume that there are 5 types of data objects in the
CDP as:
500*( 1)pb i
and
1
10 seci
uT
with i=
0,1,2,3 and 4
Table1: Average Query Delay per no of records
100 200 400 80
0
1600 3200 640
0
1280
0
SD
CI
0.16
5
0.29
8
0.42
9
0.5
64
0.67
9
0.78
4
0.8
96
1.01
5
SSU
M
12.3
14
12.9
74
13.8
62
14.
43
9
14.9
94
15.4
94
17.
465
161.
977
per no of transactions
10 40 160 640 2560 10240
SDCI 3.004 1.6 0.934 0.667 0.59
6
0.573
SSUM 50.006 36.9 17.139 15.488 15.0
96
14.879
Table 2: Uplink per query per no of records
100 200 400 800 1600 3200 6400 12800
SD
CI
0.2
34
0.3
34
0.4
28
0.495 0.55
8
0.59
9
0.64
8
0.673
SS 0.7 0.7 0.8 0.861 0.89 0.89 0.92 0.924
UM 56 93 32 3 5 2
per no of transactions
(a) Per no of records
(b) Per no of transactions
Fig 3: Line chart representation of Average query delay
comparison between SDCI and SSUM
(a)Per no of records
10 40 160 640 2560 10240
SDCI 0.838 0.717 0.584 0.509 0.513 0.520
SSUM 0.999 0.986 0.956 0.893 0.839 0.825
7. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 434
(b)Per no of transactions
Fig 4: Line chart representation of uplink per query
comparison between SDCI and SSUM
Each and every data type group has N/5 data objects.
The parameter values that are selected above depend on the
understanding that a highly frequent query of Mobile Node
usually implies a shorter awake time and in the case of a faster
updated data object generally has a smaller size. The cache
size is 150 Kbytes. The maximum number of data ID-only
entries which can be put in each Mobile Node cache is set at
100.
Figures 3 and 4 describe AQD and uplink per query
comparison between SDCI and SSUM, respectively. As we
can observe, SDCI scales much better compared to SSUM in
terms of both performance metrics.
CONCLUSIONS AND FUTURE WORK
In this paper, we suggested a Scalable distributed cache
indexing for Cache Consistency (SDCI) for mobile
environments. 3 key features of SDCI are: (i) use of standard
bits at CDP and Mobile Node's caches to sustain cache
consistency; (ii) utilization of a Local-Cache state for each and
every entry in Mobile Node's cache after a data object
becomes nullified; (iii) all acceptable data entries are set to the
uncertain state after an Mobile Node wakes up. These main
features make the suggested algorithm highly scalable and
efficient. To be straight forward, SDCI is a hybrid of stateful
and stateless algorithms. But, unlike stateful algorithms, SDCI
sustains one flag bit for each and every data object in CDP to
ascertain whenever to broadcast CUAs. On the flipside, unlike
prevailing synchronous stateless procedures, SDCI does not
need periodic broadcast of CUAs. So SDCI largely declines
IR messages that are required to be sent through the downlink
broadcast channel. SDCI gets the positive features from both
stateful as well as stateless algorithms. Comprehensive
simulation results reveal that the suggested algorithm higher
performance compared to SSUM scheme. Future work will
comprise studying the effect of distinct replacement
algorithms on the performance of SDCI. Future study will also
delve into the CDP cache management algorithm and the
effective transfer cached data objects among CDPs when
Mobile Nodes roam among distinct CDPs.
REFERENCES
[1]G. Forman and J. Zahorjan, "The challenge of mobile
computing", IEEE Computer, 27(6), pp38-47, April 1994.
[2]D. Barbara and T. Imielinksi," Sleeper and Workaholics:
caching strat¬egy in mobile environments ", In Proceedings of
the ACM SIGMOD Conference on Management of Data, pp1-
12, 1994.
[3]J. Jing, A. Elmagarmid, A. Heal, and R. Alonso. "Bit-
sequences: an adaptive cache invalidation method in mobile
client/server environ¬ments", Mobile Networks and
Applications, pp 115-127, 1997.
[4]Q. Hu and D.K. Lee, "Cache algorithms based on adaptive
invalidation reports for mobile environments", Cluster
Computing, pp 39-50, 1998.
[5]K.L. Wu, P.S. Yu and M.S. Chen, "Energy-efficient
caching for wire¬less mobile computing", In 20th
International Conference on Data En¬gineering, pp 336-345,
1996
[6]G. Cao, "A scalable low-latency cache invalidation strategy
for mobile environments", ACM Intl. Conf. on Computing and
Networking (Mo- bicom), pp200-209, August, 2001
[7]K. Tan, J. Cai and B. ooi, "An evaluation of cache
invalidation strate¬gies in wireless environments", IEEE
Trans. on Parallel and Dis¬tributed System, 12(8), pp789-897,
2001
[8]A. Kahol, S. Khurana, S.K.S. Gupta and P.K. Srimani," A
strategy to manage cache consistency in a distributed mobile
wireless environ¬ment", IEEE Trans. on Parallel and
Distributed System, 12(7), pp 686¬700, 2001.
[9]H. Yu, L. Breslau and S. Shenker, "A scalable web cache
consistency architecture", In Proceedings ofthe ACM
SIGCOMM, August, 1999.
[10]J. Gwertzman and M. Seltzer, "World-Wide Web cache
consistency", In Proceedings of The USENIX Symposium on
Internet Technologies and Systems, December, 1997.
[11]L. Breslau, P. Cao, J. Fan, G. Phillips and S. Shenker,
"Web caching and Zipf-like distributions: evidence and
implications, ", Proceedings of IEEE INFOCOM'99,pp126-
134, 1999
[12]Khaleel Mershad and Hassan Artail, Senior Member,
IEEE; "SSUM: Smart Server Update Mechanism for
Maintaining Cache Consistency in Mobile Environments";
IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL.
9, NO. 6, JUNE 2010
[13] A. Elmagarmid, J. Jing, A. Helal, and C. Lee, “Scalable
Cache Invalidation Algorithms for Mobile Data Access,”
IEEE Trans. Knowledge and Data Eng., vol. 15, no. 6, pp.
1498-1511, Nov. 2003.
[14] H. Jin, J. Cao, and S. Feng, “A Selective Push Algorithm
for Cooperative Cache Consistency Maintenance over
MANETs,” Proc. Third IFIP Int’l Conf. Embedded and
Ubiquitous Computing, Dec. 2007.
8. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 435
[15] IEEE Standard 802.11, Wireless LAN Medium Access
Control (MAC) and Physical Layer (PHY) Specification,
IEEE, 1999.
[16] J. Jing, A. Elmagarmid, A. Helal, and R. Alonso, “Bit-
Sequences: An Adaptive Cache Invalidation Method in
Mobile Client/Server Environments,” Mobile Networks and
Applications, vol. 15, no. 2, pp. 115-127, 1997.
[17] J. Jung, A.W. Berger, and H. Balakrishnan, “Modeling
TTL-Based Internet Caches,” Proc. IEEE INFOCOM, Mar.
2003.
[18] X. Kai and Y. Lu, “Maintain Cache Consistency in
Mobile Database Using Dynamical Periodical Broadcasting
Strategy,” Proc. Second Int’l Conf. Machine Learning and
Cybernetics, pp. 2389- 2393, 2003.
[19] B. Krishnamurthy and C.E. Wills, “Piggyback Server
Invalidation for Proxy Cache Coherency,” Proc. Seventh
World Wide Web (WWW) Conf., Apr. 1998.
[20] B. Krishnamurthy and C.E. Wills, “Study of Piggyback
Cache Validation for Proxy Caches in the World Wide Web,”
Proc. USENIX Symp. Internet Technologies and Systems,
Dec. 1997.
[21] D. Li, P. Cao, and M. Dahlin, “WCIP: Web Cache
Invalidation Protocol,” IETF Internet Draft,
http://tools.ietf.org/html/draftdanli- wrec-wcip-01, Mar. 2001.
[22] W. Li, E. Chan, Y. Wang, and D. Chen, “Cache
Invalidation Strategies for Mobile Ad Hoc Networks,” Proc.
Int’l Conf. Parallel Processing, Sept. 2007.
[23] S. Lim, W.-C. Lee, G. Cao, and C.R. Das, “Performance
Comparison of Cache Invalidation Strategies for Internet-
Based Mobile-Ad Hoc Networks,” Proc. IEEE Int’l Conf.
Mobile Ad-Hoc and Sensor Systems, pp. 104-113, Oct. 2004.
[24] M.N. Lima, A.L. dos Santos, and G. Pujolle, “A Survey
of Survivability in Mobile Ad Hoc Networks,” IEEE Comm.
Surveys and Tutorials, vol. 11, no. 1, pp. 66-77, First Quarter
2009.
[25] H. Maalouf and M. Gurcan, “Minimisation of the Update
Response Time in a Distributed Database System,”
Performance Evaluation, vol. 50, no. 4, pp. 245-266, 2002.
[26] P. Papadimitratos and Z.J. Haas, “Secure Data
Transmission in Mobile Ad Hoc Networks,” Proc. ACM
Workshop Wireless Security (WiSe ’03), pp. 41-50, 2003.
[27] J.P. Sheu, C.M. Chao, and C.W. Sun, “A Clock
Synchronization Algorithm for Multi-Hop Wireless Ad Hoc
Networks,” Proc. 24th Int’l Conf. Distributed Computing
Systems, pp. 574-581, 2004.
[28] W. Stallings, Cryptography and Network Security, fourth
ed. Prentice Hall, 2006.
[29] D. Wessels, “Squid Internet Object Cache,” http://www.
squid-cache.org, Aug. 1998.
[30] J. Xu, X. Tang, and D. Lee, “Performance Analysis of
Location- Dependent Cache Invalidation Schemes for Mobile
Environments,” IEEE Trans. Knowledge and Data Eng., vol.
15, no. 2, pp. 474-488, Feb. 2003.
[31] L. Yin, G. Cao, and Y. Cai, “A Generalized Target
Driven Cache Replacement Policy for Mobile Environments,”
Proc. Int’l Symp. Applications and the Internet (SAINT ’03),
Jan. 2003.