International Journal of Advance Foundation and Research in Computer (IJAFRC)

Volume 1, Issue 7, July !1"# I$$% &"' ( "')&

* + , !1", IJAFRC All Ri-hts Reserved ...#i/afrc#or-
0erformance 1valuation of an 1fficient Cloud(Assisted
2ate.ay 3iscovery for Vehicular Ad hoc %et.or4
Ms.Madhuri H. Badole (Student)*, Mr.Pritam Nikam,Chief Engineer.
Aha College of engineering,Nag!ur.(M.S.)*,Samsung " # $,"esear%h &nstitude,&ndia.
madhuriadole'gmail.%om

A 5 $ 6 R A C 6
6he accessin- of the internet from vehicular net.or4s is -ettin- -reat interest from the research
point of vie.# It is very important to constantly connect to the Internet for sta7ly receivin- the
cloud services on the road# For that purpose, the discovery of the 0roper Internet -ate.ay is
needed and for that purpose, the selection of the -ate.ay in an appropriate .ay is important to
deliver the information and data services to the users of VA%16# 6his paper proposes a -ate.ay
discovery mechanism for -ettin- sta7le Internet connection ta4in- the consideration of the
loadin- parameter of the -ate.ay# 6he proper -ate.ay discovery and dispatchin- made
si-nificant impacts on 8uality of services of cloud services# A -ate.ay discovery mechanism is
proposed to discover and select proper Internet -ate.ays in VA%16 environment and provide
services throu-h it# Finally, it e9tracts the current trends and the challen-es for efficient -ate.ay
discovery for VA%16s usin- different routin- mechanism#
Inde9 6erms: VA%16, Routin-, 0rotocol ,-ate.ay discovery, 3$3V,F$R,A;3V,3$R,<R0#

I# I%6R;3=C6I;%

(raditionall), A%%essing of the &nternet from the *ANE(s is generall) !ro+ided ) means of roadside
gate,a)s. -or otaining high moilit) # %hanging net,ork to!olog) of the *ANE(s also for getting more
stale %onne%tions to the internet for *ANE( users, moile gate,a)s are introdu%ed. A *ehi%ular Ad.Ho%
Net,ork (*ANE() is the net,ork te%hnolog) that uses mo+ing %ars as a nodes in a net,ork to %reate the
moile net,ork. As ,e kno, that the ,ireless information and the data ser+i%es !ro+ides a faster and a
reliale moile a%%essing ,hi%h in%reases its demand. &t e%omes essential for su!!orting stale &nternet
a%%ess in the *ANE( for otaining !o,erful %loud ser+i%es. An internet gate,a) is modem or router or
an) other !eri!heral de+i%e that allo,s )ou to a%%ess the internet. /ate,a) is an a%%ess !oint ,hi%h a%ts
as an entran%e to another net,ork. Be%ause of the high s!eed of +ehi%les, the +ehi%les 0ui%kl) mo+es into
and out of the %ommuni%ation range of the gate,a). (hus, it is diffi%ult to stal) a%%ess the &nternet
ser+i%es through the stationar) gate,a). (o o+er%ome the limitations of stationar) gate,a)s, moile
gate,a)s are taken into %onsideration to im!ro+e the ser+i%es of the internet. (o !ro+ide the gloal
%onne%ti+it) of all the ad ho% nodes, the gate,a) dis%o+er) is re0uired to lo%ali1e the gate,a) ,ithin the
ad ho% net,ork. Effe%ti+e dis%o+er) and sele%tion of the !ro!er &nternet gate,a)s and also therefore
these gate,a) signifi%antl) im!a%ts the 2oS of %loud ser+i%es. A gate,a) dis%o+er) me%hanism is
!ro!osed to dis%o+er and sele%t !ro!er &nternet gate,a)s for *ANE(s %loud.

II# $>$61? ;V1RVI1@

(he !ro!osed s)stem %onsists of numer of the %lient +ehi%les, gate,a)s and %loud %ontaining data and
information ser+i%es are o+er+ie,ed here in this !a!er.

A# 0ro7lem $tatement
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 7, July !1"# I$$% &"' ( "')&

7 + , !1", IJAFRC All Ri-hts Reserved ...#i/afrc#or-

-or otaining a !o,erful %loud ser+i%es for the *ANE( users, a%%essing of the stale &nternet is re0uired.
ut e%ause of the in%reasing s!eed of the +ehi%les, the +ehi%les 0ui%kl) mo+e into and out of the
%ommuni%ation rage of the gate,a). So !ro!er dis%o+er) of the gate,a) and dis!at%hing that gate,a)
made signifi%ant im!a%ts on the 0ualit) of ser+i%es of %loud ser+i%es. A gate,a) dis%o+er) me%hanism is
used to !ro!ose for dis%o+ering and sele%ting !ro!er &nternet gate,a)s in *ANE( en+ironment and
!ro+ide ser+i%es +ia it.

5# $ystem ?odel

(he net,ork ar%hite%ture of the s)stem is de!i%ted in -igure 3. (he element in+ol+ed in the s)stem
in%ludes4



Fi-ure 1# %et.or4 architecture
1# 2ate.ay

/ate,a) is a entit) that is going to %onne%t the &nternet dire%tl) through 5iMA6, 5i.-i, or %ellular
net,orks. &t is getting diffi%ult to a%%ess the &nternet ser+i%es in a stale manner +ia the stationar)
gate,a). (o o+er%ome the limitations of the stationar) gate,a)s, moile gate,a)s are taking into
%onsideration to im!ro+e the &nternet ser+i%es. A%%ording to the moilit) of gate,a), there are mainl)
t,o t)!es of the gate,a)s are %onsidered in this !a!er, namel) the stationar) gate,a) and the moile
gate,a). Stationar) /ate,a) (S/) is a !art of the roadside infrastru%ture su%h as a%%ess !oints (APs) of
5i.-i or 5iMA6, or ase stations (BSs) of %ellular net,orks. Moile
/ate,a) (M/) is the +ehi%les ,hi%h %an e dire%tl) %onne%ted to the &nternet.

# Client Vehicle

Client *ehi%le (C*) is the +ehi%le that ,ants to %onne%t to the &nternet through a Stationar) /ate,a)(S/)
or a Moile /ate,a)(MB) for a%%essing the %loud ser+i%es.

&# Cloud $ervices

Cloud %om!uting is the use of %om!uting resour%es that are deli+ered as a ser+i%e o+er the net,ork.
Cloud Ser+er is ser+i%e !ro+ider in the %loud. (he %loud users are not ale to manage the %loud
infrastru%ture and the !latform on ,hi%h a!!li%ation is running. (his eliminates the need to install and
run the a!!li%ation on a %loud user7s o,n %om!uters that sim!lifies maintenan%e and su!!ort. 8sers used
to a%%ess %loud %om!uting using net,orked %lient de+i%es, su%h as a deskto! %om!uters, la!to!s, talets
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 7, July !1"# I$$% &"' ( "')&

' + , !1", IJAFRC All Ri-hts Reserved ...#i/afrc#or-
and Smart!hone9s. Some of these de+i%es . %loud %lients . rel) on the %loud %om!uting for all or the
ma:orit) of their a!!li%ations ,hi%h are to e an essentiall) useless ,ithout using it.

III# 2A61@A> 3I$C;V1R> A00R;ACA1$

Mainl) three a!!roa%hes are used for dis%o+er) of the gate,a) de!ending on ,ho initiates the !ro%ess of
dis%o+er) are as gi+en elo,.

A# 0roactive 2ate.ay 3iscovery
3. &n !roa%ti+e gate,a) dis%o+er) a!!roa%h, /ate,a) !eriodi%all) road%asts its Advertisement
Message to all the %lient +ehi%les !resent in the net,ork ,hi%h is ,ithin a transmission range of
the gate,a).
;. Client *ehi%les on re%ei+ing the ad+ertisement message sends a "e0uest to Conne%t to the
internet through the gate,a).
<. Client +ehi%les that alread) ha+e a route to the gate,a) u!date their route entr) for the gate,a).
Client +ehi%les that alread) ha+e a route to the gate,a) u!date their route entr) for the gate,a).
Ne=t, this ad+ertisement is for,arded ) the %lient +ehi%les to other %lient +ehi%les residing in
their transmission range.
>. After getting the re0uest message from %lient +ehi%le, /ate,a) re!lies either a !ositi+e or a
negati+e res!onse ) sending a "es!onse to Conne%t message
?. (he %onne%tion from the %lient +ehi%le through the gate,a) to the %loud is thus uilt

&n !roa%ti+e gate,a) dis%o+er) a!!roa%h, gate,a)s are !eriodi%all) road%asts ad+ertisement messages
to all the %lient +ehi%les !resent in the net,ork ,hi%h is ,ithin a transmission range of the gate,a).
Client +ehi%les that alread) ha+e a route to the gate,a) u!date their route entr) for the gate,a). Ne=t,
this ad+ertisement is for,arded ) the %lient +ehi%les to other %lient +ehi%les residing in their
transmission range. (o assure that all %lient +ehi%les ,ithin the moile ad ho% net,ork re%ei+e the
ad+ertisement. &t means gate,a) initiates the dis%o+er) !ro%ess. (he time et,een t,o %onse%uti+e
ad+ertisements must e %hosen ,ith %are so that the net,ork is not flooded unne%essaril). As %lient
+ehi%le re%ei+e ad+ertisement message, it send a re0uest message to the ad+ertising gate,a) to reser+e
it. (hen gate,a) sends reser+ation message to %lient +ehi%le as an a%kno,ledgement that the gate,a) is
read) to !ro+ide internet %onne%tion.


Fi-ure # 0roactive -ate.ay discovery

International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 7, July !1"# I$$% &"' ( "')&

B + , !1", IJAFRC All Ri-hts Reserved ...#i/afrc#or-
(he %onne%tion from the %lient +ehi%le to the %loud through the gate,a) is thus uilt. (his a!!roa%h
a%hie+es good %onne%ti+it) ut results in high o+erhead. (his a!!roa%h hel!s di+ide the net,ork into
man) sunets, ,here the numer of sunets is e0ual to the numer of gate,a)s in +ehi%ular ad ho%
net,ork (*ANE().

5# Reactive 2ate.ay 3iscovery

(he rea%ti+e gate,a) dis%o+er) is initiated ) a moile node that is to initiali1e or u!date information
aout the gate,a). (he %lient +ehi%le road%asts a Soli%itation message to all gate,a)s ,ithin a
transmission range. As the gate,a) re%ei+ed the Soli%itation message, it sends a%k its o,n
Ad+ertisement message to the re0uesting %lient +ehi%le. As %lient +ehi%le re%ei+e ad+ertisement message,
it send a re0uest message to ad+ertising gate,a) to reser+e it. (hen gate,a) sends reser+ation message
to %lient +ehi%le as an a%kno,ledgement that gate,a) is read) to !ro+ide internet %onne%tion. (hus the
%onne%tion from the %lient +ehi%le to the %loud through the gate,a) is uilt. (he ad+antage of this
a!!roa%h is that re0uests are sent onl) ,hen a moile node needs the information aout rea%hale
gate,a)s. Hen%e, !eriodi% flooding of the %om!lete +ehi%ular ad ho% net,ork, ,hi%h is the disad+antage
of !roa%ti+e a!!roa%h is !re+ented. (he disad+antage of rea%ti+e gate,a) dis%o+er) is that the load on
for,arding moile nodes, es!e%iall) on those %lose to a gate,a), is in%reased. (his a!!roa%h in%urs lo,
o+erhead for small net,orks ut suffers from !oor s%alailit).


Fi-ure &# Reactive -ate.ay discovery

C# Ay7rid 2ate.ay 3iscovery

H)rid a!!roa%hes %omine rea%ti+e and !roa%ti+e gate,a) dis%o+er) strategies. -or moile nodes in a
%ertain range around a gate,a), !roa%ti+e gate,a) dis%o+er) is used. Moile nodes residing outside this
range use rea%ti+e gate,a) dis%o+er) to otain information aout the gate,a). (he gate,a) !eriodi%all)
road%asts a re0uest message ,hi%h is transmitted after e=!iration of the gate,a)9s timer. &t %onsists of
sele%ting the +alue of the time to li+e (((@) of gate,a) ad+ertisements ased on the numer of ho!s
et,een the gate,a) and the sour%e nodes. All moile nodes residing in the gate,a)9s transmission
range re%ei+es it. 8!on re%ei!t of the message, the moile nodes that do not ha+e a route to the gate,a)
%reate a route entr) for it in their routing tales. Moile nodes that alread) ha+e a route to the gate,a)
u!date their route entr) for the gate,a). Ne=t, the re0uest message is for,arded ) the moile nodes to
other moile nodes residing in their transmission range. (he ma=imal numer of ho!s a re0uest %an
mo+e through the moile ad ho% net,ork defines the range ,ithin ,hi%h !roa%ti+e gate,a) dis%o+er) is
used. 5hen a moile node residing outside this range needs gate,a) information, it road%asts a re0uest
to the all the gate,a). Moile nodes re%ei+ing the re0uest :ust reroad%ast it. 8!on re%ei!t of this
re0uest, the gate,a) uni%asts a%k a re!l) message. &n this ,a), oth a!!roa%hes are used to %onne%t
%lient +ehi%les to the %loud. (he main !ur!ose of this a!!roa%h is to redu%e the %ontrol o+erhead due to
the rea%ti+e dis%o+er) s%heme ,hen there are man) sour%e nodes in the *ANE(. (his a!!roa%h also aims
International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 7, July !1"# I$$% &"' ( "')&

&! + , !1", IJAFRC All Ri-hts Reserved ...#i/afrc#or-
to redu%e the o+erhead of the !roa%ti+e !roto%ols ,hen the numer of gate,a)s in%reases. &n this
a!!roa%h, the determination of the est ((@ is therefore not straightfor,ard e%ause the net,ork
%onditions %hange fre0uentl).

IV# ?16A;3;C;2>

$esign of %loud A assisted gate,a) dis%o+er) s)stem for *ehi%ular Ad ho% net,ork is dis%uss in this
!a!er. (his s)stem aims for a%%essing %loud ser+i%es from +ehi%ular ad ho% net,orks BCD and e+aluated
the !erforman%e !arameter like !a%ket deli+er) ratio. (he gate,a) dis%o+er) algorithm for sele%ting and
dis!at%hing est gate,a) using rea%ti+e a!!roa%h is sho,n in -igure >. (he %lient +ehi%le road%ast BED
re0uest messages C*F"E2F/5 to all gate,a)s ,ithin its hearing range. At first, /ate,a) nearest to %lient
+ehi%le res!onse to re0uest and sele%ts as the !ortal to the internet until it is o+erloaded and send
a%kno,ledgement message /5FACG to re0uesting %lient +ehi%le. Hn%e it e%omes o+erloaded, ne=t
nearer gate,a) is sele%ted as est gate,a) to !ro+ide ser+i%e to %lient +ehi%le. (hen C* re0uesting for
data to %loud ) sending C*F"E2F$A(A message through sele%ted gate,a). Cloud send ACGF$A(A
message as an a%kno,ledgement that ,hether the re0uesting data is a+ailale or not to re0uesting C*.
Hn%e it gets a%kno,ledgement, %lient +ehi%le send C*F"$IF$A(A message to %loud ,hen it e%omes
read) to a%%e!t data. &n this ,a), data is transmitted from %loud to %lient +ehi%le through !ro!er gate,a).



Fi-ure "# 2ate.ay discovery and dispatchin- process
V# C;%CC=$I;%

International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 7, July !1"# I$$% &"' ( "')&

&1 + , !1", IJAFRC All Ri-hts Reserved ...#i/afrc#or-
(his !a!er aims to !ro!ose a gate,a) dis%o+er) me%hanism to get stale %onne%tion to the &nternet for
a%%essing %loud ser+i%es from the +ehi%ular ad ho% net,ork. Hut of three dis%o+er) a!!roa%hes, h)rid
gate,a) dis%o+er) a!!roa%h ,ill gi+e the est !erforman%e as it redu%e the %ontrol o+erhead due to the
rea%ti+e dis%o+er) s%heme ,hen there are man) sour%e nodes in the *ANE( and also aims to redu%e the
o+erhead of the !roa%ti+e !roto%ols ,hen the numer of gate,a)s in%reases. &n this !a!er, the !a%ket
deli+er) ratio of the stationar) gate,a) and moile gate,a) are in+estigated. As sho,n in the simulation
results, moile gate,a)s out!erform stationar) gate,a)s. (he !a%ket deli+er) ratio of the moile
gate,a) is higher than that of the stationar) gate,a)s. As +elo%it) of %lient +ehi%le in%reases, the !a%ket
deli+er) ratio de%reases for oth the gate,a)s.

R1F1R1%C1$
B3D Ien.5en @in, Jie.Min Shen, Hao.Chun 5eng. /ate,a) $is%o+er) in *ANE( CloudK &nternational
Conferen%e on High Performan%e Com!uting and Communi%ation, &EEE, ;L33.
B;D ". Bu))a (eds.). Cloud Com!uting4 Prin%i!les and ParadigmsK 5ile), ;L3L.
B<D @ /illam (eds.). Cloud Com!uting4 Prin%i!les, S)stems and A!!li%ations, MS!ringer, ;L3L.
B>D >. Ien.5en @in, Jie.Min Shen and Hao.Chun 5eng MCloud. Assisted /ate,a) $is%o+er) for
*ehi%ular Ad Ho% net,orkK &nternational Conferen%e on High Performan%e Com!uting and
Communi%ation, &EEE, ;L33.
B?D Bernard M. /ate,a) $ete%tion and Sele%tion for 5ireless Multiho! &nternet A%%essK, Master9s
thesis, (Hl%hing,
BND /erman)), ;LL;.
BCD 6i J, Bettstetter C. 5ireless Multiho! &nternet A%%ess4 /ate,a) $is%o+er), "outing and
Addressing, in Pro%eedings of the &nternational Conferen%e on (hird /eneration 5ireless and
Be)ond (</,ireless9L;), San -ran%is%o, 8SA, ;LL;.
BED A Benslimane, S Barghi, C Assi. An Effi%ient "outing Proto%ol for Conne%ting *ehi%ular Net,orks
to the &nternet,K Per+asi+e and Moile Com!uting, *ol. C, !!. OE.33<, ;L33.
BOD *inod Namoodiri. Student Memer, &EEE, and @i=in /ao, Memer, &EEE MPredi%tion. Based
"outing for *ehi%ular Ad Ho% Net,orks,K &EEE (ransa%tions Hn *ehi%ular (e%hnolog), *ol. ?N, >,
;LLC.
B3LD JPnsson 8, Alriksson -., @arsson (, Johansson P, Maguire / 2. M&PMANE(.Moile &P for Moile Ad
Ho% Net,orks, in Pro%eedings of the 5orksho! on Moile Ad Ho% Net,orking and Com!uting
(MoiHo%), Boston, 8SA, ;LLL.