Localized Minimum-energy Broadcasting in Ad-hoc Networks
30
Localized Minimum-energy Broadcasting in Ad-hoc Networks Julien Cartigny, David Simplot and Ivan Stoj menović IEEE INFOCOM 2003 Speaker: Chung-Hsien Hsu Presented at TKU Group Meeting Apr. 15, 2004
-
Upload
charlene-durham -
Category
Documents
-
view
18 -
download
0
description
Localized Minimum-energy Broadcasting in Ad-hoc Networks. Julien Cartigny, David Simplot and Ivan Stojmenovi ć IEEE INFOCOM 2003 Speaker: Chung-Hsien Hsu Presented at TKU Group Meeting Apr. 15, 2004. Outline. Introduction Preliminaries Related literature Localized protocol - PowerPoint PPT Presentation
Transcript of Localized Minimum-energy Broadcasting in Ad-hoc Networks
Localized Minimum-energy Broadcasting in Ad-hoc Networks
Julien Cartigny, David Simplot and Ivan Stojmenović
IEEE INFOCOM 2003
Speaker: Chung-Hsien Hsu
Presented at TKU Group Meeting
Apr. 15, 2004
Outline
Introduction Preliminaries Related literature Localized protocol
RNG Topology Control Protocol RNG Broadcast Oriented Protocol
Performance Evaluation Conclusion
Introduction
Minimum energy broadcasting problem Each node can adjust transmission power to minimize
total energy consumption. A message originated from a source node needs to be
forwarded to all the other nodes in the network.
Introduction
Existing broadcasting protocol Topology control oriented protocols
To assign the transmission power for each node. To preserve strong connectivity of the network.
All nodes can be a source of a broadcast. Using pre-assigned transmission radii at each node to reach all nodes of
the network. Min(-total) assignment problem.
NP-hard for two- and three-dimensional space.
Broadcast oriented protocols Considering the broadcast process form a given source node.
NP-complete.
Introduction
Communication models: One-to-all
Omnidirectional antennas Communication zone: disk
One-to-one Directional antennas Communication zone: small beam
Variable angular range Node can choose direction. Width beam that allows to target several neighbor with one tra
nsmission.
Preliminaries - Communication Model
Communication Model
}),(|),{(
),(2 RvudVvuE
EVG
}),(|),{(
),(2 RvudVvuE
EVG
})(0),(),(|),{(
),(2 RururvudVvuE
EVG
r
rr
})(0),(),(|),{(
),(2 RururvudVvuE
EVG
r
rr
Preliminaries - Energy Model
Energy Model
)()( uruE )()( uruE
.0
,0)()()(
otherwise
urifcuruE
.0
,0)()()(
otherwise
urifcuruE
Preliminaries - Energy Model (c=0, α=2)
S D S D
900
S DS D
Preliminaries - Energy Model (c=0, α 2)≧
S D
S D
Preliminaries – Minimum energy broadcasting
Total power consumption:
Vu
uEE )(
Related Literature – topology control protocol
“Power consumption in packet radio networks” Addressed the tree construction in wireless networks. Globalized protocol. NP-hard for three-dimensional space.
“The power range assignment problem in radio networks on the plane” NP-hard for two-dimensional space.
Related Literature – topology control protocol
“On the construction of energy-efficient broadcast and multicast trees in wireless networks” MST Topology Control Protocol (MTCP)
Based on minimum-power spanning tree. Applying Prim’s algorithm. Strongly connected (undirected). Range adjustment:
}),(|),(max{)(
),()(
mst
mst
EvuVvvudurVu
EVGMST
}),(|),(max{)(
),()(
mst
mst
EvuVvvudurVu
EVGMST
Related Literature – Prim’s algorithm
a
b
h
i
c
g
d
f
e
4
11
87
1 2
64
2
8 7
14
10
9
a
b
h
i
c
g
d
f
e
4
11
87
1 2
64
2
8 7
14
10
9
a
b
h
i
c
g
d
f
e
4
11
87
1 2
64
2
8 7
14
10
9
a
b
h
i
c
g
d
f
e
4
11
87
1 2
64
2
8 7
14
10
9
Related Literature – topology control protocol
“On the construction of energy-efficient broadcast and multicast trees in wireless networks” MST Topology Control Protocol (MTCP)
Based on minimum-power spanning tree. Applying Prim’s algorithm. Strongly connected (undirected). Range adjustment:
}),(|),(max{)(
),()(
mst
mst
EvuVvvudurVu
EVGMST
}),(|),(max{)(
),()(
mst
mst
EvuVvvudurVu
EVGMST
Related Literature – topology control protocol
Related Literature – broadcast oriented protocol
Two minimum-energy broadcast problem: Globalized greedy heuristics. BLU heuristic (Broadcast Least-Unicast-cost)
Applying the Dijkstra’s algorithm. BIP (Broadcast Incremental Power)
A modified version of the Prim’s algorithm. Consider additional cost in order to cover new node.
Related Literature – Dijkstra’s algorithm
4
8
1
2
7
94 6
2 30
-
-
-
-
s
t x
zy
4
8
1
2
7
94 6
2 30
4
8
-
-
s
t x
zy
4
8
1
2
7
94 6
2 30
4
6
5
-
s
t x
zy
4
8
1
2
7
94 6
2 30
4
6
5
9
s
t x
zy
4
8
1
2
7
94 6
2 30
4
6
5
8
s
t x
zy
4
8
1
2
7
94 6
2 30
4
6
5
8
s
t x
zy
Related Literature – broadcast oriented protocol
Two minimum-energy broadcast problem: Globalized greedy heuristics. BLU heuristic (Broadcast Least-Unicast-cost)
Applying the Dijkstra’s algorithm. BIP (Broadcast Incremental Power)
A modified version of the Prim’s algorithm. Consider additional cost in order to cover new node.
Related Literature – broadcast oriented protocol
The “sweep” operation: To remove some unnecessary transmission.
)()(),(
)(
vrurvud
uNv
)()(),(
)(
vrurvud
uNv
Localized Protocols
Localized Protocol Communication model: one-to-all Two protocols
RTCP (RNG Topology Control Protocol) RBOP (RNG Broadcast Oriented Protocol)
RNG (Relative Neighborhood Graph) To minimize node degrees, hop-diameter, maximum transmiss
ion radius and the number of biconnected components. Localized protocol
Localized Protocols - RTCP
RNS Topology Control Protocol (RTCP)
)},(),(),(),(
),(),,(|),{(
),()(
vudwvdvudwud
GvwwuVwGvuE
EVGRNG
rng
rng
)},(),(),(),(
),(),,(|),{(
),()(
vudwvdvudwud
GvwwuVwGvuE
EVGRNG
rng
rng
u v
w
Localized Protocols - RTCP
Range adjustment:
}),(|),(max{)( rngEvuVvvudurVu }),(|),(max{)( rngEvuVvvudurVu
Localized Protocols - RTCP
The RNG can be deduced locally by each node by using only the distance with its neighbors. With position system (GPS)
Need only 1-hop information. Without position system
Determine distances Signal strength or time delay information.
Need 2-hop distance information.
Localized Protocols - RBOP
RNG Broadcast Oriented Protocol (RBOP) The adaptation and some improvements of RTCP.
Localized Protocols - RBOP
S
A da
B db
C dc
A
S ds
F df
G dg
C
S ds
E de
D dd
F df
A da
F
A da
E de
C dc
E
F df
C dc
Performance Evaluation
Compared four protocols: MTCP: MST Topology Control Protocol BIP: Broadcast Incremental Power RTCP: RNG Topology Control Protocol RBOP: RNG Broadcast Oriented Protocol
Two energy models: α = 2, c = 0 α = 4, c = 108
Performance Evaluation
Parameters: Number of nodes: 100 (static node) The maximum communication radius: 250 meters Ideal MAC layer Density: 6 to 30 nodes per communication zone 5000 broadcasts have been run for each measure.
Performance Evaluation
Performance Evaluation
Conclusion
Proposed two localized RNG based minimum energy broadcast protocol RTCP (RNG Topology Control Protocol) RBOP (RNG Broadcast Oriented Protocol)
