New strategies for collision resolution of multi-access channel

The truncated binary exponential back-off algorithm is one of the most effective methods applied in collision resolution process of random multi-access channel.In this study,two new strategies are presented to improve the capability of the truncated binary exponential back-off algorithm.In the new strategies,the sizes of the initial window size or the operating window sizes are adjusted dynamically,which always bring a significant improvement for the self-adaptability of the original algorithm.A series of experiments are simulated and the results verify that the new strategies can make the implementation more stable and effective than the original algorithm.

Modeling and simulation for a new virtual-clock-based collision resolution algorithm

Virtual time Ethemet is a multiple access protocol proposed to provide FCFS transmission service over the predominant Ethemet bus. It incorporates a novel message-rescheduling algorithm based on the virtual clock mechanism. By manipulating virtual clocks back up over a common virtual time axis and performing timely collision resolution, the algorithm guarantees the system＇s queuing strictness. The protocol is particularly modeled as a finite state machine and implemented using OPNET tools. Simulation studies prove its correctness and effectiveness.

In-home Power Line Communication Media Access Control Protocol Based on Collision Resolution

Most existing media access control(MAC) protocols in power line communication(PLC) networks just discard the colliding data packets when collision occurs.The collision deteriorates throughput and delay performance of system under high traffic conditions.This article presents a novel media access scheme with fast collision resolution for in-home power line networks.It works by first recognizing the colliding stations through detecting the inserted unique ID sequence ahead of data packets,then the source nodes retransmitting their packets immediately after the collision slot.The proposed protocol maintains the benefits of ALOHA systems.It needs no scheduling overhead and is suitable for bursty sources,such as multimedia data packets.Computer simulations have demonstrated that this approach can achieve high throughput due to its ability of resolving collisions.

Collision-free Scheduling of Multi-bridge Machining Systems： A Colored Traveling Salesman Problem-based Approach

Multi-bridge machining systems(MBMS) have gained wide applications in industry due to their high production capacity and efficiency. They contain multiple bridge machines working in parallel within their partially overlapping workspaces.Their scheduling problems can be abstracted into a serial-colored travelling salesman problem in which each salesman has some exclusive cities and some cities shared with its neighbor(s). To solve it, we develop a greedy algorithm that selects a neighboring city satisfying proximity. The algorithm allows a salesman to select randomly its shared cities and runs accordingly many times. It can thus be used to solve job scheduling problems for MBMS. Subsequently, a collision-free scheduling method is proposed to address both job scheduling and collision resolution issues of MBMS. It is an extension of the greedy algorithm by introducing time window constraints and a collision resolution mechanism. Thus, the augmented greedy algorithm can try its best to select stepwise a job for an individual machine such that no time overlaps exist between it and the job sequence of the neighboring machine dealt in the corresponding overlapping workspace; and remove such a time overlap only when it is inevitable. Finally, we conduct a case study of a large triplebridge waterjet cutting system by applying the proposed method.

Steady-State Analysis of the Distributed Queueing Algorithm in a Single-Channel M2M Network

The Distributed Queuing (DQ) algorithm is predicted as one of the solutions to the issues currently found in IoT networks over the use of Aloha based algorithms. Since recently, the algorithm has been of interest to many IoT researchers as a replacement of those Aloha variants for channel access. However, previous works analyzed and evaluated the DQ algorithm without any consideration of the stability of its queues, assuming it is stable for any given number of nodes in the network. In this paper, we define the DQ stability condition in a single-channel M2M environment considering a traffic model of periodic and urgent frames from each node in the network. Besides, a steady-state evaluation of the algorithm’s performance metrics is also presented. In general, the DQ algorithm, when it is stable, was observed not to efficiently use the contention slots for the collision resolution. In a single-channel environment, the DQ algorithm is found to outperform the Aloha based algorithms only in an idle-to-saturation scenario.