Professional Documents
Culture Documents
(2r)
2
W
2
_
(5)
The total energy consumed in the ith grid, E
i
, is the sum of
the energy consumed in the listening, transmitting and
Figure 5 Distribution of data trafc along the offpeak and
peak times
Table 1 Parameters for computing data trafc
speech bit
rate
64 kB/s speech ON/OFF
probability
5/35
video bit rate 320 kB/s video ON/OFF
probability
5/65
data bit rate 10 MB/s data ON/OFF
probability
15/75
RFID bit rate 10 MB/s data ON/OFF
probability
1/12
854 IET Commun., 2010, Vol. 4, Iss. 7, pp. 850860
& The Institution of Engineering and Technology 2010 doi: 10.1049/iet-com.2009.0153
www.ietdl.org
receiving states of the nodes in the grid (1), thus
E
i
E
t
E
r
E
l
e
p
T
r
e
l
e
a
R
n
i
T
t
(6)
Therefore based on (2), (4) and (5), the energy consumed in
the entire network can be expressed as follows
E
total
mE
i
L
r
e
p
D
r
e
l
=d
R
e
a
(2r)
2
W
2
_ _ _
n
D
t
_ _
(7)
As mentioned, data trafc is constant through the network,
thus D
t
D
r
D. To compute the minimum energy
consumption of the network nodes, we take the rst
derivative of E
total
in terms of grid-length, r, and let
@E
total
=@r 0. For n 2 (free space propagation scenario)
r
2
e
p
D e
l
=d
R
W
2
e
a
D
4e
a
D
r
e
p
D e
l
=d
R
W
2
e
a
D
4e
a
D
_ (8)
where r
e
p
D e
l
=d
R
2W
2
e
a
D
e
a
D
_
(9)
Equation (9) shows that the optimal radio transmission
range, R
r
2
i
W
2
_
(normal nodes are able to transmit
data to the head node, no matter where their location is), r
i
is the grid length of the ith grid. In the equal-grid model,
r
i
r.
The energy consumed by the head nodes of the ith grid
can be derived as (7)
E
N
h
i
e
p
D
ri
e
l
=d
R
e
a
(2r)
2
W
2
_ _ _
n
D
ti
(11)
where
D
ti
(L (i 1)r)Wl
D
ri
(L ir)Wl
(12)
l denotes the trafc data (bits) intensity per metres
2
(m
2
),
which can be calculated from the our data trafc model
(l 1:16 10
4
bits=m
2
=s).
By using (10) (12), the energy consumption of the entire
network is
E
total
m
i1
E
N
h
i
(N m) E
N
n
(13)
where N is the number in vehicular nodes in our motorway
network (N 80).
5.2 Analysis of network connectivity
Based on [32], the probability of network connectivity (P)
can be calculated by
P (1 e
d2R
)
N
(14)
where d is the node density, R is the transmission range of
nodes and N is the total number of nodes in the network.
To meet P . 99%, and using the parameters stated earlier
in this section, R is solved to be R . 113 m. Using the
mechanism of equal-grid GAF model, the number of grids
is about 36 (m 36), where the energy consumption of the
network is 3841 J, which is larger than the minimum energy
consumption of the equal-grid model (E
min
3567 J).
5.3 Adjustable-grid motorway GAF model
Obviously, nodes near the sink will relay more trafc than nodes
at the other end of the network. Therefore to optimise their
energy consumption according to the relationship between
optimal radio range (optimal grid length) and network trafc
from (9) [(8)], the nodes near a sink should have a smaller
radio range. Apparently, an adjustable-grid motorway GAF
model can lead to lower energy consumption compared to
equal-grid GAF model, if properly designed. As illustrated in
Fig. 1, the adjustable-grid motorway GAF model divides the
network into m variable-length grids, where the length of
each grid is determined according to (9).
IET Commun., 2010, Vol. 4, Iss. 7, pp. 850860 855
doi: 10.1049/iet-com.2009.0153 & The Institution of Engineering and Technology 2010
www.ietdl.org
The energy consumed by the normal nodes is only for
transmitting, which can be derived based on (1) and (2)
E
N
n
(e
e
e
a
R
n
i
)D
t
=d
R
(15)
where R
i
r
2
i
W
2
_
(normal nodes are able to transmit
data to the head node, no matter where their location is), r
i
is the grid length of the ith grid.
The energy consumed by the head nodes of the ith grid
can be derived as (7)
E
N
h
i
e
p
D
ri
e
l
=d
R
e
a
(2r)
2
W
2
_ _ _
n
D
ti
(16)
where
D
ti
(L r
1
r
2
; . . . ; r
i1
)Wl
D
ri
(L r
1
r
2
; . . . ; r
i
)Wl
(17)
l denotes the trafc data (bits) intensity per metre
2
(m
2
),
which is the same as the equal-grid model
(l 1:16 10
4
bits=m
2
=s).
By using (15) (17), the energy consumption of the entire
network is
E
total
m
i1
E
N
h
i
(N m) E
N
n
(18)
where N is the number of vehicular nodes of our motorway
network (N 80). The energy consumption of the
adjustable-grid motorway GAF model is 3012 J, when the
number of grids m 21.
5.4 Genetic algorithm motorway
GAF model
Genetic algorithms (GA) [33, 34] are optimisation and
search techniques based on the principles of genetics and
natural selections. GA is applied to search the minimum
value of the tness function, and the variables are processed
by three main GA operators, which are dened as follows:
Selection: This operator selects chromosomes in the
population for reproduction, and the tter chromosome has
a higher probability of being selected to reproduce.
Crossover: This operator chooses a locus and exchanges or
crosses over two chromosomes to create two offspring.
Mutation: This operator randomly ips some bits in a
chromosome.
Each variable is considered as a chromosome that evolves
through iterations (generations). The chromosomes of the
next generation are created by merging or modifying the
chromosomes together from the current population, where
the crossover and mutation operators are applied in the
process. During each population, the chromosomes are
selected according to their selection probabilities, which are
determined by the selection operators. This has been
explained in the owchart shown in Fig. 6.
In our GA model, the tness function is
E
t
m
i1
E
i
(19)
where
E
i
e
p
D
ri
e
l
d
R
e
a
(r
i
r
i1
)
2
W
2
_
_ _
n
D
ti
(20)
which is a constraint by the set
_
{(r
1
, r
2
, . . . , r
m
):0 , r
i
, L,
m
i1
r
i
L} (21)
where r
i
is represented by a chromosome in our GA
algorithm, based on which new chromosomes are produced
in each generation by crossover and mutation operations on
parent population, as shown in Fig. 6. Given enough
generations (about 20 000 generations), the minimum of
the tness function (minimum energy consumption) is
computed: E
t
2946 J, where m 20. This result will be
analysed in Section 7.
Figure 6 Flowchart of the GA
856 IET Commun., 2010, Vol. 4, Iss. 7, pp. 850860
& The Institution of Engineering and Technology 2010 doi: 10.1049/iet-com.2009.0153
www.ietdl.org
6 Energy consumption in off peak
time trafc model
In the off peak data trafc scenario, the average number of
vehicles in the motorway section GAF model is only about
4. Since the maximum number of grids is 4, with the same
mechanism of the peak time trafc model, the minimum
energy consumption of the equal-grid model is achieved at
this number of grids, where m 4. Since the data trafc
density is too low and the number of vehicles is very small,
the energy consumption results of the adjustable-grid,
equal-grid and genetic algorithm models show comparable
results in terms of energy consumption.
Fig. 5 shows that the average data trafc transmitted by
vehicles during the peak time is much larger than that during
off peak time and varies at different locations during specic
time durations. The huge difference in data trafc calls for
enabling vehicles to transmit at different transmission ranges
according to time duration and location on a motorway in
order to save more energy. Therefore vehicles adjust their
transmission range based on transport trafc density in order
to maintain vehicular network connectivity as well as to save
more energy. When the number of vehicles along a specic
time duration or over a specic location is small, then, each
adjusts its transmission range to a large value in order to
maintain network connectivity. Whereas, when the number
of vehicles increases then each vehicle should adjust its
transmission range based on the optimal transmission range
and total energy relationship functions derived in this paper
so that the total energy consumption can be minimised. As a
result, vehicles will be able to automatically tune their wireless
communication cards to a transmission range, which
corresponds to a specic driving time or a specic location on
a motorway in order to save more energy.
7 Numerical results
We have conducted simulations to evaluate the energy efciency
of the equal-grid, adjustable-grid and GA models. Eighty
vehicular nodes (determined by the M4 motorway trafc
model) were randomly distributed in the motorway network
which is divided into virtual grids following the GAF models
introduced. In each grid, the head node to which all the other
nodes transmit was randomly selected. The data are relayed by
the head node of each grid until it reaches the sink node.
Each simulation was repeated 1000 times, and the total
average energy consumption was computed. In what follows,
we discuss the results based on the relationships derived and
the energy-efciency GAF models considered.
Based on the relationship between the optimal transmission
range and data trafc transmitted by vehicular nodes, which
we have derived in Section 5, Fig. 7 depicts the relationship
between optimal grid length and network trafc. Three
important points can be observed in the results shown in
Fig. 7. First, the optimal grid length (or optimal radio
transmission range) increases sharply when the network trafc
is low, where the number of transmissions is small and
therefore the global network energy can be minimised by
minimising the number of nodes involved in the transmission,
which corresponds to a large node transmission range. The
analysis agrees with this observation and predicts this trend,
where a large number of nodes are in the sleeping state and
therefore the transmission range is large. The majority of the
network is in the sleeping state when the network trafc is less
than 2 10
6
bits in 1 s. Second, when the network trafc is
large, the optimal transmission range, R
(x
i
x
i1
)
2
(y
i
y
i1
)
2
_
, where x
i
and y
i
are the
coordinates of the active node in the ith grid.
As a result, Fig. 8 also shows the energy consumption of
the GAF models which considers variable transmission
ranges, and it shows that the model based on the variable
transmission range can save more energy than those which
are based on a static transmission range. Based on our
computation, it has been found that the GAF models
based on variable transmission ranges can save energy by
35.3% in (equal-grid model), 34.5% in (adjustable-grid
model) and 36.1% in (GA model), compared to the GAF
models which are based on static transmission ranges.
Furthermore, the comparison is more clearly shown in Fig. 9.
7.3 Comparison of power consumption
The results above are all based on 100 s simulations, in which
the power consumptions (J/s) of these models are calculated
and shown in Fig. 9. Without GAF mechanisms, we assume
that every vehicle can transmit data directly to the BS. Thus
the transmission range of each vehicle is considered to be
xed, and is set to be the network length (L 2 km). Based
on (7), the energy consumed by the entire network is
computed to be about 6:4 10
5
J, thus the power
consumption is 6:4 10
3
W, which is shown in Fig. 9.
Compared to the power consumption without using GAF
mechanism, the GAF models proposed in this paper could
save power consumption by 99:4 99:7% (about 6364
6381 W), and the comparison is given in Fig. 9. Note that, in
Fig. 9, we only consider the minimum energy consumption
of both equal-grid and GAs models, which occur respectively
at m 21 and 27. As an example, if we consider a 60 W
bulb, then, the power saved in the 2 km section of the
motorway network can power 106 bulbs and over the entire
motorway (300 km approximately) 16 000 bulbs.
8 Conclusion
Based on transport trafc proles observed at different ILs on
the M4 motorway in the UK, this paper introduced, analysed
and evaluated three GAF models to optimise energy
consumption in vehicular ad hoc networks. We have derived
the relationship between the number of grids and energy
consumption, where the minimum number of network grids
can be determined in the equal-grid GAF model,
determining the minimum energy consumption in this
model. The relationship between the network energy
consumption and nodes transmission range has been derived
Figure 9 Power consumption in three models
858 IET Commun., 2010, Vol. 4, Iss. 7, pp. 850860
& The Institution of Engineering and Technology 2010 doi: 10.1049/iet-com.2009.0153
www.ietdl.org
in the adjustable-grid GAF model. This enabled us to nd the
optimal transmission range, which corresponds to the
minimum energy consumption in adjustable-grid model. The
performance of these two GAF models is compared to the
performance of a genetic algorithm introduced to optimise
energy consumption in VANETs. The comparison results
show that the GA model is the most energy efcient one and
saves 21.1% compared to the equal-grid model, whereas the
adjustable-grid model saves 19.3% compared to the equal-
grid model. It has been found out that a GAF model with
variable transmission ranges can save about 35% energy
compared to the GAF models based on a static transmission
range. This paper draws the rst step towards building a
software utility to control vehicle energy consumed in
vehicular communication. Consequently, vehicles will be able
to tune their communication transmission range based on the
driving time or specic locations along their trajectory.
Furthermore, the proposed transmission range adjustment
mechanism can be deployed in other ad hoc network scenarios
where dynamically varying node densities are expected, for
example in social networking.
9 References
[1] BUNDGEN R.: White paper green ict. Technical Report,
T-Systems Enterprise Service GmbH, 2008
[2] HODGES R., WHITE W.: Go green in ict. Technical Report,
GreenTech News, 2008
[3] GROUP S.: ICT system and network for reducing
environmental impacts. Technical Report, Ministry of
Internal Affairs and Communications of Japan, March 2007
[4] NGUYEN T.D., BERDER O., SENTIEYS O.: Cooperative mimo
schemes optimal selection for wireless sensor networks.
IEEE Vehicular Technology Conf. (VTC) Spring, May 2007,
pp. 8597
[5] JURDAK R.: Wireless ad hoc and sensor networks:
a cross-layer design perspective (Springer, 2007)
[6] XU Y., HEIDEMANN J., ESTRIN D.: Geography-informed energy
conservation for ad hoc routing. Proc. ACMMobil01, July
2001, pp. 7084
[7] I. 802.11: Wireless lan mediumaccess control(MAC) and
physical layer(phy) specications, IEEE Standard 802.11, 1999
[8] ZHOU Y., TAN Y.E., LAURENSON D.I., MCLAUGHLIN S.: Impact of
power saving mac scheme on ad hoc network routing
protocol. Vehicular Technology Conf. 2005. VTC 2005-
Spring, 2005 IEEE 61st, 2005
[9] LI N., WANG H., ZHENG S.: An energy-saving scheme for
wireless lans. Int. Conf. on Communication Technology,
April 2003
[10] LI N., XU Y., XIE S.: A power-saving protocol for ad hoc
networks. IEEE Int. Conf. on Wireless Communications,
Network and Mobile Computing, September 2005
[11] MILLER M.J., VAIDYA N.H.: Ad hoc routing for multilevel
power save protocols. April 2008, vol. 6, pp. 210225
(www.elsevier.com/locate/adhoc)
[12] CHANDRA A.V.S.: Application-specic network management
for energy-aware streaming of popular multimedia formats.
Usenix Annual Technical Conf., 2002
[13] RODOPLU V., MENG T.H.: Minimum energy mobile wireless
networks. IEEE Int. Conf. on Communications, ICC98, June
1998, vol. 3, pp. 16331639
[14] LI N., HOU J.C., SHA L.: Design and analysis of an mst-
based topology control algorithm. IEEE INFOCOM 2003,
March 2003, pp. 17021712
[15] CHANGJ.H., TASSIULASL.: Energy conserving routing in wireless
ad-hoc networks. IEEE INFOCOM 2000, 2000, pp. 2231
[16] BANERJEE S., MISRA A.: Minimum energy paths for reliable
communication in multi-hop wireless networks. MobiHoc,
2002, pp. 146156
[17] PARK S.J., SIVAKUMAR R.: Quantitative analysis of
transmission power control in wireless ad-hoc networks.
Int. Workshop on Ad Hoc Networking (IWAHN), August 2002
[18] TAKAGI H., KLEINROCK L.: Optimal transmission ranges for
randomly distributed packet radio terminals, IEEE Trans.
Commun., 1984, COM-32, pp. 246257
[19] RODOPLU V., MENG T.H.: Minimum energy mobile wireless
networks, IEEE J. Sel. Areas Commun., 1999, 17, pp. 13331344
[20] HOU T.C., LI V.O.K.: Transmission range control inmultihop
packet radio networks, IEEE Trans. Commun., 1986,
COM-34, pp. 3844
[21] ZORZI M., PUPOLIN S.: Optimum transmission ranges in
multihop packet radio networks in the presence of
fading, IEEE Trans. Commun., 1995, 43, pp. 22012205
[22] CHEN P., ODEA B., CALLAWAY E.: Energy efcient system
design with optimum transmission range for wireless ad
hoc networks. IEEE ICC, 2002, pp. 945952
[23] CHEN Y., SIRER E.G., WICKER S.B.: On selection of optimal
transmission power for ad hoc networks. 36th Hawaii Int.
Conf. on Syst. Sci., 2003, pp. 300309
[24] ZUNIGA M., KRISHNAMACHARI B.: Optimal transmission
radius for ooding in large scale sensor networks. 23rd
Int. Conf. on Distrib. Comput. Syst. Workshops, 2003,
pp. 697702
IET Commun., 2010, Vol. 4, Iss. 7, pp. 850860 859
doi: 10.1049/iet-com.2009.0153 & The Institution of Engineering and Technology 2010
www.ietdl.org
[25] GAO J.L.: Analysis of energy consumption for
ad hoc wireless sensor networks using a bit-meter-
per-joule metric. Technical Report, IPN Progress Report,
August 2002
[26] GAO Q., BLOW K.J., HOLDING D.J., MARSHALL I.W., PENG X.H.:
Radio range adjustment for energy efcient wireless
sensor network, Ad hoc Netw., 2006, 4, pp. 7582
[27] YIN B., HONGCHI S., SHANGY.: Analysis of energy consumption
in clustered wireless sensor networks. Second Int. Symp. on
Wireless Pervasive Computing, February 2007
[28] GOKTURK M.S., ERCETIN O., GURBUZ O.: Energy distribution
control in wireless sensor networks through range
optimization. PIMRC 2008, 2008
[29] ERCETIN O.: Distance-based routing for balanced
energy consumptioninsensor networks. Globecom2008, 2008
[30] QAZI B.R., DE GRADOVIVEROA., ALANI O.Y.K., ELMIRGHANI J.M.H.: Pico
cellular mac protocol for multimedia communication. AINA
2009, 2009
[31] BHARDWAJ M., GARNETT T., CHANDRAKASAN A.P.: Upper bounds
on the lifetime of sensor networks. Proc. ICC01, June
2001, pp. 785790
[32] BETTSTETTER C.: On the minimum node degree and
connectivity of a wireless multihop network. Int. Symp.
on Mobile Ad Hoc Networking & Computing Archive Proc.
Third ACM Int. Symp. on Mobile Ad hoc Networking &
Computing, 2002
[33] HAUPT R.L., HAUPT S.E.: Practical genetic algorithms
(Wiley, New York, 2004)
[34] MELANIE M.: An introduction to genetic algorithms
(A Bradford book, The MIT Press, 1999)
860 IET Commun., 2010, Vol. 4, Iss. 7, pp. 850860
& The Institution of Engineering and Technology 2010 doi: 10.1049/iet-com.2009.0153
www.ietdl.org