GREENCOMP: ENERGY-AWARE COOPERATION FOR GREEN CELLULAR

NETWORKS

ABSTRACT
How to accommodate the tremendous growth of data traffic and how to reduce
power/energy consumption are two important issues to tackle in todays cellular networks. To
deal with the increasing demand of mobile traffic, mobile operators deploy more base stations
(BSs) to achieve higher capacity and better coverage. However, this may consume more energy
and lead to larger capital and operating expenditure. This calls for energy-saving radio access
mechanisms for green cellular networks.

EXISTING SYSTEM
Turning off BSs is a simple and effective way for energy saving. However, this approach
incurs such problems as service disconnection and quality degradation to users who are
connected to previously switched-on BSs. To solve these problems, solutions in existing works
include cell zooming, cell breathing, and cell scaling. The rationale behind these works is to
increase the transmission powers of active BSs in order to cover those users previously
connected to the switched-off BSs. However, increasing transmission powers of neighboring BSs
to cover the switched-off BSs also introduces other power consumption problems However,
according to existing works on wireless energy savings focus mainly on energy consumption
from the system perspective, and often neglect the impact on the RF radiated power
consumption. This requires more efforts on how to reduce transmission power while saving
constant power.

DIS ADVANTAGES

Both constant power and transmission power of each BS become the major
energy consumption sources.

Challenges come mainly from how to jointly consider which BSs to switch off
and how to cooperate among active-mode BSs.

#13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar, Vellore 6.
Off: 0416-2247353 / 6066663 Mo: +91 9500218218
Website: www.shakastech.com, Email - id: shakastech@gmail.com, info@shakastech.com

PROPOSED SYSTEM
In this paper, we study the problem of QoS-aware green cellular networks by using BS
cooperation to enlarge coverage for scenarios with different user distributions and BS power
models. Our objective is to ensure the user demands are satisfied while achieving minimal system power consumption. We jointly decide which set of BSs to cooperate and which set of BSs
to switch off. We formulate the problem via binary integer programming and prove the problem
is NP-hard. To discuss this problem properly and to propose efficient solutions, we design a near
optimal approach named Green CoMP by La-grangian Relaxation and Search Enumeration, and
then derive key properties based on this algorithm. We observe that a higher cooperative size
doesnt imply a better strategy for different scenarios. Based on the results of GreenCoMP, we
then propose two heuristic algorithms according to different user demands in BSs, and show they
are polynomial time methods.

ADVANTAGES

Our algorithms outperform pure power control mechanisms that do not consider the
transmission power and pure cooperation without power control in terms of the total
consumed energy.

Consume less power under any traffic loads.

MODULES

GreenCoMP

Heuristic Algorithms

HeavyCoMP

LightCoMP.

#13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar, Vellore 6.
Off: 0416-2247353 / 6066663 Mo: +91 9500218218
Website: www.shakastech.com, Email - id: shakastech@gmail.com, info@shakastech.com

SYSTEM REQUIREMENTS
H/W System Configuration:Processor

- Pentium III

RAM

- 256 MB (min)

Hard Disk

- 20 GB

Key Board

Standard Windows Keyboard

Mouse

Two or Three Button Mouse

Monitor

- SVGA

S/W System Configuration:Operating System

: Windows95/98/2000/XP

Application Server

: Tomcat5.0/6.X

Front End

: HTML, Jsp

Scripts

: JavaScript.

Server side Script

: Java Server Pages.

Database

: MySQL 5.0

Database Connectivity

: JDBC

#13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar, Vellore 6.
Off: 0416-2247353 / 6066663 Mo: +91 9500218218
Website: www.shakastech.com, Email - id: shakastech@gmail.com, info@shakastech.com