In the paper is described the simulating process for the situations analysis and the decisions making about the functioning of the Distributed Computer Systems (DCS) nodes on the basis of special stochastic RA-networks mechanism. There are presented the main problems in the estimations of the DCS nodes functioning parameters and there are shown that the suggested RA-networks mechanism allows simulate the data flow with the different, including the significantly different intensities, what is particularly important in for the situations analysis and the decisions making in the DCS nodes parameters dynamics control.

In wireless networks two types of losses namely congestion loss and transmission loss are significant. One of the important transmission losses is jitter. Variation in inter-arrival time is called jitter. When jitter value is greater than half of the average round trip time cause timeout loss and sender window size falls to one packet resulting reduction in throughput and degradation in the quality of service (QoS). In this paper, we are discussing a new model for transmission control protocol (TCP) which is capable of changing its window size based on the feedback. In the new model TCP is added with intelligence so that it can distinguish the type of losses. If the loss is due to congestion, congestion control algorithm is invoked and loss is due to jitter immediate-recovery algorithm is invoked to recover from the throughput loss. The technique also provides an end-to-end congestion control. The performance of TCP is further enhanced by discussing stability. Time-delay control theory is applied for the analysis of asymptotic stability. The stability boundaries of random early detection (RED) control parameter Pmax and jitter control parameter β are derived. Using the characteristic equation of Hermite matrix an approximate solution of q(t) (queue length) which converges to a given target value is derived. The results are analyzed based on graphs and statistical data using Matlab R2009b.

For decades, the structure of existing power grids has not changed. It is an old structure that depends heavily on fossil fuel as an energy source, and in the future, this is likely to be critical in the field of energy. To solve these problems and to make optimal use of energy resources, a new concept is proposed, called Smart Grid. Smart Grid is an electric power distribution automation system, which can provide a two-way flow of electricity and information between power plants and consumers. The Smart Grid communications infrastructure consists of different network components, such as Home Area Network (HAN), Neighborhood Area Network (NAN) and Wide Area Network (WAN). Achieving the required level of reliability in the transmission of information to all sections, including the HAN, is one of the main objectives in the design and implementation of Smart Grid. This study offers a routing protocol by considering the parameters and constraints of HAN, which, by improving AODV routing protocol, achieves the level of required reliability for data transmission in this network. These improvements include: making table-driven AODV routing protocol, extending the routing protocol to compute multiple paths in a route discovery, simplification and providing the effect of HAN parameters. The results of the NS2 simulation indicate that applying this improved routing protocol in the HAN, satisfies the required level of reliability of the network, which is over 98%.

The present work considers energy aware distributed clustering protocol (EADC) which is commonly employed for balancing the energy consumption in non-uniformly deployed sensor networks. In the EADC, residual energy is considered as the primary clustering parameter and the clusters are constructed using uniform competition radius. However in non-uniform node distribution scenarios, more energy imbalance occurs in the network due to variation in intra-cluster energy consumption. For counter balancing it, an inter-cluster energy-efficient multi-hop routing protocol is utilized. In the EADC protocol, cluster heads select the relay node based on residual energy and cluster member count information. But this approach is less efficient in energy balancing. In this paper, an improved energy aware distributed equal clustering protocol is projected. Our scheme considers the relay metric directly in terms of energy expense in relaying the sensed data to the base station taking into account not only the residual energy and member count information but also distance information. It provides better balancing of energy in comparison with the existing approach. Three different scenarios created by varying node distribution are used for evaluating the performance of the proposed protocol and comparison is made with the EADC protocol. The results show that the proposed scheme extends network lifetime in all the scenarios.

Increased demand of Wireless Sensor Networks (WSN) in various applications has made it a hot research area. Several challenges imposed which include energy conservation, scalability, limited network resources etc. with energy conservation being the most important. Clustering improves the energy efficiency by making high power nodes as cluster heads (CHs) which reduces the chance of energy depletion of nodes. Scalability, fault tolerance, data aggregation, energy efficiency are some of the main objectives of clustering. This paper discusses various challenges associated with clustering and different methods or techniques developed to overcome these challenges. Various clustering approaches have been summarized and few prominent Quality of service (QoS) based clustering routing protocols for WSN have been identified. Comparison of these approaches and protocols is discussed based on some parameters.

At this fastest growing of information age, there is a rapid change of business, resources and technology, mean while increasing the requirement of electronic commerce for the sophisticated societies in around the globe. During this process increasing the uncertainty, un order, un safe and un setup due to un authorize users, hackers is a great issue for down time of communication system. Our objective to determine and resolve these uncertainty problems to develop this proposed combinatory ACM to optimize the accessibilities of resources and maximize quality of services for all the time and every time to co-op with pervasive, ubiquitous & autonomy system. The relation, function, operation, maintaince and services are the vital role for all aspect of multiples societies, business and technologies in around the cloud. Meanwhile, it will be more accountable for performance, fault tolerance, throughput, benchmarking on any computational services for all the time. We have to make more simplification, unification and step by step normalization by applying permutation & combinations on UFS ACM mechanism on distributed object oriented system on multi-dimensional work culture. This access control mechanism is preventing, detecting, correcting, verification and validation of the UFS ACM in background process of RTOS.

This paper endeavors to present a novel framework for the generic structure of a verifier-based password authenticated Three-Party Encrypted Key Exchange (3P-EKE) protocol which yields more efficient protocol than the ones knew before. A previous framework presented by Archana and Premchand is more secured against all types of attacks like password guessing, replay, pre-play, man-in-the-middle attack etc. But unfortunately, this protocol does not solve the problem of a server compromise. These proofs help as inspiration to search for another framework. The framework we offer produces more efficient 3P-EKE protocol, and, in addition, delivers perceptive clarification about the existing attacks that do not solve in the previous framework. Moreover, it allows direct change from a class of verge private-key encryption to a hybrid (symmetric & Asymmetric) one without significant overhead.

The In today’s era with increase in the use of internet and networking devices, there is an increase in demand for more secure data communication. This problem has led to development of hybrid security mechanisms. Various techniques are available in literature that makes use of different steganography and cryptographic mechanisms which has certain pros and cons. In this paper, we propose a new hybrid security mechanism that tries to choose the best cryptographic and steganography mechanism. In addition, to increase the embedding capacity of the proposed mechanism, Huffman encoding scheme is used. The proposed strategy is implemented in MATLAB-09. In order to check the efficacy of the proposed technique three types of analysis were performed named as: security, robustness and efficiency analysis. It is found from the simulation and results that the proposed scheme outperforms other techniques in literature in every aspect.