Sciweavers

736 search results - page 39 / 148
» Approximating the Number of Network Motifs
Sort
View
WIOPT
2011
IEEE
14 years 1 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...
INFOCOM
2003
IEEE
15 years 3 months ago
A Queueing Network Model of an Edge Optical Burst Switching Node
— We consider an edge optical burst switching (OBS) node with or without converters, and with no buffering. The OBS node serves a number of users, each connected to the switch ov...
Lisong Xu, Harry G. Perros, George N. Rouskas
MSN
2005
Springer
15 years 3 months ago
Population Estimation for Resource Inventory Applications over Sensor Networks
Abstract. The growing advance in wireless communications and electronics makes the development of low-cost and low-power sensors possible. These sensors are usually small in size a...
Jiun-Long Huang
WINET
2008
86views more  WINET 2008»
14 years 9 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
ICASSP
2011
IEEE
14 years 1 months ago
User admission in MIMO interference alignment networks
In this paper we consider an interference channel where a set of primary active users are cooperating through interference alignment over a constant multiple-input-multiple-output...
Behrang Nosrat-Makouei, Jeffrey G. Andrews, Robert...