Sciweavers

33 search results - page 2 / 7
» On Information-Theoretic Scaling Laws for Wireless Networks
Sort
View
MOBIHOC
2006
ACM
14 years 4 months ago
Fundamental scaling laws for energy-efficient storage and querying in wireless sensor networks
We use a constrained optimization framework to derive fundamental scaling laws for both unstructured sensor networks (which use blind sequential search for querying) and structure...
Joon Ahn, Bhaskar Krishnamachari
INFOCOM
2012
IEEE
11 years 7 months ago
Toward simple criteria to establish capacity scaling laws for wireless networks
Abstract—Capacity scaling laws offer fundamental understanding on the trend of user throughput behavior when the network size increases. Since the seminal work of Gupta and Kumar...
Canming Jiang, Yi Shi, Y. Thomas Hou, Wenjing Lou,...
CORR
2007
Springer
81views Education» more  CORR 2007»
13 years 5 months ago
Throughput Scaling Laws for Wireless Networks with Fading Channels
—A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels b...
Masoud Ebrahimi, Mohammad Ali Maddah-Ali, Amir K. ...
ICC
2009
IEEE
121views Communications» more  ICC 2009»
13 years 2 months ago
Throughput Scaling of Wireless Networks With Random Connections
This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connec...
Shengshan Cui, Alexander M. Haimovich, Oren Somekh...
WIOPT
2006
IEEE
13 years 11 months ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi