SECAN-Lab
   Home
   News

Projects
   SECAN-LAB
   Mesh Sequencer
   U-2010
   NARTUS
   EFIPSANS
   IRMA
   SECRICOM

The Group
   Members
   Publications
   Theses
   Teaching
   Presentations

Topics
   Mobile Computing
   Ad-Hoc Networks
   Ad-Hoc Protocols
   Mesh Computing
   Trust

Related Stuff
   L-101 Laboratory Systems
   AS28 Systems
   802.11 Network Simulator
   Internships
   Conferences
   Publications
   Standards
   Projects
   Links
   Partners
   OSTN

Miscellaneous
   Contact
   About
   Job Opportunities
   Search

Broadcast Resolution Protocol

BRP

The Bordercast Resolution Protocol (BRP) provides the packet delivery service. The BRP uses a map of an extended routing zone, provided by the local proactive Intrazone Routing Protocol (IARP), to construct bordercast tree. A node send a query outward to its peripheral nodes along a bordercast tree also named multicast tree. After receiving this packet, the BRP from the node marks the interior nodes of the previous bordercasting node as having been "covered" by the query. If this node is the peripheral node of the previous bordercaster it marks the interior nodes of its own routing zone as "covered". Now queries will be steered away from the covered nodes.
A query control mechanisms helps to steer the queries away from covered regions. Nodes should be able to detect when the routing zones, they belong to, have been covered by a query and the protocol should be able to terminate a query before it is sent to a peripheral node which is already covered by the query. But if queries are relayed by IP, the query will not be detected again until it reappears at the target peripheral nodes.
All nodes in the bordercast tree are going to detect the query if query forwarding is performed within the routing zone (QD1).
Further query detection is possible in shared channel networks. In this case, nodes may overhear a query even if they do not belong to the bordercast tree (QD2).
Another query route mechanism is the Early Termination (ET). A node will not relay a packet down a branch of the bordercast tree if each of the peripheral nodes that lies inside the routing zone of a previous bordercasted node, or if this node has already relayed the query to that peripheral node.

The combination of multicasting and zone based query control makes bordercasting very efficient. It's more suitable than flooding the whole network.



Nodes G, B, C, D, H did received the packet. With BRP they will not receive the packet twice.

References

[Haas2001c] Original internet draf
[Haas2002b]
[Schaumann2002] Picture

"Broadcast Resolution Protocol" is mentioned on: Ad-Hoc Protocols (Classification) | Ad-Hoc Protocols (History) | Interzone Routing Protocol | Zone Routing Protocol

(C) 2004-2006 University of Luxembourg, SECAN-Lab

Printable Version
VeryQuickWiki - HTML Export
Version: 2.7.1 (UniLux: 1.15.0 2006-01-19)
Modified: 2005-07-05 14:58:01
Exported: 2010-03-14 02:38:25