Data networks
The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Habitat monitoring: application driver for wireless communications technology
SIGCOMM LA '01 Workshop on Data communication in Latin America and the Caribbean
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
An architecture for building self-configurable systems
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic Power Management in Wireless Sensor Networks
IEEE Design & Test
Power Efficient Topologies for Wireless Sensor Networks
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
LANDMARC: Indoor Location Sensing Using Active RFID
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Energy-efficient surveillance system using wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Evaluations of target tracking in wireless sensor networks
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Achieving Real-Time Target Tracking UsingWireless Sensor Networks
RTAS '06 Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium
Wakeup scheduling in wireless sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Energy Efficient Data Routing in Wireless Sensor Network: A Mixed Approach
CNSR '07 Proceedings of the Fifth Annual Conference on Communication Networks and Services Research
Algorithms for Fault-Tolerant Topology in Heterogeneous Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
A survey of energy conservation, routing and coverage in wireless sensor networks
AMT'11 Proceedings of the 7th international conference on Active media technology
Information Sciences: an International Journal
Hi-index | 0.00 |
Wireless sensor networks have found more and more applications in a variety of pervasive computing environments, in their functions as data acquisition in pervasive applications. However, how to get better performance to support data acquisition of pervasive applications over WSNs remains to be a nontrivial and challenging task. The network lifetime and application requirement are two fundamental, yet conflicting, design objectives in wireless sensor networks for tracking mobile objects. The application requirement is often correlated to the delay time within which the application can send its sensing data back to the users in tracking networks. In this paper we study the network lifetime maximization problem and the delay time minimization problem together. To make both problems tractable, we have the assumption that each sensor node keeps working since it turns on. And we formulate the network lifetime maximization problem as maximizing the number of sensor nodes who don't turn on, and the delay time minimization problem as minimizing the routing path length, after achieving the required tracking tasks. Since we prove the problems are NP-complete and APX-complete, we propose three heuristic algorithms to solve them. And we present several experiments to show the advantages and disadvantages referring to the network lifetime and the delay time among these three algorithms on three models, random graphs, grids and hypercubes. Furthermore, we implement the distributed version of these algorithms.