Maximizing the throughput of large ad hoc wireless networks

Hua, Yingbo; Huang, Yi; Garcia-Luna-Aceves, J.J.

doi:10.1109/msp.2006.1708415

Cited by 14 publications

(2 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The MSH-DSCH in principle allows concurrent cochannel transmissions that are two hops away from each other, but its optimality has not been established. The spacing between concurrent cochannel transmissions is known to be crucial for maximal throughput of large multihop networks, [7,14,15].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Hong

Hua

Swami

2007

J Wireless Com Network

View full text Add to dashboard Cite

A distributed and cooperative link-scheduling (DCLS) algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC) algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

show abstract

Section: Introductionmentioning

confidence: 99%

“…The work [18] describes a distributed scheme to achieve interference-free scheduling. For large networks, interference-free scheduling is known to be highly inefficient [14]. The work [19] is based on graph coloring where only conflicting links are assigned orthogonal channels and the spacing issue is not addressed.…”

Section: Introductionmentioning

confidence: 99%

Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Hong

Hua

Swami

2007

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

Predicting throughput in IEEE 802.11 based wireless networks using directional antenna

et al. 2017

View full text Add to dashboard Cite

In IEEE 802.11 based wireless networks interference increases as more access points are added. A metric helping to quantize this interference seems to be of high interest. In this paper we study the relationship between the improved attacking case metric, which captures interference, and throughput for IEEE 802.11 based network using directional antenna. The y 1=3 ¼ a þ b ðln xÞ 3 model was found to best represent the relationship between the interference metric and the network throughput. We use this model to predict the performance of similar networks and decide the best configuration a network operator could use for planning his network.

show abstract

Multi-Hop Progressive Decentralized Estimation of Deterministic Vector in Wireless Sensor Networks

Huang

Hua

2007

2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers

View full text Add to dashboard Cite

Maximizing the throughput of large ad hoc wireless networks

Cited by 14 publications

References 35 publications

Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Predicting throughput in IEEE 802.11 based wireless networks using directional antenna

Multi-Hop Progressive Decentralized Estimation of Deterministic Vector in Wireless Sensor Networks

Contact Info

Product

Resources

About