Implementing a distributed firewall
Proceedings of the 7th ACM conference on Computer and communications security
A community based mobility model for ad hoc network research
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Planetary-scale views on a large instant-messaging network
Proceedings of the 17th international conference on World Wide Web
ROFL: routing as the firewall layer
Proceedings of the 2008 workshop on New security paradigms
OpenLIDS: a lightweight intrusion detection system for wireless mesh networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Routing betweenness centrality
Journal of the ACM (JACM)
Social network analysis concepts in the design of wireless ad hoc network protocols
IEEE Network: The Magazine of Global Internetworking
High Performance Firewalls in MANETs
MSN '10 Proceedings of the 2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks
Maximum betweenness centrality: approximability and tractable cases
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Density of Multipoint Relays in Dense Wireless Multi-hop Networks
ICNC '11 Proceedings of the 2011 Second International Conference on Networking and Computing
A Variant betweenness Centrality Approach towards Distributed Network Monitoring
PAAP '11 Proceedings of the 2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming
Efficient packet filtering in wireless ad hoc networks
IEEE Communications Magazine
How to reduce and stabilize MPR sets in OLSR networks
WIMOB '12 Proceedings of the 2012 IEEE 8th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)
| Hi-index | 0.00 |
In traditional networks special efforts are put to secure the perimeter with firewalls: particular routers that analyze and filter the traffic to separate zones with different levels of trust. In wireless multi-hop networks the perimeter is a concept extremely hard to identify, thus, it is much more effective to enforce control on the nodes that will route more traffic. But traffic filtering and traffic analysis are costly activities for the limited resources of mesh nodes, so a trade-off must be reached limiting the number of nodes that enforce them. This work shows how, using the OLSR protocol, the centrality of groups of nodes with reference to traffic can be estimated with high accuracy independently of the network topology or size. We also show how this approach greatly limits the impact of an attack to the network using a number of firewalls that is only a fraction of the available nodes.