Computer Science – Information Theory
Scientific paper
2010-01-19
Computer Science
Information Theory
Submitted to ISIT'10
Scientific paper
Based on a stochastic geometry framework, we establish an analysis of the multi-hop spatial reuse aloha protocol (MSR-Aloha) in ad hoc networks. We compare MSR-Aloha to a simple routing strategy, where a node selects the next relay of the treated packet as to be its nearest receiver with a forward progress toward the final destination (NFP). In addition, performance gains achieved by employing adaptive antenna array systems are quantified in this paper. We derive a tight upper bound on the spatial density of progress of MSR-Aloha. Our analytical results demonstrate that the spatial density of progress scales as the square root of the density of users, and the optimal contention density (that maximizes the spatial density of progress) is independent of the density of users. These two facts are consistent with the observations of Baccelli et al., established through an analytical lower bound and through simulations.
Cardinal Christian
Gagnon François
Sik Ali Olfa Ben
No associations
LandOfFree
A performance analysis of multi-hop ad hoc networks with adaptive antenna array systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A performance analysis of multi-hop ad hoc networks with adaptive antenna array systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A performance analysis of multi-hop ad hoc networks with adaptive antenna array systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-634003