Sciweavers

140 search results - page 17 / 28
» Limitations of Current Wireless Scheduling Algorithms
Sort
View
INFOCOM
2008
IEEE
15 years 4 months ago
iPack: in-Network Packet Mixing for High Throughput Wireless Mesh Networks
—A major barrier for the adoption of wireless mesh networks is severe limits on throughput. Many in-network packet mixing techniques at the network layer [1], [2], [3] as well as...
Richard Alimi, Erran L. Li, Ramachandran Ramjee, H...
ICC
2007
IEEE
145views Communications» more  ICC 2007»
15 years 4 months ago
Power-Aware 3D Position-based Routing Algorithms for Ad Hoc Networks
— A crucial problem in ad hoc networks is finding an efficient and correct route between a source and a destination; however for many networks, a more important problem is prov...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...
MOBICOM
2009
ACM
15 years 5 months ago
A scalable micro wireless interconnect structure for CMPs
This paper describes an unconventional way to apply wireless networking in emerging technologies. It makes the case for using a two-tier hybrid wireless/wired architecture to inte...
Suk-Bok Lee, Sai-Wang Tam, Ioannis Pefkianakis, So...
MOBIHOC
2009
ACM
15 years 11 months ago
Efficient resource management in OFDMA Femto cells
Femto cells are a cost-effective means of providing ubiquitous connectivity in future broadband wireless networks. While their primary purpose has been to improve coverage in curr...
Karthikeyan Sundaresan, Sampath Rangarajan
ATAL
2011
Springer
13 years 10 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe