Broadcasting in Ad hoc networks based on Self pruning.pptVIP

 Non restricted mobility Broadcasting: Basic vehicle for on demand routing Available resources for node mobility Broadcasting in Ad hoc networks Types of Broadcasting Flooding Probabilistic based Methods Area based methods Neighbor Knowledge Methods Broadcasting in Ad hoc networks Neighbor Knowledge methods Connected Dominating Set( CDS) Neighbor Designating method (Dominant Pruning) Self Pruning Self pruning Self pruning Assumptions Moderate mobility Near to accurate K-hop information (for small K) Basics Forwarding or non-forwarding status Before a broadcast packet is received After the first copy is received After many copies of the packet are received. Static approach ( “up to date”) CDS based on network topology Dynamic approach ( “On the fly” ) Dependent on the location of the source and progress of the broadcast process Neighbor Set Coverage On arrival at node v , the packet contains Information D(v) : this is the information about the “h” most recently visited nodes. Coverage Condition 1 ( static)  “Node v has a non-forward node status if for any two neighbors u and w, a replacement path exists that connects u and w via several intermediate nodes (if any) with higher priority values than the priority value of v.” In other words, assume that v is a non-forward node. Let N(v) be the neighbor set of node v, then for any u, w N(v), a replacement path (u, u1, u2, ..., ul, w) exists such that id(ui) id(v) for 1 ≤i ≤ l. Replacement paths Max-min node for (u, w, v) : A minimum node in a path is a node with the lowest priority. Assume {Pi} is the set of replacement paths for node v that connect u and w. A max-min node in {Pi} is a node with the highest priority among all the minimum nodes in {Pi}. Next we define a procedure called MAXMIN to construct a maximal replacement path for v that connects u and w. MAXMIN(u,w, v): 1: if u and w are directly connected then return . 2: Find the max