Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A channel access scheme for large dense packet radio networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
IEEE Transactions on Parallel and Distributed Systems
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
ACM SIGMOBILE Mobile Computing and Communications Review - Special issue on wireless pan & sensor networks
A Power Efficient Routing Protocol Based on Balanced Tree in Wireless Sensor Networks
DFMA '05 Proceedings of the First International Conference on Distributed Frameworks for Multimedia Applications
Energy-Efficient Data Gathering in Large Wireless Sensor Networks
ICESS '05 Proceedings of the Second International Conference on Embedded Software and Systems
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
SHORT: shortest hop routing tree for wireless sensor networks
International Journal of Sensor Networks
SWOB: swarm intelligent odour based routing for geographic wireless sensor network applications
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
| Hi-index | 0.00 |
For applications requiring frequent data collections from a remote wireless sensor network, it is a challenging problem to design an efficient routing scheme for comprehensively, accurately and timely delivering data packets in each round of data collection over a long period of time. Unlike previous work targeting at maximizing energy efficiency and network lifetime, we propose and analyze in this paper a new routing scheme, called Minimum Energy Spanning Tree for Efficient Routing (MESTER), which is developed under the design objective of maintaining a high quality in data collection for as long as possible. Compared with the existing Minimum Spanning Tree (MST) based schemes like PEDAP and PEDAP-PA, MESTER can achieve comparable but more balanced performance at a much lower complexity. In addition, we define "throughput efficiency" to characterize our quality-oriented design objective. As a new concept with low granularity (packet level), throughput efficiency is found a fair and stable performance metric to different network sizes, node densities and routing schemes. It provides us an additional insight into the network behavior under different resource and capability constraints.