Sciweavers

59 search results - page 6 / 12
» A distributional study of the path edge-covering numbers for...
Sort
View
TWC
2008
99views more  TWC 2008»
13 years 7 months ago
Distributed Antenna Systems with Randomness
Abstract--In a cellular distributed antenna system (DAS), distributed antenna elements (AEs) are connected to the base station via an offline dedicated link, e.g. fiber optics or l...
Jun Zhang, Jeffrey G. Andrews
IPPS
1998
IEEE
13 years 11 months ago
Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
Vincenzo Auletta, Sajal K. Das, Amelia De Vivo, Ma...
ISCIS
2004
Springer
14 years 23 days ago
Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
GLOBECOM
2006
IEEE
14 years 1 months ago
Blocking Vulnerable Paths of Wireless Sensor Networks
— In this work, we study the topology enhancement problem of wireless sensor networks. Our research focuses on reducing the path-based vulnerability. The objective is to get as m...
Shu Zhou, Min-You Wu, Wei Shu
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 2 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos