948 search results - page 7 / 190 » What can we achieve by arbitrary announcements |
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—Cooperative broadcast aims to deliver common messages to all receiver nodes in the wireless network by utilizing cooperation between them. This can have many important applicati...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—Recently, it has been shown that a simple, distributed CSMA algorithm is throughput-optimal. However, throughput-optimality is established under the perfect or ideal car...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— We present an analytical tool to enhance the blocking performance in the circuit-switched wide-area optical wavelength division multiplexed (WDM) networks with no wavelength co...