Matrix-based pairwise key establishment in wireless mesh networks using deployment knowledge

Due to the nature of wireless transmission, communication in wireless mesh networks (WMNs) is vulnerable to many adversarial activities including eavesdropping. Pairwise key establishment is one of the fundamental issues in securing WMNs. This paper presents a new matrix-based pairwise key establishment scheme for mesh clients. Our design is motivated by the fact that in WMNs, mesh routers are more powerful than mesh clients, both in computation and communication. By exploiting this heterogeneity, expensive operations can be delegated to mesh routers, which help alleviate the overhead of mesh clients during key establishment. The new scheme possesses two desirable features: (1) Neighbor mesh clients can directly establish pairwise keys; and (2) Communication and storage costs at mesh clients are significantly reduced.

Towards parameter-less 3D mesh segmentation

This thesis focuses on the 3D mesh segmentation process. The research demonstrated how the process can be done in a parameterless approach which allows full automation with accurate results. Applications of this research include, but not limited to, 3D search engines, 3D character animation, robotics environment recognition, and augmented reality.

Matrix-based pairwise key establishment with pre and post deployment knowledge for wireless mesh networks

The nature of wireless transmission leads to vulnerabilities to many malicious activities, and communication in wireless mesh networks (WMNs) must be protected by proper security measures. This paper focuses on symmetric pair wise key establishment and presents a new matrix-based pair wise key establishment scheme for mesh clients. In WMNs, mesh routers are much more powerful than mesh clients, both in communication and computation. By taking advantage of this heterogeneity, our new scheme delegates energy-consuming operations to mesh routers when establishing pair wise keys for mesh clients. Additionally, neighbor mesh clients in our scheme can directly establish pair wise keys with significantly reduced communication and storage costs, due to the use of both pre and post deployment knowledge.

Polynomial based key predistribution scheme in wireless mesh networks

Wireless mesh networks (WMNs) have the ability to integrate with other networks while providing a fast and cost-saving deployment. The network security is one of important challenge problems in this kind of networks. This paper is focused on key management between mesh and sensor networks. We propose an efficient key pre-distribution scheme based on two polynomials in wireless mesh networks by employing the nature of heterogeneity. Our scheme realizes the property of bloom filters, i.e., neighbor nodes can discover their shared keys but have no knowledge on the different keys possessed by the other node, without the probability of false positive. The analysis presented in this paper shows that our scheme has the ability to establish three different security level keys and achieves the property of self adaptive security for sensor networks with acceptable computation and communication consumption.

Sustainability analysis and resource management for wireless mesh networks with renewable energy supplies

 There is a growing interest in the use of renewable energy sources to power wireless networks in order to mitigate the detrimental effects of conventional energy production or to enable deployment in off-grid locations. However, renewable energy sources, such as solar and wind, are by nature unstable in their availability and capacity. The dynamics of energy supply hence impose new challenges for network planning and resource management. In this paper, the sustainable performance of a wireless mesh network powered by renewable energy sources is studied. To address the intermittently available capacity of the energy supply, adaptive resource management and admission control schemes are proposed. Specifically, the goal is to maximize the energy sustainability of the network, or equivalently, to minimize the failure probability that the mesh access points (APs) deplete their energy and go out of service due to the unreliable energy supply. To this end, the energy buffer of a mesh AP is modeled as a G/G/1(/N) queue with arbitrary patterns of energy charging and discharging. Diffusion approximation is applied to analyze the transient evolution of the queue length and the energy depletion duration. Based on the analysis, an adaptive resource management scheme is proposed to balance traffic loads across the mesh network according to the energy adequacy at different mesh APs. A distributed admission control strategy to guarantee high resource utilization and to improve energy sustainability is presented. By considering the first and second order statistics of the energy charging and discharging processes at each mesh AP, it is demonstrated that the proposed schemes outperform some existing state-of-the-art solutions.

A cross-layer key establishment scheme in wireless mesh networks

Cryptographic keys are necessary to secure communications among mesh clients in wireless mesh networks. Traditional key establishment schemes are implemented at higher layers, and the security of most such designs relies on the complexity of computational problems. Extracting cryptographic keys at the physical layer is a promising approach with information-theoretical security. But due to the nature of communications at the physical layer, none of the existing designs supports key establishment if communicating parties are out of each other's radio range, and all schemes are insecure against man-in-the-middle attacks. This paper presents a cross-layer key establishment scheme where the established key is determined by two partial keys: one extracted at the physical layer and the other generated at higher layers. The analysis shows that the proposed cross-layer key establishment scheme not only eliminates the aforementioned shortcomings of key establishment at each layer but also provides a flexible solution to the key generation rate problem. © 2014 Springer International Publishing Switzerland.

A noisy-smoothing relevance feedback method for content-based medical image retrieval

In this paper, we address a new problem of noisy images which present in the procedure of relevance feedback for medical image retrieval. We concentrate on the noisy images, caused by the users mislabeling some irrelevant images as relevant ones, and a noisy-smoothing relevance feedback (NS-RF) method is proposed. In NS-RF, a two-step strategy is proposed to handle the noisy images. In step 1, a noisy elimination algorithm is adopted to identify and eliminate the noisy images. In step 2, to further alleviate the influence of noisy images, a fuzzy membership function is employed to estimate the relevance probabilities of retained relevant images. After noisy handling, the fuzzy support vector machine, which can take into account different relevant images with different relevance probabilities, is adopted to re-rank the images. The experimental results on the IRMA medical image collection demonstrate that the proposed method can deal with the noisy images effectively.

A new design concept for knitted external vein-graft support mesh

Autologous vein-graft failure significantly limits the long-term efficacy of coronary artery bypass procedures. The major cause behind this complication is biomechanical mismatch between the vein and coronary artery. The implanted vein experiences a sudden increase (10-12 fold) in luminal pressures. The resulting vein over-distension or 'ballooning' initiates wall thickening phenomenon and ultimate occlusion. Therefore, a primary goal in improving the longevity of a coronary bypass procedure is to inhibit vein over-distension using mechanical constriction. The idea of using an external vein-graft support mesh has demonstrated sustained benefits and wide acceptance in experimental studies. Nitinol based knitted structures have offered more promising mechanical features than other mesh designs owing to their unique loosely looped construction. However, the conventional plain knit construction still exhibits limitations (radial compliance, deployment ease, flexibility, and bending stresses) which limit this design from proving its real clinical advantage. The new knitted mesh design presented in this study is based on the concept of composite knitting utilising high modulus (nitinol and polyester) and low modulus (polyurethane) material components. The experimental comparison of the new design with a plain knit design demonstrated significant improvement in biomechanical (compliance, flexibility, extensibility, viscoelasticity) and procedural (deployment limit) parameters. The results are indicative of the promising role of new mesh in restoring the lost compliance and pulsatility of vein-graft at high arterial pressures. This way it can assist in controlled vein-graft remodelling and stepwise restoration of vein mechanical homoeostasis. Also, improvement in deployment limit parameter offers more flexibility for a surgeon to use a wide range of vein diameters, which may otherwise be rendered unusable for a plain knit mesh.

Dominating set and network coding-based routing in wireless mesh networks

Wireless mesh networks are widely applied in many fields such as industrial controlling, environmental monitoring, and military operations. Network coding is promising technology that can improve the performance of wireless mesh networks. In particular, network coding is suitable for wireless mesh networks as the fixed backbone of wireless mesh is usually unlimited energy. However, coding collision is a severe problem affecting network performance. To avoid this, routing should be effectively designed with an optimum combination of coding opportunity and coding validity. In this paper, we propose a Connected Dominating Set (CDS)-based and Flow-oriented Coding-aware Routing (CFCR) mechanism to actively increase potential coding opportunities. Our work provides two major contributions. First, it effectively deals with the coding collision problem of flows by introducing the information conformation process, which effectively decreases the failure rate of decoding. Secondly, our routing process considers the benefit of CDS and flow coding simultaneously. Through formalized analysis of the routing parameters, CFCR can choose optimized routing with reliable transmission and small cost. Our evaluation shows CFCR has a lower packet loss ratio and higher throughput than existing methods, such as Adaptive Control of Packet Overhead in XOR Network Coding (ACPO), or Distributed Coding-Aware Routing (DCAR).

Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design

This paper describes the formulation of a Multi-objective Pipe Smoothing Genetic Algorithm (MOPSGA) and its application to the least cost water distribution network design problem. Evolutionary Algorithms have been widely utilised for the optimisation of both theoretical and real-world non-linear optimisation problems, including water system design and maintenance problems. In this work we present a pipe smoothing based approach to the creation and mutation of chromosomes which utilises engineering expertise with the view to increasing the performance of the algorithm whilst promoting engineering feasibility within the population of solutions. MOPSGA is based upon the standard Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and incorporates a modified population initialiser and mutation operator which directly targets elements of a network with the aim to increase network smoothness (in terms of progression from one diameter to the next) using network element awareness and an elementary heuristic. The pipe smoothing heuristic used in this algorithm is based upon a fundamental principle employed by water system engineers when designing water distribution pipe networks where the diameter of any pipe is never greater than the sum of the diameters of the pipes directly upstream resulting in the transition from large to small diameters from source to the extremities of the network. MOPSGA is assessed on a number of water distribution network benchmarks from the literature including some real-world based, large scale systems. The performance of MOPSGA is directly compared to that of NSGA-II with regard to solution quality, engineering feasibility (network smoothness) and computational efficiency. MOPSGA is shown to promote both engineering and hydraulic feasibility whilst attaining good infrastructure costs compared to NSGA-II.

Consumption smoothing in Latin America: an empirical assessment of present value models

The study aims to assess the empirical adherence of the permanent income theory and the consumption smoothing view in Latin America. Two present value models are considered, one describing household behavior and the other open economy macroeconomics. Following the methodology developed in Campbell and Schiller (1987), Bivariate Vector Autoregressions are estimated for the saving ratio and the real growth rate of income concerning the household behavior model and for the current account and the change in national cash ‡ow regarding the open economy model. The countries in the sample are considered separately in the estimation process (individual system estimation) as well as jointly (joint system estimation). Ordinary Least Squares (OLS) and Seemingly Unrelated Regressions (SURE) estimates of the coe¢cients are generated. Wald Tests are then conducted to verify if the VAR coe¢cient estimates are in conformity with those predicted by the theory. While the empirical results are sensitive to the estimation method and discount factors used, there is only weak evidence in favor of the permanent income theory and consumption smoothing view in the group of countries analyzed.

A roughly smooth optimal consumption path: smoothing the rough annuity puzzle

A inconsistência entre a teoria e o comportamento empírico dos agentes no que tange ao mercado privado de pensões tem se mostrado um dos mais resistentes puzzles presentes na literatura econômica. Em modelos de otimização intertemporal de consumo e poupança sob incerteza em relação ao tempo de vida dos agentes, anuidades são ativos dominantes, anulando ou restringindo fortemente a demanda por ativos cujos retornos não estão relacionados à probabilidade de sobrevivência. Na prática, entretanto, consumidores são extremamente céticos em relação às anuidades. Em oposição ao seguro contra longevidade oferecido pelas anuidades, direitos sobre esses ativos - essencialmente ilíquidos - cessam no caso de morte do titular. Nesse sentido, choques não seguráveis de liquidez e a presença de bequest motives foram consideravelmente explorados como possíveis determinantes da baixa demanda verificada. Apesar dos esforços, o puzzle persiste. Este trabalho amplia a dominância teórica das anuidades sobre ativos não contingentes em mercados incompletos; total na ausência de bequest motives, e parcial, quando os agentes se preocupam com possíveis herdeiros. Em linha com a literatura, simulações numéricas atestam que uma parcela considerável do portfolio ótimo dos agentes seria constituída de anuidades mesmo diante de choques de liquidez, bequest motives, e preços não atuarialmente justos. Em relação a um aspecto relativamente negligenciado pela academia, mostramos que o tempo ótimo de conversão de poupança em anuidades está diretamente relacionado à curva salarial dos agentes. Finalmente, indicamos que, caso as preferências dos agentes sejam tais que o nível de consumo ótimo decaia com a idade, a demanda por anuidades torna-se bastante sensível ao sobrepreço (em relação àquele atuarialmente justo) praticado pela indústria, chegando a níveis bem mais compatíveis com a realidade empírica.