Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Computability and complexity theory
Computability and complexity theory
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithmics for Hard Problems
Algorithmics for Hard Problems
Time Synchronization for Wireless Sensor Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Secure verification of location claims
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Timing-sync protocol for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Sensor Networks for Emergency Response: Challenges and Opportunities
IEEE Pervasive Computing
Detecting Malicious Beacon Nodes for Secure Location Discovery in Wireless Sensor Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Secure time synchronization service for sensor networks
Proceedings of the 4th ACM workshop on Wireless security
Attack-resistant location estimation in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
A better approximation ratio for the vertex cover problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Scalable routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Towards a theory for securing time synchronization in wireless sensor networks
Proceedings of the second ACM conference on Wireless network security
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
Hi-index | 0.00 |
Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (graph-theoretic) models for these services exist. Since, these services were not designed with robustness and security in mind, new mathematical models are needed to address these issues. In this paper, we propose a practical approach for modelling these services using weighted undirected graphs called Partially Consistent Grounded Graphs (PCGG). In such graphs, malicious behaviour or inaccurate information reporting is modelled as a function that assigns incorrect or inconsistent values (weights) to the edges connecting the corresponding nodes, called inconsistent edges. We formulate two optimisation problems, namely MAX-CON and LARGEST-CON. Given a PCGG, these are the problems of determining the largest induced subgraph (obtained by eliminating a subset of vertices) containing only consistent edges. MAX-CON maximises the number of vertices, while LARGEST-CON maximises the number of consistent edges of the resulting subgraph. We also discuss the practical implications of solving these problems, analyse their computational hardness and provide a comparitive analysis of heuristics-based algorithms for them.