Advances in Computer Science and Information Technology. Networks and Communications

The lifetime of a sensor network depends mainly on the sensor node’s battery power. Therefore it is necessary to use sensor node battery power very efficiently. Most of the existing powers saving protocols have been designed in such a way that the sensor nodes are put into sleep state when there is no transmission. These protocols fail to adjust dynamically a sensor node’s sleep duration based on its traffic load. This periodic and regular sleep and awake method of these protocols cause high latency and high energy consumption. A host must be allowed to sleep longer if it is not involved in data transmission frequently. Thus, to efficiently manage a host’s energy, we need not only have a power saving mechanism but also a scheme to guarantee data transmission. In this paper we propose an Adaptive Quorum Based MAC Protocol (AQMAC) that enables sensor nodes to sleep under light loads in non uniform node distribution thereby decreasing the latency and increasing the throughput. We also used q-Switch Routing coupled with the non uniform node distribution strategy that switches the data flow among its corresponding next-hop forwarding nodes in order to balance energy dissipation among them and to reduce the transmission latency.

Intelligent vehicular ad hoc networks (InVANETs) provide an effective communication between vehicles with dynamic mobility. This paper enhances the traffic management system using mobile agents called as Intellect Mobile Agent (IMA). IMA is used to identify the traffic in the path from source to destination and provides an effective way to transport through less traffic scenario. IMA designed with an algorithm which calculates the amount of traffic as a parameter and finds a least path to reach the destination. The vehicle sends the IMA with the destination node which traces the traffic path. IMA identifies the path with least traffic using probability calculation and directs the vehicle to reach the destination.

This paper investigates the local observer design for nonlinear control systems with real parametric uncertainty around equilibria. In this paper, new results are derived for a general class of nonlinear systems with real parametric uncertainty. In this paper, it is first shown that equilibrium-state detectability is a necessary condition for the existence of local asymptotic observers for any nonlinear system and using this result, it is shown that for the classical case, when the state equilibrium does not change with the real parametric uncertainty, and when the plant output is purely a function of the state, there is no local asymptotic observer for the plant. Next, it is shown that in sharp contrast to this case, for the general case of problems where we allow the state equilibrium to change with the real parametric uncertainty, there generically exist local exponential observers even when the plant output is purely a function of the state. In this paper, a characterization and construction procedure for local exponential observers for a general class of nonlinear systems with real parametric uncertainty has also been derived under some stability assumptions. It is also shown that for the general class of nonlinear systems considered, the existence of local exponential observers in the presence of inputs implies, and is implied by the existence of local exponential observers in the absence of inputs.

We propose a Node Stability Index (NSI)-based algorithm to determine stable connected dominating sets (CDS) for Mobile Ad hoc Networks (MANETs). The NSI of a node is defined as the sum of the predicted Link Expiration Times (LETs) of the links with its neighbor nodes. The NSI-CDS algorithm prefers to include (to the CDS) covered nodes that have the largest NSI value, computed based on the sum of the LETs of the uncovered neighbors. The NSI-CDS has been observed to have significantly longer lifetime than the maximum density-based CDS (MaxD-CDS) and the ID-based CDS (ID-CDS). The tradeoff is a modest increase in the CDS Node Size which however contributes significantly to the robustness of the CDS as well as to a lower hop count per path, especially in high-density networks.

One of the most significant challenges for Wireless Sensor Networks (WSN) is long-lived sensor nodes and minimization in overall power consumption, As the nodes spend substantial energy in sending and receiving data, a robust and power-aware routing protocol can maximize the network lifetime. In this paper, a cluster based dynamic and energy efficient routing scheme with optimal transmission range (DEOR) for wireless sensor networks is proposed in order to maximize the network lifetime. In this protocol, nodes are classified in different ranks depending on the nature of their power consumption in terms of both direct communication to the Base Station and optimal transmission range. Each node maintains a routing table to choose the next hop node to relay the data and after successful transmission it updates that routing table. Computer simulation of this dynamic routing protocol has been done and a better outcome has been observed compared to one of the multihop routing strategies.

This paper investigates the problem of designing active feedback controllers for achieving generalized projective synchronization (GPS) of identical hyperchaotic Lü systems (Chen

et al.

2006) and non-identical hyperchaotic Cai system (Wang and Cai, 2009) and hyperchaotic Lü system. The synchronization results (GPS) derived in this paper have been established using Lyapunov stability theory. Since the Lyapunov exponents are not required for these calculations, the active feedback control method is very effective and convenient for achieving the general projective synchronization (GPS) of hyperchaotic Lü and hyperchaotic Cai systems. Numerical simulations are shown to demonstrate the effectiveness of the synchronization results derived in this paper.

One of the important issues in ad hoc wireless network is to construct virtual backbone for efficient broadcasting. A Multi Point Relay (MPR) is a set of 1-hop neighbours to cover all 2-hop neighbours of a node. It is a promising approach for broadcasting in ad hoc networks. A Connected Dominating Set (CDS) based virtual backbone has been used where only the nodes in the set relay messages. A node in the CDS consumes more energy and the energy depletes quickly than other nodes. Although previous CDS construction algorithms achieve good results in terms of the size of the CDS, a minimum size CDS does not necessarily guarantee the optimal network performance from an energy efficient point of view. In this paper, we propose a distributed algorithm for energy efficient stable MPR based CDS construction to extend the lifetime of ad hoc wireless networks by considering energy and velocity of nodes. The simulation results show that our algorithm can save a significant amount of energy and increases the lifetime up to 25% than previous works.

This paper investigates the hybrid chaos synchronization of identical Arneodo systems (1981), identical Rössler systems (1976) and non-identical Arneodo and Rössler systems. In hybrid synchronization of chaotic systems, one part of the systems is synchronized and the other part is anti-synchronized so that complete synchronization (CS) and anti-synchronization (AS) co-exist in the systems. The co-existence of CS and AS is very useful in secure communication and chaotic encryption schemes. Active nonlinear control is the method used for the hybrid synchronization of the chaotic systems addressed in this paper. Since the Lyapunov exponents are not required for these calculations, the active control method is effective and convenient to achieve hybrid synchronization of the two chaotic systems. Numerical simulations are shown to verify the results.

The increase in the consumer demand and the exponential growth for wireless systems, which enables consumer to communicate in any place by means of information, has in turn led to the emergence of many portable wireless communication products. The present research works primarily targets to integrate as much as signal processing applications in a single portable device. Since integration through software applications compromises system speed, integration through hardware will be the better compliment. Software Defined Radio (SDR) Technology yields to achieve this small form factor system while keeping power consumption under the limit. SDR enables soft changeable system functionality, such as receiver demodulation technique. The flexibility of changing the receiver functionality in runtime is usually attained by FPGA. However, using a complete FPGA for reconfiguration of a particular functionality is not an efficient method in terms of power consumption and switching time. We proposed a SDR architecture using a recent advancement in FPGAs, called Partial Reconfiguration (PR). PR helps to change certain portion of FPGA, while the rest keeps functioning. It also reduces the total hardware usage and hence the power. The different demodulation technique and other signal processing application from an external memory unit can be loaded into FPGA PR modules while the other parts of FPGA doing a constant data processing.

Dermatosis disease is also known as Sweaty Sock Syndrome (SSS). Most of the children and young teenagers are affected by SSS. It damages the skin of the children and the young teenagers with red soles on the feet. A new methodology is used to find the stages of Sweaty Sock Syndrome using Multilayer perceptron (MLP) and EM clustering technique. The symptoms and stages of SSS are classified by using predictive modeling. In Multilayer perceptron technique, data objects are classified based on the stages of SSS and find out their efficiency and accuracy. EM Clustering is an unsupervised technique, which is characterized the objects based on the weights. Supervised learning identifies the various symptoms of SSS disease. It categorizes the data such as initial, non severe and severe by using learning by example. Learning by observation method categorizes the data into different clusters, which is grouped as initial, non severe and severe. It helps to know the various stages of dermatosis by using predictive and descriptive modeling. This prediction helps to recommend the patients those who are affected by SSS and provide suggestion to the patients.

ZigBee is a very important technology for Wireless Sensor Networks which is targeted at radio-frequency (RF) applications that require a low data rate, long battery life, and secure networking. The Ad hoc On Demand Distance Vector (AODV) routing algorithm is a routing protocol designed for ad hoc mobile networks. It is an on demand algorithm, meaning that it builds routes between nodes only as desired by source nodes. It maintains these routes as long as they are needed by the sources. In this paper we will discuss about the performance of enhanced AODV in wireless sensor networks based on ZigBee.

In this paper, new results based on the sliding mode control are derived for the global chaos synchronization of identical Coullet chaotic systems (1981). The stability results for the sliding mode control based synchronization schemes derived in this paper are established using Lyapunov stability theory. Since the Lyapunov exponents are not required for these calculations, the sliding mode control method is very effective and convenient to achieve global chaos synchronization of the identical Coullet chaotic systems. Numerical simulations are shown to illustrate the effectiveness of the sliding mode control results derived in this paper for the identical Coullet chaotic systems.

This paper deploys active feedback control method for achieving generalized projective synchronization (GPS) of double-scroll chaotic systems,

viz.

identical Li systems (2009), and non-identical Lü-Chen system (2002) and Li system. The synchronization results (GPS) derived in this paper using active feedback control method have been established using Lyapunov stability theory. Since the Lyapunov exponents are not required for these calculations, the active feedback control method is very effective and suitable for achieving the general projective synchronization (GPS) of double-scroll chaotic systems. Numerical simulations are presented to demonstrate the effectiveness of the synchronization results derived in this paper.

Ad-hoc networks are the collection of autonomous nodes where all the nodes are configured dynamically without any centralized management system. Mobile Adhoc Networks (MANETs) are self-configuring network of mobile routers connected via a wireless link. However,the feature of decentralization and dynamic configuration of nodes makes MANETs vulnerable to various security attacks,that are otherwise not so common in a wired network. For mitigation of these attacks,several secured routing protocols are being proposed till now. This paper provides the view of overall security breaches present in the Ad-hoc Networks till now and will discuss in brief about the several proposed secure routing protocols.

This is a report about cooperation projects with the Common IT-department of the Hessian judicial authority (Gemeinsame IT-Stelle der hessischen Justiz, called GIT in the following) and other Hessian public institutions. In the context of modeling and software development using state-of-the-art schema management technologies, the area of protection and security in digital networks undergoes changes towards more responsibility in dealing with technology, organization and human users. From the perspective of language theory, the available commercial systems such as NetWeaver (SAP), WebSphere (IBM) or SharePoint Server (MS) can be seen as schema-management systems. From the point of view of programming and transaction technology it will be interpreted as servicebase-management systems. Concerning the current protection and security of GIT’s application systems two solutions will be presented here, parts of which have already been implemented. Thus, this paper focuses on the standardization of data elements and the standardization of functional elements, which ensure the domain-specific semantic integrity of data and functions in enterprises and administrations. At the end, we will discuss the change we are witnessing among IT experts as well as IT users globally due to language-based technologies such as Semantic Web, Wikis, Google, Facebook, etc., here shown using the example of the Hessian judicial authority. This change is reflected also in education, especially with respect to providing language-based modeling know-how for everybody.

In today’s environment, as the need for more bandwidth for intensive networking applications such as data browsing, video conferencing, etc increase, so also does the need for high bandwidth-transport network facilities. Optical WDM networks show great promise in handling such high data volume problems, and it is expected that they will form the backbone of the next generation of high volume light wave networks. Multihop networks show the most promise in that they offer the greatest flexibility of design. This paper describes an approach to modify the routing algorithm for finding out the alternate routes on the occurrence of single node fault in WDM optical network where GEMNET is used as a physical topology and also try to find out the link which carries the maximum number of light paths in the network for randomly generated source-destination pair.

Systems using Orthogonal Frequency Division Multiplexing (OFDM) suffer with carrier frequency offset (CFO), in phase and quadrature phase imbalance (I/Q) due to which there will be large performance degradation. The CFO, I/Q imbalance are caused due to mismatch of carrier frequency at the transmitter and local oscillator frequency at the receiver. This paper presents a novel approach for joint estimation of I/Q imbalance, CFO and Channel Estimation for Multiple-Input Multiple-Output (MIMO) OFDM systems. A new energy parameter called

φ

is introduced, and from this parameter

φ

we can jointly estimate CFO, I/Q imbalance irrespective of channel estimation. The proposed method uses an optimal training block with one or two training sequences. For estimation of two repeated sequences, a two-step approach is proposed. From the simulation results we show that the Mean-Square Error (MSE) of this method is close to Cramer-Rao Bound (CRB).

Wireless Sensor Networks are often deployed in unattended and hostile environments. These networks are susceptible to harsh physical conditions and attacks from adversaries. Sensor nodes have limited power, memory and computational ability and thus are vulnerable to capture. A few malicious adversaries can easily compromise sensor devices and inject false data to disrupt the integrity of the network. In this paper, we address this problem by proposing a three tiered architecture established upon a trust based framework which distinguishes illegal nodes from legal ones and filters out deceitful and forged data. Simulation results demonstrate that our trust based framework is an efficient approach to identify the trustworthiness of data.

MANET (Mobile Ad-hoc Network) is a structureless & dynamics network, which consist of mobile nodes without any physical link between them. MANET provides some basic functions like routing, communication, network management and packet forwarding etc over self organized network. Because MANET has not a fixed topology, in which mobile nodes comes and leaves the network within a random period of time. It effects energy, bandwidth and memory computations of network. Providing trust in MANET is such a crucial task because it doesn’t having centralized infrastructure. In this paper, we survey the different trust model schemes of MANET with their unique features, merits and demerits

.

Service discovery requests’ messages have a vital role in sharing and locating resources in many of service discovery protocols. Sending more messages than a link can handle may cause congestion and loss of messages which dramatically influences the performance of these protocols. Re-send the lost messages result in latency and inefficiency in performing the tasks which user(s) require from the connected nodes.

This issue become a serious problem in two cases: first, when the number of clients which performs a service discovery request is increasing, as this result in increasing in the number of sent discovery messages; second, when the network resources such as bandwidth capacity are consumed by other applications. These two cases lead to network congestion and loss of messages.

This paper propose an algorithm to improve the services discovery protocols performance by separating each consecutive burst of messages with a specific period of time which calculated regarding the available network resources. In addition, this paper explains the impact of increasing the number of clients and the consumed network resources on the proposed algorithm.

Several cluster analysis techniques have been developed till the present to group objects having similar property or similar characteristics and K-means clustering is one of the most popular statistical clustering techniques proposed by Macqueen [12] in 1967. But this algorithm is unable to handle the categorical data and unable to handle uncertainty as well. But after proposing the rough set theory by Pawlak [15], we have an alternative way of representing sets whose exact boundary cannot be described due to incomplete information. As rough set has been widely used for knowledge representation, hence it can also be applied in classification and very helpful in clustering too. In real life data mining applications we do not have the crisp boundaries for clusters. So, in 2007 and 2009 Parmar et al [14] and Tripathy et al [16] proposed two algorithms MMR and MMeR using rough set theory but these two algorithms have the stability problem due to multiple runs and higher time complexity. In this paper we are proposing a new approach of k-means algorithm using rough set which can handle heterogeneous data and uncertainty as well.

Many security schemes for mobile ad-hoc network(MANET) have been proposed so far but none of them has been successful in combating the different types of attacks that a mobile ad-hoc network often faces. This paper is providing one way of mitigating attacks in mobile ad-hoc networks by authenticating the node who tries to access this network .This scheme has been applied by using cellular automata (CA). Our simulation results show how cellular automata(CA) is implemented for user authentication and secure transmission in MANET.

Mobile computing is developing fast and one of its major services is location dependent information services (LDIS).The dependence of the results of a query on the present location of the mobile user leads to such services. The query is called Location Dependent Query and the resultant data is called Location Dependent Data (LDD).The caching scheme often used in these services is semantic caching where information about data is stored along with data in cache. In this paper, we have added a new dimension, segment frequency (S

F

) to the Semantic segment. The cache replacement policy takes this dimension into consideration when replacing the cache. The prediction algorithm Enhanced RBFNN (ERBFNN) takes the future location of neighbors into account. The existing FAR algorithm is modified taking into account the new dimension to replace items from cache. The proposed system is called Enhanced RBF-FAR (ERBF-FAR) algorithm. The experimental results show that the proposed system performs better and yields better results.

Maintaining connectivity among a group of autonomous agents exploring an area is very important, as it promotes cooperation between the agents and also helps message exchanges which are very critical for their mission. Creating an underlying Ad-hoc Mobile Router Network (AMRoNet) using simple robotic routers is an approach that facilitates communication between the agents without restricting their movements. We address the following question in our paper: How to create an AMRoNet with local information and with minimum number of routers? We propose an agent-assisted router deployment algorithm for creating AMRoNet which is a localized, distributed router placement algorithm. The algorithm has a greedy deployment strategy for releasing new routers effectively into the area and a triangular deployment strategy to connect different connected components created by the agents exploring from different base stations. Empirical analysis shows that the agent-assisted router deployment algorithm is one of the best localized approaches to create an AMRoNet.

Steganography hides the fact that a message is being sent. It provides security. In this world full of intruders, security of information is the most vital concern. In this paper, we present a Steganography algorithm. Our approach is based on hiding message in an image file by selecting pixels using some mathematical formulation and replacing the last few bits of the pixel. The bit selection is also not obvious; the selection is decided again by some calculation. In our algorithm we try to ensure that there is minimum amount of distortion from the original image. We also use a symmetric key to ensure security of the message. To the best of our knowledge this approach can be used to hide data in an image file with great security and with a very small chance of detection.

Wireless sensor networks (WSNs) consists of small nodes with constrained capabilities to sense, collect, and disseminate information in many types of applications. As sensor networks become wide-spread, security issues become a central concern. In this paper, we identify the Security requirements of key management in WSN. The secure management of the keys is one of the most critical elements when integrating cryptographic functions into a system. An outline of hybrid cryptography, one way hash and Key infection schemes are discussed in this paper. Along the way we analyze the advantages and disadvantages of current secure schemes. Finally, we aim to provide efficient key management operations for secure communications in WSN.

We present the design and development of a new multicast routing protocol, referred to as the Multicast Link Distance Ratio (MLDR) routing protocol, which yields stable trees with longer lifetime and without incurring any substantial increase in the number of edges and the hop count per source-receiver path. The proposed multicast protocol is based on the idea of assigning each link a weight, called the Link Distance Ratio (LDR), corresponding to the ratio of the actual physical Euclidean distance between the constituent nodes of the link to that of the maximum transmission range per node. The multicast tree construction procedure of MLDR focuses on discovering source-receiver paths that have the lowest sum of the LDR values of the constituent links. An aggregate of all such source-receiver paths yields the MLDR multicast tree. The lifetime of MLDR multicast trees is 25% - 63% longer than that of the well-known minimum hop based Multicast Ad hoc On demand Distance Vector (MAODV) routing protocol and at the same time the number of edges per tree and hop count per source-receiver path are slightly larger than that of MAODV, by factors of 11% and 8% respectively.

Mobile Ad hoc Networks (MANETS) are a group of large autonomous wireless nodes communicating on a peer-to-peer basis in a heterogeneous environment with no pre-defined infrastructure. The special characteristics of MANETS make them highly susceptible to security attacks than the wired networks. The paper presents a novel Security Solution Architecture (SSA) which is used to evaluate the newly proposed protocol, report on the behaviour of MANETS against attacks and then accomplished with the corrective measures to avoid malicious nodes in the routes. Our security solution architecture presented here mainly concentrates on security levels, security attacks and evaluation procedures for SSA.

Aircraft navigation relies mainly on Global Positioning System (GPS) to provide accurate position values consistently. However, GPS receivers may encounter frequent GPS outages within urban areas where satellite signals are blocked. To overcome this drawback generally GPS is integrated with inertial sensors mounted inside the vehicle to provide a reliable navigation solution. Inertial Navigation System (INS) and GPS are commonly integrated using a Kalman filter (KF) to provide a robust navigation solution, overcoming situations of GPS satellite signals blockage. This work presents New Position Update Architecture (NPUA) for GPS and INS data integration. The NPUA has an Artificial Neural Network (ANN) block that uses Associative memoy Neural Networks like Bidirectional Associative Memory Neural Network (BAM-NN) and Hetero Associative memory Neural Network (HAM-NN). The performances of GPS/INS data integration are computed by using HAM-NN and BAM-NN. The performances of both networks are analysed using real time data in terms of Mean Square Error (MSE), Performance Index (PI), Number of Epochs and Accuracy. It is found that HAM is better than BAM in terms of accuracy, MSE, and PI whereas BAM is better than HAM in terms of Number of epochs.

The emergence of wireless networking necessitates continuous time connectivity to support end-to-end TCP or UDP sessions. Wireless networking does not provide reliable connections to mobile users for real-time traffic such as voice over IP, audio streaming and video streaming. Handover latency in Mobile IPv6 poses many challenges to the research world in terms of disconnecting users while roaming. Many efforts have been made to reduce the handover latency with focus either on layer 2 or layer 3. This paper presents the handover procedure of Mobile IPv6 and investigates various factors affecting the delay during network switch over. In this paper, a testbed environment is presented that includes two different wireless LAN networks using Universal Mobile IP for Linux (UMIP) implementation and Cisco routers. The aim is to present handover latency caused by multiple signals at layer 2 and layer 3 and make recommendations on how to reduce the total handover latency experienced by the MIPv6 protocol.

Mobile computing is a revolutionary technology which enables us to access information, anytime and anywhere. Recently, there has been many research area found in mobile computing area. In this paper, we have discussed about different strategies that mobile computing has had in the area of data management. In wireless communication the data availability is the most important problem, so we have focused on the problem of data availability and discussed about replicating mobile databases.

Adhoc sensor network consists of dense wireless network having tiny, low-cost sensor nodes. Examples include military applications, and acquiring sensing information from inhospitable locations like thick forests, active volcano regions etc. Since the devices are scattered in a complex sensor network, It is very difficult to locate each node, know about its status and the topology of the wireless network. Hence the need of developing a system to visualise, control and monitor such networks arises. This paper presents implementation issues and author’s contribution to design and implement a generic framework of the ’Network Visualization tool’ to monitor adhoc wireless networks. The paper also elaborates system architecture, hardware and software organizations, and integration details of the proposed system with an exemplary wireless network based on standard IEEE 802.15.4 MAC protocol.

The adaptive algorithm has been widely used in the digital signal processing like channel estimation, channel equalization, echo cancellation, and so on. One of the most important adaptive algorithms is the LMS algorithm. We present in this paper an multiple objective optimization approach to fast blind channel equalization. By investigating first the performance (mean-square error) of the standard fractionally spaced CMA (constant modulus algorithm) equalizer in the presence of noise, we show that CMA local minima exist near the minimum mean-square error (MMSE) equalizers. Consequently, CMA may converge to a local minimum corresponding to a poorly designed MMSE receiver with considerablely large mean-square error. The step size in the LMS algorithm decides both the convergence speed and the residual error level, the highest speed of convergence and residual error level.

A Face recognition scheme using weighted angle based approach is proposed in this paper. In content based image retrieval, Face recognition system performs fast and accurate detection from database. Feature vector based on Eigen vectors of sub images is used for recognition. Image is partitioned into sub images. Sub parts are rearranged into rows and column matrices. Eigenvectors are computed for these matrices. Global feature vector is generated and weighted angle distance is used for face recognition. Experiments performed on benchmark face database (YALE) indicated that the proposed weighted angle based approach has better recognition performance in terms of average recognized rate and retrieval time compared to the existing methods.

Energy Efficient and reliable data dissemination in wireless sensor network is an important research issue since the network consists of low cost nodes with limited resources. Mobile agent-based data dissemination (MADD) approach that deploys multiple mobile agents for the data gathering task is a flexible, robust, and distributed solution to the data dissemination problem in wireless sensor networks. However the manners in which mobile agents follow the itineraries (order of visited sensor nodes) have an impact on the efficiency of the data gathering. In this paper, we propose a multiple mobile agents with dynamic itineraries based data dissemination (MMADIDD) protocol that not only adapts to unexpected node failures but also prolongs the network lifetime.

Mobile ad-hoc networks (MANETs) are a set of self organized wireless mobile nodes that works without any predefined infrastructure. For routing data in MANETs, the routing protocols relay on mobile wireless nodes. In general, any routing protocol performance suffers i) with resource constraints and ii) due to the mobility of the nodes. Due to existing routing challenges in MANETs clustering based protocols suffers frequently with cluster head failure problem, which degrades the cluster stability. This paper proposes, Enhanced CBRP, a schema to improve the cluster stability and in-turn improves the performance of traditional cluster based routing protocol (CBRP), by electing better cluster head using weighted clustering algorithm and considering some crucial routing challenges. Moreover, proposed protocol suggests a secondary cluster head for each cluster, to increase the stability of the cluster and implicitly the network infrastructure in case of sudden failure of cluster head.

The decision Mechanism is the concluding phase of any decision making process. This paper discusses on the different methodologies available for implementing the decision mechanisms. The paper preambles with a brief description on set of conventional Multi criteria Decision Mechanisms (MCDM) like Analytical Hierarchy Process (AHP), Simple Additive weighting Method (SAW) and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), Grey Rational Analysis (GRA) along with benefits and limitations of each technique. The different intelligent/soft computing techniques that are widely used in decision making processes like fuzzy logic, neural networks are discussed and finally confines the discussions to the different neural network (NN) based decision support systems. The paper proposes a fuzzy neural network based architecture for call admission control decision mechanism in a heterogeneous wireless network environment.

Applications of todays world require to have dynamic features like mobility support,In this paper we proposed and evaluated a comprehensive set of mechanisms essential to assure the support of mobility in WSNs,by providing energy efficiency mechanism for a node and a mechanism for soft handoff,based on link quality.

In wireless network, fault tolerant topology control is an important and a challenging task. The wireless nodes and links could experience frequent failures since Wireless networks are usually deployed under extreme environments. Therefore, fault tolerance must be considered for many applications. In wireless network Topology control has been proved effective in saving node power. The main idea of topology control is that instead of using its maximal transmission power, each node sets its power to a certain level such that the global topology satisfies a certain constraint. To increase fault tolerance, nodes in the network will consume more power. Here we need to give the optimum distance between the nodes of the wireless network in order to reduce the consumption of the power of each node.

This paper deals with the approach for the finding the minimum distance between the nodes of the wireless network by the use of mat lab coding through the graph theory considering the minimum weight based algorithm.

In the next generation of wireless networks, the entire network operating on different radio frequencies under wireless mode will be available for communication. The rapidly growing demand for “any service – anywhere - anytime” high-speed access to IP-based services is becoming one of the major challenges for mobile networks. However, in several situations, mobile terminals tend to associate with networks guaranteeing the best performances to stay “Always Best Connected” which leads to overload the most attractive technology while keeping the others technologies underutilized. As a recent research focus, load balancing is one of the key technologies in the convergence of heterogeneous wireless networks. Load balancing is a significant method to achieve the resource sharing over heterogeneous wireless networks, and it can improve resource utilization, enlarge system capacity, as well as provide better services for users. When dealing with high speed traffic over heterogeneous, we propose a load balancing algorithm using novel approach. For wireless packet network, this novel load metric is based on the packet scheduling and the radio link quality information. The solution can be used in on-line system because it requires less computation time and it operates in a distributed way instead of a usual centralized way. The two main targets of the proposed algorithm are the admission control and the network initiated handover. Further we have to investigate the joint load balancing and resource allocation optimization in heterogeneous networks.

Peer-to-Peer systems have emerged as popular way of sharing large volume of data. It is an application layer networks which enables network host to share resources in a distributed manner. The usability of these systems depends on effective search techniques to retrieve data. In this paper, an approach is made to list out some of the searching techniques that are applicable for the peer-to-peer network. However, most of the Peer-to-Peer information Systems is still unaware of some important features, such as cross-language information retrieval. Cross-language information retrieval is the state-of-art research area in the information retrieval research area.

A mobile ad hoc network (MANET) consists of a collection of wireless mobile nodes that forms a temporary network without having any fixed infrastructure or centralized administration. MANET is infrastructure-less, lack of centralized monitoring and dynamic changing network topology. MANET is highly vulnerable to attack due to open error prone shared wireless medium. In this paper, we proposed an algorithm for avoiding and preventing the wormhole attacks in MANET using statistical analysis approach. Simulation and results show that efficacy of proposed algorithm and the proposed heuristics provides better security and performance than conventional AODV in the presence of wormhole attack.

Advanced technology of Wireless Sensor Networks used in many applications like health, environment, battle field etc. The sensor nodes equipped with limited power sources. Therefore, efficiently utilizing sensor nodes energy can maintain a prolonged network lifetime

.

One of the major issues in sensor networks is developing an energy-efficient routing protocol to improve the lifetime of the networks. In this paper, we propose EEHCRP (Energy-Efficient Hierarchical Clustering Routing Protocol), a protocol for wireless sensor networks. Network partitioned into annular rings by using various power levels at base station and each ring having various sensor nodes. The mathematical formulae for choosing the cluster head are provided. The model developed is simulated in MATLAB. The results are obtained in terms of three metrics, lifetime of the network, and number of clusters and energy consumption of clusters heads. From the results of simulation, it is observed that the performance of EEHCRP is better in terms of energy consumption of CH, number of clusters and lifetime of network compared with LEACH.

The primary focus of research in computing systems has been on the improvement of the effective designon system performance. In order to fulfil this objective, the performance has been steadily growing driven by more efficient system design and algorithms. The performance of grid is improved in many aspect based on various research direction of last few year. In grid computing, load sharing is the major research issue. In addition to the load sharing, at present, the power management is attracting current researchers. This paper further explains basic power management scheme in the general computing as well as grid computing. And this paper strongly performed an analysis on various categories of real time grid systems. The power consumption on various grid levels based on multiple volumes in the organization level is analysed. The conclusion is focused the future requirement of research direction in the energy efficient system design of grid computing.

Efficient power utilization gains more importance for WSNs (Wireless sensor Network), since battery replacement is not possible in many sensor applications. Sensors consume energy when it changes from one radio state (transmission, reception, listen, sleep) to another. In this paper, a Cluster-based Power-Aware Scheduling (CPAS) algorithm is proposed to specifically design a low-data-rate WSNs to reduce the number of state transitions of a node, thereby efficiently maintaining the power level of the network. In CPAS, the nodes within the cluster are first synchronized to avoid collision during transmission. CPAS is based on IEEE 802.15.4 standard with dynamic routing ability based on the power level of the nodes. Performance evaluation is done by using simulation, and it has been showed that this cluster based algorithm considerably improves network lifetime when compared to non-cluster based network in WSN.

This paper describes the design and testing of Web based system for online overhead conductor sag measurement of 11V power distribution line using Global Positioning System (GPS). The paper shows testing results of GPS data transmission from mid span of overhead conductor to substation. Maximum utilization of a power line may be achieved using dynamic rating algorithm for which conductor sag measurement is important. Raw GPS measurements are not so accurate that these are usable for overhead conductor sag evaluation. Further signal processing techniques such as bad data identification/modification, LSPE method and wavelet analysis required to improve accuracy of GPS measurements are discussed in the paper.

In many applications large scale Wireless Sensor Networks (WSNs) use multiple sinks for fast data dissemination and energy efficiency. A WSN may be divided into a number of partitions and each partition may contain a sink, thereby reducing the distance between source nodes and sink node. This paper focuses on partitioning algorithms for WSN. Some existing graph partitioning algorithms are studied that can be applied for partitioning a WSN. A novel partitioning approach for WSN is proposed along with its modification. Simulation of the proposed algorithms has been carried out and their performances are compared with some existing algorithms. It is demonstrated that the proposed algorithms perform better than the existing algorithms.

A broad ranges of vital applications that acquire and process information from the corporeal world are in the extensive need of Wireless sensor networks. Similarly distributed resource sharing is also in the need of Cloud computing which serves as a standards-based approach. Extension of the Cloud computing paradigm to the sharing of sensor resources in wireless sensor networks results in a much promising technology called Sensor Clouds. The amount of data generated from these vast set of sensor applications is huge. These data if combined with various web-based virtual communities can prove to be beneficial in several significant areas like a virtual community of doctors monitoring patient healthcare for virus infection, portal for sharing real-time traffic information, real-time environmental data monitoring and analyzing, etc. To permit this study, all types of sensor data will require for an increasing capability to do analysis and mining on-the-fly. Since the applications provided by Cloud computing is plenty; it may be combined with Sensor network in the application areas such as environmental monitoring, weather forecasting, transportation business, healthcare, military application etc. The idea that WSNs deployed for various applications are brought under one roof and then seeing it as a distinct virtual WSN unit through cloud computing infrastructure is novel. Sharing and analysis of real time sensor data on-the-fly becomes easier when cloud is integrated with WSNs. Added to it is the benefit of providing sensor data or sensor event as a service over the internet. In this paper, we have addressed numerous issues and challenges in the design of Sensor Clouds and we propose a framework called sensor-cloud to enable this exploration by integrating sensor networks to the talented cloud computing.

In this paper, a Game Theoretic Model for selfish node avoidance routing is presented. A mathematical framework for rational node that maximizes its credits has been developed. Using game theory, it is verified that that this proposed model is robust and can achieve full cooperation among nodes. The proposed model is simulated using network simulator ns-2 The simulation results show that game theoretic model improves packet delivery ratio with the increase in number of the routes in the network. It is shown that game theoretic model with AODV can achieve higher packet delivery ratio for heavy traffic network in the presence of selfish nodes as compared to the original AODV. Further, it is observed that the packet delivery ratio of cooperative nodes decreases proportionally when the number of selfish nodes increases. Furthermore, it is also shown that game theoretic model with AODV gives low routing overheads.

Vehicular Ad-hoc Networks (VANETs) is attracting considerable attention from the research community and the automotive industry to improve the services of Intelligent Transportation System (ITS). As today’s transportation system faces serious challenges in terms of road safety, efficiency, and environmental friendliness, the idea of so called “ITS” has emerged. Due to the expensive cost of deployment and complexity of implementing such a system in real world, research in VANET relies on simulation. This paper attempts to evaluate the performance of VANET in a realistic environment. The paper contributes by generating a real world road Map of JNU using existing Google Earth and GIS tools. Traffic data from a limited region of road Map is collected to capture the realistic mobility. In this work, the entire region has been divided into various smaller routes. Vehicular Traffic Flow on these routes has been created using MOVE. The traffic flow generator model of MOVE generates traces of the traffic flow. These traces of different traffic scenario are subsequently used in NS-2 which facilitated the simulation of traffic flow of region under study. The realistic mobility model used here considers the driver’s route choice at the run time. Finally, the performance of the VANET is evaluated in terms of average delivery ratio, packet loss, and router drop as statistical measures. The maximum average delivery ratio for varying number of vehicles is observed to be very high as compare to the packet loss. Overall, this experiment has provided insight into the performance of real life vehicular traffic communication.

Mobile

ad hoc

networks (MANETs) are autonomous systems which are comprised of a number of mobile nodes that communicate between themselves by wireless communication in a peer-to-peer basis. They are self-organized, self-configured and self-controlled infrastructure-less networks. Nodes can communicate with each other without any pre-planned or a base station. Disseminating information securely between these nodes in such networks however is a challenging task, particularly when the information is confidential. Revealing such information to anyone else other than the intended nodes could be highly damaging, especially in military applications where keeping the message secret from adversaries is essential. In this paper we present our novel framework for privacy control in mobile

ad hoc

networks in which privacy policies are attached to messages as they are send between peers. We evaluate our framework using the Network Simulator (NS-2) to provide and check whether the privacy and confidentiality of the originator are met. For this we implemented the privacy enforcement as an NS2 agent that manages and enforces the policies attached to packets at every node in the MANET.

Association rule mining is an important data-mining technique that finds interesting association among a large set of data items. Since it may disclose patterns and various kinds of sensitive knowledge that are difficult to find otherwise, it may pose a threat to the privacy of discovered confidential information. Such information is to be protected against unauthorized access. Many strategies had been proposed to hide the information. Some use distributed databases over several sites, data perturbation, clustering, and data distortion techniques. Hiding sensitive rules problem, and still not sufficiently investigated, is the requirement to balance the confidentiality of the disclosed data with the legitimate needs of the user. The proposed approach uses the data distortion technique where the position of the sensitive items is altered but its support is never changed. The size of the database remains the same. It uses the idea of representative rules to prune the rules first and then hides the sensitive rules. Advantage of this approach is that it hides maximum number of rules however, the existing approaches fail to hide all the desired rules, which are supposed to be hidden in minimum number of passes. The paper also compares of the proposed approach with existing ones.

Our research entitled “Designing Dependable Agile Layered Security Architecture Solutions” addresses the innovative idea and novel implementations of Security Engineering for Software Engineering using Agile Modeled Layered Security Architectures for Dependable Privacy Requirements, with a validation of an exemplar case study of Web Services Security Architectures. Securing the Software Architecture in any application at design phase is known as Security Architectures, and we focus on authentication and authorization of the user. Now a day most of the applications are developed as a Layered Security Architecture Pattern, typically we have user presentation layer, Business Logic Layer and Database access layer. Now Agile modeling is used in all applications design (but Agile Modeled Architectures are given little importance) because of shortened developed time, with customer collaborations with developers and importantly with Test Driven Development approaches. Securing Agile Modeled architectures, which being an iterative development, will provide enhanced Dependable Security Requirements in terms of Privacy of user, in its successive iterations. All this research paves a way for Secure Web Engineering.

Public key cryptography is based on some mathematically hard problems, such as Integer Factorization and Discrete Logarithm problems. The RSA is based on Integer factorization problem. Number Field Sieve is one of the popular algorithms to solve these two problems. Block Lanczos algorithm is used in the linear algebra stage of Number Filed Sieve method for Integer Factorization. The algorithm solves the system of equations Bx=0 for finding null spaces in the matrix B. The major problems encountered in implementing Block Lanczos are storing the entire sieve matrix and solving the matrix efficiently in reduced time. Implementations of Block Lanczos algorithm have already been carried out using distributed systems. In the current study, the implementation of Block Lanczos Algorithm has been carried out on GPUs using CUDA C as programming language. The focus of the present work has been to design a model to make use of the high computing power of the GPUs. The input matrices are very large and highly sparse and so stored using coordinate format. The GPU on-chip memories have been used to reduce the computation time. The experimental results were obtained for the following problems; RSA100, RSA110, RSA120. From the results it can be concluded that a distributed model over GPUs can be used to reduce the iteration times for Block Lanczos.

Lattice reduction is a powerful concept for solving diverse problems involving point lattices. Lattice reduction has been successfully utilizing in Number Theory, Linear algebra and Cryptology. Not only the existence of lattice based cryptosystems of hard in nature, but also has vulnerabilities by lattice reduction techniques. In this survey paper, we are focusing on point lattices and then describing an introduction to the theoretical and practical aspects of lattice reduction. Finally, we describe the applications of lattice reduction in cryptanalysis like subset sum problem of low density, modular equations, Attacking RSA with small e by knowing parts of the message and Diophantine Approximation using LLL algorithm.

The National Knowledge Network is an important initiative of the Government of India approved in the year 2010. This network is expected to connect over 1500 institutions specializing in higher education, research and development, health care, agriculture and governance and provide multi-gigabit connectivity. It is expected to create a revolution by ushering in technological progress through the rapid spread of knowledge. We look at ways of securing this network. We also study various security challenges it is likely to face and suggest remedial measures.

Intrusion detection aims at distinguishing the behavior of the network. Due to rapid development of attack pattern, it is necessary to develop a system which can upgrade itself according to new attacks. Also detection rate should be high since attack rate on the network is very high. In response to this problem, Pattern Based Algorithm is proposed which has high detection rate and low false alarm rate. The work is divided into three parts: supervised approach, semi-supervised and unsupervised approach. Besides supervised learning approach, semi-supervised learning has attracted much attention in pattern recognition and machine learning for intrusion detection. Most of the semi supervised algorithms used for intrusion detection are binary classifiers, but our approach is to classify the data into multiclass. Our experimental results on KDD cup data set shows that the performance of the proposed method is more effective.

We propose the design of a Session Transfer Protocol (STP) that allows a client to download a large file replicated across several servers. STP runs at the session layer, on the top of the standard Transmission Control Protocol (TCP). A client can sequentially download the entire file from one or more servers, from one server at a time, with just one TCP session. A STP Server, currently sending the contents of a file to a client, can proactively detect congestion in the network and transfer a file download session to another peer STP Server that is located in a different network. At any stage (initial session establishment or session transfer), the STP Client chooses a particular server by executing certain selection tests among the servers in the list sent by the STP Gateway, which is the public face of the cluster of STP Servers in the Internet. Unlike the traditional File Transfer Protocol (FTP) that requires users to repeatedly initiate the entire download process upon the failure of each FTP connection, STP is seamless, incremental and provides improved Quality of Service while downloading a large file. The user working at the STP Client is unaware of the congestion and resulting session transfer to a different STP Server. STP is security-aware and has appropriate encryption, authentication and anti-spoofing features incorporated at different stages of its execution.

Spammers are constantly evolving new spam technologies, the latest of which is image spam. Till now research in spam image identification has been addressed by considering properties like colour, size, compressibility, entropy, content etc. However, we feel the methods of identification so evolved have certain limitations due to embedded obfuscation like complex backgrounds, compression artifacts and wide variety of fonts and formats .To overcome these limitations, we have proposed a 4-stage methodology which uses the information of low level features and content of the spam images. The method works on images with and without noise separately. Also colour properties of the images are altered so that OCR (Optical Character Recognition) can easily read the text embedded in the image. The proposed method is tested on a dataset of 1984 spam images and is found to be effective in identifying all types of spam images having (1) only text, (2) only images or (3) both text and images. The encouraging experimental results show that the technique achieves an accuracy of 92%.

Network Services universally rely upon Authentication and Authorization mechanisms to ensure secure and personalized service provision. Protocols, such as Diameter provides a reliable framework for efficient access control to network services utilized by network devices. This framework can also encompass application level services e.g. web applications accessed via web browsers [1]. On the other hand, the prevalence of Internet based services and applications have brought about the burden of identity management among distributed security domains, an issue not specifically addressed by protocols such as Diameter. Efforts such as OpenID alleviate this difficulty by proposing an application level framework based on open standards to realize single sign on/off [2] semantics with regard to application level services. However, these technologies do not build upon existing security infrastructure, require significant investment in terms of technology adoption and have yet to receive industry wide acceptance and support. This paper presents Diameter Single Sign On – a framework that provides single sign on/off semantics in the context of network and application level services by harnessing the strengths of existing and proven authentication and authorization infrastructure. Because of combination of the Diameter protocol with Single Sign On and OpenID the proposed architecture overcomes the problem of identity management and also builds on existing security infrastructure.

Intrusion Detection System (IDS) can handle intrusions in computer environments by triggering alerts to help the analysts for taking actions to stop the possible attack or intrusion. But, the IDS make the job of analyst more difficult by triggering thousands of alerts for any suspicious activity. In this paper, an anomaly based network intrusion detection system using a genetic algorithm approach is adopted. The proposed method is efficient with respect to good detection rate with low false positives. The experimental results demonstrate the lower execution time of the proposed algorithm

GANIDS

(Genetic Algorithms based Network Intrusion Detection System) when compared with PAYL [1]. The proposed payload based IDS uses an adaptive genetic algorithm for both learning and detection. The proposed

GANIDS

is benchmarked with PAYL [1] using the 1999 DARPA IDS dataset.

In this paper a new Symmetric Key Cryptosystem, based on Feistel Networks has been proposed. The Cryptosystem demonstrates a few effective features like variable size key, variable size plain text encryption depending on data and key, padding by random variables etc. The cryptosystem is designed to be efficient on processors using simple operations.

With explosive growth of plant species, it is becoming difficult for the botanists to manage the details of leaf. Moreover, extracting the specific leaf from the huge collection is a big job. Hence, an effort is done so as to help the botanists identify the specific leaf. The basic approach for leaf identification is based on textual information. But the effort involved in manual annotation is comparatively tedious and moreover it is impossible to represent the vast features of the image in limited keywords. Fundamentally, the identification of a plant is based on leaf. We present a summary of different boundary based methods for image retrieval of leaf. The methods have been explored for maple leaf and advantages and disadvantages have been highlighted.

In this work, we have proposed modified chain code histogram (CCH) based feature extraction method for handwritten character recognition (HCR) applications. This modified approach explores the dynamic nature of directional information, available in character patterns, by introducing the Differential CCH which is termed as Delta (Δ) CCH. A comparable and higher recognition rate is reported which emphasizes that the dynamic nature of directional information captured by the ΔCCH is as important as that of CCH. All the experiments are conducted on MNIST handwritten numeral database. Finally, an improved recognition rate is observed at higher end by using combination of both the features which shows the effectiveness of dynamic directional feature in the classification of handwritten character patterns.

The Edge Detection is used in wide range of applications in image processing such as object detection, recognition, automated inspection of machine assemblies, diagnosis in medical imaging and topographical recognition. An efficient algorithm for extracting the edge features of images using simplified version of Gabor Wavelet is proposed in this paper. Conventional Gabor Wavelet is widely used for edge detection applications. Due do the high computational complexity of conventional Gabor Wavelet, this may not be used for real time application. Simplified Gabor wavelet based approach is highly effective at detecting both the location and orientation of edges. In this approach, Simplified Gabor Wavelet features are employed for two different scales and four different orientations. The results proved that the performance of proposed Simplified version of Gabor wavelet is superior to conventional Gabor Wavelet and other edge detection algorithm. And also the required run time for proposed work is faster than all other edge detection methods.

In this paper, we present design and FPGA implementation of a low power fractional bit encoded (FBE)–spatial modulation (SM) based transmitter for the multiple-input multiple output (MIMO) systems. This Modulation scheme includes the data dependency check before the spatial multiplexing. The proposed data dependency check allows efficient selection of antennas for parallel transmission of data. The Fractional bit encoding is modulus conversion scheme which convert the incoming bit stream to numbers in an arithmetic base, or modulus, that is not a power of 2 .When applied to SM, FBE results in a more versatile system design allowing transmitter to be equipped with an arbitrary number of antennas for a wider range of spectral efficiencies given restrictions on space and power consumption. The synthesis results of the implementation of transmitter on FPGA are included in the paper.