Self-interference in multi-hop wireless chains: Geometric analysis and performance study

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the presence of interference, two single hop links can interact in a number of different ways, exhibiting significantly different behavior. In this paper, we consider the impact of these two-flow interactions on multi-hop chains. Specifically, we characterize the different types of interactions that arise in chains between hops that do not share a common node. We develop closed formed expressions to estimate the probability of occurrence of these interaction combinations. We use simulation to characterize the performance of the most common types of chains. We make a number of interesting observations: (1) the most destructive types of two-flow interactions do not arise commonly in chains; (2) the throughput of chains does not vary significantly with the types of arising interactions, because of the self-regulating effect of packets in the chain (later hops can only transmit when they receive packets from earlier ones); however, (3) the chains exhibiting destructive interactions suffer frequent collisions and require many more retransmissions. As such, in general scenarios, such chains reduce the available bandwidth within the network. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Razak, S., & Abu-Ghazaleh, N. B. (2008). Self-interference in multi-hop wireless chains: Geometric analysis and performance study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5198 LNCS, pp. 58–71). https://doi.org/10.1007/978-3-540-85209-4_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free