TY - GEN
T1 - Fast link assessment in wireless mesh networks by using non-constant weight code
AU - Nelavelli, Ravi
AU - Prasad, Rajesh
AU - Wu, Hongyi
PY - 2008
Y1 - 2008
N2 - The wireless mesh network is experiencing tremendous growth with the standardization of IEEE 802.11 and IEEE 802.16 technologies. Compared to its wired counterpart, the resource (e.g., capacity) of the wireless mesh network is limited. Worst yet, the wireless link quality is time and space varying, depending on the environment and interference. In order to make efficient use of the scarce channel resource during topology formation, scheduling and routing, it is vital to understand the quality of the links in the wireless mesh network (in terms of, e.g., probability of successful transmission, or signal to noise ratio). The existing approaches for link assessment consume substantial amount of time and thus introduce significant delay and overhead. In this paper, we propose a novel link assessment scheme where the link assessment packets are transmitted efficiently according to a set of non-constant weight codes, which achieves low collision probability within a short link assessment period. In our proposed approach, each node considers the actual nodal degree while choosing the codeword for its link assessment. In this work, we design the link assessment procedure and establish a set of theorems that provide the necessary condition for successful link assessment. Extensive simulations are carried out, showing that our proposed approach reduces link assessment delay by over 70% compared to the orthogonal optical code OOC-based approach.
AB - The wireless mesh network is experiencing tremendous growth with the standardization of IEEE 802.11 and IEEE 802.16 technologies. Compared to its wired counterpart, the resource (e.g., capacity) of the wireless mesh network is limited. Worst yet, the wireless link quality is time and space varying, depending on the environment and interference. In order to make efficient use of the scarce channel resource during topology formation, scheduling and routing, it is vital to understand the quality of the links in the wireless mesh network (in terms of, e.g., probability of successful transmission, or signal to noise ratio). The existing approaches for link assessment consume substantial amount of time and thus introduce significant delay and overhead. In this paper, we propose a novel link assessment scheme where the link assessment packets are transmitted efficiently according to a set of non-constant weight codes, which achieves low collision probability within a short link assessment period. In our proposed approach, each node considers the actual nodal degree while choosing the codeword for its link assessment. In this work, we design the link assessment procedure and establish a set of theorems that provide the necessary condition for successful link assessment. Extensive simulations are carried out, showing that our proposed approach reduces link assessment delay by over 70% compared to the orthogonal optical code OOC-based approach.
KW - Link assessment
KW - Non-constant weight code
KW - Wireless mesh network
UR - https://www.scopus.com/pages/publications/51849164168
UR - https://www.scopus.com/pages/publications/51849164168#tab=citedBy
U2 - 10.1109/ICDCS.Workshops.2008.98
DO - 10.1109/ICDCS.Workshops.2008.98
M3 - Conference contribution
AN - SCOPUS:51849164168
SN - 9780769531731
T3 - Proceedings - International Conference on Distributed Computing Systems
SP - 120
EP - 125
BT - Proceedings - The 28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008
T2 - 28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008
Y2 - 17 June 2008 through 20 June 2008
ER -