Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks

Abstract

Abstract-This work considers the problem of communication in dense and large scale wireless networks composed of resourcelimited nodes. In this kind of networks, a massive amount of data is becoming increasingly available, and consequently implementing protocols achieving error-free communication channels constitutes an important challenge. Indeed, in this kind of networks, the prevention of message conflicts and message collisions is a crucial issue. In terms of graph theory, solving this issue amounts to solve the distance-2 coloring problem in an arbitrary graph. The paper presents a distributed algorithm providing the processes with such a coloring. This algorithm is itself collision-free and conflict-free. It is particularly suited to wireless networks composed of nodes with communication or local memory constraints.

A Matheuristic for Joint Optimal Power and Scheduling Assignment in DVB-T2 Networks

“…Notwithstanding the quite high number of parameters that characterize a transmitter and that can be configured, all works considering the WND focuses just on a subset of them. In particular, the vast majority of works include the setting of the power emission of transmitters and the assignment of served users to deployed transmitters as decision variables, since they constitute critical decision aspects in the design of a wireless network (see, for example, [7,26,27,34] related to DVB, [35,36] related to 5G, [23,37] related to FTTx, [38,39] related to mesh networks, [40,41] related to UMTS, [33,42] related to WiMAX, [43,44] related to WLANs and [13,14,[45][46][47][48] related to other kind of wireless network technologies).…”

Distributed Time Slots Assignment Protocol in Dynamic Networks

“…In [7], [8], we proposed a distance-2 coloring algorithm that allows a safe communication for tree networks. In [10], we proposed a parallel multi-coloring algorithm for tree networks and in [9], we proposed a distributed distance-2 coloring algorithm that allows a safe communication for general networks. However, this last is not optimal in terms of communication.…”