Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
IEEE Transactions on Computers
Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
Labeling Chordal Graphs: Distance Two Condition
SIAM Journal on Discrete Mathematics
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
Honeycomb Networks: Topological Properties and Communication Algorithms
IEEE Transactions on Parallel and Distributed Systems
Wireless Networks - Special issue: mobile computing and networking: selected papers from MobiCom '96
Assigning codes in wireless networks: bounds and scaling properties
Wireless Networks
Journal of Parallel and Distributed Computing
Channel Assignment with Separation for Interference Avoidance in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Graph labeling and radio channel assignment
Journal of Graph Theory
Labeling bipartite permutation graphs with a condition at distance two
Discrete Applied Mathematics
Hi-index | 0.01 |
The large development of wireless services and the scarcity of the usable frequencies require an efficient use of the radio spectrum which guarantees interference avoidance. The channel assignment problem (CAP) achieves this goal by partitioning the radio spectrum into disjoint channels, and assigning channels to the network base stations so as to avoid interference. On a flat region without geographical barriers and with uniform traffic load, the network base stations are usually placed according to a regular plane tessellation, while the channels are permanently assigned to the base stations. This paper considers the CAP problem on the honeycomb grid network topology, where the plane is tessellated by regular hexagons. Interference between two base stations at a given distance is avoided by forcing the channels assigned to such stations to be separated by a gap which is proportional to the distance between the stations. Under these assumptions, the CAP problem on honeycomb grids can be modeled as a suitable coloring problem. Formally, given a honeycomb grid G=(V,E) and a vector (@d"1,@d"2,...,@d"t) of positive integers, an L(@d"1,@d"2,...,@d"t)-coloring of G is a function f from the vertex set V to a set of nonnegative integers such that |f(u)-f(v)|=@d"i, if d(u,v)=i,1=