Hybrid sensor networks: a small world
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Optimal throughput-delay scaling in wireless networks: part I: the fluid model
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Scalability of wireless networks
IEEE/ACM Transactions on Networking (TON)
Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The multicast capacity of large multihop wireless networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Dynamic retransmission limit scheme for routing in multi-hop ad hoc networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Capacity of large scale wireless networks under Gaussian channel model
Proceedings of the 14th ACM international conference on Mobile computing and networking
Dynamic retransmission limit scheme in MAC layer for routing in multihop ad hoc networks
Journal of Computer Systems, Networks, and Communications
Multicast capacity of wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Scaling properties of delay tolerant networks with correlated motion patterns
Proceedings of the 4th ACM workshop on Challenged networks
Scheduling partition for order optimal capacity in large-scale wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Asymptotic Delay Analysis and Timeout-Based Admission Control for Ad Hoc Wireless Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Bounds on the throughput gain of network coding in unicast and multicast wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
On the improvement of scaling laws for large-scale MANETs with network coding
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Stochastic geometry and random graphs for the analysis and design of wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Capacity scaling of wireless networks with inhomogeneous node density: upper bounds
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Scaling laws of single-hop cognitive networks
IEEE Transactions on Wireless Communications
Capacity scaling in ad hoc networks with heterogeneous mobile nodes: the super-critical regime
IEEE/ACM Transactions on Networking (TON)
A collaborative training algorithm for distributed learning
IEEE Transactions on Information Theory
The capacity of wireless networks in nonergodic random fading
IEEE Transactions on Information Theory
The capacity of wireless networks: information-theoretic and physical limits
IEEE Transactions on Information Theory
On capacity scaling in arbitrary wireless networks
IEEE Transactions on Information Theory
Capacity bounds for large scale wireless ad hoc networks under Gaussian channel model
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Multicast throughput order of network coding in wireless ad-hoc networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Order-optimal data collection in wireless sensor networks: delay and capacity
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Multicast capacity of multi-channel multihop wireless networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Opportunistic scheduling in large-scale wireless networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Impact of node density on throughput and delay scaling in multi-hop wireless networks
IEEE Transactions on Wireless Communications
Capacity scaling in ad hoc networks with heterogeneous mobile nodes: the subcritical regime
IEEE/ACM Transactions on Networking (TON)
Data collection capacity of random-deployed wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Network coding does not change the multicast throughput order of wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Minimum energy per bit for wideband wireless multicasting: performance of decode-and-forward
INFOCOM'10 Proceedings of the 29th conference on Information communications
Capacity scaling of large wireless networks with heterogeneous clusters
Performance Evaluation
Virtual cooperation for throughput maximization in distributed large-scale wireless networks
EURASIP Journal on Advances in Signal Processing - Special issue on cooperative MIMO multicell networks
Multicast capacity of wireless ad hoc networks under Gaussian channel model
IEEE/ACM Transactions on Networking (TON)
Scaling laws for overlaid wireless networks: a cognitive radio network versus a primary network
IEEE/ACM Transactions on Networking (TON)
Capacity scaling of wireless networks with inhomogeneous node density: lower bounds
IEEE/ACM Transactions on Networking (TON)
The multicast capacity of large multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
On multicast throughput scaling of hybrid wireless networks with general node density
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the price of security in large-scale wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
BLOOGO: BLOOm filter based GOssip algorithm for wireless NDN
Proceedings of the 1st ACM workshop on Emerging Name-Oriented Mobile Networking Design - Architecture, Algorithms, and Applications
Generalized two-hop relay for flexible delay control in MANETs
IEEE/ACM Transactions on Networking (TON)
Cell-based snapshot and continuous data collection in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Continuous data aggregation and capacity in probabilistic wireless sensor networks
Journal of Parallel and Distributed Computing
A Constructive Capacity Lower Bound of the Inhomogeneous Wireless Networks
Wireless Personal Communications: An International Journal
| Hi-index | 755.08 |
We address the problem of how throughput in a wireless network scales as the number of users grows. Following the model of Gupta and Kumar, we consider n identical nodes placed in a fixed area. Pairs of transmitters and receivers wish to communicate but are subject to interference from other nodes. Throughput is measured in bit-meters per second. We provide a very elementary deterministic approach that gives achievability results in terms of three key properties of the node locations. As a special case, we obtain Ω(√n) throughput for a general class of network configurations in a fixed area. Results for random node locations in a fixed area can also be derived as special cases of the general result by verifying the growth rate of three parameters. For example, as a simple corollary of our result we obtain a stronger (almost sure) version of the √n/√(logn) throughput for random node locations in a fixed area obtained by Gupta and Kumar. Results for some other interesting non-independent and identically distributed (i.i.d.) node distributions are also provided.