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

Hua, Qiang-Sheng; Lau, Francis C. M.

doi:10.4018/978-1-61520-701-5.ch009

Cited by 7 publications

(3 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some other factors have also been researched such as energy control in (Hua and Lau, 2006;Moh, Kim and Moh, 2006) where Moh et al present a distributed power scheduling for data aggregation, routing protocol design in (Jia, Zhao and Ma, 2008) which improves the life span of the network. In addition, maximizing the lifetime with data aggregation in wireless sensor networks have also been discussed in (Stanford and Tongngam, 2009;Li, Zhu and Chen, 2011;Zou, Nikolaidis and Harms, 2008) and efficient aggregation tree constructed in (Cheng and Yin, 2008;Chiang and Byrd, 2009;Hua and Lau, 2010) can reduce redundant data which improves the aggregation latency. (Cam, 2007) also gives a view about coding method in data aggregation and (Kafatzoglou and Papavassiliou, 2011; Solis and Obraczka, 2006) explore the trade-off for data collection when in-network aggregation is introduced.…”

Section: Related Workmentioning

confidence: 99%

Improved minimum latency aggregation scheduling in wireless sensor networks under the SINR model

Wang

Hua

et al. 2013

IJSNET

View full text Add to dashboard Cite

Wireless sensor networks are attracting much attention from the world and Minimum Latency Aggregation Scheduling(MLAS) has become one of the most significant fundamental problems in wireless sensor networks. However there are few results about efficient data aggregation algorithms under the Signal-to-Interference-plus-Noise-Ratio (SINR) model. In this paper, we propose a centralized algorithm to aggregate data from all sources in O(log 2 n) time slots where n is the total number of nodes. To the best of our knowledge, this is the current best result for the problem. This algorithm uses round scheduling, topology construction and non-linear power assignment as the main techniques. We give a detailed proof of correctness, also an aggregation latency analysis of the algorithm as well as the parameter constraints to achieve our result.

show abstract

Section: Related Workmentioning

confidence: 99%

Improved minimum latency aggregation scheduling in wireless sensor networks under the SINR model

Wang

Hua

et al. 2013

IJSNET

View full text Add to dashboard Cite

show abstract

“…Instead of trying to describe all different variants for which the MLS problem has been proved to be NPhard, we will only highlight the result closest to ours, by Katz, Volker, and Wagner [9]. For a more complete summary of work in this area, we refer readers to the survey papers [12,8,13] and book chapter [2].…”

Section: Previous Workmentioning

confidence: 99%

On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane

Lin,

Schalekamp

2012

Preprint

View full text Add to dashboard Cite

We show NP-hardness of the minimum latency scheduling (MLS) problem under the physical model of wireless networking. In this model a transmission is received successfully if the Signal to Interferenceplus-Noise Ratio (SINR), is above a given threshold. In the minimum latency scheduling problem, the goal is to assign a time slot and power level to each transmission, so that all the messages are received successfully, and the number of distinct times slots is minimized.Despite its seeming simplicity and several previous hardness results for various settings of the minimum latency scheduling problem, it has remained an open question whether or not the minimum latency scheduling problem is NP-hard, when the nodes are placed in the Euclidean plane and arbitrary power levels can be chosen for the transmissions. We resolve this open question for all path loss exponent values α ≥ 3.

show abstract

“…For a more detailed survey of this line of research, please refer to [14,25]. First, a line of heuristic algorithms aiming to minimize the scheduling lengths can be found in [2,3,8].…”

Section: Related Workmentioning

confidence: 99%

Minimum Latency Link Scheduling for Arbitrary Directed Acyclic Networks Under Precedence and Sinr Constraints

Hua

Wang

et al. 2011

J. Inter. Net.

Self Cite

View full text Add to dashboard Cite

Scheduling wireless links under the SINR model has attracted increasing attention in the past few years [1-6, 8-15, 18-20, 23-25, 27, 28, 33-36, 39, 41, 42, 45, 46]. However, most of previous work did not account for the precedence constraint that might exist among the wireless links. Precedence constraints are common in data aggregation problems where a sensor can not send data to its parent node before it has received data from all of its children. Existing solutions to the so-called minimum latency aggregation scheduling problem [7,16,21,26,29,30,32,40,43,44] mainly focus on specific tree topologies rooted at the sink node. In this paper, we study the minimum latency link scheduling problem for arbitrary directed acyclic networks under both precedence and SINR constraints. Our formulation allows multiple sinks, and each sensor may transmit data to more than one parent node. We first show that the problem is NP-hard, and then propose a linear power assignment based polynomial time approximation algorithm and a dynamic labeling based heuristic algorithm. We have carried out extensive simulations for both dense and sparse * This work was mainly done when the author was a researcher in Department of Computer Science, The University of Hong Kong. 85 J. Inter. Net. 2011.12:85-107. Downloaded from www.worldscientific.com by UNIVERSITY OF AUCKLAND LIBRARY -SERIALS UNIT on 05/31/15. For personal use only. 86 Q.-S. Hua et al.arbitrary directed acyclic networks. The simulation results show that: (1) compared with both uniform and linear power assignments based algorithms, we can achieve much shorter scheduling lengths using our proposed labeling algorithm, and (2) the dynamic labeling based heuristic algorithm can lead to significantly shorter scheduling lengths than the heuristic algorithm which does not use labeling.

show abstract

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

Cited by 7 publications

References 48 publications

Improved minimum latency aggregation scheduling in wireless sensor networks under the SINR model

Improved minimum latency aggregation scheduling in wireless sensor networks under the SINR model

On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane

Minimum Latency Link Scheduling for Arbitrary Directed Acyclic Networks Under Precedence and Sinr Constraints

Contact Info

Product

Resources

About