Quasi-Dynamic Scheduling in Wireless Broadcast Networks
نویسندگان
چکیده
منابع مشابه
Quasi-Dynamic Scheduling in Wireless Broadcast Networks
The broadcasting nature of wireless networks provides an inherent advantage of utilizing the broadcast gain. To improve the efficiency of the network gain associated with multiuser diversity should be optimally exploited simultaneously keeping in mind the problems of wireless networks. One of the most notable problems which we have focused in this paper is the degradation of Signal-to-Noise Rat...
متن کاملAn evolutionary algorithm for broadcast scheduling in wireless multihop networks
A technical challenge in successful deployment and utilization of wireless multihop networks (WMN) are to make effective use of the limited channel bandwidth. One method to solve this challenge is broadcast scheduling of channel usage by the way of time division multiple access (TDMA). Three evolutionary algorithms, namely genetic algorithm (GA), immune genetic algorithm (IGA) and memetic algor...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملScheduling Periodic Wireless Data Broadcast
We develop simple heuristics, called \MAX" and \MAX-LD", to nd a sub-optimal solution for scheduling data for periodic wireless broadcasts. We also develop a lower bound for a branch-and-bound algorithm, which we call \B&B", to determine the optimal layout for the broadcast. We evaluate these algorithms experimentally and show that B&B runs considerably faster than exhaustive enumeration while ...
متن کاملMinimum-Energy Broadcast Routing in Dynamic Wireless Networks∗
One of the new challenges facing research in wireless networks is the design of algorithms and protocols that are energy aware. A good example is the minimum-energy broadcast routing problem for a static network in the plane, which attracted a great deal of attention these past years. The problem is NPhard and its approximation ratio complexity is a solution proved to be within a factor 6 of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/6130-8360