ccccccccccccccccccccccccccccc
 c

c
In this project, we propose a bandwidth-efficient multicast mechanism for heterogeneous
wireless networks. We reduce the bandwidth cost of a IP multicast tree by adaptively selecting
the cell and the wireless technology for each mobile host to join the multicast group. Our
mechanism enables more mobile hosts to cluster together and lead to the use of fewer cells to
save the scarce wireless bandwidth. Besides, the paths in the multicast tree connecting to the
selected cells share more common links to save the wireline bandwidth. Our mechanism supports
the dynamic group membership and offers mobility of group members. Moreover, our
mechanism requires no modification on the current IP multicast routing protocols.
We formulate the selection of the cell and the wireless technology for each mobile host in the
heterogeneous wireless networks as an optimization problem. We use Integer Linear
Programming to model the problem and show that the problem is NP-hard. To solve the
problem, we propose an distributed algorithm based on Lagrangean relaxation and a network
protocol based on the algorithm. The simulation results show that our mechanism can effectively
save the wireless and wireline bandwidth as compared to the traditional IP multicast.

c
c
c
c
c
c
c
c
c
c
c
c
c
c
cc
  c

cc c
|outing of the shortest path tree is more flexible

2 .The bandwidth consumption in IP multicast tree is reduced

3. .Mobility of group members and dynamic group membership doesn¶t make any
impact in the IP multicast protocol
c
c cc
Language : Java(JDK1.5)
Front End Tool : Swings
Back End Tool : SQL Server2000
Operating System : Windows 98.
c 
cc
cccccccccProcessor : Any Processor above 500 MH
|am : 128Mb.
Hard Disk : 10 GB.
Compact Disk : 650 Mb.
Input device : Standard Keyboard and Mouse.
Output device : VGA and High |esolution Monitor

Cc
We design an algorithm based on Lagrangean relaxation and devise a distributed protocol
based on the algorithm. Our algorithm iteratively reduces the total bandwidth cost of the shortest
path tree. Our protocol supports the dynamic group membership and mobility of members.
Moreover, our protocol requires no modification on the current IP multicast routing protocols.
Our simulation results show that our mechanism can effectively save the network bandwidth
compared with the traditional IP multicast
 cc  cc
c c
c
c

ccccccccccccccccccccccccccccccccccccccc

cccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc 

ccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccT.Venkata |ajeswar 07N41A12444

A.Srikanth 07N41A1238

B.Sriman 07N41A1240c
ccc
c