2,701 research outputs found
Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods
Copyright @ 2010 Elsevier B.V. All rights reserved.In this paper, the quality of service multicast routing and channel assignment (QoS-MRCA) problem is investigated. It is proved to be a NP-hard problem. Previous work separates the multicast tree construction from the channel assignment. Therefore they bear severe drawback, that is, channel assignment cannot work well with the determined multicast tree. In this paper, we integrate them together and solve it by intelligent computational methods. First, we develop a unified framework which consists of the problem formulation, the solution representation, the fitness function, and the channel assignment algorithm. Then, we propose three separate algorithms based on three representative intelligent computational methods (i.e., genetic algorithm, simulated annealing, and tabu search). These three algorithms aim to search minimum-interference multicast trees which also satisfy the end-to-end delay constraint and optimize the usage of the scarce radio network resource in wireless mesh networks. To achieve this goal, the optimization techniques based on state of the art genetic algorithm and the techniques to control the annealing process and the tabu search procedure are well developed separately. Simulation results show that the proposed three intelligent computational methods based multicast algorithms all achieve better performance in terms of both the total channel conflict and the tree cost than those comparative references.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1
Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using simulated annealing
This is the post-print version of the article - Copyright @ 2008 Springer-VerlagThis paper proposes a simulated annealing (SA) algorithm based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. In the proposed SA multicast algorithm, the path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we anticipate the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. The techniques for controlling the annealing process are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed SA based multicast algorithm can produce the multicast trees which have better performance in terms of both the total channel conflict and the tree cost than that of a well known multicast algorithm in wireless mesh networks.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1
Recommended from our members
Multimedia delivery in the future internet
The term “Networked Media” implies that all kinds of media including text, image, 3D graphics, audio
and video are produced, distributed, shared, managed and consumed on-line through various networks,
like the Internet, Fiber, WiFi, WiMAX, GPRS, 3G and so on, in a convergent manner [1]. This white
paper is the contribution of the Media Delivery Platform (MDP) cluster and aims to cover the Networked
challenges of the Networked Media in the transition to the Future of the Internet.
Internet has evolved and changed the way we work and live. End users of the Internet have been confronted
with a bewildering range of media, services and applications and of technological innovations concerning
media formats, wireless networks, terminal types and capabilities. And there is little evidence that the pace
of this innovation is slowing. Today, over one billion of users access the Internet on regular basis, more
than 100 million users have downloaded at least one (multi)media file and over 47 millions of them do so
regularly, searching in more than 160 Exabytes1 of content. In the near future these numbers are expected
to exponentially rise. It is expected that the Internet content will be increased by at least a factor of 6, rising
to more than 990 Exabytes before 2012, fuelled mainly by the users themselves. Moreover, it is envisaged
that in a near- to mid-term future, the Internet will provide the means to share and distribute (new)
multimedia content and services with superior quality and striking flexibility, in a trusted and personalized
way, improving citizens’ quality of life, working conditions, edutainment and safety.
In this evolving environment, new transport protocols, new multimedia encoding schemes, cross-layer inthe
network adaptation, machine-to-machine communication (including RFIDs), rich 3D content as well as
community networks and the use of peer-to-peer (P2P) overlays are expected to generate new models of
interaction and cooperation, and be able to support enhanced perceived quality-of-experience (PQoE) and
innovative applications “on the move”, like virtual collaboration environments, personalised services/
media, virtual sport groups, on-line gaming, edutainment. In this context, the interaction with content
combined with interactive/multimedia search capabilities across distributed repositories, opportunistic P2P
networks and the dynamic adaptation to the characteristics of diverse mobile terminals are expected to
contribute towards such a vision.
Based on work that has taken place in a number of EC co-funded projects, in Framework Program 6 (FP6)
and Framework Program 7 (FP7), a group of experts and technology visionaries have voluntarily
contributed in this white paper aiming to describe the status, the state-of-the art, the challenges and the way
ahead in the area of Content Aware media delivery platforms
Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using tabu search
Copyright @ 2009 IEEE Computer SocietyThis paper proposes a tabu search (TS) based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. The path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we expect the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. The techniques for controlling the tabu search procedure are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed TS multicast algorithm can produce the multicast trees which have better performance in terms of both the total channel conflict and the tree cost than that of a well known multicast algorithm in wireless mesh networks.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1
A genetic-inspired joint multicast routing and channel assignment algorithm in wireless mesh networks
Copyright @ 2008 IEEEThis paper proposes a genetic algorithm (GA) based optimization approach to search a minimum-interference multicast tree which satis¯es the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. The path-oriented en- coding method is used and each chromosome is represented by a tree data structure (i.e., a set of paths). Since we expect the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. Crossover and mutation are well designed to adapt to the tree structure. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed GA based multicast algorithm achieves better performance in terms of both the total channel conflict and the tree cost than that of a well known algorithm
Optimized resource distribution for interactive TV applications
This paper proposes a novel resource optimization scheme for cloud-based interactive television applications that are increasingly believed to be the future of television broadcasting and media consumption, in general. The varying distribution of groups of users and the need for on-the-fly media processing inherent to this type of application necessitates a mechanism to efficiently allocate the resources at both a content and network level. A heuristic solution is proposed in order to (a) generate end-to-end delay bound multicast trees for individual groups of users and (b) co-locate multiple multicast trees, such that a minimum group quality metric can be satisfied. The performance of the proposed heuristic solution is evaluated in terms of the serving probability (i.e., the resource utilization efficiency) and execution time of the resource allocation decision making process. It is shown that improvements in the serving probability of up to 50%, in comparison with existing resource allocation schemes, and several orders of magnitude reduction of the execution time, in comparison to the linear programming approach to solving the optimization problem, can be achieved
- …