![]() | Only 14 pages are availabe for public view |
Abstract The actual different level of mobility associated with Mesh Clients offers much more flexibility within Wireless Mesh Networks (WMNs). The architecture of WMNs is comparatively new and lacks a robust secure scheme, so establishing an Authentic Association (AA) amongst entities in WMN is actually nontrivial problem. This thesis develops a Polynomial Based scheme (PBs) which provides pair-wise connectivity by using random perturbation based (RPB) scheme. New scheme (EARPB) is Proposed to combine the advantages of (PBs) and (RPB) schemes. These advantages are summarized in achieving pair-wise connectivity, low communication, marginal storage overhead and high scalability. It is not only performed to be resilient against both traffic analysis and node capture attacks but also it guarantees that any two nodes can directly establish a pairwise key without exposing any secret to other nodes . Even though many nodes have been actually compromised, the pairwise keys shared by non-compromised nodes remain highly secure. The proposed scheme incurs low computation and communication overhead. As shown in this thesis the EARPB scheme provides all these distinguished features without relying on public key cryptography. viii The thesis is described as follows: Chapter one gives a brief background about the security and wireless mesh networks concepts that will be used during the thesis. Chapter two gives a survey on the terminologies that have been used in this thesis. Chapter three gives a brief survey on w related works of our scheme. Chapter four proposes five proposes (EARPB) Enhanced Approach with a Random Perturbation-Based Scheme. Chapter five gives the conclusion and the future works. |