Email this article 
Open Access
Subscription or Fee Access
A Node-based Slot Algorithm for STDMA in WMNs
Abstract
Most slot assignment algorithms that are proposed for spatial time-division multiple-access (STDMA) mesh networks use a easy transmission model that does not consider the time-varying fading characteristic of a wireless channel. When the scheduled link is in deep fade or if it has no traffic, the slot that is given to that linkage will be wasted. In this scheme scheduling in each slot is done for nodes and not links. Because dissimilar links have different traffic and fading conditions.
Keywords
References
P. H. Pathak and R. Dutta, “A survey of network design problems and joint design approaches in wireless mesh networks,” IEEE Commun. Surveys Tuts., vol. 13, no. 3, pp. 396–428, Third Quarter, 2011.
D. Allen, “Hidden terminal problems in wireless LANS,” IEEE 802.11 Working Group Papers, 1993.
R. Nelson and L. Kleinrock, “Spatial TDMA: A collision-free multihop channel access protocol,” IEEE Trans. Commun., vol. COM-33, no. 9, pp. 934–944, Sep. 1985.
M. J. Lee, J. Zheng, Y. B. Ko, and D. M. Shrestha, “Emerging standards for wireless mesh technology,” IEEE Trans. Wireless Commun., vol. 13, no. 2, pp. 56–63, Apr. 2006.
J. Gronkvist, “Traffic-controlled spatial reuse TDMA in multihop radio networks,” in Proc. 9th IEEE Int. Symp. Pers., Indoor Mobile Radio Commun., 1998, vol. 3, pp. 1203–1207.
P. Gupta and P. R. Kumar, “The capacity of wireless networks,” IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388–404, Mar. 2000.
P. Bjorklund, P. Varbrand, and D. Yuan, “Resource optimization of spatial TDMA in ad hoc radio networks: A column generation approach,” in Proc. 22nd Annu. Joint Conf. INFOCOM, 2003, vol. 2, pp. 818–824.
Gronkvist, J. Nilsson, and D. Yuan, “Throughput of optimal spatial reuse TDMA for wireless ad hoc networks,” in Proc. IEEE 59th VTC, 2004, vol. 4, pp. 2156–2160.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.