Sciweavers

7133 search results - page 361 / 1427
» Communication algorithms with advice
Sort
View
143
Voted
MOBIHOC
2003
ACM
16 years 6 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
INFOCOM
2010
IEEE
15 years 5 months ago
Resource Allocation over Network Dynamics without Timescale Separation
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...
Alexandre Proutiere, Yung Yi, Tian Lan, Mung Chian...
ICC
2008
IEEE
100views Communications» more  ICC 2008»
16 years 1 months ago
Power Scheduling for MIMO Relay Channels Employing Rateless Codes
—We propose a simple power scheduling algorithm for relay channels with multiple antennas. The algorithm combines seamlessly with a low complexity communication protocol that emp...
Youjian Liu, Mahesh K. Varanasi, Xinming Huang
ICC
2007
IEEE
138views Communications» more  ICC 2007»
16 years 1 months ago
Optimal Observation Scheduling for connected target coverage problem in Wireless Sensor Networks
— In this paper, we consider the problem of scheduling sensor activity to maximize network lifetime while maintaining both discrete targets coverage and network connectivity. We ...
Qun Zhao, Mohan Gurusamy
INFOCOM
2007
IEEE
16 years 1 months ago
Scalability of Routing Tables in Wireless Networks
— Consider a large wireless ad hoc network that facilitates communication between random pairs of network nodes. The paper investigates the size of routing tables as the number o...
Petar Momcilovic