Control chart tests based on geometric moving averages
Technometrics
Security Engineering: A Guide to Building Dependable Distributed Systems
Security Engineering: A Guide to Building Dependable Distributed Systems
Denial of Service in Sensor Networks
Computer
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
MP-DSR: A QoS-Aware Multi-Path Dynamic Source Routing Protocol for Wireless Ad-Hoc Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Convex Optimization
On link layer denial of service in data wireless LANs: Research Articles
Wireless Communications & Mobile Computing
802.11 denial-of-service attacks: real vulnerabilities and practical solutions
SSYM'03 Proceedings of the 12th conference on USENIX Security Symposium - Volume 12
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Intelligent jamming in wireless networks with applications to 802.11b and other networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
A tutorial on decomposition methods for network utility maximization
IEEE Journal on Selected Areas in Communications
Jamming sensor networks: attack and defense strategies
IEEE Network: The Magazine of Global Internetworking
Jamming-resistant communication in multi-channel multi-hop multi-path wireless networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Jamming-resilient multi-radio multi-channel multihop wireless network for smart grid
Proceedings of the Seventh Annual Workshop on Cyber Security and Information Intelligence Research
Jamming aware routing for MHWN with dynamic measurement
Computers and Electrical Engineering
Hi-index | 0.01 |
Multiple-path source routing protocols allow a data source node to distribute the total traffic among available paths. In this paper, we consider the problem of jamming-aware source routing in which the source node performs traffic allocation based on empirical jamming statistics at individual network nodes. We formulate this traffic allocation as a lossy network flow optimization problem using portfolio selection theory from financial statistics. We show that in multisource networks, this centralized optimization problem can be solved using a distributed algorithm based on decomposition in network utility maximization (NUM). We demonstrate the network's ability to estimate the impact of jamming and incorporate these estimates into the traffic allocation problem. Finally, we simulate the achievable throughput using our proposed traffic allocation method in several scenarios.