番茄花园-Pune,India,13–15December2010.pptVIP

Self Introduction 2000 - 2003 Master – Sun-yetsen Univ., China 2003 – 2006 WCDMA, NORTEL, G.D. China 2006 – now Doctor course, RA, Waseda Univ., Japan Interests: WMN, P2P Pune, India, 13 – 15 December 2010 ITU-T Kaleidoscope 2010Beyond the Internet? - Innovations for future networks and services Guowei CHEN GITS, Waseda University, Tokyo JP. davidchen@aoni.waseda.jp A scheme for Disaster Recovery in Wireless Networks with Dynamic Ad-hoc Routing Pune, India, 13 – 15 Dec 2010: ITU-T Kaleidoscope 2010 – Beyond the Internet? Innovations for future networks and services * Before Disaster Research Background BS BS BS CS CS backbone BS Mobile node Pune, India, 13 – 15 Dec 2010: ITU-T Kaleidoscope 2010 – Beyond the Internet? Innovations for future networks and services * After Disaster Research Background (cont.) ad-hoc mode cellular mode damaged BS BS BS BS CS CS backbone Pune, India, 13 – 15 Dec 2010: ITU-T Kaleidoscope 2010 – Beyond the Internet? Innovations for future networks and services * How to route to a BS? Problem to solve S B C2 C1 G BS Presumptions After disaster, mobile nodes of a cell are operational (even the BS is down). A mobile node has two interfaces for Cellular connection Ad-hoc connection A node knows its location (via GPS) A node knows location of BSs (pre-stored) Beaconing Routing Periodic broadcast Route table not always updated Beaconless Routing AP search Procedures: Achieves own location via GPS Finds out near-around BSs or moving TRs. Go thru all the above BSs or TRs, from close to far. For each a BS or TR, performs BLR routing. Beaconless routing (cont.) S A3 A4 A2 A1 E D G BS β=60° Steps of routing: (S - D) S broadcasts a packet, and all the neighbors (within radius r) can receive it (A1, A2, A3, A4). But only the neighbors within the 60°sector schedules a packet forward (A1, A2) A1, A2 performs a DFD (Dynamic Forward Delay) mechanism or Simulation Model node working as gateway node in ad-hoc mode test area working antenna Rando