A Brief History of Communication
description
Transcript of A Brief History of Communication
![Page 1: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/1.jpg)
A Brief History of Communication
David Tse
![Page 2: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/2.jpg)
Communication Systems What goes into the engineering of these systems?
![Page 3: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/3.jpg)
Key Ingredients• Software• Hardware• Communication architecture, with
coding and signal processing algorithms
![Page 4: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/4.jpg)
Communication channels can be very nasty!
Channel distortion, noise, interference……How do we communicate reliably over such channels?
![Page 5: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/5.jpg)
Communication has a long history
• Smoke signals, telegraph, telephone…
• 1895: invention of the radio by Marconi
• 1901: trans-atlantic communication
![Page 6: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/6.jpg)
State of affairs:Early 20th century
• Most communication systems are analog.
• Engineering designs are ad-hoc, tailored for each specific application.
![Page 7: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/7.jpg)
Big Questions• Is there a general methodology for
designing communication systems?
• Is there a limit to how fast one can communicate?
![Page 8: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/8.jpg)
Harry Nyquist (1928)• Analog signals of
bandwidth W can be represented by 2W samples/s
• Channels of bandwidth W support transmission of 2W symbols/s
![Page 9: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/9.jpg)
From CT to DT Nyquist converted the continuous-time
problem to a discrete-time problem.
But has he really solved the communication problem?
No. You can communicate infinite number of bits in one continuous-valued symbol!
![Page 10: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/10.jpg)
Claude Shannon (1948) His information theory
addressed all the big questions in a single stroke.
![Page 11: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/11.jpg)
Randomness Shannon thought of both
information sources and channels as random and used probability models for them.
encodersource channel decoder
![Page 12: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/12.jpg)
Everything is bits Shannon showed the universality
of a digital interface between the source and the channel.
source SourceEncoder
Channel encoder channel
Bit stream
![Page 13: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/13.jpg)
Information is like fluid• Every source has an entropy rate H
bits per second.• Every channel has a capacity C
bits per second• Reliable communication is possible
if and only if H < C.
![Page 14: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/14.jpg)
Simple example: binary symmetric channel
0
1
0
1
1-p
p1-p
p
1
p
C
10.50
C = 1+ p log p + (1-p) log (1-p)
![Page 15: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/15.jpg)
Initial Reactions Engineers didn’t understand what he was
talking about.• People were still stuck in the analog world.• Complexity way too high for
implementation technology of the day.• He didn’t really tell people exactly how to
design optimal communication systems.
![Page 16: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/16.jpg)
50 years later….• Our communication infrastructure
is going fully digital.• Most modern communication
systems are designed according to the principles laid down by Shannon.
Internet
S
D
![Page 17: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/17.jpg)
Lessons for Us• Think different• Think big• Think simple
![Page 18: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/18.jpg)
![Page 19: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/19.jpg)
Mobility in Embedded Networks
People and their stuff
Transportation systems(e.g., cars)
Environmental and wildlife monitoring(e.g., Princeton ZebraNet Wildlife Tracker)
Inventory and supply chainmanagement (e.g., RFID tags)
![Page 20: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/20.jpg)
![Page 21: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/21.jpg)
Ubiquitous Mobility• All nodes potentially move
– Network topology changes with time• Efficient routes require knowledge of
topology– Control traffic: distance vector or link state
updates, flooded discovery packets, …
![Page 22: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/22.jpg)
Shanno• Scaling to large networks?– How costly is the dissemination of enough
information to allow for “reasonably good routes”?
– Does control traffic grow more quickly than capacity of the network?
![Page 23: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/23.jpg)
Position-based Routing• Position-based routing:
– Geographic coordinates rather than graph to make routing decisions
• Local routing decisions based on positions of destination and neighbors
• Separation into– Location service: where is the destination?– Local routing protocol: select next hop
towards destination
![Page 24: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/24.jpg)
Bla• Bullet 1• Bullet
– Bullet 2.0– Bullet 2.1
• Bullet 3
![Page 25: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/25.jpg)
Location Services• Challenge: construct a distributed
database out of mobile nodes• Approaches:
– Virtual Home Region: hash destination id to geographic region -> rendez-vous point for source and dest (Giordano & Hamdi, EPFL tech. report, 1999)
– Grid Location Service: quad-tree hierarchy, proximity in hashed id space (Li et al., Mobicom 2000)
– DREAM: Distance Routing Effect Algorithm (Basagni & Chlamtac & Syrotiuk, Mobicom 1998)
![Page 26: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/26.jpg)
Last Encounter History• Question:
– Do we really need a location service?• Answer:
– No (well, at least not always)• Observation:
– Only information on network topology available for free at a node is local connectivity to neighboring nodes
– But there is more: history of this local connectivity!• Claim:
– Collection of last encounter histories at network nodes contain enough information about current topology to efficiently route packets
![Page 27: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/27.jpg)
Last Encounter Routing• Can we efficiently route a packet from a source to
a destination based only on LE information, in a large network with n nodes?
• Assumptions:– Dense encounters: O(n^2) pairs of nodes have
encountered each other at least once– Time-scale separation: packet transmission (ms) <<
topology change (minutes, hours, days)– Memory is cheap (O(n) per node)
• Basic idea:– Packet carries with it: location and age of best (most
recent) encounter it has seen so far– Routing: packet consults entries for its destination along
the way, “zeroes in” on destination
![Page 28: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/28.jpg)
Definition: Last Encounter Table
A
B
encounter at Xbetween A and B at t=10
B: loc=X, time=10C: ...
A: loc=X, time=10C: ...D: ...
X
![Page 29: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/29.jpg)
Fixed Destination
A
![Page 30: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/30.jpg)
Moving Destination
A
A
A
AA
A
![Page 31: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/31.jpg)
Exponential Age Search (EASE)
time
-T
0
?
source destination
![Page 32: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/32.jpg)
EASE: Messenger Nodes
time
-T
0
-T/2
![Page 33: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/33.jpg)
EASE: Searching for Messenger Node
time
-T
0
-T/2
Search: who has seendest at most T/2 secs ago?
![Page 34: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/34.jpg)
EASE: Forwarding the Packet
time
-T
0
-T/2
Forwarding towards new positionwith T:=new encounter age
![Page 35: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/35.jpg)
EASE: Sample RouteDef:
anchor point of age T = pos. of dest. T sec ago
EASE:- ring search nodes
until new anchor point of age less than T/2 is found
- go there and repeat with T=new age
src
dst
![Page 36: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/36.jpg)
Performance of EASE• Length of routes clearly depends on
mobility process– Cannot work without locality– Counterexample: i.i.d. node positions every
time step• Model:
– 2-D lattice, N points, fixed density of nodes– Each node knows its own position– Independent random walks of nodes on
lattice• Cost = forwarding cost + search cost
![Page 37: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/37.jpg)
Cost of EASE Routes• Claim:
– The asymptotic expected cost for large N of EASE routes is on the order of shortest route, i.e., total forwarding cost is O(shortest path):
• Forwarding cost:– Geometric series of ages -
> geometric series of EASE segments
– Total length = O(shortest path)
![Page 38: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/38.jpg)
Search Cost
• Single step search cost is small compared to forwarding cost:– Show that density of messenger nodes
around current anchor point is high– Depends on:
• Number of unique messenger nodes encountered by destination = O(log T)
• Distance traveled by messenger nodes= same order as destination
![Page 39: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/39.jpg)
Interpretation: Distance Effect and Mobility Diffusion
• Observation: required precision of destination’s location can decrease with distance– DREAM algorithm: exploit distance effect to decrease state
maintenance overhead– When a node moves by d meters, inform other nodes in disk of
radius c*d meters– Relax separation of location service and routing service
• Basic idea behind last encounter routing:– Exploit mobility of other nodes to diffuse estimate of
destination’s location “for free”– Concurrently for all nodes
destination
![Page 40: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/40.jpg)
Improvement: Greedy EASE
![Page 41: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/41.jpg)
Simulation: Random Walk Model
•N nodes•Positions i.i.d.•Increments i.i.d.
![Page 42: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/42.jpg)
Simulation: Random Walk Model
![Page 43: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/43.jpg)
Heterogeneous Speeds: Slow Dest
![Page 44: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/44.jpg)
Heterogeneous Speeds: Fast Dest
![Page 45: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/45.jpg)
Heterogeneous Speeds
![Page 46: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/46.jpg)
Simulation: Pareto Random Walk
•N nodes•Positions i.i.d.•Increments i.i.d.,heavy-tailed distancedistribution
![Page 47: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/47.jpg)
Simulation: Random Waypoint
•N nodes•Positions i.i.d.•Every node has awaypoint•Moves straight towardswaypoint at constantspeed•When reached, newwaypoint selecteduniformly over area
![Page 48: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/48.jpg)
Pareto RW and Random Waypoint
![Page 49: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/49.jpg)
Related Idea: Last Encounter Flooding
• With coordinate system– Last-encounter information: time + place– EASE/GREASE algorithms
• Blind, no coordinate system– Last-encounter information: time only– FRESH algorithm: flood to next anchor
point– Henri Dubois-Ferrière & MG & Martin
Vetterli, MOBIHOC 03
![Page 50: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/50.jpg)
FRESH: Last Encounter Flooding
![Page 51: A Brief History of Communication](https://reader031.fdocuments.net/reader031/viewer/2022020200/56813caf550346895da65c5c/html5/thumbnails/51.jpg)
Summary: Last Encounter Routing• Last Encounter Routing uses position information that is
diffused for free by node mobility– Last encounter history: noisy view of network topology– Packet successively refines position estimate as it moves
towards destination– Mobility creates uncertainty, but also provides the means to
diffuse new information• No explicit location service, no transmission overhead
to update state!– Only control traffic is local “hello” messages– At least for some classes of node mobility, routes are efficient!– Key ingredients: locality, homogeneity, mixing of trajectories
• Rich area for more research:– Prediction– Integration with explicit location services & routing protocols– More realistic mobility models
• Ref: MG & Martin Vetterli, IEEE INFOCOM 03