Abstract-We present a class of Minimum Cost Blocking (MCB) problems in Wireless Mesh Networks (WMNs) with multi-path wireless routing protocols. We establish the provable superiority of multi-path routing protocols over conventional protocols against blocking, node-isolation and network-partitioning type attacks. In our attack model, an adversary is considered successful if he is able to capture/isolate a subset of nodes such that no more than a certain amount of traffic from source nodes reaches the gateways. Two scenarios, viz. (a) low mobility for network nodes, and (b) high degree of node mobility, are evaluated. Scenario (a) is proven to be NP-hard and scenario (b) is proven to be #P-hard for the adversary to realize the goal. Further, several approximation algorithms are presented which show that even in the best case scenario it is at least exponentially hard for the adversary to optimally succeed in such blocking-type attacks. These results are verified through simulations which demonstrate the robustness of multi-path routing protocols against such attacks. To the best of our knowledge, this is the first work that theoretically evaluates the attack-resiliency and performance of multi-path protocols with network node mobility.
This chapter focuses on an important, challenging and yet largely unaddressed problem in Wireless Sensor Networks (WSN) data communication: detecting cheating aggregators and malicious/selfish discarding of data reports en route to the Base Stations (BSs). If undetected, such attacks can significantly affect the performance of applications. The goal is to make the aggregation process tamper-resistant so that the aggregator cannot report arbitrary values, and to ensure that silent discarding of data reports by intermediate en-route nodes is detected in a bounded fashion. In our model, individual node readings are aggregated into data reports by Aggregator Nodes or Cluster Heads and forwarded to the BS. BS performs a two-stage analysis on these reports: (a) Verification through attached proofs, (b) Comparison with Proxy Reports for ensuring arrival accuracy. Proofs are non-interactive verifiers sent with reports to attest correctness of reported values. Proxy Reports are periodically sent along alternate paths by non-aggregator nodes, piggybacked on data reports from other nodes. The model is intended as a guide for implementing security in real sensor network applications. It is simple and comprehensive, covering a variety of data formats and aggregation models: numeric and non-numeric data and aggregators located across one or multiple hops. Security analysis shows that the reports, both primary and proxy, cannot be forged by any outsiders and the contents of the reports are held confidential and the scheme is robust against collusion attacks. Lightweight design aims at minimal additional control and energy overhead. Simulation results show its fault tolerance against random and patterned node failures.
This paper demonstrates the provable superiority of multi-path routing protocols over other conventional protocols against blocking, node-isolation and network-partitioning typeattacks in Wireless Mesh Networks (WMNs) by emulating adversarial behavior. Though the underlying network model is of a WMN with mobile nodes, the results in this paper are equally applicable to other types of wireless data networks. The adversarial objective is to isolate a subset of network nodes through minimal cost optimal blocking of certain number of paths in the network (or partitioning the network). If less than a certain threshold of traffic from such node(s) reaches the routers, the adversary is successful. Two scenarios viz.: (a) low mobility for network nodes, and (b) high degree of node mobility, are evaluated. Scenario (a) is proven to be NP-hard and scenario (b) is proven to be #P-hard for the adversary to achieve the goal. Further, several approximation algorithms are presented which show that even in the best case scenario it is at least exponentially hard for the adversary to optimally succeed in such blocking-type attacks. These results are verified through simulations which demonstrate the robustness of multi-path protocols against such attacks. The objective of this paper is not to aid the adversary in succeeding in these attacks or to devise security measures for routing protocols; rather the aim is to study the performance and feasibility of multi-path protocols over conventional single-path protocols from a security angle in the wireless domain. To the best of our knowledge, this is the first paper to theoretically evaluate the attack-resiliency and performance of multi-path protocols with network node mobility.
Existing WLAN security schemes are few and product specific. While there exist some schemes for dealing with problems relating to Information Integrity, there are hardly any standard solutions for security problems relating to Quality of Service and Network Health Maintenance in Wireless Networks. In the absence of strong standards, the existing approach to general WLAN security is vendor specific.We propose a low cost and generic secure WLAN architecture which can be implemented on WLANs comprising of Access Points from different vendors. A behavior monitoring scheme which validates the model has been developed and tested.
This chapter focuses on an important, challenging and yet largely unaddressed problem in Wireless Sensor Networks (WSN) data communication: detecting cheating aggregators and malicious/selfish discarding of data reports en route to the Base Stations (BSs). If undetected, such attacks can significantly affect the performance of applications. The goal is to make the aggregation process tamper-resistant so that the aggregator cannot report arbitrary values, and to ensure that silent discarding of data reports by intermediate en-route nodes is detected in a bounded fashion. In our model, individual node readings are aggregated into data reports by Aggregator Nodes or Cluster Heads and forwarded to the BS. BS performs a two-stage analysis on these reports: (a) Verification through attached proofs, (b) Comparison with Proxy Reports for ensuring arrival accuracy. Proofs are non-interactive verifiers sent with reports to attest correctness of reported values. Proxy Reports are periodically sent along alternate paths by non-aggregator nodes, piggybacked on data reports from other nodes. The model is intended as a guide for implementing security in real sensor network applications. It is simple and comprehensive, covering a variety of data formats and aggregation models: numeric and non-numeric data and aggregators located across one or multiple hops. Security analysis shows that the reports, both primary and proxy, cannot be forged by any outsiders and the contents of the reports are held confidential and the scheme is robust against collusion attacks. Lightweight design aims at minimal additional control and energy overhead. Simulation results show its fault tolerance against random and patterned node failures.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.