a maximum-residual multicast protocol for large-scale mobile ad hoc networks
DESCRIPTION
A Maximum-Residual Multicast Protocol for Large-Scale Mobile Ad Hoc Networks. Pi-Cheng Hsiu and Tei-Wei Kuo Department of Computer Science and Information Engineering, National Taiwan University. IEEE Transactions on Mobile Computing, TMC 2009. Wireless & Mobile Network Laboratory (WMNL.) - PowerPoint PPT PresentationTRANSCRIPT
A Maximum-Residual Multicast Protocol for Large-Scale Mobile Ad Hoc Networks
Pi-Cheng Hsiu and Tei-Wei KuoDepartment of Computer Science and Information Engineering, National Taiwan University
IEEE Transactions on Mobile Computing, TMC 2009
Wireless & Mobile Network Laboratory (WMNL.) Department of Computer Science and Information Engineering, Tamkang University
Page: 2WMNL
Page: 3WMNL
• Multicasting is widely used in many ad hoc networks.
– Teleconference
– Tourist information distribution
– Multimedia entertainment
– Taxi dispatching
– Cooperative congestion monitoring
Page: 4WMNL
• With the popularity of mobile devices, routing becomes increasingly challenging.
– Network topologies may change quickly in an unpredictable way.
– Data traffic may change quickly in an unpredictable way.
– Critical energy efficiency considerations.
Page: 5WMNL
• Routing over mobile ad hoc networks is complicated by the considerations of energy efficiency.
– Minimum-Energy Routing.
– Maximum-Lifetime Routing.
Page: 6WMNL
• Most of the existing literature in power-aware routing
– Rely on the knowledge of certain global information.
• Remaining energy
• Minimum transmission power
– Difficulty and cost in the maintenance of up-o-date information.
– Various assumptions are made to reduce the problem complexity.
• Static network topologies
• Fixed traffic patterns
Page: 7WMNL
• Proposes a power-aware routing protocol.
– Prolong the first node failure time.
– Without collecting the topology of the whole network.
– Without collecting the remaining energy information of each node.
– Nodes are able to have different communication ranges.
– Multicasting
– Distributed.
Page: 8WMNL
• Every node is able to adjust its power level in packet transmission.
• Every node is able to measure the received signal strength RSSI (Received Signal Strength Indication).
Page: 9WMNL
Maximum-Residual Multicast Protocol
Page: 10WMNL
a
db
c e
f
Source
Destination
Page: 11WMNL
a
db
c e
f
Source
Destination
d, 0.5d, 0.5
a, 0.25a, 0.25
a, 0.5a, 0.5
b, 0.25b, 0.25
c, 0.5c, 0.5d, 0.75d, 0.75
e, 0.5e, 0.5
Page: 12WMNL
a
db
c e
f
Source
Destination
a, 0.25a, 0.25
a, 0.5a, 0.5 d, 0.75d, 0.75
e, 0.5e, 0.5
b, 0.25b, 0.25
Page: 13WMNL
a
db
c e
f
Source
Destination
a, 0.5a, 0.5
b, 0.25b, 0.25
d, 0.75d, 0.75
e, 0.5e, 0.5
Page: 14WMNL
Maximum-Residual Multicast Protocol
Page: 15WMNL
For a node u
s
R
S
β(u)
ω(u,v)
γ(v)
π[v]
m[v]
Source
Destination set
A session of data packets to multicast
The remaining amount of energy of node u
The amount of energy needed for a node u to
transmit S to another node v
The energy consumption of receiving S of node v
The predecessor of node v
The residual energy over a path from s to node v
vu
β(u)=100 β(v)=85
ω(u,v)=5
γ(v)=1
Page: 16WMNL
For source s
1:
2:
3:
4:
5:
if s has a session S of data packets to
multicast to nodes in R then
Create an entry indexed by (s, S) at s;
m[s] ← β(s);
π[s] ← NIL;
Broadcast msg{s, S, β(s), m[s], 0} to all of
its neighbors;
For a node v other than s
6:
7:
8:
9:
10:
11:
12:
13:
14:
if v receives msg{s, S, β(u), m[u], γ(u)} from a
neighbor u then
if no entry is indexed by (s, S) at v then
Create an entry indexed by (s, S) at v;
m[v] ← 0;
π[v] ← NIL;
if m[v] < min{m[u], β(u)-ω(u,v)-γ(u), β(v)-γ(v)} then
m[v] ← min{m[u], β(u)-ω(u,v)-γ(u), β(v)-γ(v)};
π[v] ← u;
Broadcast msg{s, S, β(v), m[v], γ(v)} to all of its
neighbors;
Page: 17WMNL
(85, 2)a
db
c e
f
(90, 1)
(100, 2)
(80, 1)
(95, 2)
(85, 2)
β(e) γ(e)
The remaining amount of energy of node e.
The remaining amount of energy of node e.
The energy consumption of receiving S of node e.The energy consumption of receiving S of node e.
Page: 18WMNL
(85, 2)a
db
c e
f
(90, 1)
(100, 2)
(80, 1)
(95, 2)
(85, 2)
10
5
10
10
15 5
10
5
15
10
10
10
5
5
Page: 19WMNL
(85, 2)a
db
c e
f
(90, 1)
(100, 2)
(80, 1)
(95, 2)
(85, 2)
10
5
10
10
15 5
10
5
15
10
10
10
5ω(c,e)
ω(e,f)
ω(f,e)5
The amount of energy needed for a node c to transmit S to another node
e.
The amount of energy needed for a node c to transmit S to another node
e.
ω(c,e) = (Pt_max) × (Adjust Ratio)ω(c,e) = (Pt_max) × (Adjust Ratio)
Adjust Ratio = Adjust Ratio = r
minr
maxt
t
P
P
P
P _
_
'
Pt_max = 20
Pr_min = 3
Pr = 40.750.75
Page: 20WMNL
(85, 2)a
db
c e
f
(90, 1)
(100, 2)
(80, 1)
(95, 2)
(85, 2)
10
5
10
10
15
10
5
10
10
10
5
Source
Destination
m[a]
π[a]
The residual energy over a path from s to node a.
The residual energy over a path from s to node a.
The predecessor of node a.The predecessor of node a.
15
5 5
Pt_max = 20
Page: 21WMNL
(80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
10
5
10
10
15
10
5
10
10
10
5
Source
Destination
m[a] 85
π[a] NIL
m[b] 0
π[b] NIL
m[c] 0
π[c] NIL
85 80
m[b] 80
π[b] a
{sID, nsession, R, β(a), m[a], γ(a)} {sID, nsession, R, β(a), m[a], γ(a)}
15
5 5
min{m[a], β(a)-ω(a,b)-γ(a), β(b)-γ(b)} min{m[a], β(a)-ω(a,b)-γ(a), β(b)-γ(b)}
89
0.250.25Pt_max = 20
0.50.5
Page: 22WMNL
m[c] 0
π[c] NIL
m[b] 80
π[b] a
m[c] 75
π[c] a
(80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
10
5
10
10
15
10
5
10
10
10
5
Source
Destination
85 75
15
5 5
min{m[a], β(a)-ω(a,c)-γ(a), β(c)-γ(c)} min{m[a], β(a)-ω(a,c)-γ(a), β(c)-γ(c)}
98
Pt_max = 20 0.250.25
0.50.5
m[a] 85
π[a] NIL
Page: 23WMNL
m[b] 80
π[b] a (80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
10
5
10
10
15
10
5
10
10
10
5
Source
Destination
m[c] 75
π[c] a
15
5 5
Pt_max = 20 0.250.25
0.50.5
0.250.25
0.750.75
0.750.75
m[a] 85
π[a] NIL
Page: 24WMNL
m[d] 0
π[d] NIL
m[d] 79
π[d] b
m[b] 80
π[b] a (80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
10
5
10
10
15
10
5
10
10
10
5
Source
Destination
m[e] 0
π[e] NIL
m[c] 75
π[c] a
84
15
5 5
min{m[b], β(b)-ω(b,d)-γ(b), β(d)-γ(d)} min{m[b], β(b)-ω(b,d)-γ(b), β(d)-γ(d)}
80
Pt_max = 20 0.250.25
0.50.5
0.250.25
0.750.75
0.750.75
m[a] 85
π[a] NIL 79
Page: 25WMNL
m[d] 79
π[d] b
m[b] 80
π[b] a (80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
10
5
10
10
15
10
5
15
10
10
10
5
Source
Destination
m[e] 0
π[e] NIL
m[c] 75
π[c] a
75 83
5 5
min{m[c], β(c)-ω(c,e)-γ(c), β(e)-γ(e)} min{m[c], β(c)-ω(c,e)-γ(c), β(e)-γ(e)}
93
Pt_max = 20 0.250.25
0.50.5
0.250.25
0.750.75
0.750.75
m[a] 85
π[a] NIL
Page: 26WMNL
m[d] 79
π[d] b
m[b] 80
π[b] a (80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
10
5
10
10
15
10
5
15
10
10
10
5
Source
Destination
m[e] 0
π[e] NIL
m[c] 75
π[c] a
5 5
Pt_max = 20 0.250.25
0.50.5
0.250.25
0.750.75
m[a] 85
π[a] NIL
Page: 27WMNL
0.250.25
m[d] 79
π[d] b
m[b] 80
π[b] a (80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
10
5
10
10
15
10
5
15
10
10
10
5
Source
Destination
m[e] 0
π[e] NIL
m[c] 75
π[c] a
5 5
Pt_max = 20 0.250.25
0.50.5
0.250.25
0.50.5
m[a] 85
π[a] NIL
Page: 28WMNL
0.50.5
m[d] 79
π[d] b
m[b] 80
π[b] a (80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
10
5
10
10
15
10
5
15
10
10
10
5
Source
Destination
m[e] 0
π[e] NIL
m[c] 75
π[c] a
5 5
m[f] 0
π[f] NIL
75 69min{m[d], β(d)-ω(d,f)-γ(d), β(f)-γ(f)} min{m[d], β(d)-ω(d,f)-γ(d), β(f)-γ(f)}
83
m[f] 69
π[f] d
Pt_max = 20 0.250.25
0.50.5
0.250.25
0.250.25
m[a] 85
π[a] NIL
Page: 29WMNL
m[e] 0
π[e] NIL
m[e] 74
π[e] d
m[f] 69
π[f] d
m[d] 79
π[d] b
m[b] 80
π[b] a (80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
10
5
10
10
15
10
5
15
10
10
10
5
Source
Destination
m[c] 75
π[c] a
5 5
79 74min{m[d], β(d)-ω(d,e)-γ(d), β(e)-γ(e)} min{m[d], β(d)-ω(d,e)-γ(d), β(e)-γ(e)}
93
Pt_max = 20 0.250.25
0.50.5
0.250.25
0.250.25
0.50.5
m[a] 85
π[a] NIL
Page: 30WMNL
m[e] 74
π[e] d
m[f] 69
π[f] d
m[d] 79
π[d] b(80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
10
5
10
10
15
10
5
15
10
10
10
5
Source
Destination
m[c] 75
π[c] a
5 5
Pt_max = 20 0.250.25
0.50.5
0.250.25
0.250.25
0.250.25 0.50.5
m[a] 85
π[a] NIL
m[b] 80
π[b] a
Page: 31WMNL
m[e] 74
π[e] d
m[f] 69
π[f] d
m[b] 80
π[b] a (80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
10
5
10
10
15
10
5
15
10
10
10
5
Source
Destination
m[c] 75
π[c] a
5 574 88
min{m[e], β(e)-ω(e,f)-γ(e), β(f)-γ(f)} min{m[e], β(e)-ω(e,f)-γ(e), β(f)-γ(f)}
83
m[f] 74
π[f] e
Pt_max = 20 0.250.25
0.50.5
0.250.25
0.250.25
0.250.25 0.50.50.250.25
m[a] 85
π[a] NIL
m[d] 79
π[d] b
Page: 32WMNL
0.250.25
m[f] 74
π[f] e
m[e] 74
π[e] d
m[d] 79
π[d] b
m[b] 80
π[b] a (80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
10
5
10
10
15
10
5
15
10
10
10
5
Source
Destination
m[c] 75
π[c] a
5 5
Pt_max = 20 0.250.25
0.50.5
0.250.25
0.250.25
74 73min{m[f], β(f)-ω(f,e)-γ(f), β(e)-γ(e)} min{m[f], β(f)-ω(f,e)-γ(f), β(e)-γ(e)}
93
74 73min{m[f], β(f)-ω(f,d)-γ(f), β(d)-γ(d)} min{m[f], β(f)-ω(f,d)-γ(f), β(d)-γ(d)}
79
Loop freeLoop free
m[a] 85
π[a] NIL
Page: 33WMNL
m[a] 85
π[a] NIL
0.250.25
m[f] 74
π[f] e
m[e] 74
π[e] d
m[d] 79
π[d] b
m[b] 80
π[b] a (80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
10
5
10
10
15
10
5
15
10
10
10
5
Source
Destination
m[c] 75
π[c] a
5 5
Pt_max = 20 0.250.25
0.50.5
0.250.25
0.250.25
For a node v other than s
6:
7:
8:
9:
10:
11:
12:
13:
14:
if v receives msg{s, S, β(u), m[u], γ(u)} from a
neighbor u then
if no entry is indexed by (s, S) at v then
Create an entry indexed by (s, S) at v;
m[v] ← 0;
π[v] ← NIL;
if m[v] < min{m[u], β(u)-ω(u,v)-γ(u), β(v)-γ(v)} then
m[v] ← min{m[u], β(u)-ω(u,v)-γ(u), β(v)-γ(v)};
π[v] ← u;
Broadcast msg{s, S, β(v), m[v], γ(v)} to all of its
neighbors;
Loop freeLoop free
Page: 34WMNL
Maximum-Residual Multicast Protocol
Page: 35WMNL
(80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
Source
Destination
Pt_max = 20 0.250.25
0.50.5
0.250.25
0.250.25
0.250.25
m[a] 85
π[a] NILm[f] 74
π[f] e
m[d] 79
π[d] b
m[b] 80
π[b] a
m[c] 75
π[c] a
m[e] 74
π[e] d
Page: 36WMNL
Maximum-Residual Multicast Protocol
Page: 37WMNL
m[f] 74
π[f] e
m[d] 79
π[d] b
m[b] 80
π[b] a (80, 1)
(85, 2)a
db
c e
f
(90, 1)
(100, 2) (95, 2)
(85, 2)
Pt=10
Source
Destination
m[c] 75
π[c] a
m[e] 74
π[e] d
Pt_max = 20
0.50.5
0.250.250.250.25
0.250.25
Pt=5
Pt=10
Pt=5
Pt=5
m[a] 85
π[a] NIL
Page: 38WMNL
Simulation Parameters
Simulator ns-2 (version 2.31)
Network Standard IEEE 802.11b
Antenna TypeOmni-directional (MRMPO)
Irregular (MRMPI)
Frequency 2.4GHz ISM Band
Data Rate 11Mbps
Media Access Control CSMA/CA
Propagation Model Two-Ray Ground
Page: 39WMNL
Intel PRO/Wireless 2011 LAN PC Card
Max Transmission Power 18 dBm
Receiver Sensitivity -62 dBm
Average Communication RangeOmni-directional ： 100 m
Irregular ： Max. 141m 、 Min. 76m
Average Carrier Sense Range 120 m
Transmitter Power Consumption 6.0 watt
Receiver Power Consumption 2.04 watt
Idle Power Consumption 0.12 watt
Page: 40WMNL
500 m
500 m
Deployment Randomly (100 ~ 1000 nodes)
Mobility Pattern Random Walk (1 ~ 10 m/s)
Media Stream 1 MB/minute (0.5Mbps)
Battery Capacity2160 joules (being able to be idle for 5 hours)
Page: 41WMNL
Performance metrics
Network Lifetime
Delivery Ratio
Control Overhead
Propagation Delay
Impact factor
Number of Nodes (100 ~ 1000nodes 、 Static
Networks)
Move Speed (1 ~ 10 m/s 、 100 nodes)
Page: 42WMNL
Comparison
MAODV
(ACM MobiCom 1999, “Multicast Operation of the Ad Hoc On-Demand Distance Vector Routing Protocol”)
MAODVF ： With power adaptation
MAODVP ： Without power adaptation
Page: 43WMNL
Network Lifetime
Scalability Mobility
2~9 times2.6 times
Outrunning problem
Page: 44WMNL
Delivery Ratio
Scalability Mobility
Outrunning problem
Page: 45WMNL
Control Overhead
Scalability Mobility
Neighbor and group maintenance
Page: 46WMNL
Scalability
Control Overhead Delivery Ratio
Page: 47WMNL
Mobility
Control Overhead Delivery Ratio
Page: 48WMNL
Propagation Delay
Scalability Mobility
Shorter path but longer delay！？Control messages are high-priority packets.
Page: 49WMNL
• This paper proposes a power-aware routing protocol - MRMP.
– Maximize the minimum residual energy of nodes in the network.
– Prolong the first node failure time.
– Without collecting the topology of the whole network.
– Without collecting the remaining energy information of each node.
– Nodes are able to have different communication ranges.
– Applicable to various related optimization problems.
• Ex. Minimization of the total energy consumption of any path from a source to a destination
Page: 50WMNL
Wireless & Mobile Network Laboratory (WMNL.) Department of Computer Science and Information Engineering, Tamkang University