ACM Home Page
Please provide us with feedback. Feedback
Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks
Full text PdfPdf (777 KB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 12th annual international conference on Mobile computing and networking table of contents
Los Angeles, CA, USA
SESSION: Mesh networks table of contents
Pages: 2 - 13  
Year of Publication: 2006
ISBN:1-59593-286-0
Authors
Gurashish Brar  Georgia Institute of Technology
Douglas M. Blough  Georgia Institute of Technology
Paolo Santi  Istituto di Informatica e
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 58,   Downloads (12 Months): 347,   Citation Count: 21
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1161089.1161092
What is a DOI?

ABSTRACT

Wireless mesh networks are expected to be widely used to provide Internet access in the near future. In order to fulfill the expectations, these networks should provide high throughput simultaneously to many users. Recent research has indicated that, due to its conservative CSMA/CA channel access scheme and RTS/CTS mechanism, 802.11 is not suitable to achieve this goal.In this paper, we investigate throughput improvements achievable by replacing CSMA/CA with an STDMA scheme where transmissions are scheduled according to the physical interference model. To this end, we present a computationally efficient heuristic for computing a feasible schedule under the physical interference model and we prove, under uniform random node distribution, an approximation factor for the length of this schedule relative to the shortest schedule possible with physical interference. This represents the first known polynomial-time algorithm for this problem with a proven approximation factor.We also evaluate the throughput and execution time of this algorithm on representative wireless mesh network scenarios through packet-level simulations. The results show that throughput with STDMA and physical-interference-based scheduling can be up to three times higher than 802.11 for the parameter values simulated. The results also show that our scheduling algorithm can schedule networks with 2000 nodes in about 2.5 minutes.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Azulstar Website: http://www.azulstar.com/coverage-map.html.
 
3
N. Ben Salem, J. P. Hubaux, "A Fair Scheduling for Wireless Mesh Networks", Proc. IEEE Workshop on Wireless Mesh Networks (WiMesh), 2005.
4
5
 
6
J. Gronkvist, J. Nilsson, and D. Yuan, "Throughput of Optimal Spatial Reuse TDMA for Wireless Ad-Hoc Networks," Proc. IEEE Vehicular Technology Conference, pp. 2156--2160, 2004.
 
7
J. Gronkvist, "Traffic Controlled Spatial Reuse TDMA in Multi-hop Radio Networks," Proc. Int'l. Symp. on Personal, Indoor, and Mobile Radio Communications, pp. 1203--1207, 1998.
 
8
P. Gupta and P.R. Kumar, "The Capacity of Wireless Networks," IEEE Trans. Info. Theory, Vol. 46, No. 2, pp. 388--404, 2000.
 
9
P. Gupta, P. R. Kumar, "Critical Power for Asymptotic Connectivity in Wireless Networks", Stochastic Analysis, Control, Optimization and Applications, Birkhauser, Boston, pp. 547--566, 1998.
 
10
 
11
Houston Wireless Website: http://www.houstonwireless.org/.
12
13
 
14
V. F. Kolchin, B. A. Sevast'yanov, V. P. Chistyakov, Random Allocations, V. H. Winston and Sons, Washington D.C., 1978.
15
 
16
P. Kyasanur, X. Yang, N. Vaidya, "Mesh Networking Protocols to Exploit Physical Layer Capabilities", Proc. IEEE Workshop on Wireless Mesh Networks (WiMesh), 2005.
 
17
P. Kyasanur, N. Vaidya, "Routing and Interface Assignment in Multi-Channel Multi-Interface Wireless Networks", Proc. IEEE WCNC, 2005.
 
18
T. Moscibroda, R. Wattenhofer, "The Complexity of Connectivity in Wireless Networks", Proc. IEEE Infocom 2006, to appear.
 
19
R. Nelson and L. Kleinrock, "Spatial-TDMA: A Collison-free Multihop Channel Access Protocol," IEEE Trans. on Communication, Vol. 33, pp. 934--944, Sept. 1985.
 
20
D. Qiao, S. Choi, "Goodput enhancement of IEEE 802.11a wireless LAN via link adaptation", Proc. IEEE ICC, pp. 1995--2000, 2001.
 
21
B. Raman, "Channel Allocation in 802.11-based Mesh Networks," Proc. IEEE Infocom 2006, to appear.
22
 
23
A. Raniwala, T. Chiueh, "Architecture and Algorithms for an IEEE 802.11-Based Multi-Channel Wireless Mesh Networks", Proc. IEEE Infocom, pp. 2223--2234, 2005.
24
 
25
 
26
P. Santi, Topology Control in Wireless Ad Hoc and Sensor Networks, John Wiley & Sons, Chichester, UK, 2005.
 
27
Seattle Wireless Website: http://www.seattlewireless.net/.
 
28
O. Somarriba, Multihop Packet Radio Systems in Rough Terrain, Tech.lic. Thesis, Radio Communication Systems, Royal Institute of Technology, Stockholm, Sweden, Oct. 1995.
29
 
30
Wireless Communities Website: http://wiki.personaltelco.net/index.cgi/WirelessCommunities.
 
31
Z. Wu and D. Raychaudhuri, "D-LSMA: Distributed Link Scheduling Multiple Access Protocol for QoS in Ad-hoc Networks," Proc. Globecom 2004, pp. 1670--1675.
 
32
Y. Yuan, H. Yang, S. Wong, S. Lu, W. Arbaugh, "ROMER: Resilient Opportunistic Mesh Routing for Wireless Mesh Networks", Proc. IEEE Workshop on Wireless Mesh Networks (WiMesh), 2005.

CITED BY  21

Collaborative Colleagues:
Gurashish Brar: colleagues
Douglas M. Blough: colleagues
Paolo Santi: colleagues