Performance comparison of collision resolution algorithms with amount of feedback information

Wattanamongkhol, Norrarat

doi:10.1109/iswpc.2013.6707439

Cited by 4 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To address the excessive delay issue, a promising strategy involves a collision-resolution algorithm (CRA), which resolves collisions by organizing the retransmission of colliding packets in a way that all packets are always successfully transmitted with finite delay. The basic CRA does not attain all the potential gains because it uses the same resources (slots) to transmit data and resolve contention [112]. Instead, it is possible to separate contention from data using contention-based access requests by employing mini-slots.…”

Section: Omnidirectional Mac Protocolsmentioning

confidence: 99%

Network for hypersonic UCAV swarms

Luo¹,

Zhang²,

Wang³

et al. 2020

Sci. China Inf. Sci.

View full text Add to dashboard Cite

Unmanned combat aerial vehicles (UCAVs) that swarm with both autonomous decision-making and cooperative attacking have been regarded as revolutionary elements of modern warfare. In such a swarm, inter-group connectivity must be ensured in a network to maintain a collective consensus. In recent years, academia and industry have made many efforts to achieve common tactical data link systems and commercial drone networks. However, the existing results have difficulty meeting the needs of cooperative autonomous UCAV swarms with both hypersonic mobility and time sensitivity in severe confrontation scenarios. In this article, we conduct an in-depth investigation of the network used for the hypersonic UCAV swarms, which can be considered as a special form of mobile wireless network. Furthermore, faced with specific functional demands, we summarize the main challenges of designing this dedicated network. In addition, a comprehensive survey of potential solutions for the network design is presented. Lastly, we discuss the possible capabilities of the network given the current forefront of technology, as well as remaining challenges and open issues.

show abstract

Section: Omnidirectional Mac Protocolsmentioning

confidence: 99%

Network for hypersonic UCAV swarms

Luo¹,

Zhang²,

Wang³

et al. 2020

Sci. China Inf. Sci.

View full text Add to dashboard Cite

show abstract

“…Data packets, on the other hand, may require several time slots to be correctly transmitted/received. This work assumes that the stations maintain a certain level of synchronization, similar to that considered in (Wattanamongkhol, 2013;Mathys and Flajolet, 2006;Nakano and Olariu, 2002;Felice et al, 2013;Zhou and Lai, 2005). For instance, synchronization could be obtained using a mechanism like the Self-Adjusting Timing Synchronization Function (SATSF) algorithm (Zhou and Lai, 2005).…”

Section: Communication Modelmentioning

confidence: 99%

“…Tree-based algorithms (split, stack or collision resolution) usually implement a partitioning strategy, allowing nodes to receive a free slot for communication (Wattanamongkhol, 2013). Mathys and Flajolet (2006) presented a group and split approach, called Q-ary split.…”

Section: Introductionmentioning

confidence: 99%

“…The main idea is to gather the colliding stations in Q > 2 groups and employ a split approach to reduce collision probability in each group. Wattanamongkhol (2013) proposes the Uniform Selection (UNI) protocol where the contending stations uniformly elect a time slot for transmission. The outcome of their attempt is later propagated to the contending stations.…”

Section: Introductionmentioning

confidence: 99%

“…Such information is then used to reduce the chance of collision. Tree-based algorithms usually assume that the number of contending stations is known a priori (Wattanamongkhol, 2013;Mathys and Flajolet, 2006). Nevertheless, on a distributed environment, it may be not possible to obtain a precise number, or even an estimate, of the contending stations (Nakano and Olariu, 2002).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Fast-and-Fair Collision Resolution Protocol Tailored for Ad Hoc Wireless Networks

Caetano

Guimarães²,

Bordim³

2016

Journal of Computer Science

View full text Add to dashboard Cite

Abstract:Wireless technologies have permeated a significant number of devices over the years. On the other hand, Medium Access Control (MAC) protocols strive to deal with an increasing number of contending nodes on crowded frequency bands. This work presents an efficient medium access control resolution protocol. The proposed protocol, termed Collision Resolution Protocol (CRP), uses pulse/tone signaling that works in both Collision Detection (CD) and Non-Collision Detection (NCD) environments. Given n>1 contending nodes, CRP selects a single transmitting node in 16n and 40n time slots, respectively, for the CD and the NCD scenarios, with probability of at least 1-2 -1.5n . Furthermore, CRP does not require an exact number, or estimation, of the contending nodes.Extensive simulations on the OMNeT++ shows that, for n = 256 and considering CD-capability, CRP successfully grants channel access in 0.03% of the time required by the IEEE 802.11 standard while improving the number of transmissions per second in 100%. In addition, CRP provides fair resource allocation and reduced channel access latency.

show abstract