Beruflich Dokumente
Kultur Dokumente
Ning Li and Jennifer C.Hou Department of Computer Science University of Illinous at Urbana-Champaign
Contents
Introduction Network Model Related Work and Why They Cannot Be Directly
Applied To Heterogeneous Networks DRNG and DLMST Properties Of DRNG and DLMST Simulation Study Conclusions References
Introduction
DLMST
Directed Local Minimum Spanning Tree
Be able to prove
1) Derived under both DRNG and DLMST 2) DLMST is bounded, DRNG may be unbounded. 3) DRNG and DLMST preservers network bi-directionality
System Software Laboratory 3
Introduction (cont.)
In Section 2
Network model Summarize previous work on topology control DRNG and DLMST algorithms Prove several of their useful properties Evaluate the performance of the proposed algorithms conclude
In Section 3
In Section 4
In Section 5
In Section 6
In Section 7
Network Model
V = {v1, v2, . . . , vn}, random distrivuted in the 2-D
plane.
Let rvi
Maximal transmission range of vi
Heterogeneous network
All nodes may not be the same. rmin = minvV {rv} rmax = maxvV {rv}
Definition 1
Reachable Neighborhood
or (d(u1, v1) = d(u2, v2) &&max{id(u1), id(v1)} = max{id(u2), id(v2)} &&min{id(u1), id(v1)} > min{id(u2), id(v2)}).
NA(u) = {v V (G) : u
Definition 4
Topology
v , u, v V (GA)}.
Definition 5
Radius
The radius, ru, of node u is defined
Definition 6
Connectivity
If there exists a path(p0 = u, p1,,pm-1,pm = v) It follows that u => v if u = > p and p = > v for some p V(GA)
Definition 7
Bi-Directionality
Definition 8
Bi-Directional Connectivity
Bi-directionally connected to node v (denoted u v ) If there exists a path p0 = u, p1,pm-1, pm = v) It follows that u u if u p and p v for some p V(GA)
Definition 9
Addition and Removal
Addition operation
extra edge (v, u) E(GA)
Removal operation
delete any edge (u, v) E(GA)
RELATED WORK AND WHY THEY CANNOT BE DIRECTLY APPLIED TO HETEROGENEOUS NETWORKS
RELATED WORK AND WHY THEY CANNOT BE DIRECTLY APPLIED TO HETEROGENEOUS NETWORKS
10
RELATED WORK AND WHY THEY CANNOT BE DIRECTLY APPLIED TO HETEROGENEOUS NETWORKS (cont.)
CBTC() [6]
Proved to preserve network connectivity
In [10]
Proposed LMST(Local Minimum Spanning Tree)
Topology control in homogeneous wireless multihop- networks
Proved that
LMST preserves the network connectivity The node degree of any node Can be transformed into one with bi-directional links
11
RELATED WORK AND WHY THEY CANNOT BE DIRECTLY APPLIED TO HETEROGENEOUS NETWORKS (cont.)
12
13
Definition 12
Neighbor Relation in DRNG
u v if and only if d(u, v) ru and there does not exist a third node p such that w(u, p) < w(u, v) and w(p, v) < w(u, v), d(p, v) rp
DRNG
14
Definition 13
Neighbor Relation in DLMST Directed Local Minimum Spanning Tree Graph (DLMST)
u v if and only if (u, v) E(Tu), where Tu is the directed local MST R rooted at u that spans N .
u
DLMST
each node u computes a directed MST that spans N nodes that are one hop away as its neighbors
15
Connectivity
Theorem 1 (Connectivity of DLMST)
If G is strongly connected, then G DLMST is also strongly connected.
Proof
For any two nodes u, v V (G), there exists a unique global MST T rooted at u since G is strongly connected. Since E(T) E(GDLMST ) by Lemma 2, there is a path from u to v in GDLMST .
Lemma 2 : Let T be the global directed MST of G rooted at any node w V(G) ,then E(T) E(Gdlmst)
16
Proof
For any two nodes u, v V (G), since G is strongly connected, there exists a path (p0 = u, p1, p2, . . . , pm1, pm = v) from u to v, such that (pi, pi+1) E(G), i = 0, 1, . . .,m 1. Thus pi pi+1 in GDRNG by Lemma 3. Therefore, u v in GDRNG. Hence we can conclude that GDRNG is strongly connected. Lemma 3: For any edge (u,v) E(G), we have u => v in Gdrng
17
Bi-directionality
Theorem 3
If the original topology G is strongly connected and bi-directional, then G DLMST and G DRNG are also strongly connected and bidirectional
Proof
For any two nodes u, v V (G), there exists at least one path p = (w0 = u,w1, w2, , wm1, wm = v) from u to v, where (wi, wi+1) E(G), i = 0, 1, ,m 1. Since wi wi+1 in GDLMST by Lemma 5, we have u v in GDLMST . Therefore, wi wi+1 in GDRNG, which means u v in GDRNG. The same results still hold after Addition or Removal
Lemma 5 : If the original topology G is strongly connected and bidirectional, then any edge (u,v) E(G) satisfies that u v in Gdlmst
18
(Cont.)
Degree Bound
Theorem 4
For any node u V (GDLMST ), the number of neighbors in GDLMST that are inside Disk(u, rmin) is at most 6.
Theorem 5
The out degree of node in GDLMST is bounded by a constant that depends only on rmax and rmin.
19
Simulation Study
First simulation
50 nodes are uniformly distributed 1000m x 1000m region R&M, DRNG and LMST all reduce
Average node degree, while maintaining network connectivity
21
Simulation Study
(cont.)
Second simulation
Vary the number of nodes in the region
80 to 300
Nodes are uniformly distributed in [10m,250m] Average radius and the average edge length
NONE(no topology control) R&M, DRNG, and DLMST
DLMST outperforms the others Better spatial reuse and use less energy
System Software Laboratory 22
24
Conclusions
Show that
Most existing topology control algorithms
Have different transmission ranges Disconnected network topology
Directly applied to heterogeneous networks.
25
Conclusions
(cont.)
Future research
26
References
[3] S. Narayanaswamy, V. Kawadia, R. S. Sreenivas, and P. R. Kumar, Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol, in Proc. of European Wireless 2002, Next Generation Wireless Networks: Technologies, Protocols, Services and Applications, Florence, Italy, Feb. 2002, pp. 156162. [4] V. Rodoplu and T. H. Meng, Minimum energy mobile wireless networks, IEEE J. Select. Areas Commun., vol. 17, no. 8, pp. 13331344, Aug. 1999. [5] R. Ramanathan and R. Rosales-Hain, Topology control of multihop wireless networks using transmit power adjustment, in Proc. IEEE INFOCOM 2000, Tel Aviv, Israel, Mar. 2000, pp. 404413. [6] L. Li, J. Y. Halpern, P. Bahl, Y.-M. Wang, and R. Wattenhofer, Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks, in Proc. ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, US, Aug. 2001, pp. 264273. [7] V. Kawadia and P. Kumar, Power control and clustering in ad hoc networks, in Proc. IEEE INFOCOM 2003, San Francisco, California, US, Apr. 2003.
27
References (cont.)
[8] S. A. Borbash and E. H. Jennings, Distributed topology control algorithm for multihop wireless networks, in Proc. 2002 World Congress on Computational Intelligence (WCCI 2002), Honolulu, Hawaii, US, May 2002. [9] X.-Y. Li, G. Calinescu, and P.-J. Wan, Distributed construction of planar spanner and routing for ad hoc networks, in Proc. IEEE INFOCOM 2002, New York, New York, US, June 2002. [10] N. Li, J. C. Hou, and L. Sha, Design and analysis of an MSTbased topology control algorithm, in Proc. IEEE INFOCOM 2003, San Francisco, California, US, Apr. 2003.
28