Analyzing the hidden-terminal effects and multimedia support for wireless LAN

Moh, W. Melody; Yao, Danfeng; Makki, Kia

doi:10.1016/s0140-3664(99)00216-9

Cited by 9 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…-Receiver collision: SO-TDMA and CS-TDMA experience receiver collisions from hidden terminal problems. For example, two ships that cannot sense each other reserve the same time slot and send data to the same NS [11]. Thus, a MAC protocol for SANETs must mitigate this problem of receiver collisions.…”

Section: Introductionmentioning

confidence: 99%

ASO-TDMA: ad-hoc self-organizing TDMA protocol for shipborne ad-hoc networks

Yun

Lim

2012

J Wireless Com Network

View full text Add to dashboard Cite

A shipborne ad-hoc network (SANET), a maritime counterpart of the terrestrial vehicle ad-hoc network, can provide ships with diverse multimedia services by substituting digital maritime VHF communications for expensive satellite communications. This article proposes ad-hoc self-organizing TDMA (ASO-TDMA), a medium access control (MAC) protocol targeting SANETs. Frames in ASO-TDMA are divided into several sub-frames, and based on the proposed rules for assigning time slots, ships can only reserve time slots for data transfers through their available sub-frames. Accordingly, ASO-TDMA provides better performance in terms of reducing receiver collisions from hidden terminal problems compared to self-organizing TDMA (SO-TDMA) and carrier-sensing TDMA (CS-TDMA), two existing MAC protocols for maritime VHF communications. In addition, the article compares the performance of the three MAC protocols in terms of delays and collision rates (CRs). The results suggest that, given the same delay, ASO-TDMA can reduce the CR by as much as 30% in comparison with SO-TDMA and CS-TDMA. Similarly, given the same CR, ASO-TDMA can reduce delays by as much as 26% in comparison with SO-TDMA and CS-TDMA.

show abstract

Section: Introductionmentioning

confidence: 99%

ASO-TDMA: ad-hoc self-organizing TDMA protocol for shipborne ad-hoc networks

Yun

Lim

2012

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…The techniques presented in [16], therefore, are not applicable in the present context. Other related works include [19,20], which also do not take queuing into account.…”

Section: Related Workmentioning

confidence: 99%

Performance of wireless networks with hidden nodes: a queuing-theoretic analysis

Ray

Starobinski

Carruthers

2005

Computer Communications

View full text Add to dashboard Cite

Hidden nodes are a fundamental problem that can potentially affect any wireless network where nodes cannot hear each other. Although the hidden node problem is well known, so far only few papers have quantified its effects in a comprehensive manner. This paper represents a first step towards getting a quantitative insight into the impact of hidden nodes on the performance of wireless networks. We first carry out an exact queuing-theoretic analysis for a 4-node segment and derive analytical expressions for the probability of packet collision, the mean packet delay, and the maximum throughput, based on a model that closely follows the IEEE 802.11 standard. We then extend the analysis and provide an approximation for a general linear topology that is asymptotically exact at low load. Finally, we perform detailed simulations to validate our analytical results and show their applicability to predict the performance of IEEE 802.11 networks with hidden nodes. The simulation and analysis closely match. Moreover, they reveal that the impact of hidden nodes propagates through the network causing some nodes to saturate at load as low as 15% of the capacity.

show abstract

“…Refs. [5,6] considered the removal of silent stations from the polling list provided that these stations responded with NULL frames to a number of consecutive CF-Poll frames. In the CSSR polling scheme, the silent stations are immediately removed from the AP polling list and remain out of it for a number of PCF rounds.…”

Section: The Dynamically Adaptable Polling Schemementioning

confidence: 99%

“…A similar approach is adopted in Ref. [6], which evaluates the IEEE802.11 PCF mode for supporting realtime traffic. In Ref.…”

Section: Introductionmentioning

confidence: 99%

A dynamically adaptable polling scheme for voice support in IEEE802.11 networks

Ziouva¹,

Antonakopoulos²

2003

Computer Communications

View full text Add to dashboard Cite

This paper presents a new dynamically adaptable polling scheme for efficient support of voice communications over an IEEE802.11 network. The proposed Cyclic Shift and Station Removal polling scheme is implemented only on the Access Point of each Basic Service Set without requiring any modification on the existing access protocol. This polling scheme increases the number of conversations in case of silence detection, while maintains high voice quality. By considering constant bit rate digitized voice traffic, the paper presents a discretetime Markov chain model, that is, used to analyze the performance of the IEEE802.11 Point Coordination Function in terms of maximum number of supported conversations, when silence detection is used at the mobile terminals. The paper also determines how the parameters of the proposed polling scheme have to be related to the silence detector hangover. q

show abstract

Analyzing the hidden-terminal effects and multimedia support for wireless LAN

Cited by 9 publications

References 10 publications

ASO-TDMA: ad-hoc self-organizing TDMA protocol for shipborne ad-hoc networks

ASO-TDMA: ad-hoc self-organizing TDMA protocol for shipborne ad-hoc networks

Performance of wireless networks with hidden nodes: a queuing-theoretic analysis

A dynamically adaptable polling scheme for voice support in IEEE802.11 networks

Contact Info

Product

Resources

About