Welcome to the InfoSci Platform
Reference Hub5
Joint Link Scheduling and Topology Control for Wireless Sensor Networks with SINR Constraints

Joint Link Scheduling and Topology Control for Wireless Sensor Networks with SINR Constraints

Qiang-Sheng Hua, Francis Lau
Copyright: © 2010 |Pages: 25
ISBN13: 9781615207015|ISBN10: 1615207015|EISBN13: 9781615207022
DOI: 10.4018/978-1-61520-701-5.ch009
Cite Chapter Cite Chapter

MLA

Hua, Qiang-Sheng, and Francis Lau. "Joint Link Scheduling and Topology Control for Wireless Sensor Networks with SINR Constraints." Handbook of Research on Developments and Trends in Wireless Sensor Networks: From Principle to Practice, edited by Hai Jin and Wenbin Jiang, IGI Global, 2010, pp. 184-208. https://doi.org/10.4018/978-1-61520-701-5.ch009

APA

Hua, Q. & Lau, F. (2010). Joint Link Scheduling and Topology Control for Wireless Sensor Networks with SINR Constraints. In H. Jin & W. Jiang (Eds.), Handbook of Research on Developments and Trends in Wireless Sensor Networks: From Principle to Practice (pp. 184-208). IGI Global. https://doi.org/10.4018/978-1-61520-701-5.ch009

Chicago

Hua, Qiang-Sheng, and Francis Lau. "Joint Link Scheduling and Topology Control for Wireless Sensor Networks with SINR Constraints." In Handbook of Research on Developments and Trends in Wireless Sensor Networks: From Principle to Practice, edited by Hai Jin and Wenbin Jiang, 184-208. Hershey, PA: IGI Global, 2010. https://doi.org/10.4018/978-1-61520-701-5.ch009

Export Reference

Mendeley
Favorite

Abstract

This chapter studies the joint link scheduling and topology control problems in wireless sensor networks. Given arbitrarily located sensor nodes on a plane, the task is to schedule all the wireless links (each representing a wireless transmission) between adjacent sensors using a minimum number of timeslots. There are two requirements for these problems: first, all the links must satisfy a certain property, such as that the wireless links form a data gathering tree towards the sink node; second, all the links simultaneously scheduled in the same timeslot must satisfy the SINR constraints. This chapter focuses on various scheduling algorithms for both arbitrarily constructed link topologies and the data gathering tree topology. We also discuss possible research directions.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.