The rapid progress of mobile, wireless communication and embedded micro-sensing MEMS
technologies has brought about the rise of pervasive computing. Wireless local-area …

Given an integer/spl sigma/> 1, a vector (/spl delta//sub 1/,/spl delta//sub 2/,...,/spl
delta//sub/spl sigma/-1/), of nonnegative integers, and an undirected graph G=(V, E), an L …

Motivated by a variation of the channel assignment problem, a graph labeling analogous to
the graph vertex coloring has been presented and is called an L (2, 1)-labeling. More …

We study conflict-free data distribution schemes in parallel memories in multiprocessor
system architectures. Given a host graph G, the problem is to map the nodes of G into …

An L (2, 1)-labeling of a graph G is a function f from the vertex set V (G) to the set of all
nonnegative integers such that| f (x)− f (y)|≥ 2 if d (x, y)= 1 and| f (x)− f (y)|≥ 1 if d (x, y)= 2 …

This paper investigates the problem of assigning channels to the stations of a wireless
network so that interfering transmitters are assigned channels with a given separation and …

Given a vector (δ1, δ2,…, δt) of nonincreasing positive integers, and an undirected graph
G=(V, E), an L (δ1, δ2,…, δt)‐coloring of G is a function f from the vertex set V to a set of …

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 …

Given a vector (/spl delta//sub 1/,/spl delta/2,...,/spl delta//sub t/) of non increasing positive
integers, and an undirected graph G=(V, E), an L (/spl delta//sub 1/,/spl delta/2,...,/spl …

The honeycomb grid is a network topology based on the hexagonal plane tessellation,
which is convenient to model the regular placement on the plane of the base stations of …