13-05-2010, 04:18 PM
[attachment=3511]
Presented By:
INTERNAL GUIDE : Ms. Meenakshi
STUDENT NAME : Karthick. T
QUALIFICATION : M. Tech
Efficient Resource Allocation for Wireless Multicast
AGENDA
The existing system of this project consumes more band width for the Internet Protocol multicast tree.
It does not support the dynamic group of members and mobility of group members.
Most previous works for mobile multicast in the heterogeneous wireless networks focus on the efficient mechanisms to provide seamless handover between different networks and the related security issues only.
MOTIVATION AND JUSTIFICATION
The aim of the proposed system is to reduce the bandwidth cost of an internet protocol multicast tree.
This can be achieved through adaptively selecting the cell and the wireless technology for each mobile host to join the multicast group.
This can be done through finding the shortest path.
That the bandwidth consumption in the shortest path tree can be reduced in the heterogeneous wireless networks because the routing of the shortest path tree here is more flexible.
DATA FLOW DIAGRAM
SEQUENCE DIAGRAM
COLLABORATION DIAGRAM
CLASS DIAGRAM
MODULES
Modules Description
Add nodes:
In this module we provide number of nodes we required in the network.
Once our requirement is provided group of nodes get arranged in each cell randomly.
Each cell accesses the nodes according to its capability.
Resource allocation:
The resource allocation will find the nearest tower to the mobile.
The main advantage of finding the nearest tower is to use the available bandwidth.
And by this way we will maintain good band width usage.
MODULE DESCRIPTION
Source and Destination:
In this module we are going to choose the source and destination nodes.
Once the source node is entered, its position and the cell which contains the node is stored.
Similarly the position of destination node is found in order to find the shortest path.
Lagrangean path:
In this module we divide the problem into two sub problems.
With the help of first sub problem we find the method of accessing the nearest cell.
With the help of second sub problem the consumption of bandwidth is found.
Finally the Lagrangean iteration process provides the shortest path to access the mobile.
CONCLUSION
We have proposed a new mechanism for reducing the total bandwidth cost of the IP multicast tree by adaptively selecting the cell and the wireless technology for each mobile host.
We model the selection of the cell and the wireless technology for each mobile host as an optimization problem.
We use ILP to formulate the optimization problem and show that the problem is NP-hard.
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.
FUTURE WORK
BIBLIOGRAPHY
T.G. Harrison, C.L. Williamson, W.L. Mackrell, and R.B. Bunt,Mobile Multicast (MoM) Protocol: Multicast Support for Mobile Hosts, Proc. ACM MobiCom, pp. 151-160, 1997.
C.R. Lin and K.-M. Wang, Mobile Multicast Support in IP Networks, Proc. IEEE INFOCOM, vol. 3, pp. 1664-1672, 2000.
Y. Wang and W. Chen, Supporting IP Multicast for MobileHosts, ACM Mobile Networks and Applications, vol. 6, no. 1, pp. 57-66, Jan. 2001
L. Huang, K.A. Chew, and R. Tafazolli, Network Selection forOne-to-Many Services in 3G-Broadcasting Cooperative Networks, Proc. 61st IEEE Vehicular Technology Conf. (VTC ™05“ Spring), vol. 5, pp. 2999-3003, 2005.
M. Hauge and Ø. Kure, Multicast in 3G Networks: Employment of Existing IP Multicast Protocols in UMTS, Proc. Fifth ACM Int™l Workshop Wireless Mobile Multimedia (WoWMoM ™02), 2002.
Presented By:
INTERNAL GUIDE : Ms. Meenakshi
STUDENT NAME : Karthick. T
QUALIFICATION : M. Tech
Efficient Resource Allocation for Wireless Multicast
AGENDA
The existing system of this project consumes more band width for the Internet Protocol multicast tree.
It does not support the dynamic group of members and mobility of group members.
Most previous works for mobile multicast in the heterogeneous wireless networks focus on the efficient mechanisms to provide seamless handover between different networks and the related security issues only.
MOTIVATION AND JUSTIFICATION
The aim of the proposed system is to reduce the bandwidth cost of an internet protocol multicast tree.
This can be achieved through adaptively selecting the cell and the wireless technology for each mobile host to join the multicast group.
This can be done through finding the shortest path.
That the bandwidth consumption in the shortest path tree can be reduced in the heterogeneous wireless networks because the routing of the shortest path tree here is more flexible.
DATA FLOW DIAGRAM
SEQUENCE DIAGRAM
COLLABORATION DIAGRAM
CLASS DIAGRAM
MODULES
Modules Description
Add nodes:
In this module we provide number of nodes we required in the network.
Once our requirement is provided group of nodes get arranged in each cell randomly.
Each cell accesses the nodes according to its capability.
Resource allocation:
The resource allocation will find the nearest tower to the mobile.
The main advantage of finding the nearest tower is to use the available bandwidth.
And by this way we will maintain good band width usage.
MODULE DESCRIPTION
Source and Destination:
In this module we are going to choose the source and destination nodes.
Once the source node is entered, its position and the cell which contains the node is stored.
Similarly the position of destination node is found in order to find the shortest path.
Lagrangean path:
In this module we divide the problem into two sub problems.
With the help of first sub problem we find the method of accessing the nearest cell.
With the help of second sub problem the consumption of bandwidth is found.
Finally the Lagrangean iteration process provides the shortest path to access the mobile.
CONCLUSION
We have proposed a new mechanism for reducing the total bandwidth cost of the IP multicast tree by adaptively selecting the cell and the wireless technology for each mobile host.
We model the selection of the cell and the wireless technology for each mobile host as an optimization problem.
We use ILP to formulate the optimization problem and show that the problem is NP-hard.
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.
FUTURE WORK
BIBLIOGRAPHY
T.G. Harrison, C.L. Williamson, W.L. Mackrell, and R.B. Bunt,Mobile Multicast (MoM) Protocol: Multicast Support for Mobile Hosts, Proc. ACM MobiCom, pp. 151-160, 1997.
C.R. Lin and K.-M. Wang, Mobile Multicast Support in IP Networks, Proc. IEEE INFOCOM, vol. 3, pp. 1664-1672, 2000.
Y. Wang and W. Chen, Supporting IP Multicast for MobileHosts, ACM Mobile Networks and Applications, vol. 6, no. 1, pp. 57-66, Jan. 2001
L. Huang, K.A. Chew, and R. Tafazolli, Network Selection forOne-to-Many Services in 3G-Broadcasting Cooperative Networks, Proc. 61st IEEE Vehicular Technology Conf. (VTC ™05“ Spring), vol. 5, pp. 2999-3003, 2005.
M. Hauge and Ø. Kure, Multicast in 3G Networks: Employment of Existing IP Multicast Protocols in UMTS, Proc. Fifth ACM Int™l Workshop Wireless Mobile Multimedia (WoWMoM ™02), 2002.
