2008 · 10 citations · 16 references
ComputingComputer SystemsElectrical EngineeringEnergy ManagementEnergy SystemsWireless CommunicationsRoutingRouting AlgorithmsRouting ProtocolsSensor NetworksWireless NetworksWireless Sensor NetworksEnergy ConsumptionEnergy-efficient Wireless Sensor NetworksMinimum Spanning Tree AlgorithmsSensor Network RoutingSensor NodesSpanning Tree ConstructionTree AlgorithmsWireless Sensor Network Routing
Wireless sensor networks (WSNs) are prone to partitioning due to limited energy in sensor nodes and unreliable radio communications between them. Message ferrying (MF) has been proposed as an effective means to deliver data between separated parts of a partitioned WSN. In this paper, we propose a tree-based MF algorithm (TMFA), in which minimum-weight spanning trees of each partition of the WSN are evaluated with different alternate root nodes. Appropriate choice of the weights allows overall energy consumption or delay to be minimized. Two kinds of tree-constructing algorithms respectively named least energy tree (LET) and minimum hop tree (MHT) are presented and evaluated by deriving an energy model. For comparison, minimum spanning tree (MST) at a single root node and one level tree (OLT) that maximizes the use of the MF are considered. Simulation experiments show that LET and MHT outperform both MST and OLT when we take the message ferrypsilas moving cost into account.
16
Epidemic routing for partially-connected ad hoc networks
Amin Vahdat · 2000 · 4.2K citations
Thrasyvoulos Spyropoulos, Konstantinos Psounis, C.S. Raghavendra · 2005 · 2.6K citations · Full text
Energy-aware wireless microsensor networks
Vijay Raghunathan, Curt Schurgers, Sung Min Park et al. · IEEE Signal Processing Magazine · 2002 · 1.7K citations
Data MULEs: modeling a three-tier architecture for sparse sensor networks
Rahul Shah, Sumit Roy, Shailendra Pratap Jain et al. · 2003 · 1.3K citations