Minimum-Latency Scheduling

Consider a multihop wireless network in which all network nodes V lie in plane and have a unit communication radius. Its communication topology G is the unit disk graph (UDG) of V. Under the protocol interference model, every node has a communication radius normalized to one, and an interference radius ρ for some parameter ρ ≥ 1 (see Fig. 11.1). A node v can receive the message successfully from a transmitting node u if v is within the transmission range of u but is outside the interference range of any other node transmitting simultaneously.

[1]  Donghyun Kim,et al.  Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[2]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[3]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2004, Mob. Networks Appl..

[4]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[5]  Weili Wu,et al.  Minimum connected dominating sets and maximal independent sets in unit disk graphs , 2006, Theor. Comput. Sci..

[6]  Yuhong Zhang,et al.  Modeling and energy consumption evaluation of a stochastic wireless sensor network , 2012, EURASIP Journal on Wireless Communications and Networking.

[7]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[8]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[9]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[10]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[11]  Sergiy Butenko,et al.  On connected domination in unit ball graphs , 2011, Optim. Lett..

[12]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[13]  Peng-Jun Wan,et al.  A Simple Heuristic for Minimum Connected Dominating Set in Graphs , 2003, Int. J. Found. Comput. Sci..

[14]  Jie Wu,et al.  TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs , 2008, 2008 Proceedings of 17th International Conference on Computer Communications and Networks.

[15]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

[16]  Matt Gibson,et al.  Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier - (Extended Abstract) , 2010, ESA.

[17]  Beat Gfeller,et al.  A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs , 2007, Ad Hoc Sens. Wirel. Networks.

[18]  Majid Sarrafzadeh,et al.  Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks , 2008, DISC.

[19]  B. Mukherjee,et al.  WDM-based local lightwave networks. II. Multihop systems , 1992, IEEE Network.

[20]  Deying Li,et al.  Minimum Power Strongly Connected Dominating Sets in Wireless Networks , 2008, ICWN.

[21]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[22]  Hans Eriksson,et al.  MBONE: the multicast backbone , 1994, CACM.

[23]  Weili Wu,et al.  An exact algorithm for minimum CDS with shortest path constraint in wireless networks , 2011, Optim. Lett..

[24]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[25]  Weili Wu,et al.  Construction of directional virtual backbones with minimum routing cost in wireless networks , 2011, 2011 Proceedings IEEE INFOCOM.

[26]  Ding-Zhu Du,et al.  On greedy construction of connected dominating sets in wireless networks , 2005, Wirel. Commun. Mob. Comput..

[27]  N. Oler,et al.  An inequality in the geometry of numbers , 1961 .

[28]  Byrav Ramamurthy,et al.  Minimizing the number of optical amplifiers needed to support a multi-wavelength optical LAN/MAN , 1997, Proceedings of INFOCOM '97.

[29]  Jie Wu,et al.  VBS: Maximum Lifetime Sleep Scheduling for Wireless Sensor Networks Using Virtual Backbones , 2010, 2010 Proceedings IEEE INFOCOM.

[30]  Loren Schwiebert,et al.  Power efficient topologies for wireless sensor networks , 2001, International Conference on Parallel Processing, 2001..

[31]  B. Mukherjee,et al.  WDM-based local lightwave networks. I. Single-hop systems , 1992, IEEE Network.

[32]  Deying Li,et al.  Converter Placement Supporting Broadcast in WDM Optical Networks , 2001, IEEE Trans. Computers.

[33]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[34]  Herbert Reichl,et al.  Batteries and power supplies for wearable and ubiquitous computing , 1999, Digest of Papers. Third International Symposium on Wearable Computers.

[35]  Changyuan Yu,et al.  A 5+epsilon-approximation algorithm for minimum weighted dominating set in unit disk graph , 2009, Theor. Comput. Sci..

[36]  Toshihiro Fujito,et al.  Approximation algorithms for submodular set cover with applications , 2000 .

[37]  J.F. Smith,et al.  Overview of the space station communications networks , 1990, IEEE Network.

[38]  Luca Benini,et al.  A discrete-time battery model for high-level power estimation , 2000, DATE '00.

[39]  Ding-Zhu Du,et al.  Connected Domination in Multihop Ad Hoc Wireless Networks , 2002, JCIS.

[40]  F. Frances Yao,et al.  Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks , 2008, 2008 The 28th International Conference on Distributed Computing Systems.

[41]  Panos M. Pardalos,et al.  Greedy approximations for minimum submodular cover with submodular cost , 2010, Comput. Optim. Appl..

[42]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[43]  Fabrizio Grandoni,et al.  An improved LP-based approximation for steiner tree , 2010, STOC '10.

[44]  Panos M. Pardalos,et al.  Analysis of greedy approximations with nonsubmodular potential functions , 2008, SODA '08.

[45]  Sriram V. Pemmaraju,et al.  Approximation Algorithms for Domatic Partitions of Unit Disk Graphs , 2009, APPROX-RANDOM.

[46]  Jie Wu,et al.  Analysis on a Localized Pruning Method for Connected Dominating Sets , 2007, J. Inf. Sci. Eng..

[47]  Panos M. Pardalos,et al.  Maximum lifetime connected coverage with two active-phase sensors , 2013, J. Glob. Optim..

[48]  Samir Khuller,et al.  Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets , 1998, FSTTCS.

[49]  Fabian Kuhn,et al.  Ad-hoc networks beyond unit disk graphs , 2003, DIALM-POMC '03.

[50]  Weili Wu,et al.  Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[51]  Weili Wu,et al.  Node-weighted Steiner tree approximation in unit disk graphs , 2009, J. Comb. Optim..

[52]  Weili Wu,et al.  A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks , 2009, J. Glob. Optim..

[53]  Roger Wattenhofer,et al.  Maximizing the lifetime of dominating sets , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[54]  Deying Li,et al.  Minimizing number of wavelengths in multicast routing trees in WDM networks , 2000 .

[55]  Yin-Feng Xu,et al.  A New Proof for Zassenhaus-Groemer-Oler inequality , 2012, Discret. Math. Algorithms Appl..

[56]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[57]  Piotr Berman,et al.  Power efficient monitoring management in sensor networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[58]  Nabil H. Mustafa,et al.  Improved Results on Geometric Hitting Set Problems , 2010, Discret. Comput. Geom..

[59]  H. Ishii,et al.  ISDN user-network interface management protocol , 1989, IEEE Network.

[60]  Robert B. Ellis,et al.  Monitoring schedules for randomly deployed sensor networks , 2008, DIALM-POMC '08.

[61]  Deborah Estrin,et al.  An architecture for wide-area multicast routing , 1994, SIGCOMM 1994.

[62]  Michael Segal,et al.  A simple improved distributed algorithm for minimum CDS in unit disk graphs , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[63]  Aravind Srinivasan,et al.  Approximating the Domatic Number , 2002, SIAM J. Comput..

[64]  Jie Wu,et al.  Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges , 2006, IEEE Transactions on Mobile Computing.

[65]  Weili Wu,et al.  A better constant-factor approximation for weighted dominating set in unit disk graph , 2009, J. Comb. Optim..

[66]  Roberto Solis-Oba,et al.  A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves , 1998, Algorithmica.

[67]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[68]  Deying Li,et al.  Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.

[69]  Robert James Douglas,et al.  NP-completeness and degree restricted spanning trees , 1992, Discret. Math..

[70]  Weili Wu,et al.  On minimum submodular cover with submodular cost , 2011, J. Glob. Optim..

[71]  Ding-Zhu Du,et al.  Connected dominating sets in disk graphs with bidirectional links , 2006, IEEE Communications Letters.

[72]  Lo Yang,et al.  Approximations for color-covering problems , 2001 .

[73]  Ionut Cardei,et al.  Energy-Efficient Target Coverage in Heterogeneous Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[74]  Jie Wu,et al.  Iterative local solutions for connected dominating set in ad hoc wireless networks , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[75]  Ding-Zhu Du,et al.  Design and Analysis of Approximation Algorithms , 2011 .

[76]  Weili Wu,et al.  Constant-approximation for target coverage problem in wireless sensor networks , 2012, 2012 Proceedings IEEE INFOCOM.

[77]  F. Fodor.  The Densest Packing of 19 Congruent Circles in a Circle , 1999 .

[78]  Jie Wu,et al.  Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets , 2003, Wirel. Commun. Mob. Comput..

[79]  H. Prömel,et al.  Approximating Minimum Spanning Sets in Hypergraphs and Polymatroids , 2000 .

[80]  Hai Liu,et al.  Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks , 2009, WASA.

[81]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[82]  Martin Farber,et al.  Steiner trees, connected domination and strongly chordal graphs , 1985, Networks.

[83]  Donghyun Kim,et al.  Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network , 2008, WASA.

[84]  Weili Wu,et al.  A greedy approximation for minimum connected dominating sets , 2004, Theor. Comput. Sci..

[85]  Ning Zhang,et al.  Trade-off scheme for fault tolerant connected dominating sets on size and diameter , 2008, FOWANC '08.

[86]  Weili Wu,et al.  Coverage breach problems in bandwidth-constrained sensor networks , 2007, TOSN.

[87]  Xiaohua Jia,et al.  Virtual backbone construction in multihop ad hoc wireless networks , 2006, Wirel. Commun. Mob. Comput..

[88]  Jie Wu,et al.  Extended multipoint relays to determine connected dominating sets in MANETs , 2006, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[89]  Minming Li,et al.  Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks , 2009, ISAAC.

[90]  Thomas Erlebach,et al.  A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs , 2009, WAOA.

[91]  Donghyun Kim,et al.  A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs , 2010, IEEE Transactions on Mobile Computing.

[92]  Deying Li,et al.  A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.

[93]  Ding-Zhu Du,et al.  Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links , 2006, APWeb.

[94]  Deying Li,et al.  Construction of strongly connected dominating sets in asymmetric multihop wireless networks , 2009, Theor. Comput. Sci..

[95]  R. Graham,et al.  A Packing Inequality for Compact Convex Subsets of the Plane , 1969, Canadian Mathematical Bulletin.

[96]  Rajiv Ramaswami,et al.  Multiwavelength optical networks with limited wavelength conversion , 1998, TNET.

[97]  Hans Zassenhaus,et al.  Modern developments in the geometry of numbers , 1961 .

[98]  Laurence A. Wolsey,et al.  An analysis of the greedy algorithm for the submodular set covering problem , 1982, Comb..

[99]  Weili Wu,et al.  Analysis on Theoretical Bounds for Approximating Dominating Set Problems , 2009, Discret. Math. Algorithms Appl..

[100]  Weili Wu,et al.  (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs , 2008, COCOON.

[101]  Hongwei Du,et al.  PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks , 2010, COCOA.

[102]  Weili Wu,et al.  Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[103]  Weili Wu,et al.  New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs , 2011, Theor. Comput. Sci..

[104]  Xiaohua Jia,et al.  Minimum-latency aggregation scheduling in multihop wireless networks , 2009, MobiHoc '09.

[105]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[106]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[107]  Dario Pompili,et al.  Underwater acoustic sensor networks: research challenges , 2005, Ad Hoc Networks.

[108]  Ding-Zhu Du,et al.  On the construction of 2-connected virtual backbone in wireless networks , 2009, IEEE Transactions on Wireless Communications.

[109]  Thomas Erlebach,et al.  Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs , 2006, APPROX-RANDOM.

[110]  Helmut Groemer,et al.  Über die Einlagerung von Kreisen in einen konvexen Bereich , 1960 .

[111]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[112]  Zhu Wang,et al.  Wireless coverage with disparate ranges , 2011, MobiHoc '11.

[113]  P. Green.  Fiber Optic Networks , 1992 .

[114]  Ding-Zhu Du,et al.  Connected Dominating Sets in Wireless Networks with Different Transmission Ranges , 2007, IEEE Transactions on Mobile Computing.

[115]  Gruia Calinescu,et al.  Network Lifetime and Power Assignment in ad hoc Wireless Networks , 2003, ESA.

[116]  Wei Cheng,et al.  Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs , 2008, 2008 The 28th International Conference on Distributed Computing Systems.

[117]  Deying Li,et al.  CDS-Based Virtual Backbone Construction with Guaranteed Routing Cost in Wireless Sensor Networks , 2013, IEEE Transactions on Parallel and Distributed Systems.

[118]  Ning Hu,et al.  Connected Dominating Set in 3-dimensional Space for Ad Hoc Network , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[119]  Yi Zhu,et al.  Efficient Distributed Algorithms for Topology Control Problem with Shortest Path Constraints , 2009, Discret. Math. Algorithms Appl..

[120]  Ding-Zhu Du,et al.  On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay , 2006, IEEE Transactions on Mobile Computing.

[121]  Maggie Xiaoyan Cheng,et al.  Maximum lifetime coverage preserving scheduling algorithms in sensor networks , 2011, J. Glob. Optim..

[122]  F. Frances Yao,et al.  Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges , 2010, IEEE Transactions on Mobile Computing.

[123]  Mahtab Seddigh,et al.  Internal nodes based broadcasting in wireless networks , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[124]  Charles J. Colbourn,et al.  Permutation graphs: Connected domination and Steiner trees , 1991, Discret. Math..

[125]  Weili Wu,et al.  Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks , 2006, J. Glob. Optim..

[126]  Weili Wu,et al.  Efficient Virtual Backbone Construction with Routing Cost Constraint in Wireless Networks Using Directional Antennas , 2012, IEEE Transactions on Mobile Computing.

[127]  Arthur L. Liestman,et al.  Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks , 2002, MobiHoc '02.