Efficient Energy-Aware Cooperative Group Clustering Data Gathering Algorithm in Wireless Networks
Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 4
Abstract
Now days, hot topic among mobile researchers is to optimize the power consumption in every aspect of the mobile devices. The optimization can be carried out by means of some applications and communication techniques. We are trying to optimize a power efficient routing technique for wireless networks in this project. We have proposed a routing algorithm which tries to minimize the power consumption in transmitting a packet from the source to the destination, while trying to maximize the lifetime of the network by avoiding nodes that have a shorter lifetime remaining. Discovering paths show the way to consume minimum energy. In addition to this, discovering path which does not use energy depleted nodes has lead to conflicting objectives and discovered that the proposed algorithm surpassed as the best known algorithm in mobile optimizing literature. Here we are using the energyaware algorithm and the cooperative routing algorithm is incorporated through the inclusion factor for both the required cooperative transmission power.
Authors and Affiliations
M. SANTHALAKSHMI , P. KAVITHA
Keywords
Related Articles
- EP ID EP130010
- DOI -
- Views 121
- Downloads 0
Stream Ciphers Encript Transformation
In this paper the initiative has been taken to review the flaws which have lead to the decline of stream ciphers in public domain. This review of the flaws in the existing stream cipher systems had lead to the developmen...
Workload-aware VM Scheduling on Multicore Systems
In virtualized environments, performance interference between virtual machines (VMs) is a key challenge. In order to mitigate resource contention, an efficient VM scheduling is positively necessary. In this paper, we pro...
Efficient Lossless Colour Image Compression Using Run Length Encoding and Special Character Replacement
Image compression, in the present context of heavy network traffic, is going through major research and development. The lossless compression techniques, presently in practise, follow three basic paradigms – character re...
A GA Approach to Static Task Scheduling in Grid based Systems
Static task scheduling in computational grids is very important because of the optimal usage of computing time for scheduling algorithms. Given a set of resources, a static scheduler computes the execution schedule befor...
Fractals Based Clustering for CBIR
Fractal based CBIR is based on the self similarity fundamentals of fractals. Mathematical and natural fractals are the shapes whose roughness and fragmentation neither tend to vanish, nor fluctuate, but remain essentiall...