1783 search results - page 135 / 357 » Low-Complexity Distributed Scheduling Algorithms for Wireles... |
128
click to vote
DIALM
1999
ACM
15 years 7 months ago
1999
ACM
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
226
click to vote
JSAC
2007
15 years 2 months ago
2007
— The large number of network nodes and the energy constraints make Wireless Sensor Networks (WSN) one of the most important application fields for Cooperative Diversity. Node c...
138
click to vote
TON
2008
15 years 2 months ago
2008
Abstract-- We consider the problem of broadcasting in an adhoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Ou...
163
click to vote
TMC
2010
15 years 1 months ago
2010
—One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implem...
112
click to vote
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—Proportional Fair (PF) is a frequently used channelaware scheduling algorithm in 3G wireless networks. However, recent work by us and others has shown that, in practice,...