Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
Abstract—We analyze the carrier sensing and interference relations between the two wireless links and measure the impact of these relations on link capacity in two indoor 802.11a...
Jeongkeun Lee, Sung-Ju Lee, Wonho Kim, Daehyung Jo...
Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, ...
— In this paper, we investigate joint resource allocation and routing for a wireless mesh network consisting of fixed access points inter-connected through multi-channel wireles...
Kemal Karakayali, Joseph H. Kang, Murali S. Kodial...