Information Science and Engineering

Clustering is an important research topic in wireless networks, because cluster structures can facilitate resource reuse and increase system capacity. Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. A slight change in the speed of cluster head nodes has a great influence on the cluster members and even causes the cluster head to switch frequently. we present a robust self-stabilizing weight-based clustering algorithm for ad hoc networks. The robustness property guarantees that, starting from an arbitrary configuration, after one asynchronous round, the network is partitioned into clusters. The communication in VANET is at greater risk because the messages are broadcasted and a wireless medium is used for data propagation. For secure communication among these vehicles, clustering algorithms are preferred. The proposed algorithm intends to create stable clusters by reducing reclustering overhead prolonging cluster lifetime, and shortening the average distance between cluster heads and their cluster members. Many clustering schemes have been proposed by the researchers which can be classified into either mobility based clustering or non-mobility based clustering algorithms. This technique takes the distance and velocity as a parameter to create relatively a stable cluster structure. We also developed a algorithm for super cluster-head selections. .

The concept of adaptive technologies is increasingly prevalent in many areas, particularly in learning. In this context we require quick and robust approaches for developing adaptive learning environments. In order to construct such environments, we need to enable reusability of learning contents according to the needs of learners, which is one of the challenges for current learning technologies. In this paper we show how an ontology-based approach can help us to reuse the same learning contents for different purposes.

Tools like JUnit and its relatives are making software testing reachable even for introductory students. At the same time, however, many introductory computer sciences courses use graphical interfaces as an "attention grabber" for students and as a metaphor for teaching object-oriented programming. Unfortunately, developing software tests for programs that have significant graphical user interfaces is beyond the abilities of typical students (and, for that matter, many educators). This paper describes a framework for combining readily available tools to create an infrastructure for writing tests for Java programs that have graphical user interfaces. These tests are level-appropriate for introductory students and fit in with current approaches in computer science education that incorporate testing in programming assignments. An analysis of data collected during actual student use of the framework in a CS1 course is presented.

Scalability presents a significant challenge in vehicular communication, particularly when there is no hierarchical structure in place to manage the increasing number of vehicles. As the number of vehicles increases, they may encounter the broadcast storm problem, which can cause network congestion and reduce communication efficiency. Clustering can solve these issues, but due to high vehicle mobility, clustering in vehicular ad hoc networks (VANET) suffers from stability issues. Most of the existing clustering protocols are optimized for highways only and some protocols are optimized for intersections only. The clusters that are created by the protocols which are optimized for highways breakdown at the intersections where clustering is needed more. On the other hand, the clusters that are created by the protocols optimized for intersections create extra clusters or break unnecessary on straight-roads which reduces cluster stability. Moreover, the lack of intelligent use of a combination of the mobility parameters, such as direction, movement, position, velocity, degree of vehicle, and movement at the intersection, also contributes to cluster stability problems. A dynamic clustering protocol that efficiently combines all the mobility parameters can resolve these issues in VANETs by providing stability in both intersections and highways. To achieve high stability in VANET clustering, a Stable Dynamic feedback-based Predictive Clustering (SDPC) protocol is proposed for VANET to ensure cluster stability in both highway and intersection scenarios. SDPC considers vehicle relative velocity, acceleration, position, distance, transmission range, moving direction at the intersection, and vehicle density to create a cluster. The cluster head is selected based on the future position of the vehicles, relative distance between vehicles, movement of vehicles at the intersection, degree of vehicles, and probable cluster head duration. The performance of SDPC is compared with four existing VANET clustering protocols in various road topologies, in terms of the average cluster head change rate, the average duration of cluster head, the average duration of cluster member, and the average clustering overhead. The simulation results show that SDPC outperforms the existing protocols, achieving higher clustering stability in terms of cluster head change rate (50%), cluster head duration (15%), cluster member duration (6%), and clustering overhead (35%).

Scalability presents a significant challenge in vehicular communication, particularly when there is no hierarchical structure in place to manage the increasing number of vehicles. As the number of vehicles increases, they may encounter the broadcast storm problem, which can cause network congestion and reduce communication efficiency. Clustering can solve these issues, but due to high vehicle mobility, clustering in vehicular ad hoc networks (VANET) suffers from stability issues. Most of the existing clustering protocols are optimized for highways only and some protocols are optimized for intersections only. The clusters that are created by the protocols which are optimized for highways breakdown at the intersections where clustering is needed more. On the other hand, the clusters that are created by the protocols optimized for intersections create extra clusters or break unnecessary on straight-roads which reduces cluster stability. Moreover, the lack of intelligent use of a combination of the mobility parameters, such as direction, movement, position, velocity, degree of vehicle, and movement at the intersection, also contributes to cluster stability problems. A dynamic clustering protocol that efficiently combines all the mobility parameters can resolve these issues in VANETs by providing stability in both intersections and highways. To achieve high stability in VANET clustering, a Stable Dynamic feedback-based Predictive Clustering (SDPC) protocol is proposed for VANET to ensure cluster stability in both highway and intersection scenarios. SDPC considers vehicle relative velocity, acceleration, position, distance, transmission range, moving direction at the intersection, and vehicle density to create a cluster. The cluster head is selected based on the future position of the vehicles, relative distance between vehicles, movement of vehicles at the intersection, degree of vehicles, and probable cluster head duration. The performance of SDPC is compared with four existing VANET clustering protocols in various road topologies, in terms of the average cluster head change rate, the average duration of cluster head, the average duration of cluster member, and the average clustering overhead. The simulation results show that SDPC outperforms the existing protocols, achieving higher clustering stability in terms of cluster head change rate (50%), cluster head duration (15%), cluster member duration (6%), and clustering overhead (35%).

Many applications require to send the information from the source node to the destination node through the communication network. In order to support these applications, it is necessary to determine a path of minimal cost to connect the source node to the destination node. The TM algorithm and BSMA algorithm has been used in order to find the path that minimizes the total cost. The experimental results show that the algorithm can find optimal solution quickly.

Irrigation is a traditional method that uses a higher proportion of laborer's than other daily agricultural practices. Sensors and microcontrollers are used to automatically irrigate the plants. identify when the plants need to be watered.Automation entails accelerating production, cutting costs, and making efficient use of resources. The primary objective of this project is to create a microcontroller irrigation system that sends information to farmers while autonomously watering plants.

Abstract: In automatic plant watering system, an automation of farm irrigation and soil moisture control is carried out by using an embedded system designed around Atmega328 (microcontroller), soil moisture sensor, L293D module, humidity sensor and temperature sensor. It is observed that drip irrigation system needs accurate amount of ambient humidity and temperature in environment. This automatic irrigation system detects the moisture content of the soil and automatically switches the pump, when the power is on; similarly it also maintains the humidity and temperature of the environment. A proper usage of automatic water irrigation system is very necessary because of shortage of land and reserved water due to lack of rain. On the other hand; it is found that spontaneous use of water results in wastage of large amount of water, so automatic water irrigation systems plays a vital role in conservation of water. This system is very useful in all climatic conditions and agricultural pur...

Causal multicast is required for several distributed applications. In a mobile computing environment, it is especially important for applications that involve human interactions from several locations, for example, teleconferencing. In this paper, we present a causal multicast algorithm in which the message overhead is independent of the number of mobile hosts, and which can handle connections/disconnections easily. It also handles

Abstract- Inspiration to this project taken from the nations where financial system depends on farming and the climatic circumstances lead to absence of downpours and shortage of water. When we are away from the crop land for a long day there is a need of physical watering or depending on a companion to water plants. Even if the crop land has a water pump physical action by the farmer is required to turn on/off whenever plants need water. Meanwhile Farmer needs to protect the area by animals, robberies and fire. The fundamental point of our venture is to minimize this manual mediation by the rancher and which helps in sparing cash and water. Index Terms- Embedded system, microcontroller 8051, LCD, sensors, pumping motor, relay and GSM module etc.

The Common Object Request Broker Architecture (CORBA) is one of the most popular standard for middleware platforms based on object technology. CORBA shields distributed applications from the heterogeneity of the bare distributed system. Till recently CORBA did not address the fault tolerance issue which is actually one of the core aspects of distributed applications running upon an heterogeneous environment. As a consequence, in the last few years many research proposals have appeared in the literature to add reliability and availability to CORBA applications. This paper first analyzes the advantages and drawbacks of such proposals and shows that none of them completely exploits the platform independence provided by CORBA. Then it proposes a novel CORBA-compliant approach, which differs in allowing the deployment of a dependable infrastructure in heterogeneous environments.

This paper proposes an automatic water pumping system for a smart greenhouse, optimizing plant irrigation using renewable energy. It features sensors monitoring soil moisture, a pump powered by solar or wind, and a control unit adjusting pump operation based on sensor readings. The system, linked to the Internet, enables remote monitoring and control. Expected benefits include reduced manual watering, decreased reliance on non-renewable energy, and enhanced greenhouse efficiency. Smart greenhouses aim to enhance plant cultivation sustainability, with a crucial role played by the automated irrigation system, comprising a control unit, pump, and moisture sensors. Internet connectivity facilitates remote monitoring and adjustment for informed greenhouse operation.

XML is going to be the main language for exchanging financial information between businesses over the Internet. As more and more banks and financial institutions move to electronic information exchange and reporting, the financial world is in a flood of information. With the sheer amount of financial information stored, presented and exchanged using XML-based standards, the ability to extract interesting knowledge from the data sources to better understand customer buying/selling behaviors and upward/downward trends in the stock market becomes increasingly important and desirable. Hence, there have been growing demands for efficient methods of discovering valuable information from a large collection of XML-based data. One of the most popular approaches to find the useful information is to mine frequently occurring tree patterns. In this paper, we propose a novel algorithm, FIXiT,for efficiently extracting maximal frequent subtrees from a set of XML-based documents. The main contributions of our algorithm are that: (1) it classifies the available financial XML standards such as FIXML, FpML, XBRL, and so forth with respect to their specifications, and (2) there is no need to perform tree join operations during the phase of generating maximal frequent subtrees.

The more web data sources provide XML data, the greater information flood problem has been caused. Hence, there have been increasing demands for efficient methods of discovering desirable patterns from a large collection of XML data. In this paper, we propose a new and scalable algorithm, EFoX, to mine frequently occurring tree patterns from a set of labeled trees. The main contribution made by our algorithm is that there is no need to perform any tree join operation to generate candidate sets.

The explosive growth of data available in the internet exposes a serious problem, informationoverflow, where each user gets rarely necessary information and which brings blind spot of information search. The blind spot means the areas which cannot be accessed by search engines. Hence, there is no way users can get the information in blind spots. They are getting wider, which cause loss of valuable information for users' queries. The problem of blind spots stems from the way of navigating the web for current leading search engines, Google or Yahoo; they crawl web pages periodically and automatically, store them into indexed databases, and retrieve search results via queries. However, the rapid growth of the web data brings a limit of indexing pages, which massproduces data areas that cannot be accessed by the search engines. Besides, they still retrieve useless results for depending on a few keywords, where users wander again for really necessary information. The truly required searching way is to provide valuable and accurate search results to users in a customized way and to deliver the information from the viewpoint of a user, not from the viewpoint of a search engine provider. Recently, fresh search engines are developed and issued with Silicon Valley as the center. Their objectives are the intelligent and specialized search results as well as easy user interfaces. In this manuscript, we introduce some representatives of the newly published search engines along with surveying and classifying systematically current existing web search engines.

Modern data privacy regulations such as GDPR, CCPA, and CDPA stipulate that data pertaining to a user must be deleted without undue delay upon the user's request. Existing systems are not designed to comply with these regulations and can leave traces of deleted data for indeterminate periods of time, often as long as months. We developed Lethe to address these problems by providing fine-grained secure deletion on any system and any storage medium, provided that Lethe has access to a fixed, small amount of securely-deletable storage. Lethe achieves this using keyed hash forests (KHFs), extensions of keyed hash trees (KHTs), structured to serve as efficient representations of encryption key hierarchies. By using a KHF as a regulator for data access, Lethe provides its secure deletion not by removing the KHF, but by adding a new KHF that only grants access to still-valid data. Access to the previous KHF is lost, and the data it regulated securely deleted, through the secure deletion of the single key that protected the previous KHF.

This paper presents Flashmon version 2, a tool for monitoring embedded Linux NAND flash memory I/O requests. It is designed for embedded boards based devices containing raw flash chips. Flashmon is a kernel module and stands for "flash monitor". It traces flash I/O by placing kernel probes at the NAND driver level. It allows tracing at runtime the 3 main flash operations: page reads / writes and block erasures. Flashmon is (1) generic as it was successfully tested on the three most widely used flash file systems that are JFFS2, UBIFS and YAFFS, and several NAND chip models. Moreover, it is (2) non intrusive, (3) has a controllable memory footprint, and (4) exhibits a low overhead (< 6%) on the traced system. Finally, it is (5) simple to integrate and used as a standalone module or as a built-in function / module in existing kernel sources. Monitoring flash memory operations allows a better understanding of existing flash management systems by studying and analyzing their behavior. Moreover it is useful in development phase for prototyping and validating new solutions.

Yoking-proofs show an interesting application in Radio Frequency Identification (RFID) that a verifier can check whether two tags are simultaneously scanned by a reader. We consider a scenario that multi-group of tags can be proved to be scanned simultaneously. Grouping-proof, which is an extension of yoking-proofs, allows multiple tags to be proved together, while existing protocols cannot support multiple groups. In this paper, we introduce a novel concept called "yoking-group proofs". Additionally, we propose an anonymous yoking-proof protocol and an anonymous yoking-group proof protocol and prove their security in Universal Composability framework.

Mobile networks have been quickly adopted by many companies and individuals. However, multiple factors such as mobility and limited resources often constrain availability and thus cause instability of the wireless environment. Such instability poses serious challenge for fault tolerant distributed mobile applications. Therefore, the classical checkpointing techniques, which make the applications more failure-resistant, are not always compatible with the mobile context. In fact, it is necessary now to think about other techniques or at least adapt those to devise effective and well suited techniques for the mobile environment. Considering this issue, the contribution in this paper is a proposal of a new checkpointing algorithm suitable for mobile computing systems. This algorithm is characterized by its efficiency and optimization in terms of incurred time-space overhead during checkpointing process and normal application running period.

Mobile ad hoc network (MANET) is a type of wireless network consisting of a set of self-configured mobile hosts that can communicate with each other using wireless links without the assistance of any fixed infrastructure. This has made it possible for us to create distributed mobile computing applications and has also brought several new challenges in the field of distributed algorithm design. Checkpointing is a well explored fault tolerance technique for the wired and cellular mobile networks. However, it is not directly applicable to MANET owing to its dynamic topology, limited availability of stable storage, partitioning and the absence of fixed infrastructure. In this paper, we propose an adaptive, coordinated and non-blocking checkpointing algorithm to provide fault tolerance in cluster-based MANET, where only a minimum number of mobile hosts in the cluster should take checkpoints. The performance analysis and simulation results show that the proposed scheme requires less coordinating-message cost and performs well compared to the related previous works.

SummaryRecently, the routing problem in vehicular ad hoc networks is one of the most vital research. Despite the variety of the proposed approaches and the development of communications technologies, the routing problem in VANET suffers from the high speed of vehicles and the repetitive failures in communications. In this paper, we adjusted the well‐known K‐medoids clustering algorithm to improve the network stability and to increase the lifetime of all established links. First, the number of clusters and the initial cluster heads will not be selected randomly as usual, but based on mathematical formula considering the environment size and the available transmission ranges. Then the assignment of nodes to clusters in both k‐medoids phases will be carried out according to several metrics including direction, relative speed, and proximity. To the best of our knowledge, our proposed model is the first that introduces the new metric named “node disconnection frequency.” This metric prev...

In this paper, we address the problem of delivering multimedia content to a sparse vehicular network from roadside info-stations, using efficient vehicle-to-vehicle collaboration. Due to the highly dynamic nature of the underlying vehicular network topology, we depart from architectures requiring centralized coordination, reliable MAC scheduling, or global network state knowledge, and instead adopt a distributed paradigm with simple protocols. In other words, we investigate the problem of reliable dissemination from multiple sources when each node in the network shares a limited amount of its resources for cooperating with others. By using rateless coding at the Road Side Unit (RSU) and using vehicles as data carriers, we describe an efficient way to achieve reliable dissemination to all nodes (even disconnected clusters in the network). In the nutshell, we explore vehicles as mobile storage devices. We then develop a method to keep the density of the rateless coded packets as a function of distance from the RSU at the desired level set for the target decoding distance. We investigate various tradeoffs involving buffer size, maximum capacity, and the mobility parameter of the vehicles.

In this paper, we have presented an efficient non-blocking coordinated check pointing algorithm for distributed systems. It produces a consistent set of checkpoints, without the overhead of taking temporary checkpoints; the algorithm also makes sure that only few processes are required to take checkpoints in its any execution; it uses very few control messages and the participating processes are interrupted fewer number of times when compared to some noted related works. The two most important criteria are non-blocking and minimum number of checkpoints. Cao-Singhal showed in their algorithm that it is impossible to design minimum process non-blocking algorithm but it is not desirable in mobile environment that underlying computation will be blocked whenever a check pointing algorithm invoked. If the check pointing scheme is blocking then the performance of the system will be highly affected by the frequent initiation of check pointing algorithm. We must try to minimize the blocking ...

In distributed systems, there are many opportunities for failure. Any component in any compute node could fail. This includes, but is not limited to, the processor, disk, memory, or network interface on the node. Any of these failures will cause the processes running on the affected nodes to crash or produce incorrect results. The common method of ensuring the progress of these processes is to take a checkpoint, this issue is complicated if the processes are inter-communication processes. This paper presents a distributed non-blocking coordinated checkpointing algorithm that ensures producing global consistent checkpoints images. These consistent checkpoint images can be used to migrate application processes to different computing nodes when a failure takes place.

Deeply pipelined, superscalar processors require accurate branch prediction to achieve high performance. Two-level branch predictors have been shown to achieve high prediction accuracy. It has also been shown that branch interference is a major contributor to the number of branches mispredicted by two-level predictors. This paper presents a new method to reduce the interference problem called agree prediction, which reduces the chance that two branches aliasing the same PHT entry will interfere negatively. We evaluate the performance of this scheme using full traces (both user and supervisor) of the SPECintgfi benchmarks. The result is a reduction in the misprediction rate of gee ranging from 8.62% with a 64Kentry PHT up to 33.3% with a IK-entry PHT.

Abstract: In automatic plant watering system, an automation of farm irrigation and soil moisture control is carried out by using an embedded system designed around Atmega328 (microcontroller), soil moisture sensor, L293D module, humidity sensor and temperature sensor. It is observed that drip irrigation system needs accurate amount of ambient humidity and temperature in environment. This automatic irrigation system detects the moisture content of the soil and automatically switches the pump, when the power is on; similarly it also maintains the humidity and temperature of the environment. A proper usage of automatic water irrigation system is very necessary because of shortage of land and reserved water due to lack of rain. On the other hand; it is found that spontaneous use of water results in wastage of large amount of water, so automatic water irrigation systems plays a vital role in conservation of water. This system is very useful in all climatic conditions and agricultural pur...

Point pattern matching (PPM) is an important topic in the fields of computer vision and pattern recognition. According to if there exists a one to one mapping between the two point sets to be matched, PPM can be divided into the case of complete matching and the case of incomplete matching. According to if utilizing information other than 2-D image coordinates, PPM can be divided into labelled point-matching case and unlabelled point-matching case. Using partial Hausdorff distance, this paper presents a genetic algorithm (GA) based method to solve the incomplete unlabelled matching problem under general affine transformation. Since it successfully reduces the solution space of GA by constructing 'feature ellipses' of point sets, the method can achieve high computing efficiency and good matching results. Theoretical analysis and simulation results show that the new algorithm is very effective.

IPSec is a suite of protocols that provides security for internet communications at the IP layer. The security properties of IPSec mainly depend on the key exchange protocols where the efficiency and security of the key management are important parts of IPSec. Internet Key Exchange (IKE) protocol is the most common mechanism for the two hosts to exchange key materials. However, IKE is complex and vulnerable due to attacks such as (DOS, Replay and Man in the middle). In this paper, we propose a new IKE protocol based on D-H. This protocol uses three round-trips the exchange message. The advantages of our contribution are: one phase (vs. two phases on standard IKE), Best efficiency ie. optimizes transmission time (vs. longer negotiation time). The security analysis and formal verification using Automated Validation of Internet Security Protocols and Applications (AVISPA) show that our contribution can resist to various attack types such as (Replay, DOS, man in the middle). We compare our IKE with other IKE protocols; the proposed protocol is more secure with less computation complexity.

Frequent tree patterns have many practical applications in different domains such as XML mining, web usage analysis, etc. In this paper, we present OInduced, a novel and efficient algorithm for finding frequent ordered induced tree patterns. OInduced uses a breadth-first candidate generation method and improves it by means of an indexing scheme. We also introduce frequency counting using tree encoding. For this purpose, we present two novel tree encodings, m-coding and cmcoding, and show how they can restrict nodes of input trees and compute frequencies of generated candidates. We perform extensive experiments on both real and synthetic datasets to show efficiency and scalability of OInduced.

Internet Protocol Security (IPSec) is a widely deployed mechanism for implementing Virtual Private Networks (VPNs). IPSec, proposed by Internet Engineering Task Force (IETF), is a popular tunneling technology adopted for the Virtual Private Network It provides the network layer additional security functionality to transform multiple segments of a private network into one. This paper evaluates the performance overheads associated with IPSec. We not only explore implementation issues of IPSec over popular operating systems, such as Windows and Linux, but also provide performance evaluation of the proposed algorithms by a series of experiments.

There are currently numerous practical applications to improve the effectiveness of Radio Frequency Identification (RFID) Systems. RFID provides an efficient identification for shipping and receiving goods. In warehouse management, RFID mechanisms can be used to check whether large quantities of goods are presented within a supply-chain system. In a supermarket, product information can be acquired without asking the clerks, one by one. The above applications are limited with regard to authentication between a single tag and server, while other applications focus on authenticating the relationships among the tags. In this paper, we use a yoking proof mechanism conforming to EPCglobal Class 1 Generation 2 Standards to improve the customs container check. Our scheme can also defend against known attacks and greatly enhance security.

The process description languages are used in the business may be useful in the optimization of logistics processes too. The process description languages would be the obvious solution for process control, to handle the main sources of faults and to give a correct list of what to do during the logistics process. Related to this, firstly, the paper presents the main features of the frequent process description languages. The following section describes the currently most used process modelling languages, in the areas of production and construction logistics. In addition, the paper gives some examples of logistics simulation, as another very important field of logistics system modelling. The main edification of the paper, the logistics simulation supported by process description languages. The paper gives a comparison of a Petri net formal representation and a Simul8 model, through a construction logistics model, as the major contribution of the research.

The process description languages are used in the business may be useful in the optimization of logistics processes too. The process description languages would be the obvious solution for process control, to handle the main sources of faults and to give a correct list of what to do during the logistics process. Related to this, firstly, the paper presents the main features of the frequent process description languages. The following section describes the currently most used process modelling languages, in the areas of production and construction logistics. In addition, the paper gives some examples of logistics simulation, as another very important field of logistics system modelling. The main edification of the paper, the logistics simulation supported by process description languages. The paper gives a comparison of a Petri net formal representation and a Simul8 model, through a construction logistics model, as the major contribution of the research.

Checkpointing algorithms suitable for mobile computing environments should be economical in terms of storage and energy consumption, and they should be able to handle that at starting time not all processes are known which are to be involved in the checkpointing. We propose such an algorithm by generalizing Chandy/Lamport's snapshot algorithm [4] in two ways: processes are given a certain autonomy when to take their local checkpoints, and processes send checkpoint requests only to processes they knowingly depend on. As [4], our algorithm comprises the so-called phase 1 of coordinated checkpointing, only, whichunder reasonable progress assumptions-ensures that all the local checkpoints will be taken. We present the algorithm in terms of its operational semantics over which we prove the consistency of the calculated snapshot.

The Library for Interface Testing (LIFT) supports writing unit tests for Java applications with graphical user interfaces (GUIs). Current frameworks for GUI testing provide the necessary tools, but are complicated and difficult to use for beginners, often requiring a significant amount of time to learn. LIFT takes the approach that unit testing GUIs should be no different than testing any other type of code. By providing a set of frequently used filters for identifying GUI components and a set of operations for acting on those components, LIFT lets programmers quickly and easily test their GUI applications.

The following article presents the results on the impact of encryption algorithms and the cryptographic hash function on the QoS (Quality of Service) transmission in a computer network. A network model supporting data encryption using the AES algorithm and the MD5 and SHA hash functions used in VPN tunnels was designed and tested. The influence of different data length on the quality of transmission in a secured network was studied. The measurements and tests of networks were performed according to two methodologies ITU-T Y.1564 and RFC 2544. The impact of the data encryption mechanism on bandwidth, data loss and maximum delays was examined. The secured network tests were performed with different combinations of encryption algorithms and hash functions of the VPN tunnel in the ESP (Encapsulating Security Payload) transport mode.

Performance Enhancing Proxies (PEPs) are used in satellite networks for better performance of the TCP/IP applications. Multi-layer IPSec (ML-IPSec) resolves the conflict between end-to-end security in standard IPSec and operation of PEPs. Previous Ml-IPSec solution has issues of limited application scope and increased complexity to implement and process the ML-IPSec protected data. This paper presents a new dynamic ML-IPSec protocol which addresses these issues. The paper also analyzes the protocol with reference to previous ML-IPSec protocol and presents the experiment performed to analyze the network performance while running IPSec and ML-IPSec.

Key Management is the critical issue of a cryptographic system and it requires a better security mechanism. Bio-cryptology provides a strong solution for the said critical issue. Fuzzy vault scheme is a popular scheme to design bio-cryptosystems. Key is secured with the biometric data mixed up with some noise points known as chaff points in a secure storage i.e. vault. Generation of chaff points is the important part of the fuzzy vault system. This work is mainly aims to present an authentication scheme (Key matching) with reducing the complexities of chaff generation. In chaff generation, circle packing, geometrical hashing etc. techniques are used to protect the real data from the noisy data, but these techniques are complex. Here a novel method of chaff generation is used where newly generated chaff point compared with genuine points (stored in a dataset) to assure that it is different, hence genuine points are protected. Experimental results shows that our method have less complexity and performs better than other existent methods.

Over the last few years, connectionism or neural networks (NN) have successfully been applied to a wide range of areas and have demonstrated their capabilities in solving complex problems. Current indications show that these techniques are very important and rapidly developing areas of research and applications, particularly, in the area of data mining for knowledge discovery. One particular neural network model, the back-propagation (BP) algorithm, has performed very well in this regard and it is now accepted as a reliable method for data mining. However, these models have their shortcomings. The major difficulty lies in the fact that the relationships between specific variables and the neural network results are, at best, difficult to explain. This article presents an innovative but simple method for using NN to understand the pattern/outcome correlation to interpret a cause and effect relationship. A comparative analysis and experimental results are also presented to show the val...

Upcoming ubiquitous computing systems are required to operate in dynamic, diverse, unverified, and unpredictable operating environment. The OSGi (Open Service Gateway initiative) framework employs the service-oriented approach and the Java ClassLoader architecture for the runtime service deployment, that are well suited to the dynamic environment envisioned for home networking and ubiquitous computing. However, the current OSGi framework does not provide full reliability measures, especially for failure conditions, such as network, device, and application failures. This paper analyzes software reliability issues in OSGi framework and proposes a proxy-based reliable extensions. The design concept was implemented and partly tested on an open source OSGi platform, Oscar, for the smart home residential gateway test-bed.

Directed signature scheme is applicable when the signed message contains information sensitive to the receiver, because only receiver can directly verify the signature and that he/she can prove its validity to any third party, whenever necessary. This paper presents two applications of directed signature scheme. (i) Directed –Delegated Signature Scheme. This scheme combines the idea of proxy signatures with directed signature scheme. (ii) Allocation of registration number. This scheme proposes a registration scheme in which the registration number cannot be forged and misused.

Mobile computing raises many new issues such as lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life. These new issues make traditional checkpointing algorithms unsuitable. Coordinated checkpointing is an attractive approach for transparently adding fault tolerance to distributed applications since it avoids domino effects and minimizes the stable storage requirement. However, it suffers from high overhead associated with the checkpointing process in mobile computing systems. In literature mostly, two approaches have been used to reduce the overhead: First is to minimize the number of synchronization messages and the number of checkpoints; the other is to make the checkpointing process nonblocking. Since MHs are prone to failure, so they have to transfer a large amount of checkpoint data and control information to its local MSS which increases bandwidth overhead. In this paper, we introduce the concept of “Soft checkpoint” which is neith...

Recovery from transient failures is one of the prime issues in the context of distributed systems. These systems demand to have transparent yet efficient techniques to achieve the same. Checkpoint is defined as a designated place in a program where normal processing of a system is interrupted to preserve the status information. Checkpointing is a process of saving status information. Mobile computing systems often suffer from high failure rates that are transient and independent in nature. To add reliability and high availability to such distributed systems, checkpoint based rollback recovery is one of the widely used techniques for applications such as scientific computing, database, telecommunication applications and mission critical applications. This paper surveys the algorithms which have been reported in the literature for checkpointing in Mobile Computing Systems.

Checkpointing is one of the commonly used techniques to provide fault tolerance in distributed systems so that the system can operate even if one or more components have failed. However, mobile computing systems are constrained by low bandwidth, mobility, lack of stable storage, frequent disconnections and limited battery life. Hence checkpointing protocols which have fewer checkpoints are preferred in mobile environment. Since MHs are prone to failure, so they have to transfer a large amount of checkpoint data and control information to its local MSS which increases bandwidth overhead. In this paper we propose a new soft checkpointing scheme for mobile computing systems. These soft checkpoints are saved locally in the host. Locally stored checkpoints do not consume network bandwidth and can be created in less time. Before disconnecting from the MSS, these soft checkpoints are converted to hard checkpoints and are sent to MSSs stable storage. In this way, taking a soft checkpoint avoids overhead transferring large amount of data to the stable storage MSSs.

Considering the popularity of the Internet, an automatic interactive feedback system for e-learning websites is becoming increasingly desirable. However, there are still some problems for computers to understand the natural language, especially the Chinese language. First, because the Chinese language has no space to segment the lexical entry, its segmentation method is more difficult than that of English. Second, the lack of complete grammar for Chinese language makes parsing more difficult and complicated. Building an automatic Chinese feedback system for special application domains could solve these problems. In this paper, an interactive mechanism is proposed to parse, understand and response to a Chinese sentence. This mechanism utilizes a specific lexical database according to the particular application. In this way, a Chinese interactive feedback e-learning website is built for a special application domain that will choose the proper response in a user friendly, accurate and timely manner.

Considering the popularity of the Internet, an automatic interactive feedback system for Elearning websites is becoming increasingly desirable. However, computers still have problems understanding natural languages, especially the Chinese language, firstly because the Chinese language has no space to segment lexical entries (its segmentation method is more difficult than that of English) and secondly because of the lack of a complete grammar in the Chinese language, making parsing more difficult and complicated. Building an automated Chinese feedback system for special application domains could solve these problems. This paper proposes an interactive feedback mechanism in a virtual campus that can parse, understand and respond to Chinese sentences. This mechanism utilizes a specific lexical database according to the particular application. In this way, a virtual campus website can implement a special application domain that chooses the proper response in a user friendly, accurate an...

The need for security in lightweight devices such as radio frequency identification tags is increasing and a pseudorandom number generator (PRNG) constitutes an essential part of the authentication protocols that provide security. The main aim of this research is to produce a lightweight PRNG for cryptographic applications in wireless identification and sensing platform family devices, and other related lightweight devices. This PRNG is produced with genetic programming methods using entropy calculation as the fitness function, and it is tested with the NIST statistical test suite. Moreover, it satisfies the requirements of the EPCGen2 standards.

Test Driven Development model is identified for the quality of the final product and the ease of development. This model has a few obstacles while applying for Graphical User Interface development, as User Interface Testing possesses a few challenges. This paper is a case study of developing a User Interface feature, based on the test driven development model.

Image This project on &quot;Automatic Irrigation System on Sensing Soil Moisture Content&quot; is intended to create an automated irrigation mechanism which turns the pumping motor ON and OFF on detecting the moisture content of the earth. In the domain of farming, utilization of appropriate means of irrigation is significant. The benefit of employing these techniques is to decrease human interference and still make certain appropriate irrigation. In the conventional drip irrigation system, the farmer has to keep watch on irrigation timetable, which is different for different crops. With the use of low cost sensors and the simple circuitry makes these project a low cost product, which can be bought even by a poor farmer. This project is best suited for places where water is scares and has to be used in limited quantity. The project makes the irrigation automated. This automated irrigation project brings into play an Atmega328 microcontroller, is programmed to collect the input signa...