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.) Department of Computer Science and Information Engineering, Tamkang Unive
50
Embed
A Maximum-Residual Multicast Protocol for Large-Scale Mobile Ad Hoc Networks
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 Presentation
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
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