Parallel and Distributed Computing: Applications and Technologies 

Abstract: A wireless network consisting of a large number of small sensors with limited battery power can be an effective tool for gathering data in a variety of environments. Clustering sensors into groups, so that sensors communicate information only to cluster-heads and then the cluster-heads communicate the aggregated information to the base station, may save energy. In this paper, we propose an optimal energyadaptive clustering algorithm which is motivated from the LEACH protocol presented in [4]. We optimize LEACH’s random cluster-head selection algorithm to ensure the balanced energy depletion over the whole network thus prolongs the network lifetime. Simulation results show that our algorithm outperforms LEACH by about 20% to 35% when 1%, 50%, 100% of nodes die for different network sizes and topologies.

Abstract: A honeypot is a supplemented active defense system for network security. It traps attacks, records intrusion information about tools and activities of the hacking process, and prevents attacks outbound the compromised system. Integrated with other security solutions, a honeypot can solve many traditional dilemmas. We expatiate key components of data capture and data control in a honeypot, and give a classification for honeypots according to security goals and application goals. We review the technical progress and security contribution of production honeypots and research honeypots. We present typical honeypot solutions and predict the technical trends of integration, virtualization and distribution for future honeypots.

Abstract: In this paper, a tool named CheCUDA is designed to checkpoint CUDA applications that use GPUs as accelerators. As existing checkpoint/restart implementations do not support checkpointing the GPU status, CheCUDA hooks a part of basic CUDA driver API calls in order to record the status changes on the main memory. At checkpointing, CheCUDA stores the status changes in a file after copying all necessary data in the video memory to the main memory and then disabling the CUDA runtime. At restarting, CheCUDA reads the file, re-initializes the CUDA runtime, and recovers the resources on GPUs so as to restart from the stored status. This paper demonstrates that a prototype implementation of CheCUDA can correctly checkpoint and restart a CUDA application written with basic APIs. This also indicates that CheCUDA can migrate a process from one PC to another even if the process uses a GPU. Accordingly, CheCUDA is useful not only to enhance the dependability of CUDA applications but also to enable dynamic task scheduling of CUDA applications required especially on heterogeneous GPU cluster systems. This paper also shows the timing overhead for checkpointing.

Abstract: This paper focuses on performance investigation of reactive and proactive MANET routing protocols, namely AODV, DSR, TORA and OLSR. MANET is a type of Ad Hoc network, and here its functionality is based on 802.11 IEEE standards to communicate in a discrete and disperse environment with no central management [21]. Hence, the main investigation done in this paper is of the discrete feature and routing in MANET. The main issue of MANET is the breakage of link at certain moment and re-generation of link at certain state as it consists of routers which are mobile in nature i. e. are independent to roam in an arbitrary motion. Therefore, this paper presents a performance comparison of the selected MANET routing protocols in a varying network sizes with increasing area and nodes size to investigate mobility and scalability of the routing process.