Performance evaluation of multihop ad hoc WLANs

Eshghi, Farshad; Elhakeem, A.K.; Shayan, Yousef R.

doi:10.1109/mcom.2005.1404604

Cited by 18 publications

(20 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The arrival processes to every node are all relayed versions of the original traffic flow generated at the source node. Traffic models under investigation include CBR (for voice data [16] and periodic traffic in sensor networks), correlated on-off and Bernoulli (for bursty data).…”

Section: Our Contributionsmentioning

confidence: 99%

Towards an end-to-end delay analysis of wireless multihop networks

Xie

Haenggi

2009

Ad Hoc Networks

View full text Add to dashboard Cite

We employ discrete-time queueing theory to analyze the end-to-end (e2e) delay of wireless multihop networks for two MAC schemes, m-phase TDMA and slotted ALOHA. Unlike general two-dimensional networks where there exists sufficient traffic multiplexing that would permit the arrival processes to be approximated as independent, in linear networks with multihop communication, the arrival processes are correlated due to the lack of traffic multiplexing. This paper studies an extreme scenario, a linear network fed with a single flow. A decomposition approach is used to decouple the whole network into isolated nodes. Each node is modeled as a GI/Geo/1 queueing system. We derive the complete per-node delay distribution, Preprint submitted to Elsevier 5 June 2007accounting for both the queueing delay and access delay. Additionally, we characterize the departure processes by a correlated and bursty on-off traffic model. The per-node analysis provides the e2e delay mean while for the e2e delay variance, the strong correlations between the arrival processes need to be considered. Our study shows that the sign of the correlation coefficients depends on both the MAC scheme and the traffic burstiness, both of which determine the relative burst size of the source flow compared to a Bernoulli process, which constitutes an "eigentraffic"process. There is a wide gap in the e2e delay variances for the source flows with different burst sizes even if they have identical average rates. The relative burst size also determines from which direction and at which rate the departure processes converge to the eigentraffic process after traversing multiple relay nodes.

show abstract

Section: Our Contributionsmentioning

confidence: 99%

Towards an end-to-end delay analysis of wireless multihop networks

Xie

Haenggi

2009

Ad Hoc Networks

View full text Add to dashboard Cite

show abstract

“…[11] Presents the performance evaluation of the decentralized nature of communication between nodes in IEEE 802.11, in presence of "hidden" nodes. [13] Shows the performance evaluation of Multihop Ad Hoc WLANs. Thus extensive research has been conducted on WLANs [1]- [13].…”

Section: Introductionmentioning

confidence: 99%

“…[13] Shows the performance evaluation of Multihop Ad Hoc WLANs. Thus extensive research has been conducted on WLANs [1]- [13]. Fairness index was only discussed in [1], [2], [7] and [10].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Performance evaluation of table-driven and buffer-adaptive WLANs

AL-wazedi

Elhakeem

2009

Lecture Notes in Electrical Engineering

View full text Add to dashboard Cite

-The random access control (MAC) technique of standard WLANs is called the distributed coordination function (DCF) [3]. DCF is a carrier sense multiple access based on collision avoidance (CSMA/CA) scheme with binary slotted exponential backoff. This exponential backoff makes the system more complex and fairness [3]-[13] among the stations is a major concern. This paper shows one possible evolution of WLANs where exponential backoff is not employed. In the new techniques herein users transmit randomly but adapt themselves to traffic conditions, thus improving throughput and delay while guarantying fairness. Users in the first technique are controlled by a table which is derived from traffic measurements (Table Driven). In the second, users transmission activities are function of their buffer contents.

show abstract

“…In recent years, interest in communication networks has increased, and various applications of it, such as sensor networks [1], [2], [3] energy sensitive networks [4], [5] and Ad-hoc networks [6], have gained popularity. In this field, networks with colocated receivers and colocated transmitters constitute a substantial part, since it allows increased cooperation [7], thus improving the overall network throughput [8], [9].…”

Section: Introductionmentioning

confidence: 99%

Broadcast Cooperation Strategies for Two Colocated Users

Steiner

Sanderovich

Shamai

2007

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

This work considers the problem of communication from a single transmitter, over a network with colocated users, through an independent block Rayleigh fading channel. The colocation nature of the users allows cooperation, which increases the overall achievable rate, from the transmitter to the destined user. The transmitter is ignorant of the fading coefficients, while receivers have access to perfect channel state information (CSI). This gives rise to the broadcast approach used by the transmitter. The broadcast approach facilitates reliable transmission rates adapted to the actual channel conditions, designed to maximize average throughput. It also allows in our network setting to improve the cooperation between the colocated users. With the broadcast approach, users can decode something out of the message, with almost any fading realization. The better the channel quality, the more layers that can be decoded.Such an approach is useful when considering average rates, rather than outage vs. rate. The cooperation between the users is performed over an additive white Gaussian channels (AWGN), with a relaying power constraint, and unlimited bandwidth. One type of cooperation studied is the amplify-forward (AF) cooperation. Another is the Wyner-Ziv (WZ) compression and forwarding (CF) technique. And finally, decode and forward (DF) cooperation is investigated. In this paper, we extend these methods using the broadcast approach, for the case of relaxed decoding delay constraint. For this case a separated processing of the layers, which includes multi-session cooperation is shown to be beneficial. Further, closed form expressions for infinitely many AF sessions and recursive expressions for the more complex WZ are given. Numerical results for the various cooperation strategies demonstrate the efficiency of multi-session cooperation. Our results can be extended straightforwardly to a setting of a single transmitter sending common information for two cooperating users.

show abstract

Performance evaluation of multihop ad hoc WLANs

Cited by 18 publications

References 13 publications

Towards an end-to-end delay analysis of wireless multihop networks

Towards an end-to-end delay analysis of wireless multihop networks

Performance evaluation of table-driven and buffer-adaptive WLANs

Broadcast Cooperation Strategies for Two Colocated Users

Contact Info

Product

Resources

About