Download presentation
Presentation is loading. Please wait.
Published byMatilda Flynn Modified over 9 years ago
1
Large wireless autonomic networks Sensor networks Philippe Jacquet
2
Future of internet A galaxy of wireless mobile nodes
3
Toward massively dense networks Captors sensor networks Micro or nano-drones –Static or mobile –Several thousands nodes per hectar
4
Nano drones and droids –Very small RF devices.
5
5. A simple wireless model Physical model –An infinite plan –Emitters have same nominal power Q –Signal attenuation at distance r from emitter : x y
6
5. Physical model –S is emitter set at time t Received signal at point z and time t
7
A wireless model Emitters are distributed as a point Poisson process in the plan –Signals sum
8
A wireless model Signal distribution
9
Signal power Laplace transform Partition of the plan
10
Wireless Space capacity With signal over noise ratio K requirement Average area of correct reception
11
Wireless Space capacity Reception probability vs distance Optimal routing radius
12
Wireless Space capacity Average number of hops Average per hop transmission number Net traffic density A
13
Wireless space capacity Net traffic density –Increases when increases. –Is there a limit on ?
14
Density limit Network must remain dense Gupta Kumar rule for non isolation Density limit
15
Density limits Brut per node traffic limit : Net per node traffic limit :
16
Space capacity result (Gupta- Kumar 2000) The capacity increases with the density Massively dense wireless networks N capacity
17
Protocol on wireless network Every node sends hellos at frequency h –Hellos are not routed Traffic density due to hellos –No other traffic: –Limit network size due to hellos
18
Manageable neighborhood Average neighborhood size Maximum network size
19
6. Interprétation multi sauts voisinage moyen M voisinage unique réseau déconnecté when N<M: Single hop
20
Neighbor vontrol: remaining capacity Traffic density positive since moralement libre gestion du voisinage
21
Time capacity paradox Mobility can create capacity in disconnected networks Delay Tolerant Networks X X path disruption! S D End-to-end path X X path disruption! node link
22
Information propagation speed Unit disk graph model Random walk mobility model
23
Time capacity paradox Mobility creates capacity capacity time capacity time Permanently disconnected Permanently connected Information propagation time
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.