abstract In this paper, we propose a
bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We
reduce the bandwidth cost of an Internet Protocol (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 leads to the use of fewer cells to save the scarce wireless
bandwidth. Moreover, our mechanism requires no modification to 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 (non-deterministic polynomial-time
hard).
Existing System:
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. Users in the
heterogeneous wireless networks are usually covered by more than one cell to
avoid connection drop and service disruption.
Multicast is an efficient way for one-to-many and many to-many
communications. Each multicast group owns a set of members, and each member can
be a sender or a receiver of the group. The sender in a multicast group
delivers data in a multicast tree to all receivers of the group. Current
Internet Protocol (IP) multicast routing protocols adopt the shortest path
trees for data delivery. The path from the root of the shortest path tree to
each member must be the shortest path in the network. 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 cellulars,
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. Multicast
is an efficient way for one-to-many and many to-many communications. Each
multicast group owns a set of members, and each member can be a sender or a
receiver of the group. The sender in a multicast group delivers data in a
multicast tree to all receivers of the group. Current Internet Protocol (IP)
multicast routing protocols adopt the shortest path trees for data delivery.
The path from the root of the shortest path tree to each member must be the
shortest path in the network. As a consequence, the bandwidth consumption in an
IP multicast tree will not be able to be reduced in wired networks.
Proposed System:
In this
paper, we first comment 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. The shortest path tree in the
heterogeneous wireless networks consists of two parts. The first one is composed
of the cell and the wireless technology chosen by each mobile host. The second one is comprised of the wired links
that connect the root of the tree and the chosen cells. Therefore, we can
change the routing of the shortest path tree by selecting different cells and
wireless technologies for the mobile hosts to reduce the bandwidth consumption.
we formulate in this paper the selection
of the cell and the wireless technology for each mobile host as an optimization
problem, which is denoted as the Cell and Technology Selection Problem (CTSP)
in the heterogeneous wireless networks for multicast communications. The
problem is to select the cell and the wireless technology for each group member
to minimize the total bandwidth cost of the shortest path tree. We design a
mechanism, which includes an Integer Linear Programming (ILP) formulation, a
distributed algorithm, and a network protocol, to solve the CTSP. We use ILP to
formulate the CTSP, and the network operator can use our ILP formulation to
find the optimal solution for network planning. We show that CTSP is NP-hard,
which, in turn, justifies the necessity of designing efficient algorithms for
suboptimal solutions. We devise an algorithm LAGRANGE, which is based on
Lagrange a relaxation on our ILP formulation.
Software
Requirements:
Ø JDK
5.0
Ø Java
Swings
Hardware
Requirements:
Ø Processor Pentium
Ø RAM 1 GB
No comments:
Post a Comment