SlideShare ist ein Scribd-Unternehmen logo
1 von 93
Downloaden Sie, um offline zu lesen
Infrastructure-less
Wireless Networks
Gwendal Simon
Department of Computer Science
Institut Telecom
2009
Literature
Books include:
    “Algorithms for sensor and ad hoc networks”,
    D. Wagner and R. Wattenhofer
    “Wireless sensor networks: an information
    processing approach”, F. Zhao and L. Guibas

and journal/conferences include:
     ACM SigMobile (MobiHoc, SenSys, etc.)
     IEEE MASS and WCNC
     Elsevier Ad-Hoc Network, Wireless Networks
2 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Motivations
Current wireless net. require an infrastructure:
    cellular network: interconnected base stations
    wifi Internet: an access point and Internet




3 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Motivations
Current wireless net. require an infrastructure:
    cellular network: interconnected base stations
    wifi Internet: an access point and Internet

Same flaws than centralized architectures:
   cost
   scalability
   privacy
   dependability

3 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Motivations
Sometimes, there is no infrastructure
   transient meeting
   disaster areas
   military interventions
   alter-communication




4 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Motivations
Sometimes, there is no infrastructure
   transient meeting
   disaster areas
   military interventions
   alter-communication

Sometimes not every station hear every other station
   limited wireless transmission range
   large-scale area

4 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Multi-hop Wireless Networks
Nodes: portable wireless devices
   transmission ranges do not cover the area
   density ensures network connectivity

Links: wireless characteristics
    transmission model: local broadcasting
    energy consumption: transmission is costly

Behavior: devices emit, receive and forward data

5 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
A Taxonomy of
                         Applications




6 / 41   Gwendal Simon    Infrastructure-less Wireless Networks
Ad-Hoc vs. Sensor Networks

                             Ad-Hoc Networks            Sensor Networks
                   nodes     powerful wifi devices       tiny zigbee nodes
              algorithms       all-to-all routing          echo to sink
                 mobility   human or car motions              failures
     performance criteria     quality of service       energy consumption




7 / 41     Gwendal Simon          Infrastructure-less Wireless Networks
Ad-Hoc Applications
Delay-Tolerant Network (social media application)
    assumption: no connectivity, but high mobility
    objective: ensuring eventual message delivery




8 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Ad-Hoc Applications
Delay-Tolerant Network (social media application)
    assumption: no connectivity, but high mobility
    objective: ensuring eventual message delivery

Mesh Networks (rural wireless coverage)
   assumption: some nodes have Internet access
   objective: maintaining path to these nodes




8 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Ad-Hoc Applications
Delay-Tolerant Network (social media application)
    assumption: no connectivity, but high mobility
    objective: ensuring eventual message delivery

Mesh Networks (rural wireless coverage)
   assumption: some nodes have Internet access
   objective: maintaining path to these nodes

Vehicular Ad-Hoc Networks
    assumption: a particular mobility model
    objective: mostly services related to car safety
8 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Sensor Network Applications
Sink-Based Networks (monitoring of natural areas)
    assumption: one sink retrieves all sensed data
    objective: increasing life-time




9 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Sensor Network Applications
Sink-Based Networks (monitoring of natural areas)
    assumption: one sink retrieves all sensed data
    objective: increasing life-time

Mobile Object Tracking (area surveillance)
   assumption: sensors know their location
   objective: determining hostile position




9 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Sensor Network Applications
Sink-Based Networks (monitoring of natural areas)
    assumption: one sink retrieves all sensed data
    objective: increasing life-time

Mobile Object Tracking (area surveillance)
   assumption: sensors know their location
   objective: determining hostile position

Multi-Sink Networks (intervention teams)
   assumptions: mobile sinks and fixed sensor
   objectives: increasing sink coverage
9 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Short Introduction
                          to Popular Models




10 / 41   Gwendal Simon     Infrastructure-less Wireless Networks
Network as a Graph


Unit-Disk Graph:
                                                              05        03


→ node position
                                                    07
                                                                         09

→ circular transmission                                       12
                                                                              11
                                                                                    06

                                               10
                                                         01
→ boolean connections
                                          02
                                               00                  08              04




 11 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Network as a Graph


Unit-Disk Graph:
                                                              05        03


→ node position
                                                    07
                                                                         09

→ circular transmission                                       12
                                                                              11
                                                                                    06

                                               10
                                                         01
→ boolean connections
                                          02
                                               00                  08              04




 11 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Network as a Graph


Unit-Disk Graph:
                                                              05        03


→ node position
                                                    07
                                                                         09

→ circular transmission                                       12
                                                                              11
                                                                                    06

                                               10
                                                         01
→ boolean connections
                                          02
                                               00                  08              04




 11 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Interferences
 Signal-to-noise-plus-interference (SINR) ratio
                               Pu
                             d(u,v )α
                                        Pw          ≥β
                     N+     w ∈V {u} d(w ,v )α


          Pu : power level of sender u
          d(u, v ): distance between u and v
          α: path-loss exponent
          N: noise
          β: minimum ratio
12 / 41     Gwendal Simon       Infrastructure-less Wireless Networks
A Tour of the Most
                          Studied Issues




13 / 41   Gwendal Simon     Infrastructure-less Wireless Networks
Broadcasting I: Stormy Effect
 Broadcast:
     a simple basic problem :
              a source emits a message
              all nodes within the network eventually receive the
              message
          a simple and efficient solution:
              upon first reception of message, forward it.


 Limits of flooding in wireless networks:
      redundant messages
      interferences
14 / 41     Gwendal Simon      Infrastructure-less Wireless Networks
Broadcasting II: Proposals
 Probabilistic flooding:
     idea: forward the message with some probability p
     drawbacks: no guarantee of delivering
     refinements: adjust p to node density




15 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Broadcasting II: Proposals
 Probabilistic flooding:
     idea: forward the message with some probability p
     drawbacks: no guarantee of delivering
     refinements: adjust p to node density

 Constrained flooding:
    idea: only some nodes forward the message
    implementation: build the Minimum
    Connected Dominating Set
    drawbacks: maintaining cost in dynamic systems
15 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Mobility Models I
 Few theoretical proof, few real implementations
 ⇒ generate realistic node motions for simulations




16 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Mobility Models I
 Few theoretical proof, few real implementations
 ⇒ generate realistic node motions for simulations

 The      simplest model: Random Waypoint
  1.      each node picks a random position uniformly
  2.      it travels toward this destination with a speed v
  3.      once it reaches it, it stops during few seconds
  4.      back to 1



16 / 41      Gwendal Simon    Infrastructure-less Wireless Networks
Mobility Models II: Improvements
 Basic Structural Flaws:
      non-uniform distribution of node location:
              higher node distribution in the center
          average speed decay:
              low speed nodes spend more time to travel

 Realistic Mobility Models:
     group movement
     area popularity
     urban models
     community-based

17 / 41     Gwendal Simon       Infrastructure-less Wireless Networks
Mobility Models II: Improvements
 Basic Structural Flaws:
      non-uniform distribution of node location:
              higher node distribution in the center
          average speed decay:
              low speed nodes spend more time to travel

 Realistic Mobility Models:
     group movement
     area popularity
     urban models
     community-based
     the most realistic one : using real traces!
17 / 41     Gwendal Simon       Infrastructure-less Wireless Networks
Localized Data Gathering
 Basic idea: query data from sensors within an area
     two rounds:
              query diffusion
              retrieve data from sensors
          main objectives:
              minimize energy consumption
              minimize the delay


 A problem related with broadcasting except:
     only sensors from the queried area are reached:
     complex queries are possible (average, max, etc.)
18 / 41     Gwendal Simon      Infrastructure-less Wireless Networks
Time Synchronization I
 Different time on nodes:
     different oscillator frequency ⇒ frequency error
     absolute difference between clocks ⇒ phase error

 The need of a common clock
     localization protocols
     some MAC protocols
     data fusion in sensor network



19 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Time Synchronization II
 Broadcasting standard time via GPS system:
  √
     precision, simple implementation
  × expensive devices
  × limited usage (outdoor environment)

 Achieve a common time distributively:
  √
     (almost) no special devices required
  √
     more tolerant to the environment
  × special protocols
  × message overhead, multi-hop delays
20 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
A Focus on
                          Routing Protocols




21 / 41   Gwendal Simon     Infrastructure-less Wireless Networks
Routing Protocols
 Objective:
     select a path between a source and a destination

 Main design challenges:
    unstable network topology
    low-cost devices (energy, computing. . . )

 Main routing mechanisms:
    neighbor discovering
    route setup
    route maintenance
22 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Proactive routing vs. On demand routing

                             Proactive        Reactive
            Setup             all-to-all     on demand
     Maintenance              regularly   during utilization
       Advantages          no setup delay no unused routes
    Disadvantages          fixed overhead long setup delay
    Main examples              OLSR            AODV




23 / 41    Gwendal Simon        Infrastructure-less Wireless Networks
AODV Route Discovery


                                                G
                                   F                          H

                           S                   B

                                   E                          D
                                               A


24 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
AODV Route Discovery

             Broadcasting
             RREQ Mes-                          G
             sage.
                                   F                          H

                           S                   B

                                   E                          D
                                               A


24 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
AODV Route Discovery


             Setting up                         G
             reverse path.
                                   F                          H

                           S                   B

                                   E                          D
                                               A


24 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
AODV Route Discovery


             Setting up                         G
             reverse path.
                                   F                          H

                           S                   B

                                   E                          D
                                               A


24 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
AODV Route Discovery


             Setting up                         G
             reverse path.
                                   F                          H

                           S                   B

                                   E                          D
                                               A


24 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
AODV Route Discovery


             Setting up                         G
             reverse path.
                                   F                          H

                           S                   B

                                   E                          D
                                               A


24 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
AODV Route Discovery


             Setting up                         G
             reverse path.
                                   F                          H

                           S                   B

                                   E                          D
                                               A


24 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
AODV Route Discovery


             Replying
             RREP to                            G
             source.               F                          H

                           S                   B

                                   E                          D
                                               A


24 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
AODV Route Discovery


             Forward path                       G
             setup.
                                   F                          H

                           S                   B

                                   E                          D
                                               A


24 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
AODV Route Maintenance


             Link breaks
             between B                          G
             and D.                F                          H

                           S                   B

                                   E                          D
                                               A


25 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
AODV Route Maintenance

             Sending
             RERR mes-                          G
             sage.
                                   F                          H

                           S                   B

                                   E                          D
                                               A


25 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
AODV Route Maintenance

             Restarting
             route discov-                      G
             ery.
                                   F                          H

                           S                   B

                                   E                          D
                                               A


25 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
AODV Route Maintenance


             New route                          G
             discovered.           F                          H

                           S                   B

                                   E                          D
                                               A


25 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
Some Tricks
 Intelligent flooding (detect close destination)
      idea: init TTL at 1, then 2, then 3. . .
      idea: flood slowly and send message to stop it




26 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Some Tricks
 Intelligent flooding (detect close destination)
      idea: init TTL at 1, then 2, then 3. . .
      idea: flood slowly and send message to stop it

 Route caching (use past flooding)
    idea: during flood, answer for a distant node
    drawback: contradict reactive routing philosophy




26 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Some Tricks
 Intelligent flooding (detect close destination)
      idea: init TTL at 1, then 2, then 3. . .
      idea: flood slowly and send message to stop it

 Route caching (use past flooding)
    idea: during flood, answer for a distant node
    drawback: contradict reactive routing philosophy

 Local maintenance (almost unchanged route)
     idea: instead of NAK s, look for d by yourself
     drawback: sometimes it does not work
26 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
A Proactive Routing Protocol: OLSR
 Objective: make use of Multi-Point Relay (MPR)
     acting as super-peers
     easing topology discovery
     handling most of the traffic

 OLSR message types:
    HELLO: discover 1-hop and 2-hop neighbors
    topology discovery through MPR



27 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Neighbor sensing


                           F                   G
                                                                       H

           S                   B

                                                                       D
                           E                   A



28 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
Neighbor sensing


                           F                         G
               Nb:{S},
                                                                             H
               2hopNb:{}
                                              Broadcasting
           S                         B        HELLO Message.
                           Nb:{S},
                           2hopNb:{}
                                                                             D
                           E                         A
               Nb:{S},
               2hopNb:{}

28 / 41    Gwendal Simon             Infrastructure-less Wireless Networks
Neighbor sensing


                             F                      G
                                                                            H

             S                       B
   Nb:{E},                   Nb:{S,E},
   2hopNb:{}                 2hopNb:{}
                                                                            D
                             E                      A
                                         Nb:{E},
                                         2hopNb:{S}

28 / 41      Gwendal Simon          Infrastructure-less Wireless Networks
Neighbor sensing


                           F                       G
                                         Nb:{F},
                                                                           H
                                         2hop Nb:{S}

           S                       B
   Nb:{E,F},               Nb:{S,E,F},
   2hop Nb:{}              2hop Nb:{}
                                                                           D
                           E                       A



28 / 41    Gwendal Simon           Infrastructure-less Wireless Networks
Neighbor sensing


                           F                       G
                 Nb:{S,B,G},            Nb:{F,B,H},
                                                                           H
                 2hopNb:{E,A,H}         2hopNb:{S,E,A,D}            Nb:{G,D},
                                                                    2hopNb:{B,F,A}
           S                       B
   Nb:{E,F,B},             Nb:{S,E,F,A,G},
   2hopNb:{G,A}            2hopNb:{D,H}
                                                                           D
                           E                       A                Nb:{A,H},
                 Nb:{S,A,B},            Nb:{E,B,D},                 2hopNb:{B,E,G}
                 2hopNb:{F,G,D}         2hopNb:{S,F,G,H}

28 / 41    Gwendal Simon           Infrastructure-less Wireless Networks
MPR selection


                           F                       G
                 Nb:{S,B,G},
                                                                           H
                 2hopNb:{E,A,H}

           S                       B
   Nb:{E,F,B},             Nb:{S,E,F,A,G},
   2hopNb:{G,A}            2hopNb:{D,H}
                                                                           D
                           E                       A
                 Nb:{S,A,B},
                 2hopNb:{F,G,D}

29 / 41    Gwendal Simon           Infrastructure-less Wireless Networks
MPR selection


                           F                   G
                                        HELLO message
                                                                       H
                                        indicating B as
           S                   B        MPR of S and B
                                        note S as its MPR
                                        selector.
                                                                       D
                           E                   A



29 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
MPR selection


                           F                       G
               MPR Selector:             MPR Selector:                     H
               {}                        {B,F,H}                   MPR Selector:
                                                                   {G,D}
           S                       B
   MPR Selector:           MPR Selector:
   {}                      {S,G,E,F,A}
                                                                           D
                           E                       A               MPR Selector:
               MPR Selector:             MPR Selector:             {A,H}
               {}                        {B,E,D}

29 / 41    Gwendal Simon          Infrastructure-less Wireless Networks
Topology Table
 Each node maintains a Topology Table
     containing all possible destinations
     notifying a MPR to reach them

 Structure of Topology Table (on S for example):
          Dest Addr        Last Hop     Seq      Holding Time
              G                B         1            10
              A                B         4            20
              D                A         6            10
              H                G         5            15
             ...              ...       ...           ...

30 / 41    Gwendal Simon        Infrastructure-less Wireless Networks
Building the Topology Table


                           F                   G
                                    MPR Selector:                      H
                                    {B,F,H}

           S                   B

                                                                       D
                           E                   A



31 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
Building the Topology Table


                           F                   G
                                                                       H

           S                   B
                        Topology Table
                    Des Lhop Seq Htime
                                                                       D
                     F
                       E G       2     30
                                         A
                     H    G      2     30



31 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
Building the Topology Table


                           F                      G
                                                                           H
                                                                   MPR Selector:
                                                                   {G,D}
           S                       B
                           MPR Selector:
                           {S,G,E,F,A}
                                                                           D
                           E                      A



31 / 41    Gwendal Simon          Infrastructure-less Wireless Networks
Building the Topology Table


                           F                   G
                                                                       H
                     Topology Table
                 Des Lhop Seq Htime
           S      F    G     B2     30
                  H    G      2     30
                  B    G      2     30
                                                                       D
                           E                   A



31 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
Building the Topology Table


                           F                     G
                                                                        H

                                      Broadcasting contin-
           S                   B      ues. . .


                                                                        D
                           E                     A              MPR Selector:
                                    MPR Selector:               {A,H}
                                    {B,E,D}

31 / 41    Gwendal Simon       Infrastructure-less Wireless Networks
Building the Topology Table


                           F                       G
               MPR Selector:             MPR Selector:                     H
               {}                        {B,F,H}                   MPR Selector:
                                                                   {G,D}
           S                       B
   MPR Selector:           MPR Selector:
   {}                      {S,G,E,F,A}
                                                                           D
                           E                       A               MPR Selector:
               MPR Selector:             MPR Selector:             {A,H}
               {}                        {B,E,D}

31 / 41    Gwendal Simon          Infrastructure-less Wireless Networks
Building the Routing Table

             Topology Table on S          Neighbor Table on S
          Des Lhop Seq Htime              Nb:{E,F,B},
           F      G       2    30         2hopNb:{G,A}
           H      G       2    30
           B      G       2    30              Routing Table on S
           F      B       3    30              Des Nhop Hops
           A      B       3    30                E        E        1
           E      B       3    30                F        F        1
           G      B       3    30                B        B        1
           B      A       6    30
           E      A       6    30
           D      A       6    30
           A      D       7    30
           H      D       7    30
           D      H       8    30
32 / 41    G Gwendal Simon8
                  H            30 Infrastructure-less Wireless Networks
Building the Routing Table

             Topology Table on S          Neighbor Table on S
          Des Lhop Seq Htime              Nb:{E,F,B},
           F      G       2    30         2hopNb:{G,A}
           H      G       2    30
           B      G       2    30              Routing Table on S
           F      B       3    30              Des Nhop Hops
           A      B       3    30                E        E        1
           E      B       3    30                F        F        1
           G      B       3    30                B        B        1
           B      A       6    30
           E      A       6    30
           D      A       6    30
           A      D       7    30
           H      D       7    30
           D      H       8    30
32 / 41    G Gwendal Simon8
                  H            30 Infrastructure-less Wireless Networks
Building the Routing Table

             Topology Table on S          Neighbor Table on S
          Des Lhop Seq Htime              Nb:{E,F,B},
           F      G       2    30         2hopNb:{G,A}
           H      G       2    30
           B      G       2    30              Routing Table on S
           F      B       3    30              Des Nhop Hops
           A      B       3    30                E        E        1
           E      B       3    30                F        F        1
           G      B       3    30                B        B        1
           B      A       6    30
           E      A       6    30
           D      A       6    30
           A      D       7    30
           H      D       7    30
           D      H       8    30
32 / 41    G Gwendal Simon8
                  H            30 Infrastructure-less Wireless Networks
Building the Routing Table

             Topology Table on S          Neighbor Table on S
          Des Lhop Seq Htime              Nb:{E,F,B},
           F      G       2    30         2hopNb:{G,A}
           H      G       2    30
           B      G       2    30              Routing Table on S
           F      B       3    30              Des Nhop Hops
           A      B       3    30                E        E        1
           E      B       3    30                F        F        1
           G      B       3    30                B        B        1
           B      A       6    30                A        B        2
           E      A       6    30                G        B        2
           D      A       6    30
           A      D       7    30
           H      D       7    30
           D      H       8    30
32 / 41    G Gwendal Simon8
                  H            30 Infrastructure-less Wireless Networks
Building the Routing Table

             Topology Table on S          Neighbor Table on S
          Des Lhop Seq Htime              Nb:{E,F,B},
           F      G       2    30         2hopNb:{G,A}
           H      G       2    30
           B      G       2    30              Routing Table on S
           F      B       3    30              Des Nhop Hops
           A      B       3    30                E        E        1
           E      B       3    30                F        F        1
           G      B       3    30                B        B        1
           B      A       6    30                A        B        2
           E      A       6    30                G        B        2
           D      A       6    30
           A      D       7    30
           H      D       7    30
           D      H       8    30
32 / 41    G Gwendal Simon8
                  H            30 Infrastructure-less Wireless Networks
Building the Routing Table

             Topology Table on S          Neighbor Table on S
          Des Lhop Seq Htime              Nb:{E,F,B},
           F      G       2    30         2hopNb:{G,A}
           H      G       2    30
           B      G       2    30              Routing Table on S
           F      B       3    30              Des Nhop Hops
           A      B       3    30                E        E        1
           E      B       3    30                F        F        1
           G      B       3    30                B        B        1
           B      A       6    30                A        B        2
           E      A       6    30                G        B        2
           D      A       6    30
           A      D       7    30
           H      D       7    30
           D      H       8    30
32 / 41    G Gwendal Simon8
                  H            30 Infrastructure-less Wireless Networks
Building the Routing Table

             Topology Table on S          Neighbor Table on S
          Des Lhop Seq Htime              Nb:{E,F,B},
           F      G       2    30         2hopNb:{G,A}
           H      G       2    30
           B      G       2    30              Routing Table on S
           F      B       3    30              Des Nhop Hops
           A      B       3    30                E        E        1
           E      B       3    30                F        F        1
           G      B       3    30                B        B        1
           B      A       6    30                A        B        2
           E      A       6    30                G        B        2
           D      A       6    30                H        B        3
           A      D       7    30                D        B        3
           H      D       7    30
           D      H       8    30
32 / 41    G Gwendal Simon8
                  H            30 Infrastructure-less Wireless Networks
Any Hybrid Approach ?
 Merging advantages from both approaches:
     build a routing table at 4 ∼ 5 hops
     launch a reactive process if d is not

 Applicative concerns:
     OLSR is attractive because networks often small
     AODV scales well but no all-to-all routing




33 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Research Activity:
                          Multi-Sinks Query
                          Range



34 / 41   Gwendal Simon     Infrastructure-less Wireless Networks
Multi-sink Multi-hop WSN
       200
             Target application: “fireman application”
                                      Many sensors (small, blue) and some
                                      firemen (large, green)
       150
                                      Firemen talk directly with the sensors
                                      Gather only local information
                                      On demand, fixed rate data gathering
       100
                                      Hop based query, constrained flooding
                                      Simple to deploy and scalable

       50




   0             50             100     150           200           250       300
35 / 0
     41         Gwendal Simon         Infrastructure-less Wireless Networks
Multi-sink Multi-hop WSN
       200
             Target application: “fireman application”
                                      Many sensors (small, blue) and some
                                      firemen (large, green)
       150
                                      Firemen talk directly with the sensors
                                      Gather only local information
                                      On demand, fixed rate data gathering
       100
                                      Hop based query, constrained flooding
                                      Simple to deploy and scalable

       50




   0             50             100     150           200           250       300
35 / 0
     41         Gwendal Simon         Infrastructure-less Wireless Networks
Multi-sink Multi-hop WSN
       200
             Target application: “fireman application”
                                      Many sensors (small, blue) and some
                                      firemen (large, green)
       150
                                      Firemen talk directly with the sensors
                                      Gather only local information
                                      On demand, fixed rate data gathering
       100
                                      Hop based query, constrained flooding
                                      Simple to deploy and scalable

       50




   0             50             100     150           200           250       300
35 / 0
     41         Gwendal Simon         Infrastructure-less Wireless Networks
Multi-sink Multi-hop WSN
       200
             Target application: “fireman application”
                                      Many sensors (small, blue) and some
                                      firemen (large, green)
       150
                                      Firemen talk directly with the sensors
                                      Gather only local information
                                      On demand, fixed rate data gathering
       100
                                      Hop based query, constrained flooding
                                      Simple to deploy and scalable

       50




   0             50             100     150           200           250       300
35 / 0
     41         Gwendal Simon         Infrastructure-less Wireless Networks
Multi-sink Multi-hop WSN
       200
             Target application: “fireman application”
                                       Many sensors (small, blue) and some
                                       firemen (large, green)
       150
                                       Firemen talk directly with the sensors
                                       Gather only local information
                                       On demand, fixed rate data gathering
       100
                                       Hop based query, constrained flooding
                                       Simple to deploy and scalable
        Networking assumptions:
       50
                IEEE 802.15.4 MAC layer, ZigBee tree routing
                No in-network data aggregation, compression

   0
                Static sensors100
                  50
                                and sinks 150
                                          (may extend to mobile 250
                                                    200
                                                                 sinks)        300
35 / 0
     41         Gwendal Simon          Infrastructure-less Wireless Networks
Network Sharing Without Congestions
       200
        Capacity of sensors c = 5
        Each flow consumes r = 1
        Nodes within u hops generate traffic
       150



                                                Configurations        Feasible?
                                                   (5, 1)               yes
   S1
   100


 u1 = 5
                   S2
       50        u2 = 1

   0            50            100      150           200           250           300
      0
36 / 41       Gwendal Simon         Infrastructure-less Wireless Networks
Network Sharing Without Congestions
       200
        Capacity of sensors c = 5
        Each flow consumes r = 1
        Nodes within u hops generate traffic
       150



                                                Configurations        Feasible?
                                                   (5, 1)               yes
   S1
   100                                             (4, 2)               no
 u1 = 4
                   S2
       50        u2 = 2

   0            50            100      150           200           250           300
      0
36 / 41       Gwendal Simon         Infrastructure-less Wireless Networks
Network Sharing Without Congestions
       200
        Capacity of sensors c = 5
        Each flow consumes r = 1
        Nodes within u hops generate traffic
       150



                                                Configurations        Feasible?
                                                   (5, 1)               yes
   S1
   100                                             (4, 2)               no
                                                   (3, 2)               yes
 u1 = 3
                   S2
       50        u2 = 2

   0            50            100      150           200           250           300
      0
36 / 41       Gwendal Simon         Infrastructure-less Wireless Networks
Network Sharing Without Congestions
       200
        Capacity of sensors c = 5
        Each flow consumes r = 1
        Nodes within u hops generate traffic
       150



                                                Configurations        Feasible?
                                                   (5, 1)               yes
   S1
   100                                             (4, 2)               no
                                                   (3, 2)               yes
 u1 = 2                                            (2, 3)               yes
                   S2
       50        u2 = 3

   0            50            100      150           200           250           300
      0
36 / 41       Gwendal Simon         Infrastructure-less Wireless Networks
Network Sharing Without Congestions
       200
        Capacity of sensors c = 5
        Each flow consumes r = 1
        Nodes within u hops generate traffic
       150



                                                Configurations        Feasible?
                                                   (5, 1)               yes
   S1
   100                                             (4, 2)               no
                                                   (3, 2)               yes
 u1 = 2                                            (2, 3)               yes
                   S2
       50        u2 = 3
                               62 configurations
   0            50            100      150           200           250           300
      0
36 / 41       Gwendal Simon         Infrastructure-less Wireless Networks
Which Configuration is Better?
       200
   Basic considerations:
        (4, 2): not feasible, (1, 1): inefficient

       150




       100




       50




   0           50             100     150           200           250       300
37 / 0
     41       Gwendal Simon         Infrastructure-less Wireless Networks
Which Configuration is Better?
       200
   Basic considerations:
        (4, 2): not feasible, (1, 1): inefficient

       150


   Optimality criteria:                                                 1
       Maximum Impact Range
       100          (5, 1): Sum up to 6
             Max-Min Fairness                                       4
                    (2, 3) = (3, 2)   (5, 1)                                3
                                                                2
       50



                                                            (?, ?, ?, ?)
   0           50             100       150           200           250         300
37 / 0
     41       Gwendal Simon           Infrastructure-less Wireless Networks
Problem Formulation
 Multi-Dimensional Multiple Choice Knapsack Problem
     a NP-complete problem




38 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Problem Formulation
 Multi-Dimensional Multiple Choice Knapsack Problem
     a NP-complete problem

 Toward a distributed heuristic algorithm
     only local views of the network
     only local optimal solutions




38 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Protocol
       200
   At each sink:
        enlarge requirement periodically
        receive notification from sensors
    150
        adjust requirement if it is smaller
                                    At each sensor:
       3
       100
                                        measure the traffic
                                        detect congestion
               A
       50
                4
                    2
                         1
                                        solve the local problem
                                        notify related sinks
   0           50             100      150           200           250       300
39 / 0
     41       Gwendal Simon          Infrastructure-less Wireless Networks
Conclusion




40 / 41   Gwendal Simon     Infrastructure-less Wireless Networks
Personal Thoughts
 Great theoretical importance:
     a lot of new and scientifically exciting problems
     a multi-disciplinary field (network, algorithms,
     computational geometry, probabilities)




41 / 41    Gwendal Simon   Infrastructure-less Wireless Networks
Personal Thoughts
 Great theoretical importance:
     a lot of new and scientifically exciting problems
     a multi-disciplinary field (network, algorithms,
     computational geometry, probabilities)

 Unsure applicative importance:
     no killer application yet
     cellular networks just do what we want



41 / 41    Gwendal Simon   Infrastructure-less Wireless Networks

Weitere ähnliche Inhalte

Was ist angesagt?

Lecture 5 6 .ad hoc network
Lecture 5 6 .ad hoc networkLecture 5 6 .ad hoc network
Lecture 5 6 .ad hoc networkChandra Meena
 
Interference and system capacity
Interference and system capacityInterference and system capacity
Interference and system capacityAJAL A J
 
Wireless Sensor Networks
Wireless Sensor NetworksWireless Sensor Networks
Wireless Sensor Networksjuno susi
 
security in wireless sensor networks
security in wireless sensor networkssecurity in wireless sensor networks
security in wireless sensor networksVishnu Kudumula
 
5G Network Architecture and Design
5G Network Architecture and Design5G Network Architecture and Design
5G Network Architecture and Design3G4G
 
Wireless sensor networks (Yogesh Chandra Fulara)
Wireless sensor networks (Yogesh Chandra Fulara)Wireless sensor networks (Yogesh Chandra Fulara)
Wireless sensor networks (Yogesh Chandra Fulara)Yogesh Fulara
 
Wan technologies
Wan technologiesWan technologies
Wan technologiesOnline
 
Energy consumption of wsn
Energy consumption of wsnEnergy consumption of wsn
Energy consumption of wsnDeepaDasarathan
 
Wireless Local Area Networks
Wireless Local Area NetworksWireless Local Area Networks
Wireless Local Area NetworksDon Norwood
 
Wireless sensor network applications
Wireless sensor network applicationsWireless sensor network applications
Wireless sensor network applicationsDeepshika Reddy
 
Public Switched Telephone Network
Public Switched Telephone NetworkPublic Switched Telephone Network
Public Switched Telephone NetworkHaither Mithath
 
Wireless body area network
Wireless body area networkWireless body area network
Wireless body area networkPratik Gondaliya
 

Was ist angesagt? (20)

Adhoc wireless
Adhoc wirelessAdhoc wireless
Adhoc wireless
 
Lecture 5 6 .ad hoc network
Lecture 5 6 .ad hoc networkLecture 5 6 .ad hoc network
Lecture 5 6 .ad hoc network
 
Interference and system capacity
Interference and system capacityInterference and system capacity
Interference and system capacity
 
Wireless personal area networks(PAN)
Wireless personal area networks(PAN)Wireless personal area networks(PAN)
Wireless personal area networks(PAN)
 
Ad-Hoc Networks
Ad-Hoc NetworksAd-Hoc Networks
Ad-Hoc Networks
 
Wireless Sensor Networks
Wireless Sensor NetworksWireless Sensor Networks
Wireless Sensor Networks
 
security in wireless sensor networks
security in wireless sensor networkssecurity in wireless sensor networks
security in wireless sensor networks
 
5G Network Architecture and Design
5G Network Architecture and Design5G Network Architecture and Design
5G Network Architecture and Design
 
Wide Area Network (WAN)
Wide Area Network (WAN)Wide Area Network (WAN)
Wide Area Network (WAN)
 
Wireless sensor networks (Yogesh Chandra Fulara)
Wireless sensor networks (Yogesh Chandra Fulara)Wireless sensor networks (Yogesh Chandra Fulara)
Wireless sensor networks (Yogesh Chandra Fulara)
 
Switching systems lecture2
Switching  systems lecture2Switching  systems lecture2
Switching systems lecture2
 
Wan technologies
Wan technologiesWan technologies
Wan technologies
 
Energy consumption of wsn
Energy consumption of wsnEnergy consumption of wsn
Energy consumption of wsn
 
Wireless Local Area Networks
Wireless Local Area NetworksWireless Local Area Networks
Wireless Local Area Networks
 
Wireless sensor network applications
Wireless sensor network applicationsWireless sensor network applications
Wireless sensor network applications
 
Public Switched Telephone Network
Public Switched Telephone NetworkPublic Switched Telephone Network
Public Switched Telephone Network
 
Wireless body area network
Wireless body area networkWireless body area network
Wireless body area network
 
Wireless LAN Security
Wireless LAN SecurityWireless LAN Security
Wireless LAN Security
 
IEEE 802.11
IEEE 802.11IEEE 802.11
IEEE 802.11
 
Localization in wsn
Localization in wsnLocalization in wsn
Localization in wsn
 

Andere mochten auch

Waste water treatment processes
Waste water treatment processesWaste water treatment processes
Waste water treatment processesAshish Agarwal
 
Intro to Algebra II
Intro to Algebra IIIntro to Algebra II
Intro to Algebra IIteamxxlp
 
Top 10 senior administrative officer interview questions and answers
Top 10 senior administrative officer interview questions and answersTop 10 senior administrative officer interview questions and answers
Top 10 senior administrative officer interview questions and answersannababy1245
 
Packet capture and network traffic analysis
Packet capture and network traffic analysisPacket capture and network traffic analysis
Packet capture and network traffic analysisCARMEN ALCIVAR
 
Virtualization In Software Testing
Virtualization In Software TestingVirtualization In Software Testing
Virtualization In Software TestingColloquium
 
Video Quality Measurements
Video Quality MeasurementsVideo Quality Measurements
Video Quality MeasurementsYoss Cohen
 
Vendor quality management
Vendor quality managementVendor quality management
Vendor quality managementG2Link
 
Digital Platform Selection Best Practices
Digital Platform Selection Best PracticesDigital Platform Selection Best Practices
Digital Platform Selection Best Practicesedynamic
 
Hands-On Lab: Let's Build an ITSM Dashboard
Hands-On Lab: Let's Build an ITSM DashboardHands-On Lab: Let's Build an ITSM Dashboard
Hands-On Lab: Let's Build an ITSM DashboardCA Technologies
 
Defining Workplace Safety
Defining Workplace SafetyDefining Workplace Safety
Defining Workplace SafetyBruce Lambert
 
Str581 final exam part 1
Str581 final exam part 1Str581 final exam part 1
Str581 final exam part 1Rogue Phoenix
 
Which test cases to automate
Which test cases to automateWhich test cases to automate
Which test cases to automatesachxn1
 
E leave management-system
E leave management-systemE leave management-system
E leave management-systemArti Sehgal
 

Andere mochten auch (20)

Waste water treatment processes
Waste water treatment processesWaste water treatment processes
Waste water treatment processes
 
Intro to Algebra II
Intro to Algebra IIIntro to Algebra II
Intro to Algebra II
 
Orbital Notation
Orbital NotationOrbital Notation
Orbital Notation
 
Top 10 senior administrative officer interview questions and answers
Top 10 senior administrative officer interview questions and answersTop 10 senior administrative officer interview questions and answers
Top 10 senior administrative officer interview questions and answers
 
Packet capture and network traffic analysis
Packet capture and network traffic analysisPacket capture and network traffic analysis
Packet capture and network traffic analysis
 
Virtualization In Software Testing
Virtualization In Software TestingVirtualization In Software Testing
Virtualization In Software Testing
 
Video Quality Measurements
Video Quality MeasurementsVideo Quality Measurements
Video Quality Measurements
 
Vendor quality management
Vendor quality managementVendor quality management
Vendor quality management
 
Digital Platform Selection Best Practices
Digital Platform Selection Best PracticesDigital Platform Selection Best Practices
Digital Platform Selection Best Practices
 
Analysis of water pollution presentaion by m.nadeem ashraf
Analysis of water pollution presentaion by m.nadeem ashrafAnalysis of water pollution presentaion by m.nadeem ashraf
Analysis of water pollution presentaion by m.nadeem ashraf
 
Hands-On Lab: Let's Build an ITSM Dashboard
Hands-On Lab: Let's Build an ITSM DashboardHands-On Lab: Let's Build an ITSM Dashboard
Hands-On Lab: Let's Build an ITSM Dashboard
 
Defining Workplace Safety
Defining Workplace SafetyDefining Workplace Safety
Defining Workplace Safety
 
Str581 final exam part 1
Str581 final exam part 1Str581 final exam part 1
Str581 final exam part 1
 
Which test cases to automate
Which test cases to automateWhich test cases to automate
Which test cases to automate
 
Chem Lab Report (1)
Chem Lab Report (1)Chem Lab Report (1)
Chem Lab Report (1)
 
E leave management-system
E leave management-systemE leave management-system
E leave management-system
 
PL/SQL Unit Testing Can Be Fun!
PL/SQL Unit Testing Can Be Fun!PL/SQL Unit Testing Can Be Fun!
PL/SQL Unit Testing Can Be Fun!
 
Catalogo de Productos Nutrilite (Amway)
Catalogo de Productos Nutrilite (Amway)Catalogo de Productos Nutrilite (Amway)
Catalogo de Productos Nutrilite (Amway)
 
Telecom Roaming Overview
Telecom Roaming OverviewTelecom Roaming Overview
Telecom Roaming Overview
 
Hydraulic intensifier
Hydraulic  intensifierHydraulic  intensifier
Hydraulic intensifier
 

Mehr von Gwendal Simon

Reproducible research at ACM MMSys
Reproducible research at ACM MMSysReproducible research at ACM MMSys
Reproducible research at ACM MMSysGwendal Simon
 
Netgames: history and preparing 2018 edition
Netgames: history and preparing 2018 editionNetgames: history and preparing 2018 edition
Netgames: history and preparing 2018 editionGwendal Simon
 
Virtual Reality in 5G Networks
Virtual Reality in 5G NetworksVirtual Reality in 5G Networks
Virtual Reality in 5G NetworksGwendal Simon
 
Adaptive Delivery of Live Video Stream: Infrastructure cost vs. QoE
Adaptive Delivery of Live Video Stream: Infrastructure cost vs. QoEAdaptive Delivery of Live Video Stream: Infrastructure cost vs. QoE
Adaptive Delivery of Live Video Stream: Infrastructure cost vs. QoEGwendal Simon
 
Research on cloud gaming: status and perspectives
Research on cloud gaming: status and perspectivesResearch on cloud gaming: status and perspectives
Research on cloud gaming: status and perspectivesGwendal Simon
 
DASH in Twitch: Adaptive Bitrate Streaming in Live Game Streaming Platforms
DASH in Twitch: Adaptive Bitrate Streaming in Live Game Streaming PlatformsDASH in Twitch: Adaptive Bitrate Streaming in Live Game Streaming Platforms
DASH in Twitch: Adaptive Bitrate Streaming in Live Game Streaming PlatformsGwendal Simon
 
Fast Near-Optimal Delivery of Live Streams in CDN
Fast Near-Optimal Delivery of Live Streams in CDNFast Near-Optimal Delivery of Live Streams in CDN
Fast Near-Optimal Delivery of Live Streams in CDNGwendal Simon
 
Scadoosh: Scaling Down the Footprint of Rate-Adaptive Live Streaming on CDN I...
Scadoosh: Scaling Down the Footprint of Rate-Adaptive Live Streaming on CDN I...Scadoosh: Scaling Down the Footprint of Rate-Adaptive Live Streaming on CDN I...
Scadoosh: Scaling Down the Footprint of Rate-Adaptive Live Streaming on CDN I...Gwendal Simon
 
Minimizing Server Throughput for Low-Delay Live Streaming in Content Delivery...
Minimizing Server Throughput for Low-Delay Live Streaming in Content Delivery...Minimizing Server Throughput for Low-Delay Live Streaming in Content Delivery...
Minimizing Server Throughput for Low-Delay Live Streaming in Content Delivery...Gwendal Simon
 
Time-Shifted TV in Content Centric Networks: the Case for Cooperative In-Netw...
Time-Shifted TV in Content Centric Networks: the Case for Cooperative In-Netw...Time-Shifted TV in Content Centric Networks: the Case for Cooperative In-Netw...
Time-Shifted TV in Content Centric Networks: the Case for Cooperative In-Netw...Gwendal Simon
 
Internet : pourquoi ça marche
Internet : pourquoi ça marcheInternet : pourquoi ça marche
Internet : pourquoi ça marcheGwendal Simon
 
Optimal Network Locality in Distributed Services
Optimal Network Locality in Distributed ServicesOptimal Network Locality in Distributed Services
Optimal Network Locality in Distributed ServicesGwendal Simon
 
peer-to-peer oppotunities
peer-to-peer oppotunitiespeer-to-peer oppotunities
peer-to-peer oppotunitiesGwendal Simon
 

Mehr von Gwendal Simon (14)

Reproducible research at ACM MMSys
Reproducible research at ACM MMSysReproducible research at ACM MMSys
Reproducible research at ACM MMSys
 
Netgames: history and preparing 2018 edition
Netgames: history and preparing 2018 editionNetgames: history and preparing 2018 edition
Netgames: history and preparing 2018 edition
 
Virtual Reality in 5G Networks
Virtual Reality in 5G NetworksVirtual Reality in 5G Networks
Virtual Reality in 5G Networks
 
Adaptive Delivery of Live Video Stream: Infrastructure cost vs. QoE
Adaptive Delivery of Live Video Stream: Infrastructure cost vs. QoEAdaptive Delivery of Live Video Stream: Infrastructure cost vs. QoE
Adaptive Delivery of Live Video Stream: Infrastructure cost vs. QoE
 
Research on cloud gaming: status and perspectives
Research on cloud gaming: status and perspectivesResearch on cloud gaming: status and perspectives
Research on cloud gaming: status and perspectives
 
DASH in Twitch: Adaptive Bitrate Streaming in Live Game Streaming Platforms
DASH in Twitch: Adaptive Bitrate Streaming in Live Game Streaming PlatformsDASH in Twitch: Adaptive Bitrate Streaming in Live Game Streaming Platforms
DASH in Twitch: Adaptive Bitrate Streaming in Live Game Streaming Platforms
 
Fast Near-Optimal Delivery of Live Streams in CDN
Fast Near-Optimal Delivery of Live Streams in CDNFast Near-Optimal Delivery of Live Streams in CDN
Fast Near-Optimal Delivery of Live Streams in CDN
 
Scadoosh: Scaling Down the Footprint of Rate-Adaptive Live Streaming on CDN I...
Scadoosh: Scaling Down the Footprint of Rate-Adaptive Live Streaming on CDN I...Scadoosh: Scaling Down the Footprint of Rate-Adaptive Live Streaming on CDN I...
Scadoosh: Scaling Down the Footprint of Rate-Adaptive Live Streaming on CDN I...
 
Minimizing Server Throughput for Low-Delay Live Streaming in Content Delivery...
Minimizing Server Throughput for Low-Delay Live Streaming in Content Delivery...Minimizing Server Throughput for Low-Delay Live Streaming in Content Delivery...
Minimizing Server Throughput for Low-Delay Live Streaming in Content Delivery...
 
Time-Shifted TV in Content Centric Networks: the Case for Cooperative In-Netw...
Time-Shifted TV in Content Centric Networks: the Case for Cooperative In-Netw...Time-Shifted TV in Content Centric Networks: the Case for Cooperative In-Netw...
Time-Shifted TV in Content Centric Networks: the Case for Cooperative In-Netw...
 
Internet : pourquoi ça marche
Internet : pourquoi ça marcheInternet : pourquoi ça marche
Internet : pourquoi ça marche
 
Optimal Network Locality in Distributed Services
Optimal Network Locality in Distributed ServicesOptimal Network Locality in Distributed Services
Optimal Network Locality in Distributed Services
 
Cloud Engineering
Cloud EngineeringCloud Engineering
Cloud Engineering
 
peer-to-peer oppotunities
peer-to-peer oppotunitiespeer-to-peer oppotunities
peer-to-peer oppotunities
 

Kürzlich hochgeladen

Meet the new FSP 3000 M-Flex800™
Meet the new FSP 3000 M-Flex800™Meet the new FSP 3000 M-Flex800™
Meet the new FSP 3000 M-Flex800™Adtran
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8DianaGray10
 
Introduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxIntroduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxMatsuo Lab
 
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDEADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDELiveplex
 
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online CollaborationCOMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online Collaborationbruanjhuli
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.YounusS2
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...Aggregage
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1DianaGray10
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UbiTrack UK
 
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...DianaGray10
 
UiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPathCommunity
 
Empowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintEmpowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintMahmoud Rabie
 
Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1DianaGray10
 
Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxGDSC PJATK
 
Designing A Time bound resource download URL
Designing A Time bound resource download URLDesigning A Time bound resource download URL
Designing A Time bound resource download URLRuncy Oommen
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemAsko Soukka
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024SkyPlanner
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesMd Hossain Ali
 
20230202 - Introduction to tis-py
20230202 - Introduction to tis-py20230202 - Introduction to tis-py
20230202 - Introduction to tis-pyJamie (Taka) Wang
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationIES VE
 

Kürzlich hochgeladen (20)

Meet the new FSP 3000 M-Flex800™
Meet the new FSP 3000 M-Flex800™Meet the new FSP 3000 M-Flex800™
Meet the new FSP 3000 M-Flex800™
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8
 
Introduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxIntroduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptx
 
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDEADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
 
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online CollaborationCOMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
 
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
 
UiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation Developers
 
Empowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintEmpowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership Blueprint
 
Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1
 
Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptx
 
Designing A Time bound resource download URL
Designing A Time bound resource download URLDesigning A Time bound resource download URL
Designing A Time bound resource download URL
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystem
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
 
20230202 - Introduction to tis-py
20230202 - Introduction to tis-py20230202 - Introduction to tis-py
20230202 - Introduction to tis-py
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
 

Infrastructureless Wireless networks

  • 1. Infrastructure-less Wireless Networks Gwendal Simon Department of Computer Science Institut Telecom 2009
  • 2. Literature Books include: “Algorithms for sensor and ad hoc networks”, D. Wagner and R. Wattenhofer “Wireless sensor networks: an information processing approach”, F. Zhao and L. Guibas and journal/conferences include: ACM SigMobile (MobiHoc, SenSys, etc.) IEEE MASS and WCNC Elsevier Ad-Hoc Network, Wireless Networks 2 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 3. Motivations Current wireless net. require an infrastructure: cellular network: interconnected base stations wifi Internet: an access point and Internet 3 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 4. Motivations Current wireless net. require an infrastructure: cellular network: interconnected base stations wifi Internet: an access point and Internet Same flaws than centralized architectures: cost scalability privacy dependability 3 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 5. Motivations Sometimes, there is no infrastructure transient meeting disaster areas military interventions alter-communication 4 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 6. Motivations Sometimes, there is no infrastructure transient meeting disaster areas military interventions alter-communication Sometimes not every station hear every other station limited wireless transmission range large-scale area 4 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 7. Multi-hop Wireless Networks Nodes: portable wireless devices transmission ranges do not cover the area density ensures network connectivity Links: wireless characteristics transmission model: local broadcasting energy consumption: transmission is costly Behavior: devices emit, receive and forward data 5 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 8. A Taxonomy of Applications 6 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 9. Ad-Hoc vs. Sensor Networks Ad-Hoc Networks Sensor Networks nodes powerful wifi devices tiny zigbee nodes algorithms all-to-all routing echo to sink mobility human or car motions failures performance criteria quality of service energy consumption 7 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 10. Ad-Hoc Applications Delay-Tolerant Network (social media application) assumption: no connectivity, but high mobility objective: ensuring eventual message delivery 8 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 11. Ad-Hoc Applications Delay-Tolerant Network (social media application) assumption: no connectivity, but high mobility objective: ensuring eventual message delivery Mesh Networks (rural wireless coverage) assumption: some nodes have Internet access objective: maintaining path to these nodes 8 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 12. Ad-Hoc Applications Delay-Tolerant Network (social media application) assumption: no connectivity, but high mobility objective: ensuring eventual message delivery Mesh Networks (rural wireless coverage) assumption: some nodes have Internet access objective: maintaining path to these nodes Vehicular Ad-Hoc Networks assumption: a particular mobility model objective: mostly services related to car safety 8 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 13. Sensor Network Applications Sink-Based Networks (monitoring of natural areas) assumption: one sink retrieves all sensed data objective: increasing life-time 9 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 14. Sensor Network Applications Sink-Based Networks (monitoring of natural areas) assumption: one sink retrieves all sensed data objective: increasing life-time Mobile Object Tracking (area surveillance) assumption: sensors know their location objective: determining hostile position 9 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 15. Sensor Network Applications Sink-Based Networks (monitoring of natural areas) assumption: one sink retrieves all sensed data objective: increasing life-time Mobile Object Tracking (area surveillance) assumption: sensors know their location objective: determining hostile position Multi-Sink Networks (intervention teams) assumptions: mobile sinks and fixed sensor objectives: increasing sink coverage 9 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 16. Short Introduction to Popular Models 10 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 17. Network as a Graph Unit-Disk Graph: 05 03 → node position 07 09 → circular transmission 12 11 06 10 01 → boolean connections 02 00 08 04 11 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 18. Network as a Graph Unit-Disk Graph: 05 03 → node position 07 09 → circular transmission 12 11 06 10 01 → boolean connections 02 00 08 04 11 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 19. Network as a Graph Unit-Disk Graph: 05 03 → node position 07 09 → circular transmission 12 11 06 10 01 → boolean connections 02 00 08 04 11 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 20. Interferences Signal-to-noise-plus-interference (SINR) ratio Pu d(u,v )α Pw ≥β N+ w ∈V {u} d(w ,v )α Pu : power level of sender u d(u, v ): distance between u and v α: path-loss exponent N: noise β: minimum ratio 12 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 21. A Tour of the Most Studied Issues 13 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 22. Broadcasting I: Stormy Effect Broadcast: a simple basic problem : a source emits a message all nodes within the network eventually receive the message a simple and efficient solution: upon first reception of message, forward it. Limits of flooding in wireless networks: redundant messages interferences 14 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 23. Broadcasting II: Proposals Probabilistic flooding: idea: forward the message with some probability p drawbacks: no guarantee of delivering refinements: adjust p to node density 15 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 24. Broadcasting II: Proposals Probabilistic flooding: idea: forward the message with some probability p drawbacks: no guarantee of delivering refinements: adjust p to node density Constrained flooding: idea: only some nodes forward the message implementation: build the Minimum Connected Dominating Set drawbacks: maintaining cost in dynamic systems 15 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 25. Mobility Models I Few theoretical proof, few real implementations ⇒ generate realistic node motions for simulations 16 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 26. Mobility Models I Few theoretical proof, few real implementations ⇒ generate realistic node motions for simulations The simplest model: Random Waypoint 1. each node picks a random position uniformly 2. it travels toward this destination with a speed v 3. once it reaches it, it stops during few seconds 4. back to 1 16 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 27. Mobility Models II: Improvements Basic Structural Flaws: non-uniform distribution of node location: higher node distribution in the center average speed decay: low speed nodes spend more time to travel Realistic Mobility Models: group movement area popularity urban models community-based 17 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 28. Mobility Models II: Improvements Basic Structural Flaws: non-uniform distribution of node location: higher node distribution in the center average speed decay: low speed nodes spend more time to travel Realistic Mobility Models: group movement area popularity urban models community-based the most realistic one : using real traces! 17 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 29. Localized Data Gathering Basic idea: query data from sensors within an area two rounds: query diffusion retrieve data from sensors main objectives: minimize energy consumption minimize the delay A problem related with broadcasting except: only sensors from the queried area are reached: complex queries are possible (average, max, etc.) 18 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 30. Time Synchronization I Different time on nodes: different oscillator frequency ⇒ frequency error absolute difference between clocks ⇒ phase error The need of a common clock localization protocols some MAC protocols data fusion in sensor network 19 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 31. Time Synchronization II Broadcasting standard time via GPS system: √ precision, simple implementation × expensive devices × limited usage (outdoor environment) Achieve a common time distributively: √ (almost) no special devices required √ more tolerant to the environment × special protocols × message overhead, multi-hop delays 20 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 32. A Focus on Routing Protocols 21 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 33. Routing Protocols Objective: select a path between a source and a destination Main design challenges: unstable network topology low-cost devices (energy, computing. . . ) Main routing mechanisms: neighbor discovering route setup route maintenance 22 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 34. Proactive routing vs. On demand routing Proactive Reactive Setup all-to-all on demand Maintenance regularly during utilization Advantages no setup delay no unused routes Disadvantages fixed overhead long setup delay Main examples OLSR AODV 23 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 35. AODV Route Discovery G F H S B E D A 24 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 36. AODV Route Discovery Broadcasting RREQ Mes- G sage. F H S B E D A 24 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 37. AODV Route Discovery Setting up G reverse path. F H S B E D A 24 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 38. AODV Route Discovery Setting up G reverse path. F H S B E D A 24 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 39. AODV Route Discovery Setting up G reverse path. F H S B E D A 24 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 40. AODV Route Discovery Setting up G reverse path. F H S B E D A 24 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 41. AODV Route Discovery Setting up G reverse path. F H S B E D A 24 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 42. AODV Route Discovery Replying RREP to G source. F H S B E D A 24 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 43. AODV Route Discovery Forward path G setup. F H S B E D A 24 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 44. AODV Route Maintenance Link breaks between B G and D. F H S B E D A 25 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 45. AODV Route Maintenance Sending RERR mes- G sage. F H S B E D A 25 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 46. AODV Route Maintenance Restarting route discov- G ery. F H S B E D A 25 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 47. AODV Route Maintenance New route G discovered. F H S B E D A 25 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 48. Some Tricks Intelligent flooding (detect close destination) idea: init TTL at 1, then 2, then 3. . . idea: flood slowly and send message to stop it 26 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 49. Some Tricks Intelligent flooding (detect close destination) idea: init TTL at 1, then 2, then 3. . . idea: flood slowly and send message to stop it Route caching (use past flooding) idea: during flood, answer for a distant node drawback: contradict reactive routing philosophy 26 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 50. Some Tricks Intelligent flooding (detect close destination) idea: init TTL at 1, then 2, then 3. . . idea: flood slowly and send message to stop it Route caching (use past flooding) idea: during flood, answer for a distant node drawback: contradict reactive routing philosophy Local maintenance (almost unchanged route) idea: instead of NAK s, look for d by yourself drawback: sometimes it does not work 26 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 51. A Proactive Routing Protocol: OLSR Objective: make use of Multi-Point Relay (MPR) acting as super-peers easing topology discovery handling most of the traffic OLSR message types: HELLO: discover 1-hop and 2-hop neighbors topology discovery through MPR 27 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 52. Neighbor sensing F G H S B D E A 28 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 53. Neighbor sensing F G Nb:{S}, H 2hopNb:{} Broadcasting S B HELLO Message. Nb:{S}, 2hopNb:{} D E A Nb:{S}, 2hopNb:{} 28 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 54. Neighbor sensing F G H S B Nb:{E}, Nb:{S,E}, 2hopNb:{} 2hopNb:{} D E A Nb:{E}, 2hopNb:{S} 28 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 55. Neighbor sensing F G Nb:{F}, H 2hop Nb:{S} S B Nb:{E,F}, Nb:{S,E,F}, 2hop Nb:{} 2hop Nb:{} D E A 28 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 56. Neighbor sensing F G Nb:{S,B,G}, Nb:{F,B,H}, H 2hopNb:{E,A,H} 2hopNb:{S,E,A,D} Nb:{G,D}, 2hopNb:{B,F,A} S B Nb:{E,F,B}, Nb:{S,E,F,A,G}, 2hopNb:{G,A} 2hopNb:{D,H} D E A Nb:{A,H}, Nb:{S,A,B}, Nb:{E,B,D}, 2hopNb:{B,E,G} 2hopNb:{F,G,D} 2hopNb:{S,F,G,H} 28 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 57. MPR selection F G Nb:{S,B,G}, H 2hopNb:{E,A,H} S B Nb:{E,F,B}, Nb:{S,E,F,A,G}, 2hopNb:{G,A} 2hopNb:{D,H} D E A Nb:{S,A,B}, 2hopNb:{F,G,D} 29 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 58. MPR selection F G HELLO message H indicating B as S B MPR of S and B note S as its MPR selector. D E A 29 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 59. MPR selection F G MPR Selector: MPR Selector: H {} {B,F,H} MPR Selector: {G,D} S B MPR Selector: MPR Selector: {} {S,G,E,F,A} D E A MPR Selector: MPR Selector: MPR Selector: {A,H} {} {B,E,D} 29 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 60. Topology Table Each node maintains a Topology Table containing all possible destinations notifying a MPR to reach them Structure of Topology Table (on S for example): Dest Addr Last Hop Seq Holding Time G B 1 10 A B 4 20 D A 6 10 H G 5 15 ... ... ... ... 30 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 61. Building the Topology Table F G MPR Selector: H {B,F,H} S B D E A 31 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 62. Building the Topology Table F G H S B Topology Table Des Lhop Seq Htime D F E G 2 30 A H G 2 30 31 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 63. Building the Topology Table F G H MPR Selector: {G,D} S B MPR Selector: {S,G,E,F,A} D E A 31 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 64. Building the Topology Table F G H Topology Table Des Lhop Seq Htime S F G B2 30 H G 2 30 B G 2 30 D E A 31 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 65. Building the Topology Table F G H Broadcasting contin- S B ues. . . D E A MPR Selector: MPR Selector: {A,H} {B,E,D} 31 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 66. Building the Topology Table F G MPR Selector: MPR Selector: H {} {B,F,H} MPR Selector: {G,D} S B MPR Selector: MPR Selector: {} {S,G,E,F,A} D E A MPR Selector: MPR Selector: MPR Selector: {A,H} {} {B,E,D} 31 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 67. Building the Routing Table Topology Table on S Neighbor Table on S Des Lhop Seq Htime Nb:{E,F,B}, F G 2 30 2hopNb:{G,A} H G 2 30 B G 2 30 Routing Table on S F B 3 30 Des Nhop Hops A B 3 30 E E 1 E B 3 30 F F 1 G B 3 30 B B 1 B A 6 30 E A 6 30 D A 6 30 A D 7 30 H D 7 30 D H 8 30 32 / 41 G Gwendal Simon8 H 30 Infrastructure-less Wireless Networks
  • 68. Building the Routing Table Topology Table on S Neighbor Table on S Des Lhop Seq Htime Nb:{E,F,B}, F G 2 30 2hopNb:{G,A} H G 2 30 B G 2 30 Routing Table on S F B 3 30 Des Nhop Hops A B 3 30 E E 1 E B 3 30 F F 1 G B 3 30 B B 1 B A 6 30 E A 6 30 D A 6 30 A D 7 30 H D 7 30 D H 8 30 32 / 41 G Gwendal Simon8 H 30 Infrastructure-less Wireless Networks
  • 69. Building the Routing Table Topology Table on S Neighbor Table on S Des Lhop Seq Htime Nb:{E,F,B}, F G 2 30 2hopNb:{G,A} H G 2 30 B G 2 30 Routing Table on S F B 3 30 Des Nhop Hops A B 3 30 E E 1 E B 3 30 F F 1 G B 3 30 B B 1 B A 6 30 E A 6 30 D A 6 30 A D 7 30 H D 7 30 D H 8 30 32 / 41 G Gwendal Simon8 H 30 Infrastructure-less Wireless Networks
  • 70. Building the Routing Table Topology Table on S Neighbor Table on S Des Lhop Seq Htime Nb:{E,F,B}, F G 2 30 2hopNb:{G,A} H G 2 30 B G 2 30 Routing Table on S F B 3 30 Des Nhop Hops A B 3 30 E E 1 E B 3 30 F F 1 G B 3 30 B B 1 B A 6 30 A B 2 E A 6 30 G B 2 D A 6 30 A D 7 30 H D 7 30 D H 8 30 32 / 41 G Gwendal Simon8 H 30 Infrastructure-less Wireless Networks
  • 71. Building the Routing Table Topology Table on S Neighbor Table on S Des Lhop Seq Htime Nb:{E,F,B}, F G 2 30 2hopNb:{G,A} H G 2 30 B G 2 30 Routing Table on S F B 3 30 Des Nhop Hops A B 3 30 E E 1 E B 3 30 F F 1 G B 3 30 B B 1 B A 6 30 A B 2 E A 6 30 G B 2 D A 6 30 A D 7 30 H D 7 30 D H 8 30 32 / 41 G Gwendal Simon8 H 30 Infrastructure-less Wireless Networks
  • 72. Building the Routing Table Topology Table on S Neighbor Table on S Des Lhop Seq Htime Nb:{E,F,B}, F G 2 30 2hopNb:{G,A} H G 2 30 B G 2 30 Routing Table on S F B 3 30 Des Nhop Hops A B 3 30 E E 1 E B 3 30 F F 1 G B 3 30 B B 1 B A 6 30 A B 2 E A 6 30 G B 2 D A 6 30 A D 7 30 H D 7 30 D H 8 30 32 / 41 G Gwendal Simon8 H 30 Infrastructure-less Wireless Networks
  • 73. Building the Routing Table Topology Table on S Neighbor Table on S Des Lhop Seq Htime Nb:{E,F,B}, F G 2 30 2hopNb:{G,A} H G 2 30 B G 2 30 Routing Table on S F B 3 30 Des Nhop Hops A B 3 30 E E 1 E B 3 30 F F 1 G B 3 30 B B 1 B A 6 30 A B 2 E A 6 30 G B 2 D A 6 30 H B 3 A D 7 30 D B 3 H D 7 30 D H 8 30 32 / 41 G Gwendal Simon8 H 30 Infrastructure-less Wireless Networks
  • 74. Any Hybrid Approach ? Merging advantages from both approaches: build a routing table at 4 ∼ 5 hops launch a reactive process if d is not Applicative concerns: OLSR is attractive because networks often small AODV scales well but no all-to-all routing 33 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 75. Research Activity: Multi-Sinks Query Range 34 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 76. Multi-sink Multi-hop WSN 200 Target application: “fireman application” Many sensors (small, blue) and some firemen (large, green) 150 Firemen talk directly with the sensors Gather only local information On demand, fixed rate data gathering 100 Hop based query, constrained flooding Simple to deploy and scalable 50 0 50 100 150 200 250 300 35 / 0 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 77. Multi-sink Multi-hop WSN 200 Target application: “fireman application” Many sensors (small, blue) and some firemen (large, green) 150 Firemen talk directly with the sensors Gather only local information On demand, fixed rate data gathering 100 Hop based query, constrained flooding Simple to deploy and scalable 50 0 50 100 150 200 250 300 35 / 0 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 78. Multi-sink Multi-hop WSN 200 Target application: “fireman application” Many sensors (small, blue) and some firemen (large, green) 150 Firemen talk directly with the sensors Gather only local information On demand, fixed rate data gathering 100 Hop based query, constrained flooding Simple to deploy and scalable 50 0 50 100 150 200 250 300 35 / 0 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 79. Multi-sink Multi-hop WSN 200 Target application: “fireman application” Many sensors (small, blue) and some firemen (large, green) 150 Firemen talk directly with the sensors Gather only local information On demand, fixed rate data gathering 100 Hop based query, constrained flooding Simple to deploy and scalable 50 0 50 100 150 200 250 300 35 / 0 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 80. Multi-sink Multi-hop WSN 200 Target application: “fireman application” Many sensors (small, blue) and some firemen (large, green) 150 Firemen talk directly with the sensors Gather only local information On demand, fixed rate data gathering 100 Hop based query, constrained flooding Simple to deploy and scalable Networking assumptions: 50 IEEE 802.15.4 MAC layer, ZigBee tree routing No in-network data aggregation, compression 0 Static sensors100 50 and sinks 150 (may extend to mobile 250 200 sinks) 300 35 / 0 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 81. Network Sharing Without Congestions 200 Capacity of sensors c = 5 Each flow consumes r = 1 Nodes within u hops generate traffic 150 Configurations Feasible? (5, 1) yes S1 100 u1 = 5 S2 50 u2 = 1 0 50 100 150 200 250 300 0 36 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 82. Network Sharing Without Congestions 200 Capacity of sensors c = 5 Each flow consumes r = 1 Nodes within u hops generate traffic 150 Configurations Feasible? (5, 1) yes S1 100 (4, 2) no u1 = 4 S2 50 u2 = 2 0 50 100 150 200 250 300 0 36 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 83. Network Sharing Without Congestions 200 Capacity of sensors c = 5 Each flow consumes r = 1 Nodes within u hops generate traffic 150 Configurations Feasible? (5, 1) yes S1 100 (4, 2) no (3, 2) yes u1 = 3 S2 50 u2 = 2 0 50 100 150 200 250 300 0 36 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 84. Network Sharing Without Congestions 200 Capacity of sensors c = 5 Each flow consumes r = 1 Nodes within u hops generate traffic 150 Configurations Feasible? (5, 1) yes S1 100 (4, 2) no (3, 2) yes u1 = 2 (2, 3) yes S2 50 u2 = 3 0 50 100 150 200 250 300 0 36 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 85. Network Sharing Without Congestions 200 Capacity of sensors c = 5 Each flow consumes r = 1 Nodes within u hops generate traffic 150 Configurations Feasible? (5, 1) yes S1 100 (4, 2) no (3, 2) yes u1 = 2 (2, 3) yes S2 50 u2 = 3 62 configurations 0 50 100 150 200 250 300 0 36 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 86. Which Configuration is Better? 200 Basic considerations: (4, 2): not feasible, (1, 1): inefficient 150 100 50 0 50 100 150 200 250 300 37 / 0 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 87. Which Configuration is Better? 200 Basic considerations: (4, 2): not feasible, (1, 1): inefficient 150 Optimality criteria: 1 Maximum Impact Range 100 (5, 1): Sum up to 6 Max-Min Fairness 4 (2, 3) = (3, 2) (5, 1) 3 2 50 (?, ?, ?, ?) 0 50 100 150 200 250 300 37 / 0 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 88. Problem Formulation Multi-Dimensional Multiple Choice Knapsack Problem a NP-complete problem 38 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 89. Problem Formulation Multi-Dimensional Multiple Choice Knapsack Problem a NP-complete problem Toward a distributed heuristic algorithm only local views of the network only local optimal solutions 38 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 90. Protocol 200 At each sink: enlarge requirement periodically receive notification from sensors 150 adjust requirement if it is smaller At each sensor: 3 100 measure the traffic detect congestion A 50 4 2 1 solve the local problem notify related sinks 0 50 100 150 200 250 300 39 / 0 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 91. Conclusion 40 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 92. Personal Thoughts Great theoretical importance: a lot of new and scientifically exciting problems a multi-disciplinary field (network, algorithms, computational geometry, probabilities) 41 / 41 Gwendal Simon Infrastructure-less Wireless Networks
  • 93. Personal Thoughts Great theoretical importance: a lot of new and scientifically exciting problems a multi-disciplinary field (network, algorithms, computational geometry, probabilities) Unsure applicative importance: no killer application yet cellular networks just do what we want 41 / 41 Gwendal Simon Infrastructure-less Wireless Networks