Virtual Surrounding Face Geocasting in
Wireless Ad Hoc and Sensor Networks
GUIDE : Ms.SelviRavindran
Dept.of CSE,
College of Engineering,Guindy.
P.Sathya
200835317
M.Tech(IT)/III SEM
Abstract :
Geocasting in wireless sensor and ad hoc networks means delivering a message from a source
node to all the nodes in a given geographical region. The objectives of a geocasting protocol are
two-fold: guaranteed message delivery and low transmission
cost. Most of the existing protocols do not guarantee message delivery,
and those that do, incur high transmission costs. In this study, we propose the concept of Virtual
Surrounding Face (VSF), and design a VSF-based geocasting protocol (VSFG).
To also design a SKIP method and a local dominating set (DS) based restricted flooding
technique to further reduce the cost of VSFG. Through mathematical analysis and
comprehensive simulations, To show that VSFG, together with SKIP and local DS
based restricted flooding, guarantees message delivery and has a much lower transmission cost
than the previous approaches. The reduction of cost can be up to 65% compared with the most
efficient existing approach.
VSF forwarding :
● A source delivers a geocasting message to a node on the boundary of VSF, called a VSF
node, by using location-based routing.
Rule:
● If a node u is an external node of R and an end point of a crossing edge of R, then u is a
VSF node.
VSF Traversal :
The VSF node initiates a face traversal in which all the nodes on the VSF receive a copy of the
message
Rule:
● VSF nodes are connected via a crossing edge that connects two internal and external
border nodes.
● The VSF nodes are connected via an external c rossing edge.
Termination Condition:
● Assume that aVSF node u receives a traversal message MSG1(s,R,i1,trav(v1,u,Rule1)
from node v1 but u does not forward MSG1 to other nodes yet.only u receives another
message MSG2(s,R,i2,trav(v2,u,Rule2) from v2,u terminates traversal if the condition is
True:
(next(u,MSG1)=v2)AND (next(u,MSG2)=v1) AND (Rule1≠Rule2).
Restricted flooding:
● Nodes in R that overhear the face traversal message perform restricted flooding within R.
A. Guaranteed Message Delivery in VSFG
Guaranteed message delivery is justified due to three properties
Property 1:
● For every node outside a VSF transmitting a message to a node in a geocasting region R
on top of GG(V) , the message must pass through at least one VSF node.
● Let S-(f1,f2….Fk} be the set of faces that intersect R on GG(V), and S be the set of nodes
not in R but on the boundary of Fi for an arbitrary i(1≤i≤k).
Property 2:
● Visiting all nodes in S and performing restricted flooding within R is sufficient to ensure
delivery.
Property 3:
● Each node in S is located on the boundary of the VSF formed by VSFG.
Guaranteed Message Delivery in VSFG
Property 4:
● VSFG1 guarantees delivery of the geocasting message to all VSF nodes of the geocasting
region R.
Property 5:
● VSFG1 ensures delivery of geocasting message to all internal border nodes of the
geocasting region R.
Guaranteed Message Delivery in VSFG
● The difference of VSFG1 and VSFG2 is that uses DS-based restricted flooding.
Skip Algorithm: (VSFG1 Construction)
• Condition 1: node x can determine whether u and v are Gabriel neighbors of each
other.
• Condition 2: node x can determine whether v is the next traversed node with respect
of u .
DOMINATING-SET-BASED RESTRICTED FLOODING : (VSFG2)
Local DS construction is performed by each internal node u
which overhears a geocasting MSG. Assume that each node
has a unique ID. Once u overhears an MSG with a geocasting
region R and u has not broadcasted the MSG yet, u computes
and maintains four neighbor sets below:
• Ntx(u): the set of UDG neighbors of which have already transmitted the MSG (the MSG
can be either a VSF traversal message or a broadcasting message with ).
• Nrx(u): the set of UDG neighbors of u such that for Nrx(u),v is the internal node of R and
v has not transmitted the MSG yet.
VSFG Protocol construction :
1.To introduce the concept of VSF, and present an algorithm (VSFG) based on VSF to
achieve geocasting with guaranteed message delivery.
2.To propose a SKIP algorithm to let nodes skip some intermediate nodes during face
traversal. Few further propose a local DS-based restricted flooding algorithm to reduce
transmissions compared with simple restricted flooding. VSFG combined with SKIP is
called VSFG1 , and VSFG1 combined with DS is called VSFG2.
3) The RFIFT (Restricted Flooding with Intersected Face Traversal)
geocasting has the lowest transmission cost among all known existing algorithms. The
message complexities of RFIFT is bounded by 3n+k, where n is the number of nodes
on the boundary of the faces intersecting a geocasting region R but not in R, and k is
the total number of nodes within R . In our VSFG algorithm, the bound has been
reduced to 2n+k.
4) In VSFG1 and VSFG2 , each node in a network only needs to maintain the
information of its one-hop neighbors. To compare RFIFT, VSFG1 and VSFG2
through extensive simulations in different environments. From simulation results,
can reduce up to 65% of the total number of messages required by RFIFT.
Data Structures Used:
Unit Disk Graph:
● UDG is a simplified model of wireless networks in which all nodes have an identical
transmission range
● Let UDG(V)denote a UDG, where V is a set of nodes whose transmission radii are
normalized to 1.
Planar Graph and Gabriel Graph (GG) :
● To planarize UDG(V) a , a sub-graph of , called a Gabriel graph
(GG).
● A Gabriel graph GG(V) is : for any two nodes u and v ,
if d(u,v) ≤ 1 and ◉(u,v)and does not contain any nodes other than
u and v, then euv €GG(v).
Virtual Surrounding Face :
For any two faces that share an edge, if the shared edge is ignored, the two faces are
merged into one face with a larger area. For a geocasting region , if repeatedly merge all
faces intersecting With R by ignoring the edges intersecting the boundary of R, it will
eventually find a face large enough to contain .
This face is called a virtual surrounding face (VSF) of R
Analytical Performance Comparison :
Three costs for base networks with 3 X 1.5 geocasting regions.
Flow Chart :
Face traversal
Termination Condition ?
Restricted flooding
Skip Algorithm
DS based restricted Algorithm
Forwards the message
USE CASE Diagram:
Network Topology
Gabriel graph
VSF Forwarding
Face traversal Rule
Restricted Flooding
Comparison of RFIFT,VSFG
USE CASE diagram:VSFG1
VSFG
SKIP Algorithm
Comparison of RFIFT,VSFG,& VSFG1
USE CASE diagram:VSFG 2
Comparison of RFIFT,VSFG,,VSFG1 &VSFG2
VSFG1
DS based Restricted Flooding
Architecture Diagram :
VSFG PROTOCOL
VSFG2 PROTOCOL
VSFG1
VSF FORWARDING
VSF TRAVERSAL
RESTRICTED FLOODING
SKIP ALG
DS BASED RESTRICTED ALG
VSFG :
Restricted flooding
Termination condition
Face Traversal Rule
Identify the border nodes
Gabriel graph
Unit Disk Graph
Network topology
VSFG 1:
SKIP
Algorithm
VSFG
VSFG2 :
DS based restricted Algorithm
VSFG1
