Oriented Edge Colorings and Link Scheduling in Sensor Networks

2006 ◽  
Author(s):  
T. Herman ◽  
S. Pemmaraju ◽  
I. Pirwani
Keyword(s):  
Sensor Networks ◽  
Link Scheduling ◽  
Oriented Edge ◽  
Edge Colorings

scholarly journals Heuristic Algorithms for One-Slot Link Scheduling in Wireless Sensor Networks under SINR

2015 ◽  
Vol 11 (3) ◽  
pp. 806520 ◽  
Author(s):  
Hui Deng ◽  
Jiguo Yu ◽  
Dongxiao Yu ◽  
Guangshun Li ◽  
Baogui Huang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Heuristic Algorithms ◽  
Wireless Sensor ◽  
Link Scheduling

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

2010 ◽  
pp. 184-208 ◽  
Author(s):  
Qiang-Sheng Hua ◽  
Francis Lau
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Topology Control ◽  
Data Gathering ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Link Scheduling ◽  
Wireless Links ◽  
And Topology ◽  
Data Gathering Tree

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.

Sign in / Sign up

Export Citation Format

Share Document