This document summarizes a proposed minimum process checkpointing algorithm for mobile distributed systems. The algorithm aims to minimize the number of processes that take checkpoints to conserve battery life and bandwidth on mobile hosts. It captures dependencies between processes by piggybacking dependency vectors onto messages. The algorithm proceeds in two phases, with processes first taking mutable checkpoints locally before converting them to tentative checkpoints in coordination. It aims to minimize wasted effort if a process fails to checkpoint by only aborting mutable checkpoints in the first phase. The algorithm buffers messages during an "uncertainty period" between mutable and tentative checkpoints to prevent inconsistencies.
A comparative analysis of minimum process coordinated checkpointing algorithm...IAEME Publication
This document summarizes and compares several minimum-process coordinated checkpointing algorithms for mobile distributed systems. It begins with background on checkpointing techniques in distributed systems and issues specific to mobile distributed systems. It then describes five minimum-process coordinated checkpointing protocols: the Cao and Singhal algorithm, the Kumar and Kumar algorithm, the Silva and Silva algorithm, Koo-Toueg's algorithm, and the Coa and Singhal blocking algorithm. For each algorithm, it provides a brief overview of the approach and key aspects. The document aims to provide a comparative analysis of existing minimum-process checkpointing protocols for mobile distributed systems.
A comparative analysis of minimum process coordinated checkpointingiaemedu
This document summarizes and compares several minimum-process coordinated checkpointing algorithms for mobile distributed systems. It begins with background on checkpointing techniques in distributed systems and issues specific to mobile distributed systems. It then describes five minimum-process coordinated checkpointing protocols: the Cao and Singhal algorithm, the Kumar and Kumar algorithm, the Silva and Silva algorithm, Koo-Toueg's algorithm, and the Coa and Singhal blocking algorithm. For each algorithm, it provides a brief overview of the approach and key aspects. The document aims to provide a comparative analysis of existing minimum-process checkpointing protocols for mobile distributed systems.
Detection of Malicious Circuitry Using Transition Probability Based Node Redu...TELKOMNIKA JOURNAL
In recent years, serious concerns have been raised against the tampering of integrated circuits due to outsourcing of circuits for fabrication. It has led to the addition of malicious circuitry known as Hardware Trojan. In this paper, a transition probability based node reduction technique for faster and efficient Hardware Trojan (HT) detection has been attempted. In the proposed method, the fact that the least controllable and observable nodes or the nodes with least transition probability are more vulnerable as Trojan sites is taken into consideration. The nodes that have lesser activity than the threshold are the candidate nodes. At each candidate node, segmentation is done for further leakage power analysis to detect the presence of Trojans. Experimental results observed on ISCAS’85 and ISCAS’89 benchmark circuits illustrate that the proposed work can achieve remarkable node reduction upto 78.81% and time reduction upto 58.7%. It was also observed that the circuit activity can be increased by varying the input probability. Hence, for further reduction in the Trojan activation time, the weighted input probability was obtained.
RELIABILITY ASSESSMENT OF EMBEDDED SYSTEMS USING STOPWATCH PETRI NETSIJCSEA Journal
In this paper, we propose a reliability approach in which feared events define reliability requirements and
taking them into account allows to design systems which will be able to avoid the drift towards a feared
state. The description of feared scenarios since the system design phase enables us to understand the
reasons of the feared behavior in order to envisage the necessary reconfigurations and choose safe
architectures. In order to face the increasing complexity of embedded systems and to represent the
suspension and resumption of task execution we propose to extract directly feared scenarios from
Stopwatch Petri net model avoiding the generation of the associated reachability graph and the eternal
combinative explosion problem.
30 9762 extension paper id 0030 (edit i)IAESIJEECS
This paper deals with border distortion effect at starting and ending of finite signal by proposing sliding window technique and basic extension mode implementation. Single phase of transient and voltage sag is chosen to be analyzed in wavelet. The signal which being used for the analysis is simulated in Matlab 2017a. Disturbance signal decomposes into four level and Daubechies 4 (db4) has been chosen for computation. The proposed technique has been compared with conventional method which is finite length power disturbance analysis. Simulation result revealed that the proposed smooth-padding mode can be successfully minimized the border distortion effect compared to the zero-padding and symmetrization
CHECKPOINTING WITH MINIMAL RECOVERY IN ADHOCNET BASED TMRijujournal
The checkpointing algorithm described in the document utilizes Triple Modular Redundancy (TMR) in a wireless ad hoc network. It proposes a distributed checkpointing and recovery protocol that eliminates unnecessary checkpoints and only recovers dependent processes. Each process tracks message dependencies during execution. When a checkpoint is initiated, processes exchange status information detailing messages sent and received. A process only checkpoints after receiving any expected messages, ensuring consistency. If a process fails, only dependent processes recover by rolling back to their last checkpoint, minimizing recovery overhead.
Impact of black hole attack on aodv routing protocolZac Darcy
A
m
obile
a
d
-
hoc
n
etwork (MANET)
is a
collection
of wireless mobile nodes
that dynamically self
-
organize
to form an
arbitrary and temporary network.
The mobile nodes can communicate wit
h each other
without
any fixed infrastructure.
MANET
can be set
up quickly to facilitate communication in a hostile environment
such as battlefield or emergency situation.
The various severe security threats are
increasing
on the
MANET
. One of these secur
ity threats is black hole attack which drops all received data packets intended
for forwarding. In this paper, we are simulating and analyzing the impact of black hole attack on Ad Hoc
On
-
Demand Distance Vector (AODV) protocol. Th
e simulation is carried on
NS
-
2 and t
he simulation
results are analyzed
on
various network performance
metric
s such as packet delivery ratio, normalized
routing overhead
and
average end
-
to
-
end delay
Sensor Node Failure or Malfunctioning Detection in Wireless Sensor NetworkIDES Editor
This document presents a new method to detect sensor node failure or malfunctioning in wireless sensor networks (WSNs). It uses round trip delay (RTD) time to estimate confidence factors of RTD paths. Based on the confidence factors, failed or malfunctioning sensor nodes can be detected. The method was tested using a hardware simulation with four microcontroller-based sensor nodes communicating over Zigbee. The results showed that sensor node failures could be accurately detected by analyzing changes in instantaneous RTD times and confidence factors stored in a lookup table.
A comparative analysis of minimum process coordinated checkpointing algorithm...IAEME Publication
This document summarizes and compares several minimum-process coordinated checkpointing algorithms for mobile distributed systems. It begins with background on checkpointing techniques in distributed systems and issues specific to mobile distributed systems. It then describes five minimum-process coordinated checkpointing protocols: the Cao and Singhal algorithm, the Kumar and Kumar algorithm, the Silva and Silva algorithm, Koo-Toueg's algorithm, and the Coa and Singhal blocking algorithm. For each algorithm, it provides a brief overview of the approach and key aspects. The document aims to provide a comparative analysis of existing minimum-process checkpointing protocols for mobile distributed systems.
A comparative analysis of minimum process coordinated checkpointingiaemedu
This document summarizes and compares several minimum-process coordinated checkpointing algorithms for mobile distributed systems. It begins with background on checkpointing techniques in distributed systems and issues specific to mobile distributed systems. It then describes five minimum-process coordinated checkpointing protocols: the Cao and Singhal algorithm, the Kumar and Kumar algorithm, the Silva and Silva algorithm, Koo-Toueg's algorithm, and the Coa and Singhal blocking algorithm. For each algorithm, it provides a brief overview of the approach and key aspects. The document aims to provide a comparative analysis of existing minimum-process checkpointing protocols for mobile distributed systems.
Detection of Malicious Circuitry Using Transition Probability Based Node Redu...TELKOMNIKA JOURNAL
In recent years, serious concerns have been raised against the tampering of integrated circuits due to outsourcing of circuits for fabrication. It has led to the addition of malicious circuitry known as Hardware Trojan. In this paper, a transition probability based node reduction technique for faster and efficient Hardware Trojan (HT) detection has been attempted. In the proposed method, the fact that the least controllable and observable nodes or the nodes with least transition probability are more vulnerable as Trojan sites is taken into consideration. The nodes that have lesser activity than the threshold are the candidate nodes. At each candidate node, segmentation is done for further leakage power analysis to detect the presence of Trojans. Experimental results observed on ISCAS’85 and ISCAS’89 benchmark circuits illustrate that the proposed work can achieve remarkable node reduction upto 78.81% and time reduction upto 58.7%. It was also observed that the circuit activity can be increased by varying the input probability. Hence, for further reduction in the Trojan activation time, the weighted input probability was obtained.
RELIABILITY ASSESSMENT OF EMBEDDED SYSTEMS USING STOPWATCH PETRI NETSIJCSEA Journal
In this paper, we propose a reliability approach in which feared events define reliability requirements and
taking them into account allows to design systems which will be able to avoid the drift towards a feared
state. The description of feared scenarios since the system design phase enables us to understand the
reasons of the feared behavior in order to envisage the necessary reconfigurations and choose safe
architectures. In order to face the increasing complexity of embedded systems and to represent the
suspension and resumption of task execution we propose to extract directly feared scenarios from
Stopwatch Petri net model avoiding the generation of the associated reachability graph and the eternal
combinative explosion problem.
30 9762 extension paper id 0030 (edit i)IAESIJEECS
This paper deals with border distortion effect at starting and ending of finite signal by proposing sliding window technique and basic extension mode implementation. Single phase of transient and voltage sag is chosen to be analyzed in wavelet. The signal which being used for the analysis is simulated in Matlab 2017a. Disturbance signal decomposes into four level and Daubechies 4 (db4) has been chosen for computation. The proposed technique has been compared with conventional method which is finite length power disturbance analysis. Simulation result revealed that the proposed smooth-padding mode can be successfully minimized the border distortion effect compared to the zero-padding and symmetrization
CHECKPOINTING WITH MINIMAL RECOVERY IN ADHOCNET BASED TMRijujournal
The checkpointing algorithm described in the document utilizes Triple Modular Redundancy (TMR) in a wireless ad hoc network. It proposes a distributed checkpointing and recovery protocol that eliminates unnecessary checkpoints and only recovers dependent processes. Each process tracks message dependencies during execution. When a checkpoint is initiated, processes exchange status information detailing messages sent and received. A process only checkpoints after receiving any expected messages, ensuring consistency. If a process fails, only dependent processes recover by rolling back to their last checkpoint, minimizing recovery overhead.
Impact of black hole attack on aodv routing protocolZac Darcy
A
m
obile
a
d
-
hoc
n
etwork (MANET)
is a
collection
of wireless mobile nodes
that dynamically self
-
organize
to form an
arbitrary and temporary network.
The mobile nodes can communicate wit
h each other
without
any fixed infrastructure.
MANET
can be set
up quickly to facilitate communication in a hostile environment
such as battlefield or emergency situation.
The various severe security threats are
increasing
on the
MANET
. One of these secur
ity threats is black hole attack which drops all received data packets intended
for forwarding. In this paper, we are simulating and analyzing the impact of black hole attack on Ad Hoc
On
-
Demand Distance Vector (AODV) protocol. Th
e simulation is carried on
NS
-
2 and t
he simulation
results are analyzed
on
various network performance
metric
s such as packet delivery ratio, normalized
routing overhead
and
average end
-
to
-
end delay
Sensor Node Failure or Malfunctioning Detection in Wireless Sensor NetworkIDES Editor
This document presents a new method to detect sensor node failure or malfunctioning in wireless sensor networks (WSNs). It uses round trip delay (RTD) time to estimate confidence factors of RTD paths. Based on the confidence factors, failed or malfunctioning sensor nodes can be detected. The method was tested using a hardware simulation with four microcontroller-based sensor nodes communicating over Zigbee. The results showed that sensor node failures could be accurately detected by analyzing changes in instantaneous RTD times and confidence factors stored in a lookup table.
The document summarizes various techniques for event detection and transmission in wireless sensor networks. It proposes a new protocol that uses a single node to transmit event data to improve reliability, reduce energy consumption and computation costs. The protocol uses clustering for real-time event detection based on sensor thresholds. It applies single and composite decision rules to the clustered sensor data to accurately detect events. Upon detection, a single node is selected to transmit the event data to the sink node.
Hierarchical Non-blocking Coordinated Checkpointing Algorithms for Mobile Dis...CSCJournals
Mobile system typically uses wireless communication which is based on electromagnetic waves and utilizes a shared broadcast medium. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. So many issues such as range of transmission, limited power supply due to battery capacity and mobility of processes. These new issue makes traditional recovery algorithm unsuitable. In this paper, we propose hierarchical non blocking coordinated checkpointing algorithms suitable for mobile distributed computing. The algorithm is non-blocking, requires minimum message logging, has minimum stable storage requirement and produce a consistent set of checkpoints. This algorithm requires minimum number of processes to take checkpoint.
This paper proposes a lightweight decentralized algorithm for localizing reactive jammers in wireless sensor networks. The algorithm uses a three step process: 1) anomaly detection to identify potential victim nodes, 2) estimation of jammer properties like jamming range, and 3) trigger identification where victim nodes test themselves to identify as trigger or non-trigger nodes. Theoretical analysis and simulation results show that the algorithm can accurately estimate jammer properties while maintaining low time and message complexity. It is also robust against advanced jamming models and provides benefits like improved routing compared to existing techniques.
This document summarizes a research paper that analyzes and compares the energy consumption of different key management schemes in wireless sensor networks (WSNs). It finds that the NchooseK key management scheme consumes less energy than the pre-shared key (PSK) scheme for various key operations like generation, distribution, encryption, and verification. Through simulations of WSNs of varying sizes, the paper measures the energy used by each scheme during different steps and operations. The results show that NchooseK has more stable and consistent energy patterns compared to PSK, and consumes less energy overall for authentication and communication between sensor nodes. The paper concludes that NchooseK is a more scalable and energy-efficient scheme for key management in W
Comparative study of Different Time synchronization Techniques in WSNIRJET Journal
This document provides an overview and comparison of different time synchronization techniques in wireless sensor networks (WSNs). It begins with an abstract that introduces time synchronization as an important research area for WSN applications and outlines different protocols, methods, and parameters involved. The document then presents sections on the introduction, related work, two specific time synchronization protocols (TPSN and PBS), and conclusions. In summary, it examines time synchronization challenges in WSNs, describes existing protocols like TPSN and PBS, and provides a framework for comparing new and existing synchronization methods to better understand time synchronization characteristics in WSNs.
DSP Based Implementation of Scrambler for 56kbps ModemCSCJournals
Scrambler is generally employed in data communication systems to add redundancy in the transmitted data stream so that at the receiver end, timing information can be retrieved to aid the synchronization between data terminals. Present paper deals with simulation and implementation of the scrambler for 56Kbps voice-band modem. Scrambler for the transmitter of 56kbps modem was chosen as a case study. Simulation has been carried out using Simulink of Matlab. An algorithm for the scrambling function has been developed and implemented on Texas Instrument’s based TMS320C50PQ57 Digital Signal Processor (DSP). Signalogic DSP software has been used to compare the simulated and practical results.
The International Journal of Engineering and Science (The IJES)theijes
This document summarizes a research paper on using work-stealing scheduling algorithms to effectively balance workloads across multiple processors in real-time systems. It discusses how work stealing allows tasks to be distributed from busy processors to idle ones, improving system throughput. The authors propose a priority-based approach where tasks are stolen following an earliest deadline first policy. Their EDF-HSB scheduling algorithm uses work stealing combined with periodic servers to ensure real-time tasks meet deadlines while also efficiently executing best-effort jobs opportunistically during idle periods. The system model and overall approach are described to integrate real-time and best-effort work using global scheduling with work stealing.
Securing Privacy of User’s Data on Cloud Using Back Propagation Neural Networkstheijes
To improve the accuracy of learning result, in practice multiple parties may collaborate through conducting joint Backpropagation neural network learning on the union of their respective data sets. During this process no party wants to disclose her/his data to others. Existing schemes supporting this kind of collaborative learning are either limited in the way of data partition or just consider two parties. There lacks a solution that allows two or more parties, each with an arbitrarily portioned data set, to collaboratively conduct the learning. this paper solves this open problem by utilizing the power of cloud computing. In our proposed scheme, each party encrypts his/her private data locally and uploads the ciphertexts into the cloud. The cloud then executes most of the operations pertaining to the learning algorithms over ciphertexts without knowing the original private data. To support flexible operations over ciphertexts, we adopt and tailor the BGN ‘doubly homomorphic’ encryption algorithm for the multi-party setting..
Administrator&trust based routing protocolNinad Samel
This document proposes a new routing scheme called Administrator and Trust Based Secure Routing (ATSR) for mobile ad hoc networks (MANETs). ATSR selects administrator nodes to route packets based on parameters like battery power, node coverage, reliability, and trust. It uses digital signatures and asymmetric cryptography to provide message confidentiality and integrity. Simulation results show ATSR is efficient, robust, and trustworthy. The document describes the working methodology of ATSR, related work, the proposed algorithms for administrator selection and trust/willingness calculation, packet formats, and security analysis.
The Quality of the New Generator Sequence Improvent to Spread the Color Syste...TELKOMNIKA JOURNAL
This paper shows a new technic applicable for the digital devices that are the result of the finite’s
effect precision in the chaotic dynamics used in the coupled technic and the chaotic map’s perturbation
technics used for the generation of a Pseudo-Random Number Generator (PRNGs).The use of the
pseudo- chaotic sequences coupled to the orbit perturbation method in the chaotic logistic map and the
NewPiece-Wise Linear Chaotic Map (NPWLCM). The pseudo random number generator’s originality
proposed from the perturbation of the chaotic recurrence. Furthermore the outputs of the binary sequences
with NPWLCM are reconstructed conventionally with the Bernoulli’s sequences shifts map to change the
shapes with the bitwise permetation then the results in simulation are shown in progress.After being
perturbed, the chaotic system can generate the chaotic binary sequences in uniform distribution and the
statistical properties invulnerable analysis. This generator also has many advantages in the possible useful
applications of spread spectrum digitalimages, such as sensitive secret keys, random uniform distribution
of pixels in Crypto system in secure and synchronize communication.
1) The document describes the Random Early Detection (RED) algorithm for congestion control in computer networks. RED monitors average queue size and randomly drops packets before buffers get full to avoid congestion.
2) The author simulates a computer network using NS2 to test the performance of RED under different parameter settings. By varying RED parameters like minimum threshold, maximum threshold, and maximum drop probability, the author analyzes how it affects network performance metrics like drop count, efficiency, throughput, and delay.
3) The simulation involves defining a network topology with sources, sinks and a bottleneck link implementing RED. The author collects statistics from running the simulation and analyzes the results using scripting to understand the impact of RED parameters on
The document discusses various techniques for resource management in distributed systems. It describes approaches like task assignment, load balancing, and load sharing. It also covers desirable features of scheduling algorithms and discusses techniques like task assignment in detail with an example. Furthermore, it discusses concepts like load balancing approaches, task assignment, location policies, state information exchange policies, and priority assignment policies.
This document discusses resource management techniques in distributed systems. It covers three main scheduling techniques: task assignment approach, load balancing approach, and load sharing approach. It also outlines desirable features of good global scheduling algorithms such as having no a priori knowledge about processes, being dynamic in nature, having quick decision-making capability, balancing system performance and scheduling overhead, stability, scalability, fault tolerance, and fairness of service. Finally, it discusses policies for load estimation, process transfer, state information exchange, location, priority assignment, and migration limiting that distributed load balancing algorithms employ.
Derivative threshold actuation for single phase wormhole detection with reduc...ijdpsjournal
Communication in mobile Ad hoc networks is completed via multi
-
hop ways. Owing to the distributed
specification and restricted resource of nodes, MANET is a lot prone
to wormhole attacks i.e. wormhole
attacks place severe threats to each Ad hoc routing protocol and a few security enhancements. Thus,
so as
to discover wormholes, totally different techniques are in use. In all those techniques fixation of
threshold
is mer
ely by trial & error methodology or by random manner. Conjointly wormhole detection is in twin
part by putting the nodes that is higher than the edge in a suspicious set, however predicting the n
ode as a
wormhole by using some other algorithms. Our aim in
this paper is to deduce the traffic threshold level by
derivational approach for identifying wormholes in a very single phase in relay network having dissi
milar
characteristics.
This document proposes an Enhanced Cooperative Bait Detection Scheme (ECBDS) to combat Byzantine attacks in mobile ad hoc networks (MANETs). It summarizes existing research on security threats in MANETs like black hole and gray hole attacks. The Cooperative Bait Detection Scheme (CBDS) detects but does not prevent malicious nodes. ECBDS improves on CBDS by having two phases: detection to identify malicious nodes using bait requests and reverse tracing, and prevention to avoid routing through detected nodes and broadcast their identifiers. The scheme is evaluated in MATLAB and shown to increase throughput and packet delivery ratio while reducing energy consumption compared to CBDS.
Job satisfaction and contributing variables among the bank employees in cudda...iaemedu
This document summarizes a study on job satisfaction and contributing variables among bank employees in Cuddalore District, India. The study found that the majority (65.7%) of employees reported high job satisfaction, while 16% reported low satisfaction and 18.3% reported medium satisfaction. A regression analysis showed that job involvement, organizational climate, and organizational commitment significantly contributed to job satisfaction. Job involvement had the highest influence on satisfaction. The study provides suggestions for improving job satisfaction, such as ensuring job security, improving relationships, and fulfilling employee needs.
Compaction sintering and mechanical propertiesiaemedu
The document summarizes research on developing aluminum-silicon carbide (Al-SiCp) composites using powder metallurgy techniques. Specifically, it discusses fabricating unreinforced aluminum and aluminum composites containing 5 wt% silicon carbide particles. The composites were sintered and then heat treated. Testing showed that microhardness and compressive strength increased with the addition of silicon carbide particles. Microstructural analysis revealed mostly uniform dispersion of silicon carbide particles in the aluminum matrix, with some clustering. The research demonstrated that powder metallurgy can be used to effectively fabricate Al-SiCp composites with improved mechanical properties over unreinforced aluminum.
Surface reconstruction and display from range and color data under realistic ...iaemedu
This document summarizes a research paper on surface reconstruction and display of 3D objects from range and color data. It discusses using a stereo camera system to scan the surface geometry and color of objects. The scans are registered into a single coordinate system and integrated into a surface model using space carving. The mesh is optimized and simplified. Two methods are presented for view-dependent display: projecting color onto a single surface model, or rendering separate textured triangle meshes from the viewpoint. The paper covers topics such as data acquisition, surface reconstruction algorithms, mesh optimization, and displaying realistic images of scanned objects.
An investigation on faculty development and retention in technical educationiaemedu
This document summarizes a study on faculty development and retention in technical education institutions in India. Some key points:
1. There has been a large expansion of engineering colleges in India in recent decades, especially private self-financing institutions, which has sometimes led to decreasing standards due to a lack of qualified teachers.
2. Attracting and retaining talented faculty is challenging as other sectors offer higher salaries. Technical institutions must offer competitive salaries and career growth to recruit and keep good teachers.
3. Ongoing faculty development is needed to help teachers take on new roles like curriculum development, research, and administrative work, and to keep their knowledge current. Training programs at different stages of a teacher's career
1. The document discusses redesigning the inlet valve of an HCCI engine to improve performance and lifetime.
2. It proposes using a titanium alloy for the valve material instead of nickel chromium, and adding a hollow path inside filled with sodium liquid metal to help conduct heat away from the valve.
3. Analysis of the redesigned valve using CAD software shows improvements in withstanding pressure and reducing temperature fluctuations compared to the original design, indicating better efficiency and lifespan.
Experimental analysis of heat transfer enhancementin circulariaemedu
This document summarizes an experimental study on enhancing heat transfer in a circular double tube heat exchanger using rectangular inserts. Air was passed through the inner tube while hot water flowed through the outer tube. Heat transfer coefficients and friction factors were determined for the plain tube and with inserts. The results showed that heat transfer was enhanced by 0.9 to 1.9 times with the inserts due to flow disruption, while friction factors increased by 1 to 1.7 times. Heat transfer coefficients increased with Reynolds number whereas friction factors decreased. Validation experiments on a plain tube agreed well with theoretical predictions within 10% uncertainty.
The document summarizes various techniques for event detection and transmission in wireless sensor networks. It proposes a new protocol that uses a single node to transmit event data to improve reliability, reduce energy consumption and computation costs. The protocol uses clustering for real-time event detection based on sensor thresholds. It applies single and composite decision rules to the clustered sensor data to accurately detect events. Upon detection, a single node is selected to transmit the event data to the sink node.
Hierarchical Non-blocking Coordinated Checkpointing Algorithms for Mobile Dis...CSCJournals
Mobile system typically uses wireless communication which is based on electromagnetic waves and utilizes a shared broadcast medium. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. So many issues such as range of transmission, limited power supply due to battery capacity and mobility of processes. These new issue makes traditional recovery algorithm unsuitable. In this paper, we propose hierarchical non blocking coordinated checkpointing algorithms suitable for mobile distributed computing. The algorithm is non-blocking, requires minimum message logging, has minimum stable storage requirement and produce a consistent set of checkpoints. This algorithm requires minimum number of processes to take checkpoint.
This paper proposes a lightweight decentralized algorithm for localizing reactive jammers in wireless sensor networks. The algorithm uses a three step process: 1) anomaly detection to identify potential victim nodes, 2) estimation of jammer properties like jamming range, and 3) trigger identification where victim nodes test themselves to identify as trigger or non-trigger nodes. Theoretical analysis and simulation results show that the algorithm can accurately estimate jammer properties while maintaining low time and message complexity. It is also robust against advanced jamming models and provides benefits like improved routing compared to existing techniques.
This document summarizes a research paper that analyzes and compares the energy consumption of different key management schemes in wireless sensor networks (WSNs). It finds that the NchooseK key management scheme consumes less energy than the pre-shared key (PSK) scheme for various key operations like generation, distribution, encryption, and verification. Through simulations of WSNs of varying sizes, the paper measures the energy used by each scheme during different steps and operations. The results show that NchooseK has more stable and consistent energy patterns compared to PSK, and consumes less energy overall for authentication and communication between sensor nodes. The paper concludes that NchooseK is a more scalable and energy-efficient scheme for key management in W
Comparative study of Different Time synchronization Techniques in WSNIRJET Journal
This document provides an overview and comparison of different time synchronization techniques in wireless sensor networks (WSNs). It begins with an abstract that introduces time synchronization as an important research area for WSN applications and outlines different protocols, methods, and parameters involved. The document then presents sections on the introduction, related work, two specific time synchronization protocols (TPSN and PBS), and conclusions. In summary, it examines time synchronization challenges in WSNs, describes existing protocols like TPSN and PBS, and provides a framework for comparing new and existing synchronization methods to better understand time synchronization characteristics in WSNs.
DSP Based Implementation of Scrambler for 56kbps ModemCSCJournals
Scrambler is generally employed in data communication systems to add redundancy in the transmitted data stream so that at the receiver end, timing information can be retrieved to aid the synchronization between data terminals. Present paper deals with simulation and implementation of the scrambler for 56Kbps voice-band modem. Scrambler for the transmitter of 56kbps modem was chosen as a case study. Simulation has been carried out using Simulink of Matlab. An algorithm for the scrambling function has been developed and implemented on Texas Instrument’s based TMS320C50PQ57 Digital Signal Processor (DSP). Signalogic DSP software has been used to compare the simulated and practical results.
The International Journal of Engineering and Science (The IJES)theijes
This document summarizes a research paper on using work-stealing scheduling algorithms to effectively balance workloads across multiple processors in real-time systems. It discusses how work stealing allows tasks to be distributed from busy processors to idle ones, improving system throughput. The authors propose a priority-based approach where tasks are stolen following an earliest deadline first policy. Their EDF-HSB scheduling algorithm uses work stealing combined with periodic servers to ensure real-time tasks meet deadlines while also efficiently executing best-effort jobs opportunistically during idle periods. The system model and overall approach are described to integrate real-time and best-effort work using global scheduling with work stealing.
Securing Privacy of User’s Data on Cloud Using Back Propagation Neural Networkstheijes
To improve the accuracy of learning result, in practice multiple parties may collaborate through conducting joint Backpropagation neural network learning on the union of their respective data sets. During this process no party wants to disclose her/his data to others. Existing schemes supporting this kind of collaborative learning are either limited in the way of data partition or just consider two parties. There lacks a solution that allows two or more parties, each with an arbitrarily portioned data set, to collaboratively conduct the learning. this paper solves this open problem by utilizing the power of cloud computing. In our proposed scheme, each party encrypts his/her private data locally and uploads the ciphertexts into the cloud. The cloud then executes most of the operations pertaining to the learning algorithms over ciphertexts without knowing the original private data. To support flexible operations over ciphertexts, we adopt and tailor the BGN ‘doubly homomorphic’ encryption algorithm for the multi-party setting..
Administrator&trust based routing protocolNinad Samel
This document proposes a new routing scheme called Administrator and Trust Based Secure Routing (ATSR) for mobile ad hoc networks (MANETs). ATSR selects administrator nodes to route packets based on parameters like battery power, node coverage, reliability, and trust. It uses digital signatures and asymmetric cryptography to provide message confidentiality and integrity. Simulation results show ATSR is efficient, robust, and trustworthy. The document describes the working methodology of ATSR, related work, the proposed algorithms for administrator selection and trust/willingness calculation, packet formats, and security analysis.
The Quality of the New Generator Sequence Improvent to Spread the Color Syste...TELKOMNIKA JOURNAL
This paper shows a new technic applicable for the digital devices that are the result of the finite’s
effect precision in the chaotic dynamics used in the coupled technic and the chaotic map’s perturbation
technics used for the generation of a Pseudo-Random Number Generator (PRNGs).The use of the
pseudo- chaotic sequences coupled to the orbit perturbation method in the chaotic logistic map and the
NewPiece-Wise Linear Chaotic Map (NPWLCM). The pseudo random number generator’s originality
proposed from the perturbation of the chaotic recurrence. Furthermore the outputs of the binary sequences
with NPWLCM are reconstructed conventionally with the Bernoulli’s sequences shifts map to change the
shapes with the bitwise permetation then the results in simulation are shown in progress.After being
perturbed, the chaotic system can generate the chaotic binary sequences in uniform distribution and the
statistical properties invulnerable analysis. This generator also has many advantages in the possible useful
applications of spread spectrum digitalimages, such as sensitive secret keys, random uniform distribution
of pixels in Crypto system in secure and synchronize communication.
1) The document describes the Random Early Detection (RED) algorithm for congestion control in computer networks. RED monitors average queue size and randomly drops packets before buffers get full to avoid congestion.
2) The author simulates a computer network using NS2 to test the performance of RED under different parameter settings. By varying RED parameters like minimum threshold, maximum threshold, and maximum drop probability, the author analyzes how it affects network performance metrics like drop count, efficiency, throughput, and delay.
3) The simulation involves defining a network topology with sources, sinks and a bottleneck link implementing RED. The author collects statistics from running the simulation and analyzes the results using scripting to understand the impact of RED parameters on
The document discusses various techniques for resource management in distributed systems. It describes approaches like task assignment, load balancing, and load sharing. It also covers desirable features of scheduling algorithms and discusses techniques like task assignment in detail with an example. Furthermore, it discusses concepts like load balancing approaches, task assignment, location policies, state information exchange policies, and priority assignment policies.
This document discusses resource management techniques in distributed systems. It covers three main scheduling techniques: task assignment approach, load balancing approach, and load sharing approach. It also outlines desirable features of good global scheduling algorithms such as having no a priori knowledge about processes, being dynamic in nature, having quick decision-making capability, balancing system performance and scheduling overhead, stability, scalability, fault tolerance, and fairness of service. Finally, it discusses policies for load estimation, process transfer, state information exchange, location, priority assignment, and migration limiting that distributed load balancing algorithms employ.
Derivative threshold actuation for single phase wormhole detection with reduc...ijdpsjournal
Communication in mobile Ad hoc networks is completed via multi
-
hop ways. Owing to the distributed
specification and restricted resource of nodes, MANET is a lot prone
to wormhole attacks i.e. wormhole
attacks place severe threats to each Ad hoc routing protocol and a few security enhancements. Thus,
so as
to discover wormholes, totally different techniques are in use. In all those techniques fixation of
threshold
is mer
ely by trial & error methodology or by random manner. Conjointly wormhole detection is in twin
part by putting the nodes that is higher than the edge in a suspicious set, however predicting the n
ode as a
wormhole by using some other algorithms. Our aim in
this paper is to deduce the traffic threshold level by
derivational approach for identifying wormholes in a very single phase in relay network having dissi
milar
characteristics.
This document proposes an Enhanced Cooperative Bait Detection Scheme (ECBDS) to combat Byzantine attacks in mobile ad hoc networks (MANETs). It summarizes existing research on security threats in MANETs like black hole and gray hole attacks. The Cooperative Bait Detection Scheme (CBDS) detects but does not prevent malicious nodes. ECBDS improves on CBDS by having two phases: detection to identify malicious nodes using bait requests and reverse tracing, and prevention to avoid routing through detected nodes and broadcast their identifiers. The scheme is evaluated in MATLAB and shown to increase throughput and packet delivery ratio while reducing energy consumption compared to CBDS.
Job satisfaction and contributing variables among the bank employees in cudda...iaemedu
This document summarizes a study on job satisfaction and contributing variables among bank employees in Cuddalore District, India. The study found that the majority (65.7%) of employees reported high job satisfaction, while 16% reported low satisfaction and 18.3% reported medium satisfaction. A regression analysis showed that job involvement, organizational climate, and organizational commitment significantly contributed to job satisfaction. Job involvement had the highest influence on satisfaction. The study provides suggestions for improving job satisfaction, such as ensuring job security, improving relationships, and fulfilling employee needs.
Compaction sintering and mechanical propertiesiaemedu
The document summarizes research on developing aluminum-silicon carbide (Al-SiCp) composites using powder metallurgy techniques. Specifically, it discusses fabricating unreinforced aluminum and aluminum composites containing 5 wt% silicon carbide particles. The composites were sintered and then heat treated. Testing showed that microhardness and compressive strength increased with the addition of silicon carbide particles. Microstructural analysis revealed mostly uniform dispersion of silicon carbide particles in the aluminum matrix, with some clustering. The research demonstrated that powder metallurgy can be used to effectively fabricate Al-SiCp composites with improved mechanical properties over unreinforced aluminum.
Surface reconstruction and display from range and color data under realistic ...iaemedu
This document summarizes a research paper on surface reconstruction and display of 3D objects from range and color data. It discusses using a stereo camera system to scan the surface geometry and color of objects. The scans are registered into a single coordinate system and integrated into a surface model using space carving. The mesh is optimized and simplified. Two methods are presented for view-dependent display: projecting color onto a single surface model, or rendering separate textured triangle meshes from the viewpoint. The paper covers topics such as data acquisition, surface reconstruction algorithms, mesh optimization, and displaying realistic images of scanned objects.
An investigation on faculty development and retention in technical educationiaemedu
This document summarizes a study on faculty development and retention in technical education institutions in India. Some key points:
1. There has been a large expansion of engineering colleges in India in recent decades, especially private self-financing institutions, which has sometimes led to decreasing standards due to a lack of qualified teachers.
2. Attracting and retaining talented faculty is challenging as other sectors offer higher salaries. Technical institutions must offer competitive salaries and career growth to recruit and keep good teachers.
3. Ongoing faculty development is needed to help teachers take on new roles like curriculum development, research, and administrative work, and to keep their knowledge current. Training programs at different stages of a teacher's career
1. The document discusses redesigning the inlet valve of an HCCI engine to improve performance and lifetime.
2. It proposes using a titanium alloy for the valve material instead of nickel chromium, and adding a hollow path inside filled with sodium liquid metal to help conduct heat away from the valve.
3. Analysis of the redesigned valve using CAD software shows improvements in withstanding pressure and reducing temperature fluctuations compared to the original design, indicating better efficiency and lifespan.
Experimental analysis of heat transfer enhancementin circulariaemedu
This document summarizes an experimental study on enhancing heat transfer in a circular double tube heat exchanger using rectangular inserts. Air was passed through the inner tube while hot water flowed through the outer tube. Heat transfer coefficients and friction factors were determined for the plain tube and with inserts. The results showed that heat transfer was enhanced by 0.9 to 1.9 times with the inserts due to flow disruption, while friction factors increased by 1 to 1.7 times. Heat transfer coefficients increased with Reynolds number whereas friction factors decreased. Validation experiments on a plain tube agreed well with theoretical predictions within 10% uncertainty.
The document describes a parallel communicating extended finite automata system. It introduces the concept of multiple extended finite automata working in parallel and communicating with each other by requesting state information. The system consists of several extended finite automata that operate independently but can communicate their current states. This model increases computational power through cooperation and communication compared to existing models. The system is formally defined and its deterministic and centralized variants are described.
Developing creative and innovative culture in organizationiaemedu
This document summarizes research on developing creative and innovative cultures in organizations. It discusses the differences between creativity and innovation, with creativity being the generation of novel ideas and innovation being the implementation of those ideas. Several key dimensions of innovation culture are identified, including risk-taking, resources, knowledge, goals, rewards, tools, and relationships. Factors that support or hinder organizational creativity are also reviewed from the literature. The roles of both creativity and innovation in organizations are discussed.
Seismic response of frp strengthened rc frameiaemedu
This document discusses research on strengthening reinforced concrete (RC) frames with fiber-reinforced plastic (FRP). It summarizes previous studies on using FRP to strengthen beams and columns. However, few studies have analyzed FRP-strengthened RC frames as a whole system. The present study uses finite element analysis to model RC frames strengthened with varying FRP thicknesses and investigates their seismic response. Models of 2-bay, 3-story and 3-bay, 5-story frames are analyzed for different crack locations. The results are intended to help develop design criteria for seismic retrofitting of RC frames with FRP.
A comparative analysis of minimum process coordinatediaemedu
This document summarizes and compares several minimum-process coordinated checkpointing algorithms for mobile distributed systems. It begins with background on checkpointing techniques in distributed systems and issues specific to mobile distributed systems. It then describes five minimum-process coordinated checkpointing protocols: the Cao and Singhal algorithm, the Kumar and Kumar algorithm, the Silva and Silva algorithm, Koo-Toueg's algorithm, and the Coa and Singhal blocking algorithm. For each algorithm, it provides a brief overview of the approach and key aspects. The document aims to provide a comparative analysis of existing minimum-process checkpointing protocols for mobile distributed systems.
A comparative analysis of minimum process coordinatediaemedu
This document summarizes checkpointing algorithms for mobile distributed systems. It discusses minimum-process coordinated checkpointing as a preferred approach. It describes asynchronous and synchronous checkpointing, and categorizes the latter into minimum-process and all-process algorithms. Minimum-process algorithms only require interacting processes to checkpoint, while all-process checkpoints all processes. Blocking and non-blocking variants are also discussed. The document focuses on challenges of mobility for traditional distributed system checkpointing algorithms.
This document discusses techniques to reduce handover interruption in mobile networks. Handover interruption occurs when a mobile station disconnects from the serving base station and must reconnect to a new target base station. This disruption can negatively impact quality of service. The document analyzes the duration of handover interruption and its effect on voice over IP communication quality. It then describes techniques like hysteresis margin, time-to-trigger, and windowing that can help minimize redundant handovers and thus reduce handover interruption duration. The techniques delay the handover decision to filter out temporary signal variations between base stations. Simulation results are used to evaluate the impact of these techniques on management overhead and user throughput.
Neural Network Implementation Control Mobile RobotIRJET Journal
This document describes the design and implementation of a neural network controlled mobile robot. The robot is equipped with IR sensors to detect obstacles and a microcontroller runs a neural network program. The neural network is trained offline using a backpropagation algorithm and sensor input patterns to navigate around obstacles. Experimental results showed the robot could successfully react to new obstacle configurations not in its training set. Potential applications of neural networks discussed include industrial process control, sales forecasting, and target marketing. The design could be improved by adding GPS and speed control to allow the robot to navigate to a target destination avoiding obstacles.
DISCONNECTION TOLERANCE IN RELIABLE TIMEOUT BASED COMMIT PROTOCOLijasuc
The transaction processing on the mobile network may lead to disconnection due to poor bandwidth. To
deploy traditional database applications into the mobile networks the transactions are to be executed
consistently without hindrance of blocking. In this paper, the proposal is made to handle the transactions
efficiently despite the frequent disconnections of the wireless network. With the use of log at MH & also
at FH, it is possible to process transactions locally during disconnection & reflect updates after getting
reconnected. This may lead to non-blocking situations, reducing the message costs, & enhancing the
throughput. The simulation results specify the performance analysis metrics
DISCONNECTION TOLERANCE IN RELIABLE TIMEOUT BASED COMMIT PROTOCOL ijasuc
The transaction processing on the mobile network may lead to disconnection due to poor bandwidth. To
deploy traditional database applications into the mobile networks the transactions are to be executed
consistently without hindrance of blocking. In this paper, the proposal is made to handle the transactions
efficiently despite the frequent disconnections of the wireless network. With the use of log at MH & also
at FH, it is possible to process transactions locally during disconnection & reflect updates after getting
reconnected. This may lead to non-blocking situations, reducing the message costs, & enhancing the
throughput. The simulation results specify the performance analysis metrics.
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.
CONFIGURABLE TASK MAPPING FOR MULTIPLE OBJECTIVES IN MACRO-PROGRAMMING OF WIR...ijassn
Macro-programming is the new generation advanced method of using Wireless Sensor Network (WSNs), where application developers can extract data from sensor nodes through a high level abstraction of the system. Instead of developing the entire application, task graph representation of the WSN model presents simplified approach of data collection. However, mapping of tasks onto sensor nodes highlights several problems in energy consumption and routing delay. In this paper, we present an efficient hybrid approach of task mapping for WSN – Hybrid Genetic Algorithm, considering multiple objectives of optimization – energy consumption, routing delay and soft real time requirement. We also present a method to configure the algorithm as per user's need by changing the heuristics used for optimization. The trade-off analysis between energy consumption and delivery delay was performed and simulation results are presented. The algorithm is applicable during macro-programming enabling developers to choose a better mapping according to their application requirements.
CONFIGURABLE TASK MAPPING FOR MULTIPLE OBJECTIVES IN MACRO-PROGRAMMING OF WIR...ijassn
Macro-programming is the new generation advanced method of using Wireless Sensor Network (WSNs),
where application developers can extract data from sensor nodes through a high level abstraction of the
system. Instead of developing the entire application, task graph representation of the WSN model presents
simplified approach of data collection.
The document describes the Tree Based Itinerary Design (TBID) algorithm for wireless sensor networks. The TBID algorithm partitions the sensor network area around the processing element into concentric zones. It then constructs itineraries for multiple mobile agents to efficiently collect and aggregate data from the sensor nodes. The algorithm builds trees connecting sensors in each zone and determines low-cost traversal orders for the mobile agents. Experimental results show that the aggregation time increases as the number of sensors or zones increases, but decreases as more mobile agents are used.
PREDICTIVE DETECTION OF KNOWN SECURITY CRITICALITIES IN CYBER PHYSICAL SYSTEM...cscpconf
A large number of existing Cyber Physical Systems (CPS) in production environments, also employed in critical infrastructures, are severely vulnerable to cyber threats but cannot be modified due to strict availability requirements and nearly impossible change management. Monitoring solutions are increasingly proving to be very effective in such scenarios. Since CPS are typically designed for a precise purpose, their behaviour is predictable to a good extent and often well known, both from the process and the cyber perspective. This work presents a cyber security monitor capable of leveraging such knowledge to detect illicit activities. It uses a formal language to specify critical conditions and an SMT-based engine to detect them through network traffic and log analysis. The framework is predictive, i.e. it recognises if the system is approaching a critical state before reaching it. An important novelty of the approach is the capability of dealing with unobservable variables, making the framework much more feasible in real cases. This work presents the formal framework and first experimental results validating the feasibility of the approach.
A Fault Tolerant Approach To Enhances WSN Lifetime In Star TopologyIRJET Journal
This document summarizes a research paper that proposes a fault-tolerant approach to increase the lifetime of wireless sensor networks using a star topology. It applies a Gradient Diffusion algorithm and Fault Node Recovery algorithm to identify and replace non-functioning sensor nodes. The Fault Node Recovery algorithm uses a genetic algorithm to determine the sequence of non-operating nodes and parameter thresholds. Simulation results showed the approach could increase the number of active nodes by 8-9 times, reduce data loss by up to 98%, and lower energy consumption by around 32%.
Congestion Control Technique with Safety Transmission of Messages in Vehicula...IRJET Journal
This document proposes an RT-MMF algorithm to control congestion in vehicular ad hoc networks (VANETs) and safely deliver safety messages. It compares the proposed technique to an existing adaptive and mobility-based algorithm (AMBA). The RT-MMF algorithm uses an active/deactive concept to save energy by only activating nodes responsible for message transmission. It also applies a relaxation theory and max-min fairness approach for congestion control and selects the transmission path based on minimum distance calculations between neighboring nodes. Simulation results show the proposed technique improves energy efficiency, packet delivery ratio, throughput and reduces delay compared to AMBA.
PSO-GSA Tuned Dynamic Allocation in Wireless Video Sensor Networks for IOTIRJET Journal
This document proposes using a hybrid Particle Swarm Optimization-Gravitational Search Algorithm (PSO-GSA) to optimize dynamic channel allocation in wireless video sensor networks for the Internet of Things (IoT). It aims to minimize total path loss by assigning the optimal channel bandwidth to paths between active sensor nodes from a total assigned bandwidth. The proposed approach involves: 1) randomly placing sensor nodes and selecting the best path for each node to a sink node, 2) using PSO-GSA to tune the bandwidth allocation to paths to minimize power consumption, and 3) comparing results to genetic algorithm and GSA optimizations. Simulation results show the hybrid approach achieves lower effective power compared to the other algorithms.
Monte Carlo simulation convergences’ percentage and position in future relia...IJECEIAES
This document summarizes a research paper that evaluates different positioning methods for convergence in Monte Carlo simulations for reliability assessment of power systems. It describes two types of convergence positions - input convergence, which focuses on mean time to failure and mean time to repair values, and output convergence, which focuses on calculating variance in system reliability indices. The document outlines the methodology used, including generating fault rates and repair times as inputs, running power flow simulations with forced faults, and calculating reliability indices like SAIFI, SAIDI and CAIDI as outputs. It analyzes convergence based on percentage accuracy limits at the input and variance calculations at the output. The research aims to determine the fastest converging positioning that provides accurate reliability evaluation results.
A Fault Tolerant Approach to Enhances Wsn Lifetime in Star TopologyIRJET Journal
This document presents a fault tolerant approach to increase the lifetime of wireless sensor networks using a star topology. It proposes using a gradient diffusion algorithm and fault node recovery algorithm to minimize packet loss and broadcast delay. The fault node recovery algorithm identifies non-functioning sensor nodes using a genetic algorithm and replaces them to extend the network lifetime. Simulation results show the approach increases active nodes by 8-10 times, reduces data loss by 98%, and decreases energy consumption by 27-32% compared to other algorithms. This is achieved by reusing sensor nodes and routing paths to prolong the usability of the wireless sensor network.
Checkpoint and recovery protocols are commonly used in distributed applications for providing fault
tolerance. A distributed system may require taking checkpoints from time to time to keep it free of arbitrary
failures. In case of failure, the system will rollback to checkpoints where global consistency is preserved.
Checkpointing is one of the fault-tolerant techniques to restore faults and to restart job fast. The algorithms
for checkpointing on distributed systems have been under study for years.
It is known that checkpointing and rollback recovery are widely used techniques that allow a distributed
computing to progress inspite of a failure.There are two fundamental approaches for checkpointing and
recovery.One is asynchronus approach, process take their checkpoints independenty.So,taking checkpoints
is very simple but due to absence of a recent consistent global checkpoint which may cause a rollback of
computation.Synchronus checkpointing approach assumes that a single process other than the application
process invokes the checkpointing algorithm periodically to determine a consistent global checkpoint.
IRJET - Analytical Study of Hierarchical Routing Protocols for Virtual Wi...IRJET Journal
This document analyzes and compares several hierarchical routing protocols for virtual wireless sensor networks (VWSNs). It first provides background on VWSNs and how virtualization allows a single physical sensor network to serve multiple applications simultaneously. It then reviews several common cluster-based routing protocols for wireless sensor networks, including LEACH, ModLEACH, SEP, and ZSEP. Through simulation and analysis of network lifetime, load balancing, energy consumption, and packets received, the document aims to provide insights on how well different routing protocols can be utilized for VWSNs under various conditions.
IRJET-Structure less Efficient Data Aggregation and Data Integrity in Sensor ...IRJET Journal
This document proposes a structureless and efficient data aggregation technique for wireless sensor networks that ensures data integrity with low transmission overhead. It introduces a concept where the base station can recover individual sensor data even after aggregation by cluster heads. This allows the base station to verify data integrity and authenticity, as well as perform any desired aggregation functions. It then proposes a structure-free scheme using intracluster and intercluster encryption and aggregation procedures. This scheme aims to address limitations of previous work such as high transmission costs and inability to query individual data values, while maintaining security and scalability. The document analyzes security and scalability aspects and argues the proposed scheme offers improved performance and efficiency for data aggregation in wireless sensor networks.
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
Similar to A minimum process synchronous checkpointing algorithm (20)
Tech transfer making it as a risk free approach in pharmaceutical and biotech iniaemedu
Tech transfer is a common methodology for transferring new products or an existing
commercial product to R&D or to another manufacturing site. Transferring product knowledge to the
manufacturing floor is crucial and it is an ongoing approach in the pharmaceutical and biotech
industry. Without adopting this process, no company can manufacture its niche products, let alone
market them. Technology transfer is a complicated, process because it is highly cross functional. Due
to its cross functional dependence, these projects face numerous risks and failure. If anidea cannot be
successfully brought out in the form of a product, there is no customer benefit, or satisfaction.
Moreover, high emphasis is in sustaining manufacturing with highest quality each and every time. It
is vital that tech transfer projects need to be executed flawlessly. To accomplish this goal, risk
management is crucial and project team needs to use the risk management approach seamlessly.
Integration of feature sets with machine learning techniquesiaemedu
This document summarizes a research paper that proposes a novel approach for spam filtering using selective feature sets combined with machine learning techniques. The paper presents an algorithm and system architecture that extracts feature sets from emails and uses machine learning to classify emails and generate rules to identify spam. Several metrics are identified to evaluate the efficiency of the feature sets, including false positive rate. An experiment is described that uses keyword lists as feature sets to train filters and compares the proposed approach to other spam filtering methods.
Effective broadcasting in mobile ad hoc networks using gridiaemedu
This document summarizes a research paper that proposes a new grid-based broadcasting mechanism for mobile ad hoc networks. The paper argues that flooding approaches to broadcasting are inefficient and cause network congestion. The proposed approach divides the network into a hierarchical grid structure. When a node needs to broadcast a message, it sends the message to the first node in the appropriate grid, which is then responsible for updating and forwarding the message within that grid. Simulation results showed the grid-based approach outperformed other broadcasting protocols and was more reliable, efficient and scalable.
Effect of scenario environment on the performance of mane ts routingiaemedu
The document analyzes the effect of scenario environment on the performance of the AODV routing protocol in mobile ad hoc networks (MANETs). It studies AODV performance under different scenarios varying network size, maximum node speed, and pause time. The performance is evaluated based on packet delivery ratio, throughput, and end-to-end delay. The results show that AODV performs best in some scenarios and worse in others, indicating that scenario parameters significantly impact routing protocol performance in MANETs.
Adaptive job scheduling with load balancing for workflow applicationiaemedu
This document discusses adaptive job scheduling with load balancing for workflow applications in a grid platform. It begins with an abstract that describes grid computing and how scheduling plays a key role in performance for grid workflow applications. Both static and dynamic scheduling strategies are discussed, but they require high scheduling costs and may not produce good schedules. The paper then proposes a novel semi-dynamic algorithm that allows the schedule to adapt to changes in the dynamic grid environment through both static and dynamic scheduling. Load balancing is incorporated to handle situations where jobs are delayed due to resource fluctuations or overloading of processors. The rest of the paper outlines the related works, proposed scheduling algorithm, system model, and evaluation of the approach.
This document summarizes research on transaction reordering techniques. It discusses transaction reordering approaches based on reducing resource conflicts and increasing resource sharing. Specifically, it covers:
1) A "steal-on-abort" technique that reorders an aborted transaction behind the transaction that caused the abort to avoid repeated conflicts.
2) A replication protocol that attempts to reorder transactions during certification to avoid aborts rather than restarting immediately.
3) Transaction reordering and grouping during continuous data loading to prevent deadlocks when loading data for materialized join views.
The document discusses semantic web services and their challenges. It provides an overview of semantic web technologies like WSDL, SOAP, UDDI, and OIL which are used to build semantic web services. The semantic web architecture adds semantics to web services through ontologies written in OWL and DAML+OIL. Key approaches to semantic web services include annotation, composition, and addressing privacy and security. However, semantic web services still face challenges in achieving their full potential due to issues in representation, reasoning, and a lack of real-world applications and data.
Website based patent information searching mechanismiaemedu
This document summarizes a research paper on developing a website-based patent information searching mechanism. It discusses how patent information can be used for technology development, rights acquisition and utilization, and management information. It describes different types of patent searches including novelty, validity, infringement, and state-of-the-art searches. It also evaluates and compares two major patent websites, Delphion and USPTO, in terms of their search capabilities and features.
Revisiting the experiment on detecting of replay and message modificationiaemedu
This document summarizes a research paper that proposes methods for detecting message modification and replay attacks in ad-hoc wireless networks. It begins with background on security issues in wireless networks and types of attacks. It then reviews existing intrusion detection systems and security techniques. Related work that detects attacks using features from the media access control layer or radio frequency fingerprinting is also discussed. The paper aims to present a simple, economical, and platform-independent system for detecting message modification, replay attacks, and unauthorized users in ad-hoc networks.
1) The document discusses the Cyclic Model Analysis (CMA) technique for sequential pattern mining which aims to predict customer purchasing behavior.
2) CMA calculates the Trend Distribution Function from sequential patterns to model purchasing trends over time. It then uses Generalized Periodicity Detection and Trend Modeling to identify periodic patterns and construct an approximating model.
3) The Cyclic Model Analysis algorithm is applied to further analyze the patterns, dividing the domain into segments where the distribution function is increasing or decreasing and applying the other techniques recursively to fully model the cyclic behavior.
Performance analysis of manet routing protocol in presenceiaemedu
This document analyzes the performance of different routing protocols in a mobile ad hoc network (MANET) under hybrid traffic conditions. It simulates a MANET with 50 nodes moving at speeds up to 20 m/s using the AODV, DSDV, and DSR routing protocols. Traffic included both constant bit rate and variable bit rate sources. Results found that AODV had lower average end-to-end delay and higher packet delivery ratios than DSDV and DSR as the percentage of variable bit rate traffic increased. AODV also performed comparably under both low and high node mobility scenarios with hybrid traffic.
Performance measurement of different requirements engineeringiaemedu
This document summarizes a research paper that compares the performance of different requirements engineering (RE) process models. It describes three RE process models - two existing linear models and the authors' iterative model. It also reviews literature on common RE activities and issues with descriptive models not reflecting real-world practices. The authors conducted interviews at two Indian companies to model their RE processes and compare them to the three models. They found the existing linear models did not fully capture the iterative nature of observed RE processes.
This document proposes a mobile safety system for automobiles that uses Android operating system. The system has two main components: a safety device and an automobile base unit. The safety device allows users to monitor the vehicle's location on a map, check its status, and control functions remotely. It communicates with the base unit in the vehicle using GPRS. The base unit collects data from sensors, determines the vehicle's GPS location, and can execute control commands like activating the brakes or switching off the engine. The document provides details on the design and algorithms of both components and includes examples of Java code implementation. The goal is to create an intelligent, secure and easy-to-use mobile safety system for vehicles using embedded systems and Android
Efficient text compression using special character replacementiaemedu
The document describes a proposed algorithm for efficient text compression using special character replacement and space removal. The algorithm replaces words with non-printable ASCII characters or combinations of characters to compress text files. It uses a dynamic dictionary to map words to their symbols. Spaces are removed from the compressed file in some cases to further reduce file size. Experimental results show the algorithm achieves better compression ratios than LZW, WinZip 10.0 and WinRAR 3.93 for various text file types while allowing lossless decompression.
The document discusses agile programming and proposes a new methodology. It provides an overview of existing agile methodologies like Scrum and Extreme Programming. Scrum uses short sprints to define tasks and deadlines. Extreme Programming focuses on practices like test-first development, pair programming, and continuous integration. The document notes drawbacks like an inability to support large or multi-site projects. It proposes designing a new methodology that combines the advantages of existing methods while overcoming their deficiencies.
Adaptive load balancing techniques in global scale grid environmentiaemedu
The document discusses various adaptive load balancing techniques for distributed applications in grid environments. It first describes adaptive mesh refinement algorithms that partition computational domains using space-filling curves or by distributing grids independently or at different levels. It also discusses dynamic load balancing using tiling and multi-criteria geometric partitioning. The document then covers repartitioning algorithms based on multilevel diffusion and the adaptive characteristics of structured adaptive mesh refinement applications. Finally, it discusses adaptive workload balancing on heterogeneous resources by benchmarking resource characteristics and estimating application parameters to find optimal load distribution.
A survey on the performance of job scheduling in workflow applicationiaemedu
This document summarizes a survey on job scheduling performance in workflow applications on grid platforms. It discusses an adaptive dual objective scheduling (ADOS) algorithm that takes both completion time and resource usage into account for measuring schedule performance. The study shows ADOS delivers good performance in completion time, resource usage, and robustness to changes in resource performance. It also describes the system architecture used, which includes a planner and executor component. The planner focuses on scheduling to minimize completion time while considering resource usage, and can reschedule if needed. The executor enacts the schedule on the grid resources.
A survey of mitigating routing misbehavior in mobile ad hoc networksiaemedu
This document summarizes existing methods to detect misbehavior in mobile ad hoc networks (MANETs). It discusses how routing protocols assume nodes will cooperate fully, but misbehavior like packet dropping can occur. It describes several techniques to detect misbehavior, including watchdog, ACK/SACK, TWOACK, S-TWOACK, and credit-based/reputation-based schemes. Credit-based schemes use virtual currencies to provide incentives for nodes to forward packets, while reputation-based schemes track nodes' past behaviors. The document aims to survey approaches for mitigating the impact of misbehaving nodes in MANET routing.
A novel approach for satellite imagery storage by classifyiaemedu
This document presents a novel approach for classifying and storing satellite imagery by detecting and storing only non-duplicate regions. It uses kernel principal component analysis to reduce the dimensionality and extract features of satellite images. Fuzzy N-means clustering is then used to segment the images into blocks. A duplication detection algorithm compares blocks to identify duplicate and non-duplicate regions. Only the non-duplicate regions are stored in the database, improving storage efficiency and updating speed compared to completely replacing existing images. Support vector machines are used to categorize the non-duplicate blocks into the appropriate classes in the existing images.
A self recovery approach using halftone images for medical imageryiaemedu
This document summarizes a proposed approach for securely transferring medical images over the internet using visual cryptography and halftone images. The approach uses error diffusion techniques to generate a halftone host image from the grayscale medical image. Shadow images are then created from the halftone host image using visual cryptography algorithms. When stacked together, the shadow images reveal the secret medical image. The halftone host image also contains an embedded logo that can be extracted to verify the integrity of the reconstructed image without a trusted third party.