8,451 research outputs found
Modeling Probability of Path Loss for DSDV, OLSR and DYMO above 802.11 and 802.11p
This paper presents path loss model along with framework for probability
distribution function for VANETs. Furthermore, we simulate three routing
protocols Destination Sequenced Distance Vector (DSDV), Optimized Link State
Routing (OLSR) and Dynamic MANET On-demand (DYMO) in NS-2 to evaluate and
compare their performance using two Mac-layer Protocols 802.11 and 802.11p. A
novel approach of this work is modifications in existing parameters to achieve
high efficiency. After extensive simulations, we observe that DSDV out performs
with 802.11p while DYMO gives best performance with 802.11.Comment: IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, Franc
Is Our Model for Contention Resolution Wrong?
Randomized binary exponential backoff (BEB) is a popular algorithm for
coordinating access to a shared channel. With an operational history exceeding
four decades, BEB is currently an important component of several wireless
standards. Despite this track record, prior theoretical results indicate that
under bursty traffic (1) BEB yields poor makespan and (2) superior algorithms
are possible. To date, the degree to which these findings manifest in practice
has not been resolved.
To address this issue, we examine one of the strongest cases against BEB:
packets that simultaneously begin contending for the wireless channel. Using
Network Simulator 3, we compare against more recent algorithms that are
inspired by BEB, but whose makespan guarantees are superior. Surprisingly, we
discover that these newer algorithms significantly underperform. Through
further investigation, we identify as the culprit a flawed but common
abstraction regarding the cost of collisions. Our experimental results are
complemented by analytical arguments that the number of collisions -- and not
solely makespan -- is an important metric to optimize. We believe that these
findings have implications for the design of contention-resolution algorithms.Comment: Accepted to the 29th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA 2017
- …