Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems最新文献_第4页

An Advanced Mobility-Aware Algorithm for Joint Beamforming and Clustering in Heterogeneous Cloud Radio Access Network 异构云无线接入网中联合波束形成和聚类的一种先进移动感知算法

Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2018-10-25 DOI: 10.1145/3242102.3242120

D. Ha, L. Boukhatem, Megumi Kaneko, Steven Martin

{"title":"An Advanced Mobility-Aware Algorithm for Joint Beamforming and Clustering in Heterogeneous Cloud Radio Access Network","authors":"D. Ha, L. Boukhatem, Megumi Kaneko, Steven Martin","doi":"10.1145/3242102.3242120","DOIUrl":"https://doi.org/10.1145/3242102.3242120","url":null,"abstract":"Heterogeneous Cloud Radio Access Networks (H-CRANs) are a promising cost-effective architecture for 5G system which incorporates the cloud computing into Heterogeneous Networks (HetNets). We consider in this work the joint beamforming and clustering (user-to-Remote Radio Head (RRH) association) issue for downlink H-CRAN to solve the sum-rate maximization problem under fronthaul link capacity and per-RRH power constraints. The main objective is to address the beamforming and user association process over time by taking into account the user mobility as a key factor to tune the solution's parameters. More precisely, based on the mobility profile of users (mainly velocity), we propose an advanced Mobility-Aware Beamforming and User Clustering (MABUC) algorithm which selects the best Channel State Information (CSI) feedback strategy and periodicity to achieve the targeted sum-rate performance while ensuring the minimum possible cost (complexity and CSI signaling). MABUC inherits the behavior of our previously proposed Hybrid algorithm which periodically activates dynamic and static clustering strategies to manage the allocation process over time. MABUC algorithm, however, takes into account the user mobility by using a CSI estimation model which can improve the algorithm performance compared to reference schemes. Our proposed algorithm has the benefit to meet the targeted sum-rate performance while being aware and adaptive to practical system constraints such as mobility, complexity and signaling costs.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117105837","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}

引用次数: 9

Where to Rendezvous?: Preferring Quiet Channels in Cognitive Radio Networks 在哪里会合?认知无线电网络中更喜欢安静频道

Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2018-10-25 DOI: 10.1145/3242102.3242103

Tong Shen, Zhaoquan Gu, Yuexuan Wang, Sivan Toledo, Senran Zhang, Mingli Song

{"title":"Where to Rendezvous?: Preferring Quiet Channels in Cognitive Radio Networks","authors":"Tong Shen, Zhaoquan Gu, Yuexuan Wang, Sivan Toledo, Senran Zhang, Mingli Song","doi":"10.1145/3242102.3242103","DOIUrl":"https://doi.org/10.1145/3242102.3242103","url":null,"abstract":"Rendezvous is a fundamental building block in distributed cognitive radio networks (CRNs), where users must find a jointly available channel. Research on the rendezvous problem has focused so far on minimizing the time to rendezvous (to find a suitable channel) or on maximizing the degree (number of channels on which rendezvous can take place). In this paper, we model the rendezvous problem in a more realistic way that acknowledges the fact available channels may suffer from interference, and interference may vary among users in different locations over time. In this setting, CRNs benefit from rendezvous methods that find a quiet channel, which supports high symbol rates and does not suffer much from dropped packets. We propose algorithms that achieve this goal for both initial rendezvous problem (users share no prior information) and continuous rendezvous problem (users who have already established a link must vacate the channel and seek another). We propose both deterministic and randomized methods based on mapping the channel set to a larger set in a way that gives preference to quiet channels. This technique allows us to add interference-awareness to existing rendezvous algorithms. We analyze the new algorithms and substantiate our analyses through extensive simulations.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121605603","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

MOCHA 摩卡

Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2018-10-25 DOI: 10.1145/3242102.3242124

Fabricio De Souza, Augusto C. S. A. Domingues, Pedro O. S. Vaz de Melo, A. A. F. Loureiro

{"title":"MOCHA","authors":"Fabricio De Souza, Augusto C. S. A. Domingues, Pedro O. S. Vaz de Melo, A. A. F. Loureiro","doi":"10.1145/3242102.3242124","DOIUrl":"https://doi.org/10.1145/3242102.3242124","url":null,"abstract":"There are many mobility models in the literature with diverse formats and origins. Besides the existence of studies that analyze and characterize these models, there is a need for a framework that can compare them in an easy way. MOCHA (Mobility framework for CHaracteristics Analysis) is a tool that characterizes and makes possible the comparison of mobility models without any hard work. We implemented 9 social, spatial and temporal characteristics, which were extracted from various (real and synthetic) distinct mobility traces. MOCHA has a classifying module that attributes each characteristic the statistic distribution that better describes it. As a validation process, all the traces were compared using the T-SNE method for data visualization, resulting in the approximation of similar traces. One of the advantages of using MOCHA is its ease of use, being able to read diverse traces formats and converting them to its standard format, allowing that different types of traces, such as check-in, GPS, contacts, and so on, to be compared. The metrics used in the tool can become a standard for trace analysis and comparison in the literature, allowing a better vision of where one trace belongs related to others. MOCHA is available for download at https://github.com/wisemap-ufmg/MOCHA.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127061073","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}

引用次数: 11

Effects of Routing on the Capacity of Multi-Hop Wireless Networks 路由对多跳无线网络容量的影响

Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2018-10-25 DOI: 10.1145/3242102.3242111

William Jones, R. Eddie Wilson

{"title":"Effects of Routing on the Capacity of Multi-Hop Wireless Networks","authors":"William Jones, R. Eddie Wilson","doi":"10.1145/3242102.3242111","DOIUrl":"https://doi.org/10.1145/3242102.3242111","url":null,"abstract":"We consider multi-hop wireless mesh networks and examine whether capacity may be improved by distributing the data flows for each origin-destination (OD) pair across multiple routes. The network geometry and the application of technologies, such as beamforming or full-duplex, are described by a matrix that describes which pairs of transmissions (or 'links') are compatible in that they can occur simultaneously without collisions or other conflicts. Under a binary interference framework, the conflict matrix is used to derive the maximal sets of compatible links, and secondly, these are used to derive a system of linear inequalities that bounds links' data flows. These steps are computationally expensive, but we show how the system usually collapses when re-expressed in terms of flows on routes. The theory is illustrated in terms of a simple 'Braess' network example with a single OD pair. We then consider networks with two OD pairs whose data flows have some nodes in common and thus contend with each other. We show how to design networks that exploit multiple relay nodes and routes so as to increase capacity. We then examine the same problem on ensembles of random networks. We find that in many cases, capacity can be improved if the OD pairs distribute their traffic over several routes. We pose and solve a set of linear programs that model (i) cooperative behavior; (ii) the optimization of one OD pair when presented with a fixed route assignment by the other; and (iii) variants of these games when both OD pairs are in contention with background (single-hop) traffic.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115396814","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

FWB

Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2018-10-25 DOI: 10.1145/3242102.3242112

Rodrigo C. Tavares, Marcos Carvalho, M. Vieira, L. Vieira, B. Krishnamachari

引用次数: 10

On the Optimality of Opportunistic Routing Protocols for Underwater Sensor Networks 水下传感器网络机会路由协议的最优性研究

Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2018-10-25 DOI: 10.1145/3242102.3242116

M. Jafri, A. Marin, A. Torsello, Majid Ghaderi

{"title":"On the Optimality of Opportunistic Routing Protocols for Underwater Sensor Networks","authors":"M. Jafri, A. Marin, A. Torsello, Majid Ghaderi","doi":"10.1145/3242102.3242116","DOIUrl":"https://doi.org/10.1145/3242102.3242116","url":null,"abstract":"In the last decade, underwater wireless sensor networks (UWSNs) have attracted a lot of attention from the research community thanks to their wide range of applications that include seabed mining, military and environmental monitoring. With respect to terrestrial networks, UWSNs pose new research challenges such as the three-dimensional node deployment and the use of acoustic signals. Despite the large number of routing protocols that have been developed for UWSNs, there are very few analytical results that study their optimal configurations given the system's parameters (density of the nodes, frequency of transmission, etc.). In this paper, we make one of the first steps to cover this gap. We study an abstraction of an opportunistic routing protocol and derive its optimal working conditions based on the network characteristics. Specifically, we prove that using a depth threshold, i.e., the minimum length of one transmission hop to the surface, is crucial for the optimality of opportunistic protocols and we give a numerical method to compute it. Moreover, we show that there is a critical depth threshold above which no packet can be transmitted successfully to the surface sinks in large networks, which further highlights the importance of properly configuring the routing protocol. We discuss the implications of our results and validate them by means of stochastic simulations on NS3.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114569523","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}

引用次数: 12

Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems 第21届ACM无线和移动系统建模、分析和仿真国际会议论文集

Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2018-10-25 DOI: 10.1145/3242102

引用次数: 1

A Trustworthy Data Aggregation Model Based on Context and Data Density Correlation Degree 基于上下文和数据密度关联度的可信数据聚合模型

Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2018-10-25 DOI: 10.1145/3242102.3242127

Yunquan Gao, Xiaoyong Li, Jirui Li, Yali Gao

{"title":"A Trustworthy Data Aggregation Model Based on Context and Data Density Correlation Degree","authors":"Yunquan Gao, Xiaoyong Li, Jirui Li, Yali Gao","doi":"10.1145/3242102.3242127","DOIUrl":"https://doi.org/10.1145/3242102.3242127","url":null,"abstract":"Data aggregation is widely used in wireless sensor networks (WSNs) due to the resource constraints of computational capability, energy and bandwidth. Because WSNs are often deployed in an unattended hostile environment, WSNs are prone to various attacks. The traditional security technologies such as privacy protection and encryption technology can not address the attacks from the internal nodes of network. Therefore, the trust management mechanism for data aggregation has become a hot research topic, and an efficient trust management mechanism plays an important role in data aggregation. In this paper, we propose an efficient trust model based on context and data density correlation degree. Our proposed trust model consists of three major contexts, sensing trust, link trust, node trust. We take into full account data aggregating characteristic and different impacts of node trust, link trust and sensing trust on the secure of data aggregation. We also take into account data correlation degree in computing sensing trust, which leads to more accurate trust result. The experiment results show that compared to the existing trust models our proposed trust model provides more accurate sensing trust and improves the throughput and robustness against malicious attacks. Our proposed trust model is more suitable for data aggregation than conventional trust models.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125639417","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}

引用次数: 4

BRRA

Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2018-10-25 DOI: 10.1145/3242102.3242126

S. Saadatmand, S. Kanhere

{"title":"BRRA","authors":"S. Saadatmand, S. Kanhere","doi":"10.1145/3242102.3242126","DOIUrl":"https://doi.org/10.1145/3242102.3242126","url":null,"abstract":"Mobile Crowdsensing (MCS) applications take advantage of the ubiquity and sensing power of smartphones in data gathering. Designing an incentive mechanism for motivating the individuals to participate in such systems is vital. Reverse Auction (RA) is a popular framework in which the participants bid their expected returns for their contributions, and a task creator selects a subset of them with a view to maximise the cumulative contribution within a prescribed budget. In RA, the participants are not aware of their winning probability before the auction is closed. If the participants are given some statistical information about the returns associated with their bid, they may reduce their bid in order to increase their returns. In this paper, we propose Bid-Revisable Reverse Auction (BRRA), as well as an enhancement called BRRA with Virtual Contribution (BRRA-VC), wherein the participants are allowed to revise their bids during the auction, based on the feedback they receive about the winning probability of their submitted bids. Through conducting extensive experiments, we show that in comparison to RA, the BRRA schemes not only benefit the task creator by increasing the return on investment (i.e., the total contribution for the same budget) and also by decreasing the participant dropout ratio, but also profit the participants who are open to revise their bids by increasing their received rewards as well as their winning chances.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117281950","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}

引用次数: 5

CR-GRT: A Novel SDR Platform Optimized for Real-time Cognitive Radio Applications CR-GRT:一种针对实时认知无线电应用优化的新型SDR平台

Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems Pub Date : 2018-10-25 DOI: 10.1145/3242102.3242114

Jun Liu, Haoyang Wu, Zhiwei Li, Boyan Ding, Tao Wang

引用次数: 0