Maximum bandwidth broadcast in single and multi-interface networks

Authors:
A. A. Bertossi;A. Navarra;C. M. Pinotti
Affiliations:
University of Bologna, Bologna, Italy;University of Perugia, Perugia, Italy;University of Perugia, Perugia, Italy
Venue:
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Year:
2011

Citing 3
Cited 0

Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel

IEEE Transactions on Computers
Localized minimum-latency broadcasting in multi-radio multi-rate wireless mesh networks

WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Minimum Latency Broadcasting in Multiradio, Multichannel, Multirate Wireless Meshes

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A maximum bandwidth broadcast problem in multi-interface networks is considered, where each transmission, simultaneously serving a group of nodes, achieves a total bandwidth equal to the product between the smallest node bandwidth in the group and the cardinality of the group. Two variants of the problem are studied, called the K-Maximum Bandwidth Broadcast in Single-Interface Networks (MBB) and K-Maximum Bandwidth Broadcast in Multiple-Interface Networks (MBBM) problems. It is shown that the former problem can be optimally solved in polynomial time, while the latter one is computationally intractable (i.e. NP-hard). Polynomial time algorithms are devised for optimally solving some particular cases of MBBM where a common order holds and the number of used interfaces is polylogarithmic in the number of nodes.