Sciweavers

4642 search results - page 482 / 929
» Distributed algorithm and reversible network
Sort
View
MOBIHOC
2008
ACM
16 years 4 months ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer
ICC
2007
IEEE
160views Communications» more  ICC 2007»
15 years 11 months ago
Maximizing Throughput of Cognitive Radio Networks with Limited Primary Users' Cooperation
— We consider a point-to-multipoint cognitive radio network that shares a set of channels with a primary network. Within the cognitive radio network, a base station (BS) controls...
Anh Tuan Hoang, Ying-Chang Liang, Habibul Islam
CN
1999
154views more  CN 1999»
15 years 4 months ago
Architectural Considerations in the Design of WDM-Based Optical Access Networks
We describe a WDM-based optical access network architecture for providing broadband Internet services. The architecture uses a passive collection and distribution network and a co...
Eytan Modiano, Richard A. Barry
WADS
2007
Springer
96views Algorithms» more  WADS 2007»
15 years 10 months ago
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
Martin Farach-Colton, Miguel A. Mosteiro
APPT
2007
Springer
15 years 10 months ago
Replication-Based Partial Dynamic Scheduling on Heterogeneous Network Processors
It is a great challenge to map network processing tasks to processing resources of advanced network processors, which are heterogeneous and multi-threading multiprocessor System-on...
Zhiyong Yu, Zhiyi Yang, Fan Zhang, Zhiwen Yu, Tuan...