Data networks
Performance Models of Asynchronous Multitrunk HYPERchannel Networks
IEEE Transactions on Computers
Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
Parallel Graph Algorithms Based Upon Broadcast Communications
IEEE Transactions on Computers
Single round simulation on radio networks
Journal of Algorithms
Data Transfers in Broadcast Networks
IEEE Transactions on Computers
Randomized algorithms
Mobile power management for wireless communication networks
Wireless Networks
Multicluster, mobile, multimedia radio network
Wireless Networks
PAMAS—power aware multi-access protocol with signalling for ad hoc networks
ACM SIGCOMM Computer Communication Review
Broadcast-Efficient Protocols for Mobile Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Randomized Initialization Protocols for Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Permutation Routing in Radio Networks
IEEE Transactions on Parallel and Distributed Systems
An Optimal Channel Access Protocol with Multiple Reception Capacity
IEEE Transactions on Computers
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Randomized Leader Election Protocols in Radio Networks with No Collision Detection
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Efficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas
IEEE Transactions on Parallel and Distributed Systems
Ranking and Sorting in Unreliable Single Hop Radio Network
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Counting-sort and routing in a single hop radio network
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
| Hi-index | 0.00 |
The Broadcast Communication Model (BCM, for short) is a distributed system with no central arbiter populated by p stations denoted by S(1), S(2), ..., S(p) that communicate by transmitting messages on a communication channel. The stations are assumed to have the computing power of a laptop computer and to be synchronous驴in particular, they all run the same program, albeit on different data. We assume that a station is expending power while transmitting or receiving messages. As it turns out, one of the most effective energy-saving strategies is to mandate individual stations to power their transceiver off (i.e., go to sleep) whenever they are not transmitting or receiving messages. Suppose that the p stations of the BCM store collectively n items such that station S(i), (1