Journal Articles and Proceedings: Recent submissions
Now showing items 58-59 of 59
-
Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication
(Association for Computing Machinery, 2009)We prove two broadcast lower bounds for a wireless network model that includes unreliable links. For deterministic algorithms, we show n − 1 rounds are required, where n is the number of processes. For randomized algorithms, ... -
Brief announcement: Minimum spanning trees and cone-based topology control
(Association for Computing Machinery, 2009)Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensuring the communication graph remains ...
