Professional Documents
Culture Documents
An Energy Efficient Load Balancing Algorithm For
An Energy Efficient Load Balancing Algorithm For
I.
INTRODUCTION
Base Station
Gateway
Sensor
1250
NETWORK MODEL
A. Assumptions
A multi-gateway architecture for sensor network is shown in
Fig. 1. Gateways are used to perform data aggregation and
relay the aggregated data to the base station. All the
communications are over wireless media and all the links are
symmetric, i.e., a link is established between two nodes only
when they are under communication range of each other. In
this paper we assume that all the sensor nodes are stationary
once deployed. The locations of the gateways are known and
fixed throughout lifetime of the network. All the nodes are
also assumed to be aware of their locations through some
beacon nodes or using some localization techniques [10].
B. Sensor Energy Model
We adopt the sensor energy model from [2]. For
communication we consider here the energy/bit consumed by
the transmitter, the transmit op-amp, and the receiver unit. Let
Etx be the energy to send r bits and Erx is the energy consumed
to receive r bits. Assuming a path loss of 1/d2 for traversing a
distance d, the equations for energy consumed by the
transmitter and receiver are given as follows [2]:
( 2.1)
RELATED WORK
PROPOSED ALGORITHM
(4.1)
(4.2)
( 4.3)
1251
CEGi =
Cost
j ,i
(4.4)
j =1
LGi = ( PGi , CE Gi )
(4.5)
BMC =
1
X
CGk =
| G | k =1
|G |
( 4.6)
1252
18
16
14
12
10
8
6
4
2
0
LBCA
CELBA
shortest
LBCA
CELBA
shortest
Number of sensors
Fig. 4. Average Communication Energy per cluster with
restricted nodes
0.6
0.5
0.4
0.3
0.2
0.1
LBCA
CELBA
0
Number of sensors
0.18
0.16
0.14
0.12
0.1
0.08
0.06
0.04
0.02
0
100
133
177
200
233
277
300
333
377
400
433
477
500
577
600
SIMULATION RESULTS
100
133
177
200
233
277
300
333
377
400
433
477
500
577
600
V.
Average Communication
Energy (joules)
X
, 1 i K
|G|
Then the sensor nodes are assigned to a nearest gateway Gi
whose cardinality is less than the BMC, i.e., CGi BMC. For
assigning n senor nodes to m gateways. The time complexity
of the proposed algorithm is O(mn).
CGi
Number of sensors
Fig. 3 Standard deviation of load with increasing density
Communication energy per cluster: We measured the total
communication energy using the equation 4.4. We performed
the experiments with and without restricted nodes for the
VI.
CONCLUSION
1253
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
1254