Maximum capacity in chain-topology wireless mesh networks
Fang−Yie Leu, Yuting Huang · Wireless Telecommunications Symposium · 2008
In the paper, we propose a mathematical model that deals with signal interference, hidden nodes and STDMA time slots among nodes of a path for a WMN to calculate maximum throughput of the path. An algorithm, named Path_C algorithm is also developed, to determine whether a node in such a topology can transmit data with its maximum data rate or not or should be prohibited to send data to the next node. The idea of an urgent path that transmits urgent data, e.g., real-time data, is also proposed. An urgent notification packet, e.g., for a traffic jam, can be delivered through this path. Simulation results show that error rates between simulated throughput by using ns2and calculated by deploying the mathematical model are all less than 5%.