1 / 11

draft-cardenas-dff-05.txt

draft-cardenas-dff-05.txt. March 26, 2012 Ulrich Herberg (Fujitsu). Background. Advanced Metering Infrastructure (AMI) based on unreliable wireless links Mesh topology Non-mobile nodes, but dynamic topology 802.11 / 802.15.4 link layer

keahi
Download Presentation

draft-cardenas-dff-05.txt

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. draft-cardenas-dff-05.txt March 26, 2012 Ulrich Herberg (Fujitsu)

  2. Background • Advanced Metering Infrastructure (AMI) based on unreliable wireless links • Mesh topology • Non-mobile nodes, but dynamic topology • 802.11 / 802.15.4 link layer • Problems with relying completely on the control-plane to update routes • Control plane may not yet have converged • High control overhead for fixing paths (reactive or proactive routing protocol)

  3. Problem Statement • Reactive Protocols • If a link is unstable, RREQ may be required to repair the route • The RREQ flood in the network in turn may lead to collisions and further packet loss • Repeating this process, the network may become unstable • Proactive Protocols • Invalid routes until protocol converges

  4. Solution Approach • Instead of increasing repair / route update frequency in the control plane, use data plane • Find alternate paths • Detect loops • Update / poison routes • No pre-computed alternative routes in control place 1. Exchange control traffic 3. Forward packet Control plane Data plane 2. Calculate routes 3. Fill routing table 2. Find route 1. Receive packet Router operating system

  5. Mechanism • General idea: • If standard forwarding to next hop fails, try alternate neighbors in a DFS fashion • When all neighbors unsuccessfully tried, return packet to parent • When loop detected (detected by storing sequence numbers), update routing table (“poison route”) e ⇒ b a ⇒ d Example: source e a b c c d a c a b b f c d b e f b b f a d a c f loop a e e d f d d e destination d f c c e c e a d c e b e b e b b a b c f a c Network topology Search Tree Search Tree

  6. Headers

  7. Information Sets • (P_orig_address, P_seq_number, P_prev_hop, P_next_hop_neighbor_list, P_time) • where • P_orig_address is the Originator Address of the received frame; • P_seq_number is the Sequence Number of the received frame; • P_prev_hop is the Source Address (i.e. the previous hop) of the frame; • P_next_hop_neighbor_list is a list of next hops to which the frame has been sent previously; • P_time specifies when this Tuple expires. • Access required to list of bidirectional neighbors

  8. DUP Flag

  9. Approach Advantages • Fewer control traffic messages • Fewer collisions when flooding the network • Increased reliability of the network DV+DFF Nodes Figure: Delivery ratio (from network simulation, source: [3])

  10. DFF Deployments • US • Field test on-going at KCEC (AMI + Internet service) • Full scale will be 2,100 nodes • Press release http://www.kitcarson.com/index.php?option=com_content&view=article&id=45&Itemid=1 • Japan • Large deployments

  11. References Smart Meter GW • [1] Depth-First Forwarding in Unreliable Networks • [Herberg, Cárdenas, Céspedes, Iwao. draft-dff-cardenas] • [2] Dynamic Data Forwarding in Wireless Mesh Networks • [Iwao, et.al., IEEE SmartGridComm 2010] • [3] Analysis of Data Forwarding Mechanisms in Unreliable Networks • [Céspedes, Cárdenas, Iwao. IEEE Innovative Smart Grid Technologies Conference 2012]

More Related