Sciweavers

736 search results - page 67 / 148
» Geometrically aware communication in random wireless network...
Sort
View
INFOCOM
2008
IEEE
16 years 17 days ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
SAC
2008
ACM
15 years 5 months ago
Synchronization of strongly pulse-coupled oscillators with refractory periods and random medium access
The weakly pulse-coupled oscillator framework has proven to be a valuable resource for the development of peer-to-peer synchronization algorithms [9]. But leveraging it in a pract...
Julius Degesys, Prithwish Basu, Jason Redi
ICN
2005
Springer
15 years 11 months ago
Packet Scheduling Across Networks of Switches
Abstract. Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the pr...
Kevin Ross, Nicholas Bambos
HUC
2000
Springer
15 years 9 months ago
Event-Driven, Personalizable, Mobile Interactive Spaces
Abstract An infrastructure is currently being deployed for delivering multimedia services using IP endto-end. Mobile devices and application resources, because of their computing c...
Theo Kanter
SECON
2007
IEEE
16 years 13 days ago
Two-hop Relaying in Random Networks with Limited Channel State Information
— In this paper we study two-hop cooperative diversity relaying in random wireless networks. In contrast to most work on cooperative diversity relaying where the relay node posit...
Furuzan Atay Onat, Dan Avidor, Sayandev Mukherjee