A slot assignment algorithm for exploiting temporal-spatial diversity in wireless hotspots
Bo Chen, Yang Shou-bao, Da Teng, Wen Ji · 2007
This paper presents a distributed slot assignment algorithm from the angle of temporal-spatial diversity of concurrent transmissions to achieve high capacity in wireless hotspots. The unique characteristics of wireless hotspots, such as multiple interference links and many flows, are the key limitations in the existing wireless network technology. However, we make the limitations to be the advantages for our proposed solutions. To make a case of exploiting temporal-spatial diversity, we focus on mesh routers. When there are many different flows running at mesh routers, each node can send interference-free different flows alternately by our proposed slot assignment algorithm based on exploiting channel diversity. Through the extensive simulations on hotspot topologies with our solutions, it demonstrates an improved performance for our approach, in term of increase in the whole network capacity over that of the existing approaches.