|
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 |
Link Life Based Routing
Link Life Mechanism
The Link Life Mechanism can be categorized as an on-demand routing and a table-driven protocol. The protocol selects the most stable path and not the shortest path. When ever a node transmits a packet, its neighbors listen to the transmission and update in there table the signal strength information. Signal strength information is converted to distance and is saved in a table with the time received this information. The link life gives us now quality information of a route, calculated from this information. Route discovery A route Request is broadcasted to the network. All the nodes forward the packet and add here link life information and node number to the packets. Of cause a node is forwarding the packet only one time. Route selection When now the destination has received some route requests the destination compares the link life information and calculates for all the routes the PLT (Path Life Time). The destination sends know a route reply to the sender through the path with the best PLT. Paper: LBR "Link Life Based Routing" is mentioned on: Ad-Hoc Protocols (Classification) | Ad-Hoc Workshop Winter 04/05 (Termine) |