The network lifetime always a critical issue in sensor networks because the sensor nodes are characterized by restricted and non-replaceable energy supply. Thus maximizing lifetime of network by minimizing energy cons...
详细信息
The network lifetime always a critical issue in sensor networks because the sensor nodes are characterized by restricted and non-replaceable energy supply. Thus maximizing lifetime of network by minimizing energy consumption poses a challenge in design of protocols. Therefore, proper organization of clustering and orientation of nodes within the cluster becomes one of the important issue to extend the lifetime of the whole sensor network through cluster head. We investigate the problem of energy consumption in ClusterHead (CH) rotation (i.e. re- clustering) in wireless sensor networks. The selection criteria of the CH are based on the residual energy of nodes within the clusters and minimum average distance from the Base Station. The total energy in delivering a packet from the sensor node to other nodes has been mathematically derived. Moreover, the expected number of packet retransmissions and the effect of it on the network is also discussed in our proposed energy model. In this paper we applied the approach for producing energy-aware unequal clusters with optimal selection of cluster head and discussed several aspects of the network mathematically and statistically. This work presents an analysis of its design and implementation aspects. The simulation results demonstrate that our approach of re-clustering in terms of energy consumption and lifetime parameters.
Virtualization enables data centers to share physical resources between virtual private servers (VPS) cost-effectively. Live migration of virtual machines (VM) is one of the most important capabilities that have been ...
详细信息
Virtualization enables data centers to share physical resources between virtual private servers (VPS) cost-effectively. Live migration of virtual machines (VM) is one of the most important capabilities that have been provided by the virtualization. It enables the data center's administrators to apply the load balancing properly. Sending large number of VM's memory pages wastes the data center's bandwidth. It also decreases the quality of service during live migration. By reducing the number of sent pages, live migration time is reduced. Using an effective approach for sending VM's pages leads to shorter downtime and migration time compared to pre-copy. This paper proposes an algorithm for tracking updated memory pages and making decision for transferring dirty pages during each iterated migration phase. In this paper, the concept of reuse distance is adopted to reduce the transferring number of dirtied pages. According to the experimental results, when the system is under heavy workload or running applications inside the VM are write-intensive; the reuse-distance approach has better performance than traditional pre-copy in terms of the number of transferred pages, total migration time and downtime. Experiments show that with increasing workload, reduction in the number of sent pages reaches 68% without increasing systems' overhead during live migration.
A wireless sensor network (WSN) has to maintain a desirable sensing area of coverage and periodically report sensed data to the administrative center (i.e., base station, router etc.). Then the coverage area of the mo...
详细信息
A wireless sensor network (WSN) has to maintain a desirable sensing area of coverage and periodically report sensed data to the administrative center (i.e., base station, router etc.). Then the coverage area of the movement of sensors and lifetime are two important problems in a WSN due to constraint of limited battery energy. Sensors are usually deployed randomly in coverage area of interest and therefore the sensor tracking become one of the biggest challenge in Wireless Sensor Networks (WSNs). Many works done to track the sensor nodes in WSNs and all previous theoretical analyses on the coverage area and lifetime are primarily focused on the random uniform distribution of sensors. Here is depicting a real analysis in WSNs, In this paper, we try to find out the coverage area of sensors and best of our knowledge we first provide a mathematical and analytical framework for the coverage area of the deployment sensor nodes in a WSN that follows a multivariable normal distribution or Gaussian distribution. The multivariate normal distribution is often used to describe correlated real-valued random variables each of which clusters around a mean value which gives the monitored region. We determine the randomly deployed sensor nodes, follows an Elliptic area in wireless sensor network.
cloudcomputing environment for the efficient resources allocation is an important issue in the field of cloudcomputing. The resources in cloudcomputing application platform are distributed widely and with great div...
详细信息
cloudcomputing environment for the efficient resources allocation is an important issue in the field of cloudcomputing. The resources in cloudcomputing application platform are distributed widely and with great diversity. User demands of real-time dynamic change are very difficult to predict accurately. The heuristic ant colony algorithm could be used to solve this kind of problems, but the algorithm has slow convergence speed and parameter selection problems. Aiming at this problem, this paper proposes an optimized ant colony algorithm based on particle swarm to solve cloudcomputing environment resources allocation problem.
Intrusion detection system(IDS) is an important component to maintain network ***,as the cloud platform is quickly evolving and becoming more popular in our everyday life,it is useful and necessary to build an effecti...
详细信息
Intrusion detection system(IDS) is an important component to maintain network ***,as the cloud platform is quickly evolving and becoming more popular in our everyday life,it is useful and necessary to build an effective IDS for the ***,existing intrusion detection techniques will be likely to face challenges when deployed on the cloud *** pre-determined IDS architecture may lead to overloading of a part of the cloud due to the extra detection *** paper proposes a neural network based IDS which is a distributed system with an adaptive architecture so as to make full use of the available resources without overloading any single machine in the ***,with the machine learning ability from the neural network,the proposed IDS can detect new types of attacks with fairly accurate *** of the proposed IDS with the KDD dataset on a physical cloud testbed shows that it is a promising approach to detecting attacks in the cloud infrastructure.
Vehicular Ad Hoc Network (VANET) is an emerging area of research nowadays for its high mobility and frequent topology change. Inter-vehicular communication is essential in the real time environment for full road safet...
详细信息
Vehicular Ad Hoc Network (VANET) is an emerging area of research nowadays for its high mobility and frequent topology change. Inter-vehicular communication is essential in the real time environment for full road safety. But due to highly challenging properties it is hard to get an optimal solution for data communication between the vehicles (V2V) or vehicle to infrastructure (V2I/I2V). Security is a core issue in VANET because it is strongly affected by attacks. This degrades network performance and leads to insecurity in data communication. In this paper, we have designed a Secure Smart Transportation (SST) System which reduces the level of accidents by making an accident free environment. The main aim of our paper is to securely transmit the warning message (WMSG) from source (S) to destination (D). Firstly, the vehicles are checked by a Fault Detection System (FDS). Secondly, the vehicles are recognized by the Central Authority (CA). Thirdly, session key establishment is done between the vehicles for communication. Then the path is decided by using optimal node generation algorithm. At last the data is send by encrypting it with the session key and then decrypting it with the same session key. This process continues until D is reached. It is difficult for an imposter to enter into the network and alter the communication. We have proved some properties related to our SST system.
P2P systems have shown useful to many types of distributed systems due to their features of efficient direct communication among peers. Although initially motivated by the need for efficient file sharing among large a...
详细信息
P2P systems have shown useful to many types of distributed systems due to their features of efficient direct communication among peers. Although initially motivated by the need for efficient file sharing among large amount of peers, P2P techniques have found wide applicability to many domains within large scale distributed systems such as solving complex problems from science andengineering, data storage, etc. During the last years, P2P techniques have found their applicability to mobile computing, vehicular networking, MANETs, etc. In this paper we survey some P2P solutions to efficient management in MANETs. By using P2P techniques, MANETs can efficiently support collaboration among mobile peers as well as efficient data exchange.
This paper presents a review for distributed Mobility Management (DMM). Mobility Management is one of the key technologies in Mobile Network. DMM can solve the problems of traditional Centralized Mobility Management...
详细信息
This paper presents a review for distributed Mobility Management (DMM). Mobility Management is one of the key technologies in Mobile Network. DMM can solve the problems of traditional Centralized Mobility Management (CMM) such as non-optimal route and single point of failure and attack. There are several DMM approaches in recent researches. Some are based on MIP and some on PMIP. We summarize and present an optional optimization (O2) strategy in this paper.
The paper proposes a distributedcomputing framework that integrates parallel differential evolution (DE) and multi-agents. Given a complex high-dimensional optimization problem, our approach decomposes the problem in...
详细信息
The paper proposes a distributedcomputing framework that integrates parallel differential evolution (DE) and multi-agents. Given a complex high-dimensional optimization problem, our approach decomposes the problem into a set of subcomponents, which are evolved by a set of Slave agents concurrently, and the results are synthesized and further evolved by a Master agent. As top-level agents of the framework, the Master and Slave agents can be divided into asynchronous teams of sub-agents including Constructors for solution initialization, Improvers for solution evolution, Repairers for constraint handling, Destroyers for keeping the quality and size of the population, etc., which share populations of solution vectors and cooperate to solve the problem efficiently. The proposed approach is highly parallelized, flexible, and scalable, and its efficiency is demonstrated by comparison with some state-of-the-art approaches.
Key-Value DB has been become a novel distributed storage framework for cloud storage. It mainly focuses on solving the problems of horizontal scalability and high throughput for cloud storage. However, data reliabilit...
详细信息
Key-Value DB has been become a novel distributed storage framework for cloud storage. It mainly focuses on solving the problems of horizontal scalability and high throughput for cloud storage. However, data reliability has become bottleneck problem for the distributed Key-Value DB. In this paper, we introduce a novel distributed storage system: BC- kvDB (Big cloud key-value DB). In BC-kvDB, we propose multi-master mechanism to solve the problem of single point of failure for secondary master. Besides, we also introduce a novel flexible replica management technique for key-value data chunk. The experiment results expose that BC-kvDB performs better than Hbase on random read/write test. It also achieved a factor of 2.5 improvements in sequence write performance than Hbase.
暂无评论