18,321 research outputs found

    A distributed key establishment scheme for wireless mesh networks using identity-based cryptography

    Get PDF
    In this paper, we propose a secure and efficient key establishment scheme designed with respect to the unique requirements of Wireless Mesh Networks. Our security model is based on Identity-based key establishment scheme without the utilization of a trusted authority for private key operations. Rather, this task is performed by a collaboration of users; a threshold number of users come together in a coalition so that they generate the private key. We performed simulative performance evaluation in order to show the effect of both the network size and the threshold value. Results show a tradeoff between resiliency and efficiency: increasing the threshold value or the number of mesh nodes also increases the resiliency but negatively effects the efficiency. For threshold values smaller than 8 and for number of mesh nodes in between 40 and 100, at least 90% of the mesh nodes can compute their private keys within at most 70 seconds. On the other hand, at threshold value 8, an increase in the number of mesh nodes from 40 to 100 results in 25% increase in the rate of successful private key generations

    Implementation and evaluation of a simulation system based on particle swarm optimisation for node placement problem in wireless mesh networks

    Get PDF
    With the fast development of wireless technologies, wireless mesh networks (WMNs) are becoming an important networking infrastructure due to their low cost and increased high speed wireless internet connectivity. This paper implements a simulation system based on particle swarm optimisation (PSO) in order to solve the problem of mesh router placement in WMNs. Four replacement methods of mesh routers are considered: constriction method (CM), random inertia weight method (RIWM), linearly decreasing Vmax method (LDVM) and linearly decreasing inertia weight method (LDIWM). Simulation results are provided, showing that the CM converges very fast, but has the worst performance among the methods. The considered performance metrics are the size of giant component (SGC) and the number of covered mesh clients (NCMC). The RIWM converges fast and the performance is good. The LDIWM is a combination of RIWM and LDVM. The LDVM converges after 170 number of phases but has a good performance.Peer ReviewedPostprint (author's final draft

    Investigation of fitness function weight-coefficients for optimization in WMN-PSO simulation system

    Get PDF
    (c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.With the fast development of wireless technologies, Wireless Mesh Networks (WMNs) are becoming an important networking infrastructure due to their low cost and increased high speed wireless Internet connectivity. In our previous work, we implemented a simulation system based on Particle Swam Optimization for solving node placement problem in wireless mesh networks, called WMN-PSO. In this paper, we use Size of Giant Component (SGC) and Number of Covered Mesh Clients (NCMC) as metrics for optimization. Then, we analyze effects of weight-coefficients for SGC and NCMC. From the simulation results, we found that the best values of the weight-coefficients for SGC and NCMC are 0.7 and 0.3, respectively.Peer ReviewedPostprint (author's final draft

    Node placement in Wireless Mesh Networks: a comparison study of WMN-SA and WMN-PSO simulation systems

    Get PDF
    (c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.With the fast development of wireless technologies, Wireless Mesh Networks (WMNs) are becoming an important networking infrastructure due to their low cost and increased high speed wireless Internet connectivity. In our previous work, we implemented a simulation system based on Simulated Annealing (SA) for solving node placement problem in wireless mesh networks, called WMN-SA. Also, we implemented a Particle Swarm Optimization (PSO) based simulation system, called WMN-PSO. In this paper, we compare two systems considering calculation time. From the simulation results, when the area size is 32 × 32 and 64 × 64, WMN-SA is better than WMN-PSO. When the area size is 128 × 128, WMN-SA performs better than WMN-PSO. However, WMN-SA needs more calculation time than WMN-PSO.Peer ReviewedPostprint (author's final draft

    Latency Optimal Broadcasting in Noisy Wireless Mesh Networks

    Full text link
    In this paper, we adopt a new noisy wireless network model introduced very recently by Censor-Hillel et al. in [ACM PODC 2017, CHHZ17]. More specifically, for a given noise parameter p[0,1],p\in [0,1], any sender has a probability of pp of transmitting noise or any receiver of a single transmission in its neighborhood has a probability pp of receiving noise. In this paper, we first propose a new asymptotically latency-optimal approximation algorithm (under faultless model) that can complete single-message broadcasting task in D+O(log2n)D+O(\log^2 n) time units/rounds in any WMN of size n,n, and diameter DD. We then show this diameter-linear broadcasting algorithm remains robust under the noisy wireless network model and also improves the currently best known result in CHHZ17 by a Θ(loglogn)\Theta(\log\log n) factor. In this paper, we also further extend our robust single-message broadcasting algorithm to kk multi-message broadcasting scenario and show it can broadcast kk messages in O(D+klogn+log2n)O(D+k\log n+\log^2 n) time rounds. This new robust multi-message broadcasting scheme is not only asymptotically optimal but also answers affirmatively the problem left open in CHHZ17 on the existence of an algorithm that is robust to sender and receiver faults and can broadcast kk messages in O(D+klogn+polylog(n))O(D+k\log n + polylog(n)) time rounds.Comment: arXiv admin note: text overlap with arXiv:1705.07369 by other author
    corecore