Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Linear Programming in O([n3/ln n]L) Operations
SIAM Journal on Optimization
Distributions on Level-Sets with Applications to Approximation Algorithms
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
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
Proceedings of the 11th annual international conference on Mobile computing and networking
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Practical, distributed channel assignment and routing in dual-radio mesh networks
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
On quality of monitoring for multi-channel wireless infrastructure networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Multichannel mesh networks: challenges and protocols
IEEE Wireless Communications
Securing wireless mesh networks
IEEE Wireless Communications
The IEEE 802.11s Extended Service Set Mesh Networking Standard
IEEE Communications Magazine
A framework for misuse detection in ad hoc Networks-part I
IEEE Journal on Selected Areas in Communications
A framework for misuse detection in ad hoc networks- part II
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
This paper studies an optimal monitoring problem for behavior-based detection in multi-channel multi-radio wireless mesh networks. In behavior-based detection, nodes overhear communications in their neighborhood to determine if the behaviors of their neighbors are legitimate. The objective of this work is to maximize the number of nodes being monitored by judiciously choosing a set of monitoring nodes and also channels for the chosen monitoring nodes. This problem is NP-hard, growing exponentially with the number of monitoring nodes. We develop three approximation algorithms, each of which achieves at least a constant factor of the optimum. Furthermore, one of our algorithms achieves the best possible approximation ratio among all polynomial-time algorithms, unless P=NP. We conduct simulations in random networks and scale-free networks to evaluate the coverage and the execution time of the three algorithms.