proposal_pres - HocNetwork Group4 YilinShen,ZhengLi...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  Problem An accident on a highway Evacuation is needed ASAP. A vehicle who received evacuation message will  broadcast it to others. Main concern: latency A rescue team after an earthquake.  No fixed APs.  Rescuers must communicate to all team members. 
Background image of page 2
  Advantage Wireless Broadcast Advantage Challenges exist in MANAT.  Interference  Synchronization Overhead reduced by mobility Why existing work isn’t satisfying? 
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  Models (informally) Network model Each node has a transmission range  r  and a  interference range  f ,   r<f . Nodes can have varied r and f. r f v 1
Background image of page 4
  Models (informally) contd.  Interference model Mobility model v 1 u v 2 v 1 u
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  Objectives Minimize latency Latency: time delay for the message to propagate  over the network. Minimize consumed energy Can be calculated from the total time for  transmitting signals.
Background image of page 6
  Approach1: Global Info Available Assumption:  1. global information is available before each  broadcast.  2. Network topology won’t change during a single  broadcast. coloring && dominating set.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  An example A D B E F C G A D B E F C G A D B E F C G A D B E F C G A D B E F C G Naïve  solution Our ideal 
Background image of page 8
  How to schedule? Message propagates from layer to layer. Layer: BFS, k-hop neighbors form the k-th layer Schedule the transmission inside and between  each layer. How? 1. Dominating sets: First transmit to dominating set (DS). Then DS to  others.
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  Back to the example A D B E F C G A D B E F C G A D B E F C G A D B E F C G A D B E F C G layer  1 layer 2
Background image of page 10
  How to do coloring? In a simple graph, 5 colors are enough. Does it 
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 12
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/27/2011 for the course CIS 4930 taught by Professor Staff during the Spring '08 term at University of Florida.

Page1 / 31

proposal_pres - HocNetwork Group4 YilinShen,ZhengLi...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online