A clustering algorithm for negotiating security in wireless mesh networks

Wireless networks rely greatly on security for authentication and confidentiality, due to the use of an open communication medium. The tendency to incorporate wireless capabilities in battery powered hand-held devices makes it difficult to enforce security because of computational resources and battery capacity limitations. One approach to this problem consists in adaptable security mechanisms: different security algorithms may be enforced at any given time, to assure a proper level of protection, while respecting constraints on power and resource consumption. This paper presents such a mechanism (CLASS), which uses a clustering scheme to setup homogenous security areas in the network. The scheme is based on the available energy at every node and on the individual security requirements. By proper assignment of the nodes and by proper selection of security, we show that our method significantly reduces the average energy consumption compared to a heterogeneous network.