Exact and approximate link scheduling algorithms under the physical interference model

doi:10.1145/1400863.1400874

Exact and approximate link scheduling algorithms under the physical interference model

Full Text:

PDF

Buy this Article

Authors:	Qiang-Sheng Hua	The University of Hong Kong, Hong Kong, Hong Kong
	Francis C.M. Lau	The University of Hong Kong, Hong Kong, Hong Kong

Published in:

	· Proceeding
	DIALM-POMC '08 Proceedings of the fifth international workshop on Foundations of mobile computing
	Pages 45-54 ACM New York, NY, USA ©2008 table of contents ISBN: 978-1-60558-244-3 doi>10.1145/1400863.1400874

	2008 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 25 · Downloads (cumulative): 245 · Citation Count: 7

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Tags: ad hoc networks algorithms coloring constraint satisfaction problem. counting geometrical problems and computations inclusion-exclusion principle link scheduling network topology physical interference model sensor networks sequencing and scheduling sinr theory wireless wireless communication

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player