Routing in ad hoc mobile networks is a problem which has not yet been satisfactorily solved. Traditional routing techniques are not well adapted to new networks. Indeed, their lack of reactivity with respect to the traffic and network changes means traditional routing techniques cannot easily be used except at the price of over-dimensioning of the network resources (network bandwidth, node memory utilization, node CPU load, etc.). In recent years the research community has been interested in the improvement of ad hoc routing, and among the solutions suggested multipath routing has been considered. Multiple paths are exploited in order to ensure reliability and a quick reaction to changes in topology with a low overhead generated by the control messages. In this article we present an extension of the well-known routing protocol AODVM (Ad hoc On-demand Distance Vector Multipath). We propose to improve the multipath routing strategy with a path classification to allow the paths with the best energy level to be chosen.

In this modern era of computing, information technology revolution has brought drastic changes in the way data are collected for knowledge mining. The data thus collected are of value when it provides relevant knowledge pertaining to the interest of an organization. Therefore, the real challenge lies in converting high dimensional data into knowledge and to use it for the development of the organization. The data that is collected are generally released on internet for research purposes after hiding sensitive information in it and therefore, privacy preservation becomes the key factor for any organization to safeguard the internal data and also the sensitive information. Much research has been carried out in this regard and one of the earliest is the removal of identifiers. However, the chances of re-identification are very high. Techniques like k-anonymity and l-diversity helps in making the records unidentifiable in their own way, but, these techniques are not fully shielded against attacks. In order to overcome the drawbacks of these techniques, we have proposed improved versions of anonymization algorithms. The result analysis show that the proposed algorithms are better when compared to existing algorithms.

Wireless sensor networks, which have been used in many applications in recent years, consist of tiny sensor nodes with restriction in processing ability and the battery unit. Because of that, one of the crucial problems in this field is power consumption and network lifetime. Geographic Adaptive Fidelity is a routing protocol which tries to reduce energy consumption by powering off unnecessary nodes. In this paper, we proposed a new backbone algorithm for this protocol to saving more energy which causes to improving the lifetime and performance of the networks. The results of simulation show that active grids will be halved approximately.

Chaotic system based message encryption system for wired and wireless networks broadly used in computer engineering, communication and network security, such as robotic systems, encryption, synchronization and genetic network. The main motive for developing the chaos based cryptosystem is to attain encryption with several compensation over the conventional encryption algorithms such as high security, speed, complexity, cost and quality assurance. These challenges encourage the researchers to develop novel chaos based data encryption techniques with digital logics dealing with encryption of messages for fast and secure communication networks. This effort provides a modified version of traditional data encryption algorithms to provide good quality and performance in a secure communication network environment. A cryptology technique is widely used in network security during communication. An avalanche effect is the attractive property of cryptography in which two different keys produce different cipher text for the same data information and also some Important properties related to chaotic systems are sensitivity to initial condition and nonlinearity, which makes two similar or slightly different keys to generate completely different cipher text to produce confusion. It has been proposed a novel fast & secure encryption Technique which uses the chaotic map function to generate the different multiple keys and shows that negligible difference in parameters of chaotic function generate completely different keys as well as cipher text. Cryptanalysis of the proposed algorithm shows the strength and security of algorithm and keys.

Hardware based ciphers are most suitable for resource constrained environments to provide information security and confidentiality. Grain is one such hardware based synchronous stream cipher. The motive of this study is to present a comprehensive survey and review of Grain family of stream ciphers that is one of the portfolio candidates in the hardware based category of eSTREAM. Security features and different attacks on these ciphers have been studied in this paper to analyze the strengths and weaknesses of these designs.

There is suggested a method for the trust level establishment to the nodes of distributed computer systems (DCS) taken into account the dynamics of the information value changing and with the in-time records of the security incidents from the nodes. The proposed method of the DCS nodes rating establishment allows adaptively and during the DCS functioning to determine a safety configuration of resources (nodes) for the information processing in the DCS. Also, there is described the specifics of the implementation of the mechanisms for the nodes trust level establishment.

Global software development (GSD) is one of modern trends in software engineering. The last years has witnessed a significant increase in the adoption of Agile in GSD .This paper considers the issue by examining whether Scrum practices used in mitigation of temporal distance-based GSD coordination challenges. We were used Cisco TelePresence tool in Synchronization communication for simulation of face to face meetings. We were designed a simple algorithm to help project managers in determining the appropriate strategies. This algorithm is based on the temporal difference between the sites. This is may be great or simple. Through temporal difference, we calculated number of working hours overlapping. Which are classified in the three cases and each case has number of strategies are sufficient to overcome this challenges.

Bandwidth Scarcity is a major drawback in multi-hop ad hoc networks. When a single-interface single-channel (SISC) approach is used for both incoming and outgoing traffic the bandwidth contention between nodes along the path has occurred as well as throughput is degraded. This drawback is overwhelmed by using MIMC approach as well as some of the Quality of Service (QoS) requirements has been enhanced. In this paper we applied multi-interface muti-channel approach to AODV routing protocol, called AODV-MIMC routing protocol and its performance is compared with AODV routing protocol. The simulation results show the Network Life Time, Throughput, and Packet Delivery Ratio of AODV-MIMC routing protocol has been tremendously improved than the AODV routing protocol.