Fault tolerant K-center problems
Theoretical Computer Science
Self-Organized Public-Key Management for Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Self-Securing Ad Hoc Wireless Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Optimization models and methods for planning wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design and implementation of MobiSEC: A complete security architecture for wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The joint Gateway Placement and Spatial Reuse Problem in Wireless Mesh Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ARSA: An Attack-Resilient Security Architecture for Multihop Wireless Mesh Networks
IEEE Journal on Selected Areas in Communications
Gateway Placement Optimization in Wireless Mesh Networks With QoS Constraints
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Wireless mesh networks (WMNs) are currently accepted as a new communication paradigm for next-generation wireless networking. They consist of mesh routers and clients, where mesh routers are almost static and form the backbone of WMNs. Several architectures have been proposed to distribute the authentication and authorization functions in the WMN backbone. In such distributed architectures, new mesh routers authenticate to a key management service (consisting of several servers, named core nodes), which can be implemented using threshold cryptography, and obtain a temporary key that is used both to prove their credentials to neighbor nodes and to encrypt all the traffic transmitted on wireless backbone links. This paper analyzes the optimal placement of the core nodes that collaboratively implement the key management service in a distributed wireless security architecture. The core node placement is formulated as an optimization problem, which models closely the behavior of real wireless channels; the performance improvement achieved solving our model is then evaluated in terms of key distribution/authentication delay in several realistic network scenarios. Numerical results show that our proposed model increases the responsiveness of distributed security architectures with a short computing time, thus representing a very effective tool to plan efficient and secure wireless networks.