Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Introduction to Algorithms
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
DEAR: a device and energy aware routing protocol for heterogeneous ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
Throughput capacity of random ad hoc networks with infrastructure support
Proceedings of the 9th annual international conference on Mobile computing and networking
Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Dynamic adaptive routing for a heterogeneous wireless network
Mobile Networks and Applications
Capacity bounds for ad hoc and hybrid wireless networks
ACM SIGCOMM Computer Communication Review
On Mobility-Capacity-Delay Trade-off in Wireless Ad Hoc Networks
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Access control in heterogeneous multichannel wireless networks
InterSense '06 Proceedings of the first international conference on Integrated internet ad hoc and sensor networks
On the throughput scaling of wireless relay networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Capacity of a wireless ad hoc network with infrastructure
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Capacity and delay of hybrid wireless broadband access networks
IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
An adaptive power controlled MAC protocol for wireless ad hoc networks
IEEE Transactions on Wireless Communications
Power controlled network protocols for multi-rate ad hoc networks
IEEE Transactions on Wireless Communications
Impacts of Topology and Traffic Pattern on Capacity of Hybrid Wireless Networks
IEEE Transactions on Mobile Computing
Throughput, delay, and mobility in wireless ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Throughput and Delay in Random Wireless Networks With Restricted Mobility
IEEE Transactions on Information Theory
Capacity of ad hoc wireless networks with infrastructure support
IEEE Journal on Selected Areas in Communications
Improved throughput bounds for interference-aware routing inwireless networks
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
A geometry study on the capacity of wireless networks via percolation
IEEE Transactions on Communications
Multicast capacity-delay tradeoff with network coding in MANETs
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Efficient link-heterogeneous multicast for wireless mesh networks
Wireless Networks
Capacity bounds of three-dimensional wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Exploiting mobility patterns for inter-technology handover in mobile environments
Computer Communications
Capacity scaling of general cognitive networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Although capacity has been extensively studied in wireless networks, most of the results are for homogeneous wireless networks where all nodes are assumed identical. In this paper, we investigate the capacity of heterogeneous wireless networks with general network settings. Specifically, we consider a dense network with n normal nodes and m = nb (0 b b(n) and length 1/b(n), where b(n) = nw and -1/2 w ≤ 0. We assume there are n flows in the network. All the n normal nodes are sources while only randomly chosen nd (0 d n normal nodes are uniformly and independently distributed, while the m helping nodes are either regularly placed or uniformly and independently distributed, resulting in two different kinds of networks called Regular Heterogeneous Wireless Networks and Random Heterogeneous Wireless Networks, respectively. In this paper, we attempt to find out what a heterogeneous wireless network with general network settings can do by deriving a lower bound on the capacity. We also explore the conditions under which heterogeneous wireless networks can provide throughput higher than traditional homogeneous wireless networks.