This publication analyzes the power allocation problem for a distributed wireless sensor network which is based on ultra-wide bandwidth communication technology. The network is used to classify target objects. In the ...
详细信息
ISBN:
(纸本)9781467300094;9781467352871
This publication analyzes the power allocation problem for a distributed wireless sensor network which is based on ultra-wide bandwidth communication technology. The network is used to classify target objects. In the considered scenarios, the absence, the presence, or the type of an object is observed by the sensors independently. Due to noisy communication channels, the interfered observations are fused into a reliable global decision in order to increase the overall classification probability. An approach based on information theory that aims at maximization of the mutual information is employed. It enables the analytical allocation of the given total power to the sensor nodes so as to optimize the overall classification probability. Furthermore, we demonstrate the feasibility of object classification by using the introduced power allocation method in ultra-wide bandwidth signaling and energy-efficient systems.
Recently many commercial and non-commercial Simulation Packages (SPs) have agreed to use the Functional Mockup Interface (FMI) as the medium of interoperability. FMI presents numerous opportunities to utilize highly s...
详细信息
ISBN:
(纸本)9781467300094
Recently many commercial and non-commercial Simulation Packages (SPs) have agreed to use the Functional Mockup Interface (FMI) as the medium of interoperability. FMI presents numerous opportunities to utilize highly specialized SPs for modeling, and simulating multidisciplinary applications with several components of various types. However there is one thing missing in the FMI;the master algorithm. The paper proposes to use, the High Level Architecture (HLA) compliant Run Time Infrastructure (RTI), as a master for the FMI compatible simulation components. The ultimate goal is to provide a completely generic and standalone master for the FMI, making FMI-based simulation components usable as plug and play components, on variety of distributed environments including grids and clouds. Towards this promising goal an initial methodology is outlined.
In a nominative proxy ring signature scheme, an original signer delegates his nominative signing power to some proxies forming a ring. The member of the ring can generate a nominative signature on behalf of the origin...
详细信息
ISBN:
(纸本)9780769536422
In a nominative proxy ring signature scheme, an original signer delegates his nominative signing power to some proxies forming a ring. The member of the ring can generate a nominative signature on behalf of the original signer and the ring. In a nominative proxy ring signature scheme, only the nominee can verify the ring signature and if necessary, only the nominee can prove its validity to the third party. In this paper, we present the first nominative proxy ring signature scheme and we prove its security
Deploying V2X services has become a challenging task. This is mainly due to the fact that such services have strict latency requirements. To meet these requirements, one potential solution is adopting mobile edge comp...
详细信息
ISBN:
(纸本)9781728197227
Deploying V2X services has become a challenging task. This is mainly due to the fact that such services have strict latency requirements. To meet these requirements, one potential solution is adopting mobile edge computing (MEC). However, this presents new challenges including how to find a cost efficient placement that meets other requirements such as latency. In this work, the problem of cost-optimal V2X service placement (CO-VSP) in a distributed cloud/edge environment is formulated. Additionally, a cost-focused delay-aware V2X service placement (DA-VSP) heuristic algorithm is proposed. Simulation results show that both CO-VSP model and DA-VSP algorithm guarantee the QoS requirements of all such services and illustrates the tradeoff between latency and deployment cost.
Although quite simple, existing protocols for the IoT suffer from the inflexibility of centralized infrastructures and require several configuration stages. The implementation of these protocols is often prohibitive o...
详细信息
ISBN:
(纸本)9781538692233
Although quite simple, existing protocols for the IoT suffer from the inflexibility of centralized infrastructures and require several configuration stages. The implementation of these protocols is often prohibitive on resource-constrained devices. In this work, we propose a distributed lightweight implementation of network discovery for simple IoT devices. Our approach is based on the exchange of symbolic executable code among nodes. Based on this abstraction, we propose an algorithm that makes even IoT resource-constrained nodes able to construct the network topology graph incrementally and without any a priori information about device positioning and presence. The minimal set of executable symbols to be defined on the devices is identified and simulation results for different topologies are reported.
In recent years scientific computing has evolved into a massive usage of cloud computing, due to its flexibility in managing computing resources. In this paper, we focus on genomic data processing, which is rapidly ga...
详细信息
ISBN:
(纸本)9781479927302
In recent years scientific computing has evolved into a massive usage of cloud computing, due to its flexibility in managing computing resources. In this paper, we focus on genomic data processing, which is rapidly gaining momentum in research and medical activities. The main characteristics of these data sets is that not only the number of available genome files is becoming extremely large, but also each individual data set is significantly large, in the order of tens of GB. Hence, a wide diffusion of cloud-based genomic data processing will have a significant impact on network resources, since each processing request will require the transfer of tens of GBs into computing nodes. To face this issue, in this paper we propose a resource discovery framework which provides decision agents with the needed information for selecting the most suitable computing nodes. We have implemented this resource discovery function in a distributed fashion, and extensively tested it in a lab testbed consisting of about 70 nodes. We found that the overhead of the proposed solution is negligible in comparison with the amount of transferred data.
As location information becomes commonly available in smart phones, applications of Location Based Service (LBS) has also become very popular and are widely used by smart phone users. Since the query of LBS contains u...
详细信息
ISBN:
(纸本)9781479923588
As location information becomes commonly available in smart phones, applications of Location Based Service (LBS) has also become very popular and are widely used by smart phone users. Since the query of LBS contains user's location, it raises a privacy concern of exposure of user's location. K-anonymity is a commonly adopted technique for location privacy protection. In the literature, a centralized architecture which consists of a trusted anonymity server is widely adopted. However, this approach exhibits several apparent weaknesses, such as single point of failure, performance bottleneck, serious security threats, and not trustable to users, etc. In this paper, we re-examine the location privacy protection problem in LBS applications. We first provide an overview of the problem itself, to include types of query, privacy protection methods, adversary models, system architectures, and their related works in the literature. We then discuss the challenges of adopting a distributed architecture which does not need to set up a trusted anonymity server and propose a solution by combining unique features of structured peer-to-peer architecture and trust relationships among users of their on-line social networking relations.
A simple decentralized power control algorithm for communication systems with mobile users and unknown nonlinear and time-varying link gains is proposed and studied. We prove that the proposed algorithm is exponential...
详细信息
ISBN:
(纸本)9780769528892
A simple decentralized power control algorithm for communication systems with mobile users and unknown nonlinear and time-varying link gains is proposed and studied. We prove that the proposed algorithm is exponentially converging. Furthermore, we show that the algorithm significantly outperforms the well-known Foschini and Miljanic algorithm in the case of quickly moving mobile users.
In order to accommodate the exponentially-growing data traffic, LTE operators are considering the extension of the LTE operation into the unlicensed bands. In a recent technical report for the third Generation Partner...
详细信息
ISBN:
(纸本)9781467377010
In order to accommodate the exponentially-growing data traffic, LTE operators are considering the extension of the LTE operation into the unlicensed bands. In a recent technical report for the third Generation Partnership Project, Licensed-Assisted Access (LAA) to the unlicensed spectrum has been introduced. The report and other works in the literature reveal coexistence challenges that are raised when the LTE system coexists with other technologies such as WiFi, with fairness being the primary challenge. In this work, we propose a preliminary design for a semi-distributed LTE-Unlicensed scheme where the LTE Base Station uses WiFi-like carrier sense, back-off, and Quality of Service facility techniques. We also present a study on LAA-WiFi-coexistence through ns3 simulations. We conclude from our simulations that our preliminary design can achieve fairness in a limited set of scenarios, and we highlight the requirements and challenges that need to be considered in future work for designing a fair scheme for a wider set of scenarios.
In this paper, we study the problem of path computation in multi-layer multi-switching networks. Compared to the standard shortest path problem, path computation in this context needs to take into account the heteroge...
详细信息
ISBN:
(纸本)9798350371000;9798350370997
In this paper, we study the problem of path computation in multi-layer multi-switching networks. Compared to the standard shortest path problem, path computation in this context needs to take into account the heterogeneous switching capabilities of nodes. We develop a routing algorithm by adapting the Floyd-Warshall algorithm to take into account the switching technology conversion. Our algorithm solves the all-pair min-cost continuous path problem by building routing tables for each node to allows hop-to-hop routing. We then extend our efforts by developing a distributed routing algorithm to construct the routing tables based on local information and interactions with direct neighbors. We complete our algorithmic analysis with extensive simulations to demonstrate the effectiveness of the developed routing algorithms.
暂无评论