Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks
FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
Trading Latency for Energy in Wireless Ad Hoc Networks Using Message Ferrying
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Message Ferrying for Constrained Scenarios
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks
IEEE Transactions on Mobile Computing
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
On-demand routing in disrupted environments
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
A centralized energy-efficient routing protocol for wireless sensor networks
IEEE Communications Magazine
| Hi-index | 0.00 |
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 disjoint parts of a partitioned WSN. In this paper, we propose a tree-based MF algorithm (TMFA) with least ratio tree (LRT) construction in order to prolong the lifetime and reduce energy usage in a WSN employing MF routing. LRT constructs a spanning tree from the topology graph of each partition of the WSN by setting the weight of each edge in the graph as the ratio between the energy cost to deliver a packet over the corresponding wireless link and a linear combination of the residual energy of the transmitting and receiving nodes connected by the link. In addition, the root of the spanning tree is randomly chosen among the nodes in the partition with residual energy equal to or larger than the mean residual energy of all nodes in the partition, so that the energy of nodes are expended evenly. Experimental results show that, compared with the previously proposed Least Energy Tree (LET) and Minimum Spanning Tree (MST) construction methods for TMFA, LRT construction outperforms both the LET and the MST construction in network lifetime and in the ratio of the number of packets reaching the sink to the total energy expended by all the nodes.