Sciweavers

1196 search results - page 221 / 240
» Link Scheduling Algorithms for Wireless Mesh Networks
Sort
View
SENSYS
2009
ACM
15 years 6 months ago
Collection tree protocol
This paper presents and evaluates two principles for wireless routing protocols. The first is datapath validation: data traffic quickly discovers and fixes routing inconsistenc...
Omprakash Gnawali, Rodrigo Fonseca, Kyle Jamieson,...
ICCV
2007
IEEE
16 years 1 months ago
Finding a Closed Boundary by Growing Minimal Paths from a Single Point on 2D or 3D Images
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the Fast Marching algorithm. First, an initial point on the des...
Fethallah Benmansour, Stephane Bonneau, Laurent D....
WIOPT
2006
IEEE
15 years 5 months ago
Reverse engineering MAC
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
Ao Tang, Jang-Won Lee, Jianwei Huang, Mung Chiang,...
INFOCOM
2007
IEEE
15 years 6 months ago
Exploiting Hidden Convexity For Flexible And Robust Resource Allocation In Cellular Networks
— A systematic approach to solve seemingly nonconvex resource allocation problems in wireless cellular networks is studied in this paper. By revealing and exploiting the hidden c...
Chee-Wei Tan, Daniel Pérez Palomar, Mung Ch...
SECON
2010
IEEE
14 years 9 months ago
Distributed Routing, Relay Selection, and Spectrum Allocation in Cognitive and Cooperative Ad Hoc Networks
Throughput maximization is a key challenge in cognitive radio ad hoc networks, where the availability of local spectrum resources may change from time to time and hopby-hop. To ach...
Lei Ding, Tommaso Melodia, Stella N. Batalama, Joh...