806 search results - page 116 / 162 » Lower Bounds on Correction Networks |
IJMC
2006
14 years 12 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
TIT
2008
14 years 11 months ago
2008
Abstract-- The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. acc...
ISCAS
2007
IEEE
15 years 6 months ago
2007
IEEE
— Digital fountain codes are becoming increasingly important for multimedia communications over networks subject to packet erasures. These codes have significantly lower complex...
SENSYS
2009
ACM
15 years 6 months ago
2009
ACM
Having access to an accurate time is a vital building block in all networks; in wireless sensor networks even more so, because wireless media access or data fusion may depend on i...
104
click to vote
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...