A mobile ad hoc network (MANET) is a wireless communication network, which does not rely on any centralized management or a pre-existing infrastructure. Various certificate authorities (CAs) distributed over the netwo...
详细信息
ISBN:
(纸本)9780769550053
A mobile ad hoc network (MANET) is a wireless communication network, which does not rely on any centralized management or a pre-existing infrastructure. Various certificate authorities (CAs) distributed over the network, each with a periodically updated share of the secrete key, is usually adopted. Thus many efforts have been made to adapt Certificate Authority's (CA) tasks to the dynamic environments of MANETs and distribute the tasks of CA among MANET nodes. Elliptic Curve Cryptography (ECC) is a cryptographic technique prominent suited for small devices, like those used in wireless communications and is gaining momentum. The main advantage of ECC versus RSA is that for the same level of security it requires a much shorter key length. The purpose of this work is to design and implement a fully certificate authority based on polynomial over elliptic curve, based on trust graphs and threshold cryptography, which though has better cryptography in nature. The security is based on the elliptic curve discrete logarithm problem which aimed to increase the authentication and the security in MANETs.
In this paper, multi-stream transmission in interference networks aided by multiple amplify-and-forward (AF) relays in the presence of direct links is studied. The objective is to minimize the sum power of transmitter...
详细信息
ISBN:
(纸本)9781538692233
In this paper, multi-stream transmission in interference networks aided by multiple amplify-and-forward (AF) relays in the presence of direct links is studied. The objective is to minimize the sum power of transmitters and relays by distributed transmit beamforming optimization under the stream signal-to-interference-plus-noise-ratio (SINR) target constraints. We utilize alternating direction method of multipliers (ADMM) algorithm for distributed implementation. The optimization problem is a well-known non-convex NP-hard quadratically constrained quadratic program (QCQP), which, after semi-definite relaxation (SDR), can be optimally solved via ADMM. The convergence rate, computational complexity, and message exchange load of the proposed algorithm are shown to outperform the existing distributed algorithm.
the issue of energy efficiency is an important concern at this time. This involves looking for hardware technologies for automating controls, measurement and adjustment in the energy system, and software technologies ...
详细信息
ISBN:
(纸本)9781479925995
the issue of energy efficiency is an important concern at this time. This involves looking for hardware technologies for automating controls, measurement and adjustment in the energy system, and software technologies for processing information obtained through hardware technologies. This work follows the possibility of using Cloud computing and Grid computing for calculations of finesse in energy efficiency. The paper explores some of the basics of cloud computing with aim of introducing cloud computing in distributed system.
Susanne Boll recounts her experience as a telepresence robot attending this year’s ACM conference on Human Factors in computing Systems (CHI), illustrating the fusion of the state of the art in robotics, long-distanc...
详细信息
Susanne Boll recounts her experience as a telepresence robot attending this year’s ACM conference on Human Factors in computing Systems (CHI), illustrating the fusion of the state of the art in robotics, long-distance interaction, and shared remote-audio-visual experiences. As a researcher in human computer interaction, yet with an international team facing restricted travel owing to the newly imposed US travel ban, she opted for remote participation at CHI 2017. Furthermore, as a member of the multimedia community, she wanted to explore first-hand how multimedia is at work in the field of telepresence.
A signal detection technique using successive interference cancellation (SIC) for uplink cooperative cellular systems is proposed in this paper, to suppress the interference caused by the cooperative transmission of t...
详细信息
ISBN:
(纸本)9781424462520
A signal detection technique using successive interference cancellation (SIC) for uplink cooperative cellular systems is proposed in this paper, to suppress the interference caused by the cooperative transmission of two mobile users transmitting both their own information and the cooperative partner's information using distributed space-time coding (DSTC). Simulation results show that the proposed scheme outperforms the existing joint DSTC and equalization scheme in terms of system performance with time division multiple access.
Synchronization of large-scale networks is an important and fundamental computing primitive in parallel and distributed systems. The synchronization in cellular automata has been known as firing squad synchronization ...
详细信息
ISBN:
(纸本)9780769546513
Synchronization of large-scale networks is an important and fundamental computing primitive in parallel and distributed systems. The synchronization in cellular automata has been known as firing squad synchronization problem (FSSP) since its development. The FSSP has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms have been proposed so far. In the present paper, we give a survey on recent developments in FSSP algorithms for two-dimensional rectangle cellular automata. Several state-efficient new implementations of synchronization algorithms are also given.
Experimentation using testbeds has become increasingly important in the area of Community networking research. An example is Community-Lab, a distributed testbed to support experimentally-driven research deployed in m...
详细信息
ISBN:
(纸本)9781479950416
Experimentation using testbeds has become increasingly important in the area of Community networking research. An example is Community-Lab, a distributed testbed to support experimentally-driven research deployed in multiple real Community Networks across Europe. Diversity in the characteristics of Community Networks and the need to use multiple or distributed testbeds, also including laboratory or campus-wide testbeds has led to consider the opportunity and challenges of federation, so that interoperability is achieved and multiple testbeds can offer and combine their capabilities. As a result, research in community networking can benefit from experiments performed in diverse experimental testbeds, consecutively or concurrently, using a common architecture and standard APIs. This paper describes the testbed federation scenario to identify its main challenges and it presents the implementation of an federation service for the Community-Lab testbed that aims to enable the federation with other testbeds through the SFA standard. The service has been validated and it has reached operational status.
Many studies have identified the numerous advantages of heterogeneous network architectures in enhancing resource efficiency and user experience. However, there are still open questions related to the decision-making ...
详细信息
ISBN:
(纸本)9781665428545
Many studies have identified the numerous advantages of heterogeneous network architectures in enhancing resource efficiency and user experience. However, there are still open questions related to the decision-making process. In this paper, we present DURATS: distributed User-centric Radio Access Technology Selection framework formulated as a Multiple Criteria Decision Making (MCDM) problem in the decision-making step. Realistic evaluation scenarios were conducted with a full-stack network simulator to prove the efficiency of this proposal. Our findings show the benefits of DURATS, under low and high-density network configurations, in enhancing network performance perceived by end-users while considering Quality of Service (QoS) constraints.
Suffix arrays and trees are important and fundamental string data structures which lie at the foundation of many string algorithms, with important applications in computational biology, text processing, and informatio...
详细信息
ISBN:
(数字)9781450362290
ISBN:
(纸本)9781450362290
Suffix arrays and trees are important and fundamental string data structures which lie at the foundation of many string algorithms, with important applications in computational biology, text processing, and information retrieval. Recent work enables the efficient parallel construction of suffix arrays and trees requiring at most O(n/p) memory per process in distributed memory. However, querying these indexes in distributed memory has not been studied extensively. Querying common string indexes such as suffix arrays, enhanced suffix arrays, and FM-Index, all require random accesses into O(n) memory - which in distributed memory settings becomes prohibitively expensive. In this paper, we introduce a novel distributed string index, the distributed Enhanced Suffix Array (DESA). We present efficient algorithms for the construction and querying of this distributed data structure, all while requiring only O(n/p) memory per process. We further provide a scalable parallel implementation and demonstrate its performance and scalability.
In recent years, systems researchers have devoted considerable effort to the study of large-scale graph processing. Existing distributed graph processing systems such as Pregel, based solely on distributed memory for ...
详细信息
ISBN:
(纸本)9781450337236
In recent years, systems researchers have devoted considerable effort to the study of large-scale graph processing. Existing distributed graph processing systems such as Pregel, based solely on distributed memory for their computations, fail to provide seamless scalability when the graph data and their intermediate computational results no longer fit into the memory;and most distributed approaches for iterative graph computations do not consider utilizing secondary storage a viable solution. This paper presents GraphMap, a distributed iterative graph computation framework that maximizes access locality and speeds up distributed iterative graph computations by effectively utilizing secondary storage. GraphMap has three salient features: (1) It distinguishes data states that are mutable during iterative computations from those that are read-only in all iterations to maximize sequential access and minimize random access. (2) It entails a two-level graph partitioning algorithm that enables balanced workloads and locality-optimized data placement. (3) It contains a proposed suite of locality-based optimizations that improve computational efficiency. Extensive experiments on several real-world graphs show that GraphMap outperforms existing distributed memory-based systems for various iterative graph algorithms.
暂无评论