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
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
Organizing a global coordinate system from local information on an ad hoc sensor network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
IEEE Communications Magazine
Layered Diffusion-based Coverage Control in Wireless Sensor Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
International Journal of Network Management
Wireless Personal Communications: An International Journal
Measuring and guaranteeing quality of barrier coverage for general belts with wireless sensors
ACM Transactions on Sensor Networks (TOSN)
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Minimum dominating sets for solving the coverage problem in wireless sensor networks
UCS'06 Proceedings of the Third international conference on Ubiquitous Computing Systems
A review of redundancy elimination protocols for wireless sensor networks
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part III
A three-tiered node scheduling scheme for sparse sensing in wireless sensor networks
Computer Communications
Hi-index | 0.00 |
Selecting a partial set of sensor nodes for maintaining full system sensing coverage is an important issue in wireless sensor networks. Previous research was concentrated on the location-aware sensor environments; little attention has been devoted to the location-free networks that are more difficult to detect blind spots. This paper describes an approach to determining active nodes for complete coverage without their location information. A triangular self-test mechanism is designed to examine the existence of blind areas and to activate appropriate sensor nodes for covering the areas. The selection mechanism was developed and evaluated using network simulator ns-2. Two related algorithms, PEAS and OGDC, were also implemented for performance comparison. The simulation measured the metrics in control overhead, size of the active set, and sensing coverage. The results show that our algorithm aids profit in network scalability, energy efficiency, and number of active sensor nodes in the location-free wireless sensor network.