Approximation Algorithm for Maximum Lifetime in Wireless Sensor Networks with Data Aggregation

Authors:
Jeffrey Stanford;Sutep Tongngam
Affiliations:
Illinois Institute of Technology;Illinois Institute of Technology
Venue:
SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Year:
2006

Citing 0
Cited 8

Novel Algorithms for the Network Lifetime Problem in Wireless Settings

ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
A combinatorial algorithm for the maximum lifetime data gathering with aggregation problem in sensor networks

Computer Communications
Everywhere sparse approximately optimal minimum energy data gathering and aggregation in sensor networks

ACM Transactions on Sensor Networks (TOSN)
Novel algorithms for the network lifetime problem in wireless settings

Wireless Networks
Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks

FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Improved approximation algorithms for maximum lifetime problems in wireless networks

Theoretical Computer Science
Improved approximation bounds for maximum lifetime problems in wireless ad-hoc network

ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
A survey on resiliency assessment techniques for wireless sensor networks

Proceedings of the 11th ACM international symposium on Mobility management and wireless access

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a decision table based methodology to analyze trading models. There are many trading systems available but mostly do not work. Ninety percent of traders lose money including those using professionally developed systems. The same system ...