Sciweavers

1687 search results - page 142 / 338
» On the complexity of scheduling in wireless networks
Sort
View
JCO
2006
234views more  JCO 2006»
15 years 6 months ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
JCM
2008
94views more  JCM 2008»
15 years 6 months ago
Cell Site Power Characterization for Multi-rate Wireless CDMA Data Networks Using Lognormal Approximation
An analytical model is developed to solve the power-rate assignment problem for multi-rate CDMA systems and calculate the probability density function (PDF) for the downlink traffi...
Ashraf S. Hasan Mahmoud
ANCS
2007
ACM
15 years 10 months ago
Optimal packet scheduling in output-buffered optical switches with limited-range wavelength conversion
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
Lin Liu, Yuanyuan Yang
INFOCOM
2009
IEEE
16 years 1 months ago
Measuring Complexity and Predictability in Networks with Multiscale Entropy Analysis
—We propose to use multiscale entropy analysis in characterisation of network traffic and spectrum usage. We show that with such analysis one can quantify complexity and predict...
Janne Riihijärvi, Matthias Wellens, Petri M&a...
AICCSA
2005
IEEE
124views Hardware» more  AICCSA 2005»
16 years 19 hour ago
On multicast scheduling and routing in multistage Clos networks
Multicast communication, which involves transmitting information from one node to multiple nodes, is a vital operation in both broadband integrated services digital networks (BISD...
Bin Tang