Discrete Mathematics - Topics on domination
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Topology management for sensor networks: exploiting latency and density
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
A cooperative intrusion detection system for ad hoc networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Reputation-based framework for high integrity sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
LITEWORP: A Lightweight Countermeasure for the Wormhole Attack in Multihop Wireless Networks
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Decentralized intrusion detection in wireless sensor networks
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
DICAS: Detection, Diagnosis and Isolation of Control Attacks in Sensor Networks
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
A resilient packet-forwarding scheme against maliciously packet-dropping nodes in sensor networks
Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks
SLAM: Sleep-Wake Aware Local Monitoring in Sensor Networks
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Self-monitoring of wireless sensor networks
Computer Communications
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Proceedings of the 4th Annual International Conference on Wireless Internet
Distributed monitoring and aggregation in wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.00 |
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry out monitoring operations. Such an assumption, however, is often difficult for a large scale sensor network. In this work, we focus on designing an efficient scheme integrated with good self-monitoring capability as well as providing an infrastructure for various security protocols using local monitoring. To the best of our knowledge, we are the first to present the formal study on finding optimized self-monitoring topology for WSNs. We show the problem is NP-complete even under the unit disk graph (UDG) model, and give the upper bound on the approximation ratio. We further propose two distributed polynomial algorithms with provable approximation ratio to address this issue. Through comprehensive simulations, we evaluate the effectiveness of this design.