scholarly journals An Adaptive Partitioning Scheme for Sleep Scheduling and Topology Control in Wireless Sensor Networks

2009 ◽  
Vol 20 (9) ◽  
pp. 1352-1365 ◽  
Author(s):  
Yong Ding ◽  
Chen Wang ◽  
Li Xiao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Topology Control ◽  
Wireless Sensor ◽  
Sleep Scheduling ◽  
And Topology ◽  
Adaptive Partitioning

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.

Research on Interference and Topology Control in Wireless Sensor Networks

2012 ◽  
Vol 241-244 ◽  
pp. 1033-1037
Author(s):  
Tao Song
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Topology Control ◽  
Control Algorithm ◽  
Wireless Sensor ◽  
Control Technology ◽  
Original Graph ◽  
And Topology ◽  
Low Degree ◽  
Entire Network

Topology control has been well studied in wireless sensor networks. Power control technology as one way of topology control can be used to indirectly reduce the interference due to low degree sparse topologies produced by it. It has often been assumed that a sparse graph implicitly has low interference, but recent research shows that that is not necessarily true. In this paper, we discuss several typical methods to measure interference, and present a new interference model that aims to describe the interference of the entire network. We present LIST, a topology control algorithm that serves two purposes: it minimizes the interference in the network according to our metrics, and it keeps the spanner properties of the original graph. The paper is completed by simulations that compare different topologies with respect to different interference metrics. Some analyses of simulations results are given in the end.

Sign in / Sign up

Export Citation Format

Share Document