A Cluster-Based Backbone

infrastructure for broadcasting in

MANETs

Student: Pei-Yue Kuo

691530040

2004. 1.15

Blind Flooding

A

B

C

D

1 1

2

2

•A host on receiving a broadcast message for the first time has the obligation to rebroadcast the message•Clearly, this hosts n transmissions in a network of n hosts

Minimum Connected Dominating Set (MCDS)

A subset of nodes is called a dominating set (DS) if every node in the network is either in the set or a neighbor of a node in the set

Cluster Switch Gateway Routing [E. M. Royer ,1999]

Multi-Level Hierarchies for Scalable Ad hoc routing [Elizabeth M., 2003]

Selection of Clusterhead

As a node is first initialized, it broadcasts a Hello message to its neighbors to announce its presence

Selection of Gateway If it receives multiple Hello messages from

cluster leader, it becomes a gateway

Otherwise it declares itself as a clusterhead.

Multi-Level Hierarchies for Scalable Ad hoc routing

s

D

CHCH

G1

G2

G3

G4

G5

System Architecture

Source Dependent Connected Dominating Sets (SD-CDS) [Wei Lou,2003]

Selection of Clusterhead

When a candidate find itself the one with smallest ID, it declares itself as the clusterhead of a new cluster notifies all its 1-hop neighbors

1

6 2 8

C1

5 9

37

C2

4

C3

C4

System Architecture

Selection of Gateway To prevent the continual growth in the

number of gateway

The concept of probability is introduced in the selection of gateway

Selection of gateway algorithm (Cont.)

c1

c3

c4

c2

c5

Selection of gateway algorithm

c1

c3

c4

c2

c5

Selection of gateway algorithm

c1

c3

c4

c2

c5

Merits of proposed algorithm

A forwarding gateway is chosen based on two cases: one that covers the maximum number of

clusters

only one randomly chosen to forward for each cluster.

Contribution Transmission traffic Power utilization.

References(Cont.)

1. S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The broadcast storm problem in a mobile ad hoc network,” Proc. MOBICOM’99. pp. 151-162, Aug.1999.

2. H. Lim and C. Kim, “Flooding in wireless ad hoc networks,” computer Communications Journal, vol. 24, no. 3-4, pp. 353-363, 2001.

3. W. Lou and J. Wu, “On reducing broadcast redundancy in ad hoc wireless networks,” IEEE Transaction on Mobile Computing, vol. 1, no. 2, pp. 111-123, April-June, 2002.

4. B.N. Clark, C.J. Colbourn, and D.S. Johnson, “Unit disk graphs. Discrete Mathematics,” 86:165-177.

5. Routing,” IEEE INFOCM, Vol. 3, 23-27, pp. 1707-1716, June, 2002.

6. Wei Lou and Jie Wu, “A Cluster-Based Backbone Infrastructure for Broadcasting in MANETs,” Proceedings of Parallel and Distributed Processing Symposium, April, 22-26, 2003.

7. Elizabeth M. Belding-Royer, “Multi-Level Hierarchies for Scalable Ad hoc Routing,” Wireless Networks,Vol. 9, Issue 5, pp. 461-478,Sept., 2003.

8. D.J. Baker and A. Ephremides, “The architectural organization of a mobile radio network via a distributed algorithm,” IEEE Transactions on Communications 29(11), 1981.

References(Cont.)

9. Zygmunt J. Hass, Joseph Y. Halpern, Li Li, “Gossip-Based Ad Hoc Routing,” IEEE INFOCM, Vol. 3, 23-27, pp. 1707-1716, June, 2002.

10. Wei Lou and Jie Wu, “A Cluster-Based Backbone Infrastructure for Broadcasting in MANETs,” Proceedings of Parallel and Distributed Processing Symposium, April, 22-26, 2003.

11. Elizabeth M. Belding-Royer, “Multi-Level Hierarchies for Scalable Ad hoc Routing,” Wireless Networks,Vol. 9, Issue 5, pp. 461-478,Sept., 2003.

12. D.J. Baker and A. Ephremides, “The architectural organization of a mobile radio network via a distributed algorithm,” IEEE Transactions on Communications 29(11), 1981.

18. K. M. Alzoubi, P. J. Wan, and O. Frieder. Message-optimal connected dominating sets in mobile ad hoc networks. Proc.of ACM MOBIHOC’2002, pages 157–164, 2002.