Title :
Maximum capacity in chain-topology wireless mesh networks
Author :
Leu, Fang-Yie ; Huang, Yu-Ting
Author_Institution :
Dept. of Comput. Sci., Tunghai Univ., Taichung
Abstract :
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 ns2 and calculated by deploying the mathematical model are all less than 5%.
Keywords :
channel capacity; space division multiple access; telecommunication network topology; time division multiple access; wireless channels; Path_C algorithm; STDMA time slots; chain topology wireless mesh networks; mathematical model; maximum capacity; signal interference; Bandwidth; Interference; Mathematical model; Spread spectrum communication; Telecommunication traffic; Throughput; Topology; Traffic control; Wireless mesh networks; Wireless networks;
Conference_Titel :
Wireless Telecommunications Symposium, 2008. WTS 2008
Conference_Location :
Pomona, CA
Print_ISBN :
978-1-4244-1869-5
Electronic_ISBN :
1934-5070
DOI :
10.1109/WTS.2008.4547572