Conflict multiplicity estimation and batch resolution algorithms | Semantic Scholar (2024)

A batch resolution algorithm for CSMA wireless networks that waives the immediate feedback approach in favor of a deferred feedback method, which shall reduce the overhead costs and results confirm that ABRADE+ outperforms the algorithms based on the immediate feedback paradigm, both in case of partial and no a priori knowledge of the batch multiplicity.

ABRADE is a dynamic framed ALOHA scheme for conflict resolution in practical CSMA-based wireless networks based on a dynamic programming argument that takes into account the time occupancy of successful, collided and idle slots, as well as the time cost of control messages.

An average-case-analysis protocol for single-hop networks which is based on the fully distributed construction of a random binary tree which runs in approximately n/log 2 slots.

New, improved algorithms are proposed for regulating access to a multiple-access channel, a common channel shared by many geographically distributed computing stations, the most efficient of which resolves conflicts about 20 percent faster on average than any of the comparable algorithms reported to date.

It is found that a good access scheduling scheme not only has information about the number of packets to be scheduled, but which, more importantly controls the average of this number, which can be achieved by properly choosing the scheduling interval.

A new collision resolution algorithm via carrier sensing for a randomly accessed channel is proposed and studied in this paper and results of throughput and delay have been explicitly derived.

A communication channel in which the only possible communication mode is transmitting beeps, which reach all the nodes instantaneously is considered, which gives a Las Vegas naming algorithm and a Monte Carlo algorithm for the case when the number of nodes is known.

This article surveys typical examples of multiple access schemes, including TDMA, FDMA, Aloha, polling, and tree-based schemes, and addresses mainly shared communication channels.

The proposed algorithm is incorporated into a numerical simulation of the Qprotocol for UHF RFID tags and is shown to be effective in providing fast and power efficient sensor arbitration.

This paper presents a novel protocol, Partitioned Dynamic Frame Slotted Aloha (PDFSA), based on grouping, that, when adopting the best estimation mechanism, reaches an asymptotical efficiency up to 0.469.

...

...

A new class of high-speed, high-throughput, stable, multiaccessing algorithms is presented and it is shown that these algorithms are stable (in that all moments of delay exist) and are optimal in a certain sense.

The classical “fix” for the multiplexing solution is to add some form of demand-assignment so that the particular division of resources can be adapted to meet the changing requirements.

New, improved algorithms are proposed for regulating access to a multiple-access channel, a common channel shared by many geographically distributed computing stations, the most efficient of which resolves conflicts about 20 percent faster on average than any of the comparable algorithms reported to date.