International Journal of Pure and Applied Mathematics

Volume 116 No. 12 2017, 257-265

ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version)
url: http://www.ijpam.eu
doi: 10.12732/ijpam.v116i12.27
Special Issue ijpam.eu

ENERGY CONSUMPTION AND LOAD

BALANCING COMPARED WITH VANET
AND MANET
S David1, R Navaneethakrishnan2
1, 2
Assistant Professor, Dept of ECE,
Kumaraguru College of Technology, India
david89rozario@gmail.com, navinkrish.r@gmail.com
Abstract
Mobile Ad Hoc Network and Vehicular Adhoc Networks are
emerging area for research and development. VANETs are subclass of
MANETs. With the rapid increase in vehicular traffic in urban areas,
optimal use of available resources is necessary to minimize the load and
energy consumption. One of the scenarios of MANET is Vehicular ad-
hoc networks. For communication in VANET, the vehicles interacting
between themselves as well as along with roadside device stations,
efficient routing Protocols are needed. This paper evaluates energy
consumption and load balancing among MANET and VANET.
Keywords: Energy consumption, load balancing, Road side units,

1. Introduction
As a special type of mobile ad hoc networks (MANETs),
vehicular ad hoc networks (VANETs) allow vehicles to form a self-
organizing mobile wireless network, which do not rely on a pre-
existing infrastructure to communicate. The VANET is a
promising application-oriented network for various high real-time
applications in intelligent transportation systems (ITS), for
instance, (1) vehicular safety-related applications such as collision
warning systems, road condition warning, lane-changing
assistance [1,2], (2) transportation efficiency related applications
such as traffic light control and vehicle navigation [3,4] and (3)
entertainment applications. Unlike conventional ad hoc networks,
a VANET has some inherent characteristics, such as highly
dynamic topology, intermittent connectivity and diverse network
densities. These characteristics make the data dissemination
really a challenging activity in this kind of network [5]

257
International Journal of Pure and Applied Mathematics Special Issue

2. Literature Survey
Ren et al. [17] considered the problem of charging the
maximum number of sensors by a charging vehicle within a given
time period, by taking into consideration the sensor charging time
and vehicle travelling time. Xu et al. [18] investigated the problem
of finding a charging tour such that the ratio of the amount of
energy charged to sensors in the tour to the length of the tour is
maximized. Lin et al. [16] extended the work of [18] by
considering both sensor residual lifetimes and their spatial
locations.

In [14] Chakrabarti and Kulkarni modified the way to

construct alternate routes that are maintained and used in DSR.
In routing protocol proposed in [14] load balancing is done among
the number of alternate routes. The approach in [14] also enabled
to provide QoS guarantees by ensuring the appropriate bandwidth
which is available for a flow even when nodes are under mobility.
Souinli et.al [15] proposed load-balancing mechanisms that push
the traffic further from the center of the network. They provided a
novel routing metrics that take into account nodes degree of
centrality, for both proactive and reactive routing protocols.

Assuming networks are not always connected, another

group of routing protocols are proposed in the literature [21, 22,
23, 24, 25, 26, and 27]. These routing protocols can be considered
as the delay tolerant protocols and the carry-and-forward [28]
scheme is used when network disconnection happens. Network
disconnections occur frequently in rural highway situations and in
cities at night where fewer vehicles are running, making
establishing end-to-end routes impossible. Even in densely-
populated urban scenarios, sparse sub-networks can also be
prevalent.

258
International Journal of Pure and Applied Mathematics Special Issue

3. Research Methodology
Algorithm of Grey Correlation Analysis:

Grey correlation analysis quantifies the dynamic correlation

degree of the trend of a system and its influencing factors; it is
suitable for dynamic analysis [4]. Concrete steps of
implementation are as follows：

2.1 Define reference number sequence reflecting system behavior

and comparing number sequence affecting system behavior

Select reference number sequence reflecting system behavior, i.e.

to choose the optimal value of one among all influencing factors as
the ideal sample logo or reference number sequence, and then
select the optimal value of influencing factors as comparing
number sequence.

2.2 Turn the reference and comparing number sequence into

dimensionless for better comparison of various factors

xi (k) = , k=1,2,3….n, i=1,2,3…m

2.3 Calculate grey correlation coefficient of reference and

comparing number sequence ξ, and find out the maximum and
minimum in the grey relational coefficient. Correlation coefficient
of x0(k) and xi(k)

| | ||
(k) = | | | |

Assume Δi(k) = |y(k)-xi(k)|

Δ Δ
ξi(k) =
Δ Δ

ρ is named as distinguishing coefficient, the range of values

allowed for ρ is from 0 to 1. Usually ρ = 0.5.

259
International Journal of Pure and Applied Mathematics Special Issue

2.4 Grey correlation degree (r) calculation

ri = ∑ , k=1,2,3….n

Load Balancing Among the Node

Load balancing is an important solution to improve the execution
time of tasks and better management of the energy by reducing
load imbalances in ad hoc networks. Cooperative approach for
load balancing among the network which is used for node having
more than one incoming request that time traffic or load high in
that particular node. By using cooperative approach it share their
work by its neighbor node.Network load is increased result work
done is decreased so we reduce the traffic among the network
while transferring the data.

Energy Consumption
Each individual node uses certain amount of energies for
processing this is known as “Energy consumption.K bit of
information packet is receiving the sensing element „i‟ while
consuming the energy which is given by, Eelec* k (1) is denoted
for the energy consumptions during information sending through
packet to the connected element „j‟ is given by the equation.

Tx(x,y) = Eene*M + Eamp * d2(x,y) * M

(1)

Where dij is the weight between the connected nodes i and j

One bit energy transmission is spent, the equation is given by

etx(d)= pd1+ptd*dn (2)

Where,

pd1- power dissipate by sending 1 bit data

260
International Journal of Pure and Applied Mathematics Special Issue

ptd - power used for transmitting the nodes over a distance

Performance Analysis
The performance analysis of the paper is simulated in NS2
environment with following figure. The parameters used are
Successive transmission, packet delivery ratio, delay, packet drop,
dropping ratio, throughput and Goodput.

Table 1 Performance analysis compared with MANET and

VANET

Parameter VANET MANET

Number of nodes 50 50
Initial energy of node 100 J 100 J
Simulation time 150 ms 100 J
Energy consumption 22 % 27 %
Dropping ratio 7% 9.8 %
Packet delivery ratio 94.42 % 94.22 %
Throughput 67.675 % 69.456 %
End to end delay 0.333 ms 0.453 ms
Load in each node 2.5 mbps 2.5 mbps

Figure 1 Graph for successive transmission

Figure 1 shows the successive transmission is the intensity of

successful transmission of packet in the network. It can be
measured across time by above algorithm which is simulated in
the environment

261
International Journal of Pure and Applied Mathematics Special Issue

Figure 2 graph for packet delivery ratio

Figure 2 show that the data packet delivery ratio is defined as the
number of successfully delivered data packets to the number of
data packets generated by the source. Packet Delivery Ratio trace
files are post-processed to calculate the delivery ratio of data
packets. That is, the relation between sent packets and received
packets.

Figure 3 graph for Goodput

Figure 5 shows the Goodput, i.e. the number of useful information

bits, delivered by the network to a certain destination, per unit of
time. The amount of data considered excludes protocol overhead
bits as well as retransmitted data packets. This is related to the
amount of time from the first bit of the first packet is sent (or
delivered) until the last bit of the last packet is delivered.

262
International Journal of Pure and Applied Mathematics Special Issue

Figure 4 Graph for drop

Figure-6 displays the graph for analysis of the packet drop

obtained with simulation of the ACO algorithm, suggesting the
high reduction in loss of packets with time. Initially the loss of
packets is high which in turn reduces with time, thereby
increasing the overall efficiency of the suggested ACO algorithm.
This proves the conclusion that the reduction in the delay time
with increase in efficiency is successfully achieved.

Conclusion

In VANET and MANET, the communication link is extremely risk

due to disconnection. Ant Colony Optimization (ACO) and Particle
swarm optimization (PSO) are simulated by using parameters like
packet delivery ratio, delay, throughput, Goodput, packet drop
and dropping ratio. With the rapid increase in vehicular traffic in
urban areas, optimal use of available resources is necessary to
minimize the load and energy consumption. The drop will be
minimize by reduce the traffic among the network and also
balanced the load.By reducing the energy consumption then
network lifetime is also extended, it is necessary to balance
energy among nodes.

263
International Journal of Pure and Applied Mathematics Special Issue

Reference:

[1 ]Lo, S.C.; Gao, J.S.; Tseng, C.C.: A water-wave broadcast

scheme for emergency messages in VANET. Wirel. Pers.
Commun. 71(1), 217–241 (2013).
[2] EmadEddin, A.G.; Evitm, P.; Richard, G.; Li, Y.Y.: Utilization
of broadcast methods for detection of the road conditions in
VANET. In: 26th European Conference on Modeling and
Simulations. Koblenz, Germany (2012)
[3] Chang, H.J.; Park, G.T.: A study on traffic signal control at
signalized intersections in vehicular ad hoc networks. Ad Hoc
Netw. 11(7), 2115–2124 (2013)
[4] Weis, B.X.; Sandweg, A.: GuideWeb: a conceptually
infrastructure-free vehicle navigation system. IET Intell. Transp.
Syst. 6(2), 139–144 (2012)
[5] Meneguette, R.I.; Villas, L.A.: An autonomic algorithm for
data dissemination in vehicular ad hoc networks. IEEE Lat. Am.
Trans. 12(3), 430–435 (2014)
[6] Hao Wu , Richard Fujimoto, Randall Guensler and Michael
Hunter,” MDDV: A Mobility-Centric Data Dissemination
Algorithm for Vehicular Networks”, ACM VANET‟04, October 1,
2004, Philadelphia, Pennsylvania, USA.
[7]Jie Wu, Fei Dai,”Broadcasting in Ad Hoc Networks Based on
Self-Pruning”, Twenty-Second Annual Joint Conference of IEEE
Computer and Communications Societies, IEEE INFOCOM 2003.
[8]Tamer Nadeem, Pravin Shankar, Liviu Iftode “A Comparative
Study of Data Dissemination Models for VANETs”, IEEE,2006
[9] Weis, B.X.; Sandweg, A.: GuideWeb: a conceptually
infrastructure-free vehicle navigation system. IET Intell. Transp.
Syst. 6(2), 139–144 (2012)

264
265
266