Code assignment for hidden terminal interference avoidance in multihop packet radio networks

Recent progress in mathematics and engineering on optimal graph labellings with distance conditions

“…But this is not required in our mathematics theory. One special case where k 1 < k 2 has already arisen: Bertossi and Bonuccelli [5] (1995) introduced an integer "control code" assignment in packet radio networks of computers to avoid hidden terminal interference. This occurs for stations (transmitters), which are outside the hearing range of each other, that transmit to the same receiving stations: It is the L(0, 1) graph-labelling problem [36].…”

“…The channel assignment problem is usually formulated in the engineering literature as a nonlinear optimization problem. A huge collection of contributions in IEEE journals explore various aspects of current research on radio channel assignment problems, among them "IEEE Transactions on Vehicular Technology" [1,2,4,16,18,20,21,25,33,40,42,49,50,51], "IEEE Transactions on Wireless Communication" [15,30], "IEEE/ACM Transactions on Networking" [3,5], "IEEE/ACM Transactions on Parallel and Distributed Systems" [7,32], "Wireless Networks" [39,46,52], and IEEE Conferences [6,9,10,17,27,44].…”

“…Mobile multimedia applications with variable data rate transmission for such integrated services can be done by means of efficient assignment of time slots, frequencies, codes, or their combinations [15]. Different channel assignment problems in the frequency, time and code domains (with a channel defined as a frequency, a time slot [3], or a control code [5]) can be modeled by graph labelling problem. Ramanathan [46] formulated a framework of channel assignments unified by the similarity of the constraints across these domains.…”

“…Wireless networks include cellular mobile networks, wireless computer networks [5], wireless ATM networks [39], and private mobile radio networks [52]. Mobile multimedia applications with variable data rate transmission for such integrated services can be done by means of efficient assignment of time slots, frequencies, codes, or their combinations [15].…”

&lt;i&gt;L&lt;/i&gt;(0, 1)-Labelling of Cactus Graphs

“…Bertossi and Bonuccelli [2] introduced a kind of code assignment to avoid hidden terminal interference; this is as follows. Since some modern computer networks consist of including mobile computers or computer displaced in wide areas, they need to use broadcast communication media such as busses (only in local area networks) or radio frequencies.…”