Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems最新文献_第3页

Delay Analysis for Wireless Fading Channels with Finite Blocklength Channel Coding 有限块长信道编码无线衰落信道的时延分析

Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2015-11-02 DOI: 10.1145/2811587.2811596

Sebastian Schiessl, J. Gross, H. Al-Zubaidy

{"title":"Delay Analysis for Wireless Fading Channels with Finite Blocklength Channel Coding","authors":"Sebastian Schiessl, J. Gross, H. Al-Zubaidy","doi":"10.1145/2811587.2811596","DOIUrl":"https://doi.org/10.1145/2811587.2811596","url":null,"abstract":"Upcoming low-latency machine-to-machine (M2M) applications are currently attracting a significant amount of interest from the wireless networking research community. The design challenge with respect to such future applications is to allow wireless networks to operate extremely reliably at very short deadlines for rather small packets. To date, it is unclear how to design wireless networks efficiently for such novel requirements. One reason is that existing performance models for wireless networks often assume that the rate of the channel code is equal to the Shannon capacity. However, this model does not hold anymore when the packet size and thus blocklength of the channel code is small. Although it is known that finite blocklength has a major impact on the physical layer performance, we lack higher-layer performance models which account in particular for the queueing effects under the finite blocklength regime. A recently developed methodology provides probabilistic higher-layer delay bounds for fading channels when assuming transmission at the Shannon capacity limit. Based on this novel approach, we develop service process characterizations for fading channels with finite blocklength channel coding, leading to novel probabilistic delay bounds that can give a fundamental insight into the capabilities and limitations of wireless networks when facing low-latency M2M applications. In particular, we show that the Shannon capacity model significantly overestimates the delay performance for such applications, which would lead to insufficient resource allocations. Finally, based on our (validated) analytical model, we study various important parameter trade-offs highlighting the sensitivity of the delay distribution under the finite blocklength regime.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129950139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 93

Energy-Efficient Model for Overlay Cognitive Communications 重叠认知通信的节能模型

Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2015-11-02 DOI: 10.1145/2811587.2811629

Salvador Perez-Salgado, E. Rodríguez-Colina

{"title":"Energy-Efficient Model for Overlay Cognitive Communications","authors":"Salvador Perez-Salgado, E. Rodríguez-Colina","doi":"10.1145/2811587.2811629","DOIUrl":"https://doi.org/10.1145/2811587.2811629","url":null,"abstract":"Current approaches regarding energy-efficient cognitive radio networks found in the literature aim to optimize the functionalities met by cognitive systems. This is done in order to improve the number of transmitted bits per energy unit and to increase the network lifetime of cognitive devices when they have limited power resources. However, many of these approaches may not fit together when designing a full cognitive radio system. For this reason, a five-layer network model for energy-efficient overlay-based cognitive radio is proposed in this paper. This model includes a set of functionalities necessary to achieve energy-efficiency. We show, by means of simulations, that these functionalities may reduce the number of secondary transmissions by improving the exploitation of primary channels. We also found that, under certain scenarios, the number of transmissions necessary to achieve successful communications can be reduced to the half when the primary network is loaded at 60% of its maximum capacity, when transmissions with low Eb/N0 are combined with adaptive bandwidth channels.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126279418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

COExiST: Revisiting Transmission Count for Cognitive Radio Networks 共存:重新审视认知无线网络的传输计数

Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2015-11-02 DOI: 10.1145/2811587.2811605

Guillaume Artero Gallardo, Jean-Gabriel Krieg, G. Jakllari, Lucile Canourgues, A. Beylot

{"title":"COExiST: Revisiting Transmission Count for Cognitive Radio Networks","authors":"Guillaume Artero Gallardo, Jean-Gabriel Krieg, G. Jakllari, Lucile Canourgues, A. Beylot","doi":"10.1145/2811587.2811605","DOIUrl":"https://doi.org/10.1145/2811587.2811605","url":null,"abstract":"Transmission count, the number of transmissions required for delivering a data packet over a link, is part of almost all state-of-the-art routing metrics for wireless networks. In traditional networks, peer-to-peer interference and channel errors are what define its value for the most part. In cognitive radio networks, however, there is a third culprit that can impact the transmission count: primary user interference. It may be tempting to think of primary user interference as no different than interference caused by other peers. However, unlike peers, primary users do not follow the same protocol and have strict channel access priority over the secondary users. Motivated by this observation, we carry out an empirical study on a USRP testbed for analyzing the impact of primary users. Our measurements show that a primary user has a distinct impact on the transmission count, which the de facto standard approach, ETX, designed for traditional networks, fails to capture. To resolve this, we present COExiST (for COgnitive radio EXpected transmISsion counT): a link metric that accurately captures the expected transmission count over a wireless link subject to primary user interference. Extensive experiments on a five-node USRP testbed demonstrate that COExiST accurately captures the actual transmission count in the presence of primary users -- the 80th percentile of the error is less than 20%.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134129019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Communication and Block Game in Cognitive Radio Networks 认知无线电网络中的通信与方块游戏

Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2015-11-02 DOI: 10.1145/2811587.2811599

Haosen Pu, Zhaoquan Gu, Qiang-Sheng Hua, Hai Jin

{"title":"Communication and Block Game in Cognitive Radio Networks","authors":"Haosen Pu, Zhaoquan Gu, Qiang-Sheng Hua, Hai Jin","doi":"10.1145/2811587.2811599","DOIUrl":"https://doi.org/10.1145/2811587.2811599","url":null,"abstract":"In this paper, we initiate the Communication and Block Game between two unlicensed users and an adversary in Cognitive Radio Networks (CRNs). In each time slot, the two unlicensed users can successfully communicate on the common available channel if it is not blocked by the adversary. In the communication and block game, the two un-licensed users aim to maximize their communication load, denoted as the number of time slots of their successful communications, while the adversary aims to minimize it. We propose efficient algorithms for both users and the adversary and we prove the proposed algorithms will lead a Nash Equilibrium, i.e. the users can achieve the maximum communication load against any adversary's blocking strategy, while the adversary can minimize the users' communication load against any users' channel accessing strategy. We also present efficient algorithms for both users and adversary for the multiple channels scenario where the users and the adversary are equipped with multiple radios. These algorithms also guarantee high communication load for the users, while the adversary can also block a considerable number of users'communications. Our simulations validate the theoretical analyses.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128332236","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Modeling and Analysis of Opportunistic Routing in Low Duty-Cycle Underwater Sensor Networks 低占空比水下传感器网络中的机会路由建模与分析

Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2015-11-02 DOI: 10.1145/2811587.2811608

Rodolfo W. L. Coutinho, A. Boukerche, L. Vieira, A. Loureiro

{"title":"Modeling and Analysis of Opportunistic Routing in Low Duty-Cycle Underwater Sensor Networks","authors":"Rodolfo W. L. Coutinho, A. Boukerche, L. Vieira, A. Loureiro","doi":"10.1145/2811587.2811608","DOIUrl":"https://doi.org/10.1145/2811587.2811608","url":null,"abstract":"The problem of reliable data delivery at low energy cost arises as one of the most challenging research topics in underwater wireless sensor networks (UWSNs). Reliable data delivery is demanding because of the acoustic channel impairments and channel fading. Moreover, it is energy hungry given the high cost of acoustic communication. In wireless ad hoc & sensor networks, separately, opportunistic routing has been employed to improve data delivery whereas duty cycled operation mode has been adopted to achieve energy efficiency and prolonging network lifetime. In this paper, we investigate the benefits and drawbacks of collision between opportunistic routing paradigm and duty cycle techniques in UWSNs. We propose an analytical model to study and evaluate the performance of opportunistic routing protocols under duty cycled settings designed from three mainly paradigms: simple asynchronous, strobed preamble and receiver initiated; and different network densities and traffic loads. The results show that while duty cycle reduces the energy consumption, it affects negatively in the opportunistic routing performance, increasing the delay and the expected number of transmissions to deliver a packet. The simple duty cycled approach is shown to be suitable for applications that require long-lived network and can tolerate some degree of packet losses. Our results indicate that strobed preamble-based duty cycle is the most effective approach to be integrated with opportunistic routing, when high fidelity monitoring is required, even having not the best performance in terms of energy savings.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128371323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 31

On the Design and Evaluation of Producer Mobility Management Schemes in Named Data Networks 命名数据网络中生产者流动管理方案的设计与评价

Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2015-11-02 DOI: 10.1145/2811587.2811616

Hisham Farahat, H. Hassanein

{"title":"On the Design and Evaluation of Producer Mobility Management Schemes in Named Data Networks","authors":"Hisham Farahat, H. Hassanein","doi":"10.1145/2811587.2811616","DOIUrl":"https://doi.org/10.1145/2811587.2811616","url":null,"abstract":"Information-centric Networks (ICNs) offer a promising paradigm for the future Internet to cope with an ever increasing growth in data and shifts in access models. Different architectures of ICNs, including Named Data Networks (NDNs) are designed around content distribution, where data is the core entity in the network instead of hosts. One of the main challenges in NDNs is handling mobile content providers and maintaining seamless operation. Accordingly, attempts at handling mobility in NDNs have been proposed in the literature are mostly studied under simplistic and/or special cases. There is a lack of benchmarking tools to analyze and compare such schemes. This paper introduces a comprehensive assessment framework for mobility management schemes in NDNs, under varying topologies, heterogeneous producers and consumers, and different mobility models. We develop a generic and modular simulation environment in ns-3 that is made available for NDN researchers to evaluate their mobility management proposals. We implement and compare the performance of three mainstream Producer mobility management schemes, namely, the Mobility Anchor, Location Resolution and Hybrid approaches in NDNs. We demonstrate how mobility impacts NDN operation, specifically in terms of latency and delivery ratio. We also argue for the superior operation of the hybrid approach to handling mobility in NDNs, yet highlight its high control overhead.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125980231","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

Protecting Location Information in Collaborative Sensing of Cognitive Radio Networks 认知无线网络协同感知中的位置信息保护

Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2015-11-02 DOI: 10.1145/2811587.2811594

Yunlong Mao, Tingting Chen, Yuan Zhang, Tiancong Wang, Sheng Zhong

引用次数: 7

RFT: Identifying Suitable Neighbors for Concurrent Transmissions in Point-to-Point Communications 点对点通信中并发传输的合适邻居识别

Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2015-11-02 DOI: 10.1145/2811587.2811595

Jin Zhang, A. Reinhardt, Wen Hu, S. Kanhere

{"title":"RFT: Identifying Suitable Neighbors for Concurrent Transmissions in Point-to-Point Communications","authors":"Jin Zhang, A. Reinhardt, Wen Hu, S. Kanhere","doi":"10.1145/2811587.2811595","DOIUrl":"https://doi.org/10.1145/2811587.2811595","url":null,"abstract":"Point-to-point traffic has emerged as a widely used communications paradigm for cyber-physical systems and wireless sensor networks in industrial settings. However, existing point-to-point communication protocols often entail substantial overhead to find and maintain reliable routes. In recent research, protocols that rely on the phenomenon of constructive interference have thus emerged. They allow to quickly, efficiently, and reliably flood packets to the entire network. As all nodes in the network need to (re-)broadcast all packets in such protocols by design, substantial energy is consumed by nodes that do not even contribute to the actual point-to-point transmission. We propose a novel point-to-point communication protocol, called RFT, which attempts to discover the most reliable route between a source and a destination. To achieve this objective, RFT selects the minimum number of participating nodes required to ensure reliable communications while allowing all other devices in the network to sleep. During data transmissions, the nodes on the direct route as well as all helper nodes broadcast the data packets and exploit the benefits of constructive interference in order to reduce end-to-end latency. Nodes which are neither part of the direct route nor helpers go to sleep mode, which helps to reduce network energy consumption significantly. Our extensive evaluation in a real sensor network testbed shows that RFT can reduce network energy consumption by up to 82.5% compared to a state-of-the-art approach whilst achieving a similar end-to-end transmission reliability.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121743712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 16

A Resilient Dynamic Gateway Selection Algorithm Based on Quality Aware Metrics for Smart Grids 基于质量感知度量的智能电网弹性动态网关选择算法

Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2015-11-02 DOI: 10.1145/2811587.2811613

Vitor Hugo Okabayashi, Igor G. Ribeiro, D. Passos, C. Albuquerque

{"title":"A Resilient Dynamic Gateway Selection Algorithm Based on Quality Aware Metrics for Smart Grids","authors":"Vitor Hugo Okabayashi, Igor G. Ribeiro, D. Passos, C. Albuquerque","doi":"10.1145/2811587.2811613","DOIUrl":"https://doi.org/10.1145/2811587.2811613","url":null,"abstract":"Smart Grid represents the evolution of the current electrical power system. It is designed to meet the challenge of increasing demands for energy by fully integrating the electrical power grid with data communication networks. One of the main challenges faced by this kind of network is to fulfill reliability and resilience requirements in order to meet various types of services and applications. Wireless mesh networks can provide scalability and resilience to this communication network, but there are issues that need to be addressed before it can be used in practical smart grids. One of these issues relates to the robustness of the network when it faces gateway failures. In this situation, communication to smart meters may be unavailable for a considerable amount of time, which is prohibitive for many types of applications. In this sense, we present DDSA, an algorithm for dynamic selection of gateways in a multihoming smart grid network. The algorithm uses a probabilistic approach for choosing gateways, prioritizing those with the most reliable paths. Results indicate that DDSA increases network robustness and resilience in the presence of gateway failures compared to existing algorithms for dynamic gateway selection.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121887253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Filling the Gaps of Vehicular Mobility Traces 填补车辆移动轨迹的空白

Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2015-11-02 DOI: 10.1145/2811587.2811612

Fabrício A. Silva, C. Celes, A. Boukerche, L. B. Ruiz, A. Loureiro

{"title":"Filling the Gaps of Vehicular Mobility Traces","authors":"Fabrício A. Silva, C. Celes, A. Boukerche, L. B. Ruiz, A. Loureiro","doi":"10.1145/2811587.2811612","DOIUrl":"https://doi.org/10.1145/2811587.2811612","url":null,"abstract":"Simulation is the approach most adopted to evaluate Vehicular Ad hoc Network (VANET) and Delay-Tolerant Network (DTN) solutions. Furthermore, the results' reliability depends fundamentally on mobility models used to represent the real network topology with high fidelity. Usually, simulation tools use mobility traces to build the corresponding network topology based on existing contacts established between mobile nodes. However, the traces' quality, in terms of spatial and temporal granularity, is a key factor that affects directly the network topology and, consequently, the evaluation results. In this work, we show that highly adopted existing real vehicular mobility traces present gaps, and propose a solution to fill those gaps, leading to more fine-grained traces. We propose and evaluate a cluster-based solution using clustering algorithms to fill the gaps. We apply our solution to calibrate three existing, widely adopted taxi traces. The results reveal that indeed the gaps lead to network topologies that differ from reality, affecting directly the performance of the evaluation results. To contribute to the research community, the calibrated traces are publicly available to other researchers that can adopt them to improve their evaluation results.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128074867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 38