02-03-2011, 04:44 PM
[attachment=9393]
Efficient Resource Allocation for Wireless Multicast
INTRODUCTION:
The success of wireless and mobile communications in the 21st century has resulted in a large variety of wireless technologies such as second and third-generation cellular, satellite, Wi-Fi, and Bluetooth. The heterogeneous wireless networks combine various wireless networks and provide universal wireless access. The leading wireless companies in some countries have operated networks with multiple wireless technologies, such as T-Mobile in the United States, British Telecom in the United Kingdom, Orange Telecom in France, NTT DoCoMo in Japan, and Chunghwa Telecom in Taiwan. The number of such Companies would increase because the standards for operators to provide seamless services in networks with multiple wireless technologies have been proposed by the Third-Generation Partnership Project (3GPP) and Unlicensed Mobile Access (UMA) . In addition, users in the heterogeneous wireless networks are usually covered by more than one cell to avoid connection drop and service disruption. More mobile terminals in the wireless networks are likely to own multiple wireless technologies. Therefore, the heterogeneous wireless networks provide the mobile hosts with many choices for the cells and wireless technologies to access the Internet.
SCOPE OF THE PROJECT:
The main aim of the project is to reduce the bandwidth cost of the multicast tree.
The bandwidth cost is reduced by finding the shortest path. We implement Lagrangean
Algorithm to find the shortest path.
Module:
We have the following module to prove the effective resource allocation. They are as follows.
• Add nodes
• Resource allocation
• Source and Destination
• Lagrangean path
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. Then we will find the nearest tower to that. The main advantage of finding this is to use the available bandwidth. And by this way we will connect the mobile to the nearest tower. And by this way we will maintain good band width usage.
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.
MODULE INPUT AND OUTPUT:
MODULE INPUT:
We provide the number of nodes we required. Then the source and destination nodes are provided.
MODULE OUTPUT:
The expected output of the module is to show the shortest path between the source and destination mobile.
Efficient Resource Allocation for Wireless Multicast
INTRODUCTION:
The success of wireless and mobile communications in the 21st century has resulted in a large variety of wireless technologies such as second and third-generation cellular, satellite, Wi-Fi, and Bluetooth. The heterogeneous wireless networks combine various wireless networks and provide universal wireless access. The leading wireless companies in some countries have operated networks with multiple wireless technologies, such as T-Mobile in the United States, British Telecom in the United Kingdom, Orange Telecom in France, NTT DoCoMo in Japan, and Chunghwa Telecom in Taiwan. The number of such Companies would increase because the standards for operators to provide seamless services in networks with multiple wireless technologies have been proposed by the Third-Generation Partnership Project (3GPP) and Unlicensed Mobile Access (UMA) . In addition, users in the heterogeneous wireless networks are usually covered by more than one cell to avoid connection drop and service disruption. More mobile terminals in the wireless networks are likely to own multiple wireless technologies. Therefore, the heterogeneous wireless networks provide the mobile hosts with many choices for the cells and wireless technologies to access the Internet.
SCOPE OF THE PROJECT:
The main aim of the project is to reduce the bandwidth cost of the multicast tree.
The bandwidth cost is reduced by finding the shortest path. We implement Lagrangean
Algorithm to find the shortest path.
Module:
We have the following module to prove the effective resource allocation. They are as follows.
• Add nodes
• Resource allocation
• Source and Destination
• Lagrangean path
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. Then we will find the nearest tower to that. The main advantage of finding this is to use the available bandwidth. And by this way we will connect the mobile to the nearest tower. And by this way we will maintain good band width usage.
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.
MODULE INPUT AND OUTPUT:
MODULE INPUT:
We provide the number of nodes we required. Then the source and destination nodes are provided.
MODULE OUTPUT:
The expected output of the module is to show the shortest path between the source and destination mobile.
