We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
— In a P2P system, a client peer may select one or more server peers to download a specific file. In a P2P resource economy, the server peers charge the client for the download...
Micah Adler, Rakesh Kumar, Keith W. Ross, Dan Rube...
—Considering the interaction through mutual interference of the different radio devices, the channel selection (CS) problem in decentralized parallel multiple access channels can...
We consider a multi-criteria control problem that arises in a delay tolerant network with two adversarial controllers: the source and the jammer. The source's objective is to ...
We consider a wireless collision channel, shared by a finite number of mobile users who transmit to a common base station using a random access protocol. Mobiles are selfoptimizin...