Sciweavers

165 search results - page 30 / 33
» Capacity of Asynchronous Random-Access Scheduling in Wireles...
Sort
View
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 7 months ago
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
Libin Jiang, Jean C. Walrand
ADHOC
2007
118views more  ADHOC 2007»
13 years 7 months ago
Sticky CSMA/CA: Implicit synchronization and real-time QoS in mesh networks
We propose a novel approach to QoS for real-time traffic over wireless mesh networks, in which application layer characteristics are exploited or shaped in the design of medium ac...
Sumit Singh, Prashanth Aravinda Kumar Acharya, Upa...
INFOCOM
2011
IEEE
12 years 11 months ago
Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints
— We consider a peer-to-peer network where nodes can send and receive files amongst their peers. File requests are generated randomly, and each new file can correspond to a dif...
Michael J. Neely, Leana Golubchik
ICDCSW
2008
IEEE
14 years 2 months ago
Fast Link Assessment in Wireless Mesh Networks by Using Non-Constant Weight Code
Abstract— The wireless mesh network is experiencing tremendous growth with the standardization of IEEE 802.11 and IEEE 802.16 technologies. Compared to its wired counterpart, the...
Ravi Nelavelli, Rajesh Prasad, Hongyi Wu
FSTTCS
2004
Springer
14 years 1 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi