In order to minimize the energy consumption involved by communications in wireless sensor networks, the use of clustering has proven to be effective. The problem remains to determine the number of cluster-heads, and their distribution in the network to ensure minimal energy consumption and better coverage networks. Unlike Low-Energy Adaptive Clustering Hierarchy algorithm which fixes in advance the number of cluster-heads, and do not guarantee the coverage of the entire network, in this paper, we proposed a genetic centralized dynamic algorithm (GA)-based clustering approach to optimize the clustering configuration (the number of cluster-heads, their distribution and the cluster-members) to limit node energy consumption and the best coverage. The obtained simulation results show that the proposed technique overcomes the Low-Energy Adaptive Clustering Hierarchy algorithm.

With all the brisk growth of web, distributed denial of service attacks are becoming the most serious issues in a data center scenarios where lot many servers are deployed. A Distributed Denial of Service attack gen-erates substantial packets by a large number of agents and can easily tire out the processing and communication resources of a victim within very less period of time. Defending DDoS problem involved several steps from detection, characterization and traceback in order todomitigation. The contribution of this research paper is a lot more. Firstly, flooding based DDoS problems is detected using obtained packets based entropy approach in a data center scenario. Secondly entropy based traceback method is applied to find the edge routers from where the whole attack traffic is entering into the ISP domain of the data center. Various simulation scenarios using NS2 are depicted in order to validate the proposed method using GT-ITM primarily based topology generators. Information theory based metrics like entropy; average entropy and differential entropy are used for this purpose.

Mobile ad-hoc networks are autonomous networks of intelligent mobile nodes. Designing an efficient routing protocol with goal efficient route establishment is still a burning research issue. Routing protocols are broadly classified into proactive and reactive protocols on the basis of their nature of working. In this paper, we present comparative simulation analysis of two proactive protocols namely, Optimized Link State Routing (OLSR) and Destination-Sequenced Distance Vector (DSDV). Simulations have been carried out multiple times using Network Simulator-2.35 (NS-2.35), on random scenario patterns and compared in two environments (OLSR and DSDV) by varying the network size and mobility of nodes. We have patched and installed OLSR protocol on NS-2.35 as it’s not available as a part of NS-2.35 installation. The simulation results indicate that, OLSR perform better than DSDV protocol for application oriented metrices such as packet delivery fraction, packet loss and end-to-end delay. But, Routing Overheads is significantly consistently higher for OLSR protocol in all the cases considered, which is proven experimentally. Furthermore, based upon the simulation results, work can be done in the direction of improving the performance of the OLSR protocol to make it a choice of proactive protocol for large and denser network.

In recent years, the advent of online data storage services has been enabled users to save their data and operational programs in cloud databases. Using an efficient and intelligent management helps to optimize quality of provided services. Also it is possible to increase throughput of services by eliminating repeated data. In following article we have offered a completely dynamic approach to detect and eliminate duplicated data which exist in shared storage resources among virtual machines. Results of simulation show that proposed approach, compared to the similar approaches, will save the storage space substantially by reducing usage of CPU, RAM, also will increase rate of de-duplication data up to 23 %.

With the advent of real applications in fields like defense and domestic fields, MANET is becoming more popular. MANET does not require any infrastructure, moreover it can behave as mobile networks. These features have boosted up the popularity of MANET in the community. As more and more fields get dependent on MANET, the system needs to be more robust and less expensive. For example, in defense field security is the major issue, while in the domestic field maintaining the QoS is the major issue. To commercialize MANET the routing protocols need to be lightweight, secure and the hardware on which it is to be implemented should be low cost at the same time. We propose a lightweight, secure and efficient routing model for MANETs; which uses fidelity to allocate trust to a neighbor, thereby taking the decision whether to send data via that secure neighbor or not. It also uses new packets like report and recommendation that help the protocol to detect and eliminate the malicious nodes from the network. To observe the results we implement this protocol in hardware, on the Arduino platform in ZigBee network. We observe that our protocol exhibits high packet delivery fraction, low normalize routing load and low end to end delay, compared to existing secure routing protocols. Thereby, maintaining a constant tradeoff between the QoS and the security of the network.

Group key management is an integral part of secure multicast. Minimizing the number of rekeying messages, maintaining the forward and backward secrecy has always been a challenging task. Though there are many solutions which reduce the rekeying messages from Ο(n) to Ο(log_2?〖n),〗 they increase with the increase in group size. In this paper, we present a centralized key table based communication efficient group key management protocol in which number of rekeying messages is independent of the group size. In this protocol key management server (KMS) divides a group of n members into n subgroups of size n-1 and maintains a table of n subkeys along with member ID and one group key. Each member has n-1 subkeys, which is a subset of n subkeys of KMS and one group key. The proposed protocol requires only one multicast rekeying message per joining of a new member as well as per eviction of any existing member. As the number of rekeying messages is not dependent on group size, it requires less computation.

Intrusion detection system is the most important part of the network security system because the volume of unauthorized access to the network resources and services increase day by day. In this paper a genetic algorithm based intrusion detection system is proposed to solve the problem of the small disjunct in the decision tree. In this paper genetic algorithm is used to improve the coverage of those rules which are cope with the problem of the small disjunct. The proposed system consists of two modules rule generation phase, and the second module is rule optimization module. We tested the effectiveness of the system with the help of the KDD CUP dataset and the result is compared with the REP Tree, Random Tree, Random Forest, Na?ve Bayes, and the DTLW IDS (decision tree based light weight intrusion detection system). The result shows that the proposed system provide the best result in comparison to the above mentioned classifiers.

The computer networks have made possible to access data remotely and they have made possible to login into a system located at far distance; it may be in a different city or in a different country other than the user’s native place. The main issue in such an environment is related to the authenticity of the user’s identity by the system. This requires to have some mechanism to authenticate a remote user for his legitimacy. In this paper, we propose a method, which is based on a 3-D Geometric approach, to authenticate the login request sent by a user, who is located at far distance. In this method, we provide two-way mutual authentication in which a legitimate user is authenticated by the server and the server is authenticated by the user. This method first performs initialization in which the required parameters are set to create an environment with the central authority. It then allows a user to register with the system/server. Once a user is registered, he is allowed to login to the system for accessing the required information. Our scheme provides a facility to a legitimate user for changing his password of his choice. This scheme withstands with several attacks without requiring much computational overhead.