#### DMCA

## Efficient Topology Design in Time-Evolving and Energy-Harvesting Wireless Sensor Networks

Citations: | 1 - 1 self |

### Citations

278 | Design and Analysis of a MST-Based Topology Control Algorithm,”
- Li, Hou, et al.
- 2015
(Show Context)
Citation Context ... in MANETs and WSNs [12]. Primary topology control algorithms aim to maintain network connectivity and conserve energy. Most of them can be classified into two categories: geometrical structure-based =-=[21]-=-, [22] and clustering-based [23], [24]. These topology control protocols deal with topology changes by re-performing the construction algorithm. However, they all assume that the underlying communicat... |

268 | Max-Min DCluster Formation in Wireless Ad Hoc Networks,”
- Amis, Prakash, et al.
- 2000
(Show Context)
Citation Context ...y topology control algorithms aim to maintain network connectivity and conserve energy. Most of them can be classified into two categories: geometrical structure-based [21], [22] and clustering-based =-=[23]-=-, [24]. These topology control protocols deal with topology changes by re-performing the construction algorithm. However, they all assume that the underlying communication graph is fully connected at ... |

178 | Approximation algorithms for directed Steiner problems
- Charikar, Chekuri, et al.
- 1998
(Show Context)
Citation Context ... to converted or splitted to link costs; and (3) the construction methods from a sequence of static graphs to the space-time graph are different. In fact, like the directed Steiner tree problem [18], =-=[19]-=-, the node-weighted version of topology design problem is much harder than the link-weighted version. We now prove the NP-hardness of our newly defined topology design problem ETDP by a reduction from... |

138 | A nearly best-possible approximation algorithm for node-weighted steiner trees,”
- Klein, Ravi
- 1995
(Show Context)
Citation Context ...t easy to converted or splitted to link costs; and (3) the construction methods from a sequence of static graphs to the space-time graph are different. In fact, like the directed Steiner tree problem =-=[18]-=-, [19], the node-weighted version of topology design problem is much harder than the link-weighted version. We now prove the NP-hardness of our newly defined topology design problem ETDP by a reductio... |

86 | Localized construction of bounded degree planar spanner.
- Wang, Li
- 2003
(Show Context)
Citation Context ...NETs and WSNs [12]. Primary topology control algorithms aim to maintain network connectivity and conserve energy. Most of them can be classified into two categories: geometrical structure-based [21], =-=[22]-=- and clustering-based [23], [24]. These topology control protocols deal with topology changes by re-performing the construction algorithm. However, they all assume that the underlying communication gr... |

81 | Ambimax: Autonomous energy harvesting platform for multisupply wireless sensor nodes - Park, Chou |

61 |
Computing shortest, fastest, and foremost journeys in dynamic networks.
- B, Ferreira, et al.
- 2003
(Show Context)
Citation Context ...sor nodes are removed from the original space-time graph but the connectivity over time is preserved. The newly defined topology design problem is different from the standard space-time routing [16], =-=[17]-=-, which aims to find the most cost-efficient space-time path for a pair of source and destination. The ETDP aims to maintain a cost-efficient and connected space-time graph for all pairs of nodes. The... |

59 |
Wakeup scheduling in wireless sensor networks,” in
- Keshavarzian, Lee, et al.
- 2006
(Show Context)
Citation Context ... duty cycles in WSNs. E.g., Lu et al. [28] propose several techniques for minimizing communication latency while providing energyefficient periodic sleep cycles for nodes in WSNs. Keshavarzian et al. =-=[29]-=- introduce a multi-parent forwarding technique and propose a heuristic algorithm for assigning parents to the nodes in the network. Recently, there are also several studies on sleep scheduling for low... |

51 | Distributed Low-Cost Backbone Formation for Wireless Ad Hoc Networks
- Wang, Wang, et al.
- 2005
(Show Context)
Citation Context ...logy control algorithms aim to maintain network connectivity and conserve energy. Most of them can be classified into two categories: geometrical structure-based [21], [22] and clustering-based [23], =-=[24]-=-. These topology control protocols deal with topology changes by re-performing the construction algorithm. However, they all assume that the underlying communication graph is fully connected at any mo... |

34 | Routing in a cyclic mobispace,”
- Liu, Wu
- 2008
(Show Context)
Citation Context ...in the connectivity over time. VII. RELATED WORK Modeling Time-Evolving Networks: How to model timeevolving networks has been studied in both mobile ad hoc networks (MANETs) [16], [17], [25] and DTNs =-=[26]-=-, [27]. Xuan et al. [17] first study routing problem in a fixed schedule dynamic network and use an evolving graph (an indexed sequence of static subgraphs of a given graph) to capture the evolving ch... |

12 | Pro-Energy: a novel energy prediction model for solar and wind energy harvesting wireless sensor networks
- Cammarano, Petrioli, et al.
- 2012
(Show Context)
Citation Context ...ight and maximized around noon everyday. This implies that it is easy to predict the solar energy resources in an energy-harvesting WSN. Actually, there has been several energy prediction methods [8]–=-=[11]-=- for different energy-harvesting WSNs. In this paper, we study the topology design problem for a Time-evolving and Energy-harvesting Wireless Sensor Network (TEWSN), by taking time-varying energy cost... |

12 |
Priority-basedcongestion control in wireless sensor networks,”
- Wang, Sohraby, et al.
- 2006
(Show Context)
Citation Context ... under different space-time graph models. Simulation results over random TEWSNs demonstrate the efficiency of our proposed methods. Topology design has been well studied in ad hoc and sensor networks =-=[12]-=-. Most efforts have been spent on how to construct a power efficient structure from a static and connected topology. Topology design over time-evolving network has not been investigated except for in ... |

7 | Dynamic switching-based data forwarding for lowduty-cycle wireless sensor networks,”
- Gu, He
- 2011
(Show Context)
Citation Context ...technique and propose a heuristic algorithm for assigning parents to the nodes in the network. Recently, there are also several studies on sleep scheduling for low-duty-cycle wireless sensor networks =-=[31]-=-–[33]. Most of these studies aim to design new data forwarding methods to optimize data delivery, endto-end delay, or energy consumptions. Usually, they assume static networks with constant and unifor... |

6 |
et al. Power management in energy harvesting sensor networks
- Kansal
(Show Context)
Citation Context ... generated from the environment [1]–[6]. Various energy sources including light, vibration or heat can be harvested by sensor nodes. Fig. 1(a) illustrates two examples of sensor devices (from [3] and =-=[4]-=-) powered by solar cells. Even though energy-harvesting technology can power WSNs more perpetually than non-renewable energy sources like batteries, the harvested energy is fundamentally different fro... |

6 |
Sleep-based topology control for wakeup scheduling in wireless sensor networks
- Zhou, Medidi
- 2007
(Show Context)
Citation Context ...inks to be removed. Previous solutions for linkweighted problem cannot be directly used in this new problem. Sleep Scheduling in Wireless Sensor Networks: Various sleep/wakeup scheduling schemes [28]–=-=[30]-=- have been proposed to save energy by employing scheduled duty cycles in WSNs. E.g., Lu et al. [28] propose several techniques for minimizing communication latency while providing energyefficient peri... |

4 |
et al. Heliomote: Enabling Long-lived Sensor Networks Through Solar Energy Harvesting. SenSys
- Lin
- 2005
(Show Context)
Citation Context ...bottleneck and the most important issue in the protocol design. Recent advances in ambient energyharvesting technologies have made it possible to power WSNs from energy generated from the environment =-=[1]-=-–[6]. Various energy sources including light, vibration or heat can be harvested by sensor nodes. Fig. 1(a) illustrates two examples of sensor devices (from [3] and [4]) powered by solar cells. Even t... |

4 | et al., “Routing in Space and Time in Networks with Predicable Mobility - Merugu - 2004 |

4 | Using evolving graphs to evaluate DTN routing protocols
- Arantes, Goldman, et al.
- 2009
(Show Context)
Citation Context ... connectivity over time. VII. RELATED WORK Modeling Time-Evolving Networks: How to model timeevolving networks has been studied in both mobile ad hoc networks (MANETs) [16], [17], [25] and DTNs [26], =-=[27]-=-. Xuan et al. [17] first study routing problem in a fixed schedule dynamic network and use an evolving graph (an indexed sequence of static subgraphs of a given graph) to capture the evolving characte... |

4 |
An energy-efficient distributed schedule-based communication protocol for periodic wireless sensor networks, Arab. jour. for sci. and eng.
- Al-Khdour, Baroudi
- 2010
(Show Context)
Citation Context ...es in the middle of T , it may not be able to reach the destination at the end of T via the constructed topology. However, in most TEWSNs (such as the ones shown in Fig. 1 and those in [4]–[6], [26], =-=[34]-=-), the energy patterns and topology evolution are periodic. Thus, the delivery of packets is guaranteed in such cases. (2) Our model assumes that all communication links are reliable. However, this ma... |

3 |
et al., “A millimeter-scale nearly-perpetual sensor system with stacked battery and solar cells
- Chen, Fojtik
- 2010
(Show Context)
Citation Context ...m energy generated from the environment [1]–[6]. Various energy sources including light, vibration or heat can be harvested by sensor nodes. Fig. 1(a) illustrates two examples of sensor devices (from =-=[3]-=- and [4]) powered by solar cells. Even though energy-harvesting technology can power WSNs more perpetually than non-renewable energy sources like batteries, the harvested energy is fundamentally diffe... |

3 |
et al., “Topology control for timeevolving and predictable delay-tolerant networks
- Huang, Chen, et al.
- 2011
(Show Context)
Citation Context ...p every sensor awake for all the time. We formally show that this new topology design problem is NP-hard, by connecting it with an existing topology control problem for delay tolerant networks (DTNs) =-=[13]-=-. We propose five different algorithms to construct new network topologies which can significantly reduce the total cost while maintaining the network connectivity over time. We also discuss how to ad... |

3 | LBA: Lifetime balanced data aggregation in low duty cycle sensor networks - Li, Peng, et al. - 2012 |

3 |
Robust multi-pipeline scheduling in lowduty-cycle wireless sensor networks
- Cao, Guo, et al.
- 2012
(Show Context)
Citation Context ...ique and propose a heuristic algorithm for assigning parents to the nodes in the network. Recently, there are also several studies on sleep scheduling for low-duty-cycle wireless sensor networks [31]–=-=[33]-=-. Most of these studies aim to design new data forwarding methods to optimize data delivery, endto-end delay, or energy consumptions. Usually, they assume static networks with constant and uniform ene... |

2 |
et al., “Harvesting aware power management for sensor networks
- Kansal
- 2006
(Show Context)
Citation Context ...leneck and the most important issue in the protocol design. Recent advances in ambient energyharvesting technologies have made it possible to power WSNs from energy generated from the environment [1]–=-=[6]-=-. Various energy sources including light, vibration or heat can be harvested by sensor nodes. Fig. 1(a) illustrates two examples of sensor devices (from [3] and [4]) powered by solar cells. Even thoug... |

2 |
et al., “Prediction and management in energy harvested wireless sensor nodes
- Piorno, Bergonzini, et al.
- 2009
(Show Context)
Citation Context ...he night and maximized around noon everyday. This implies that it is easy to predict the solar energy resources in an energy-harvesting WSN. Actually, there has been several energy prediction methods =-=[8]-=-–[11] for different energy-harvesting WSNs. In this paper, we study the topology design problem for a Time-evolving and Energy-harvesting Wireless Sensor Network (TEWSN), by taking time-varying energy... |

2 | et al., “Cost-efficient topology design problem in time-evolving delay-tolerant networks - Huang, Chen - 2010 |

2 |
et al., “Topology design in time-evolving delay-tolerant networks with unreliable links
- Huang, Chen, et al.
- 2012
(Show Context)
Citation Context ...en spent on how to construct a power efficient structure from a static and connected topology. Topology design over time-evolving network has not been investigated except for in our recent work [13]– =-=[15]-=-, where link-weighted space-time graphs are used to model time-evolving DTNs. The topology design problem over nodeweighted space-time graphs is much harder than those in [13]–[15] and more suitable f... |

2 |
et al., “Delay efficient sleep scheduling in wireless sensor networks
- Lu, Sadagopan, et al.
- 2005
(Show Context)
Citation Context ...ple links to be removed. Previous solutions for linkweighted problem cannot be directly used in this new problem. Sleep Scheduling in Wireless Sensor Networks: Various sleep/wakeup scheduling schemes =-=[28]-=-–[30] have been proposed to save energy by employing scheduled duty cycles in WSNs. E.g., Lu et al. [28] propose several techniques for minimizing communication latency while providing energyefficient... |

1 | et al., “Adaptive control of duty-cycling in energy-harvesting wireless sensor networks - Vigorito, Ganesan - 2007 |

1 | et al., “Algorithms for harvested energy prediction in batteryless wireless sensor networks - Bergonzini - 2009 |

1 | et al., “Accurate modeling and prediction of energy availability in energy harvesting real-time embedded systems - Lu - 2010 |

1 |
et al., “Set connectivity problems in undirected graphs and the directed steiner network problem
- Chekuri
(Show Context)
Citation Context ... Next, we present a more complex greedy algorithm (as shown in Algorithm 4) which is inspired by a method proposed by Charikar and Chekuri [19] for directed generalized Steiner network (DGSN) problem =-=[20]-=-. The DGSN problem is also a NP-hard problem and defined as follows. Given a directed link-weighted graph G and a set of X = {(ai, bi)} of k node pairs, find the minimum cost subgraph H of G such that... |

1 |
et al., “Performance evaluation of dynamic networks using an evolving graph combinatorial model
- Monteiro
- 2006
(Show Context)
Citation Context ...ures to maintain the connectivity over time. VII. RELATED WORK Modeling Time-Evolving Networks: How to model timeevolving networks has been studied in both mobile ad hoc networks (MANETs) [16], [17], =-=[25]-=- and DTNs [26], [27]. Xuan et al. [17] first study routing problem in a fixed schedule dynamic network and use an evolving graph (an indexed sequence of static subgraphs of a given graph) to capture t... |