activity
20092026
most citedDelay-Based Back-Pressure Scheduling in Multihop Wireless Networks

119 citations · 884 across the 130 of their papers we have counts for

collaborators
Showing 2011Show all

6 papers · 1 filter

cs.IT2011★ 5 cited

Secrecy Outage Capacity of Fading Channels

Onur Gungor, Jian Tan, C. Emre Koksal +2

This paper considers point to point secure communication over flat fading channels under an outage constraint. More specifically, we extend the definition of outage capacity to acc…

cs.NI2011★ 1 cited

Maximizing System Throughput by Cooperative Sensing in Cognitive Radio Networks

Shuang Li, Zizhan Zheng, Eylem Ekici +1

Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the mai…

cs.NI2011

On the Critical Delays of Mobile Networks under Lévy Walks and Lévy Flights

Kyunghan Lee, Yoora Kim, Song Chong +3

Delay-capacity tradeoffs for mobile networks have been analyzed through a number of research work. However, Lévy mobility known to closely capture human movement patterns has not b…

cs.NI2011

Downlink Scheduling over Markovian Fading Channels

Wenzhuo Ouyang, Atilla Eryilmaz, Ness B. Shroff

We consider the scheduling problem in downlink wireless networks with heterogeneous, Markov-modulated, ON/OFF channels. It is well-known that the performance of scheduling over fad…

cs.IT2011★ 8 cited

Throughput-Delay Analysis of Random Linear Network Coding for Wireless Broadcasting

B. T. Swapna, Atilla Eryilmaz, Ness B. Shroff

In an unreliable single-hop broadcast network setting, we investigate the throughput and decoding-delay performance of random linear network coding as a function of the coding wind…

cs.NI2011★ 1 cited

Throughput-optimal Scheduling in Multi-hop Wireless Networks without Per-flow Information

Bo Ji, Changhee Joo, Ness B. Shroff

In this paper, we consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do no…