Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing最新文献

筛选
英文 中文
Performance and Energy Consumption Analysis of a Delay-Tolerant Network for Censorship-Resistant Communication 抗审查通信中容延迟网络的性能与能耗分析
Yue Liu, David R. Bild, David Adrian, Gulshan Singh, R. Dick, D. Wallach, Z. Morley Mao
{"title":"Performance and Energy Consumption Analysis of a Delay-Tolerant Network for Censorship-Resistant Communication","authors":"Yue Liu, David R. Bild, David Adrian, Gulshan Singh, R. Dick, D. Wallach, Z. Morley Mao","doi":"10.1145/2746285.2746320","DOIUrl":"https://doi.org/10.1145/2746285.2746320","url":null,"abstract":"Delay Tolerant Networks (DTNs) composed of commodity mobile devices have the potential to support communication applications resistant to blocking and censorship, as well as certain types of surveillance. We analyze the performance and energy consumption of such a network, and consider the impact of random and targeted denial-of-service and censorship attacks. To gather wireless connectivity traces for a DTN composed of human-carried commodity smartphones, we implemented and deployed a prototype DTN-based micro-blogging application, called 1am, in a college town. We analyzed the system during a time period with 111 users. Although the study provided detailed enough connectivity traces to enable analysis, message posting was too infrequent to draw strong conclusions based on user-initiated messages, alone. We therefore simulated more frequent message initiations and used measured connectivity traces to analyze message propagation. Using a flooding protocol, we found that with an adoption rate of 0.2% of a college town's student and faculty population, the median one-week delivery rate is 85% and the median delivery delay is 13 hours. We also found that the network delivery rate and delay are robust to denial-of service and censorship attacks eliminating more than half of the participants. Using a measurement-based energy model, we also found that the DTN system would use less than 10.0% of a typical smartphone's battery energy per day in a network of 2,500 users.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129792167","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}
引用次数: 19
Handoff Rate Analysis in Heterogeneous Wireless Networks with Poisson and Poisson Cluster Patterns 基于泊松和泊松簇模式的异构无线网络切换率分析
Wei Bao, B. Liang
{"title":"Handoff Rate Analysis in Heterogeneous Wireless Networks with Poisson and Poisson Cluster Patterns","authors":"Wei Bao, B. Liang","doi":"10.1145/2746285.2746317","DOIUrl":"https://doi.org/10.1145/2746285.2746317","url":null,"abstract":"In multi-tier heterogeneous wireless networks (HWNs), both horizontal and vertical handoffs impact the signaling overhead and quality of service in the system. However, they are difficult to analyze due to the diverse and irregularly shaped cells in HWNs. The causes of this irregularity are three-fold: (1) small-cell base stations (BSs) tend to be deployed with a high level of spatial randomness; (2) BSs are likely to aggregate around highly populated geographical regions; (3) various transmission power levels in different tiers further create diverse cell sizes and shapes. In this work we present a new stochastic geometric analysis framework on user mobility in HWNs. Each tier of BSs is modeled as either a Poisson point process (PPP) or a Poisson cluster process (PCP), to capture their spatial randomness and their non-uniform and dependent aggregation in space. Flexible user association is also taken into consideration, such that various scales of cell sizes are accommodated. We derive analytical expressions for the rates of all handoff types experienced by an active user with arbitrary movement trajectory. We also demonstrate an example application of the proposed analysis, in optimizing the multi-tier BS selection by users, to balance the tradeoff between data rate and handoff overhead. Finally, extensive simulation is conducted to validate the correctness and usefulness of our analysis.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132082698","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}
引用次数: 20
TRINITY: A Practical Transmitter Cooperation Framework to Handle Heterogeneous User Profiles in Wireless Networks 一种实用的传送器合作架构,以处理无线网路中的异质使用者档案
Shailendra Singh, K. Sundaresan, S. Krishnamurthy, Xinyu Zhang, M. Khojastepour, S. Rangarajan
{"title":"TRINITY: A Practical Transmitter Cooperation Framework to Handle Heterogeneous User Profiles in Wireless Networks","authors":"Shailendra Singh, K. Sundaresan, S. Krishnamurthy, Xinyu Zhang, M. Khojastepour, S. Rangarajan","doi":"10.1145/2746285.2746321","DOIUrl":"https://doi.org/10.1145/2746285.2746321","url":null,"abstract":"To handle increased capacity demands, sophisticated MIMO-based transmission strategies, based on transmitter cooperation, have emerged. However, different types of users' channels (e.g., static vs mobile, stable vs dynamic channels) that make up today's enterprises, require different MIMO transmission strategies. With the wrong strategy, a user could even see a degradation in performance. Our overarching goal is to design and implement a framework, TRINITY, that can simultaneously cater to a heterogeneous mix of users, by intelligently combining a plurality of MIMO transmission strategies wherein the transmitters at different nodes can cooperate to deliver significant performance gains. Three key challenges that we address in building TRINITY are: (i) how to categorize users into channel profiles such that a single transmission strategy caters to the users of a profile, (ii) how to combine strategies to communicate with users of different profiles simultaneously, and (iii) what is the granularity of transmitter cooperation needed to balance efficiency with complexity. We implement and evaluate TRINITY on our WARP radio testbed. Our extensive experiments show that TRINITY's intelligent combining of transmission strategies improves the total network rate by 50%-150%, satisfies the QoS requirements of thrice as many users, and improves PSNR for video traffic by 10 dB compared to individual transmission strategies.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133036092","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
Poster: Roadside Unit Caching Mechanism for Multi-Service Providers 海报:多服务提供者的路边单元缓存机制
Zhiwen Hu, Zijie Zheng, Tao Wang, Lingyang Song
{"title":"Poster: Roadside Unit Caching Mechanism for Multi-Service Providers","authors":"Zhiwen Hu, Zijie Zheng, Tao Wang, Lingyang Song","doi":"10.1145/2746285.2764867","DOIUrl":"https://doi.org/10.1145/2746285.2764867","url":null,"abstract":"Roadside units (RSUs) with caching abilities are becoming an important part for the future transportation system, enabling both Internet accesses and local caching services for vehicular users. In this paper, we address the caching problem which involves the coexistence of multiple service providers who intend to cache their own contents into the RSUs by competitions to improve the data disseminations. And we propose a mechanism based on multi-object auctions, which can achieve a sub-optimal outcome. Simulation results also show the effectiveness of our solution.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125230260","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
On the Capacity Requirement of Largest-Deficit-First for Scheduling Real-Time Traffic in Wireless Networks 无线网络实时流量调度中最大赤字优先的容量需求研究
Xiaohan Kang, I.-Hong Hou, Lei Ying
{"title":"On the Capacity Requirement of Largest-Deficit-First for Scheduling Real-Time Traffic in Wireless Networks","authors":"Xiaohan Kang, I.-Hong Hou, Lei Ying","doi":"10.1145/2746285.2746302","DOIUrl":"https://doi.org/10.1145/2746285.2746302","url":null,"abstract":"We consider ad hoc wireless networks with real-time traffic, and study the capacity requirement of a low-complexity scheduling policy, called largest-deficit-first (LDF), for achieving the same quality of service (QoS) as the optimal policy in networks with unit capacity. We derive theoretical upper and lower bounds for general traffic. The bounds depend on the interference degree of the network and the max/min delay bound ratio. The performance of LDF is further evaluated using simulations and compared with two other algorithms. The simulation results show that LDF significantly outperforms the other two algorithms.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129063842","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}
引用次数: 10
Loop-Free Backpressure Routing Using Link-Reversal Algorithms 利用链路逆转算法实现无环路背压路由选择
Anurag Rai, Chih-Ping Li, G. Paschos, E. Modiano
{"title":"Loop-Free Backpressure Routing Using Link-Reversal Algorithms","authors":"Anurag Rai, Chih-Ping Li, G. Paschos, E. Modiano","doi":"10.1145/2746285.2746304","DOIUrl":"https://doi.org/10.1145/2746285.2746304","url":null,"abstract":"The backpressure routing policy is known to be a throughput optimal policy that supports any feasible traffic demand in data networks, but may have poor delay performance when packets traverse loops in the network. In this paper, we study loop-free backpressure routing policies that forward packets along directed acyclic graphs (DAGs) to avoid the looping problem. These policies use link reversal algorithms to improve the DAGs in order to support any achievable traffic demand. For a network with a single commodity, we show that a DAG that supports a given traffic demand can be found after a finite number of iterations of the link-reversal process. We use this to develop a joint link-reversal and backpressure routing policy, called the loop free backpressure (LFBP) algorithm. This algorithm forwards packets on the DAG, while the DAG is dynamically updated based on the growth of the queue backlogs. We show by simulations that such a DAG-based policy improves the delay over the classical backpressure routing policy. We also propose a multicommodity version of the LFBP algorithm, and via simulation we show that its delay performance is better than that of backpressure.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127477610","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
Cross-Cell DoF Distribution: Combating Channel Hardening Effect in Multi-Cell MU-MIMO Networks 跨小区DoF分布:对抗多小区MU-MIMO网络中的信道硬化效应
Xiufeng Xie, Xinyu Zhang, Eugene Chai
{"title":"Cross-Cell DoF Distribution: Combating Channel Hardening Effect in Multi-Cell MU-MIMO Networks","authors":"Xiufeng Xie, Xinyu Zhang, Eugene Chai","doi":"10.1145/2746285.2746290","DOIUrl":"https://doi.org/10.1145/2746285.2746290","url":null,"abstract":"Equipped with the multi-user MIMO (MU-MIMO) technology, a WiFi access point (AP) with M antennas can achieve M degrees-of-freedom (DoF) in theory. Existing MU-MIMO protocols strive to maximize DoF usage by serving M users simultaneously. In this paper, through a MU-MIMO testbed measurement, we found that the correlation between users' channels can severely compromise network throughput under a DoF-maximizing strategy. To combat this problem, we propose Kardia that judiciously distributes the DoF to least-correlated users within an AP's cell, and coordinates neighboring APs such that each can serve the best set of users while nulling mutual interference. The key challenge in Kardia lies in efficiently determining which set of users to serve without knowing the channel state from all of them. We propose a lightweight mechanism that enables APs to collaboratively infer the correlation between users through precoded probing packets. Our analysis shows that Kardia's DoF distribution framework has a provable performance guarantee. Our testbed implementation further reveals that Kardia can significantly boost the performance of multi-cell MU-MIMO networks, in contrast to legacy protocols like 802.11ac.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127014413","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
Taming Wireless Fluctuations by Predictive Queuing Using a Sparse-Coding Link-State Model 基于稀疏编码链路状态模型的预测排队控制无线波动
Stephen J. Tarsa, Marcus Z. Comiter, Michael B. Crouse, Bradley McDanel, H. T. Kung
{"title":"Taming Wireless Fluctuations by Predictive Queuing Using a Sparse-Coding Link-State Model","authors":"Stephen J. Tarsa, Marcus Z. Comiter, Michael B. Crouse, Bradley McDanel, H. T. Kung","doi":"10.1145/2746285.2746318","DOIUrl":"https://doi.org/10.1145/2746285.2746318","url":null,"abstract":"We introduce State-Informed Link-Layer Queuing (SILQ), a system that models, predicts, and avoids packet delivery failures caused by temporary wireless outages in everyday scenarios. By stabilizing connections in adverse link conditions, SILQ boosts throughput and reduces performance variation for network applications, for example by preventing unnecessary TCP timeouts due to dead zones, elevators, and subway tunnels. SILQ makes predictions in real-time by actively probing links, matching measurements to an overcomplete dictionary of patterns learned offline, and classifying the resulting sparse feature vectors to identify those that precede outages. We use a clustering method called sparse coding to build our data-driven link model, and show that it produces more variation-tolerant predictions than traditional loss-rate, location-based, or Markov chain techniques. We present extensive data collection and field-validation of SILQ in airborne, indoor, and urban scenarios of practical interest. We show how offline unsupervised learning discovers link-state patterns that are stable across diverse networks and signal-propagation environments. Using these canonical primitives, we train outage predictors for 802.11 (Wi-Fi) and 3G cellular networks to demonstrate TCP throughput gains of 4x with off-the-shelf mobile devices. SILQ addresses delivery failures solely at the link layer, requires no new hardware, and upholds the end-to-end design principle, to enable easy integration across applications, devices, and networks.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121902639","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
Poster: A Time-Saving Scheme for Ambulance Transportation with Support of Software-Defined Networking 海报:支持软件定义网络的救护车运输省时方案
Depeng Li
{"title":"Poster: A Time-Saving Scheme for Ambulance Transportation with Support of Software-Defined Networking","authors":"Depeng Li","doi":"10.1145/2746285.2764869","DOIUrl":"https://doi.org/10.1145/2746285.2764869","url":null,"abstract":"If Software-Defined Networking (SDN) is deployed on the ambulance, the doctor / care giver could remotely diagnose / take care of the patient after the patients are onboard. The patient get more chance to survive. After analyzing how to present patients earlier care, this paper's goals are to (1) enable an ambulance to transport the patient to hospitals as early as possible (2) ensure the paramedic provide care earlier via SDN. A set of graphic algorithms have been proposed and the experimental results demonstrate the feasibility of our solution.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122434001","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
Demo: Real LTE Experimentation in a Controlled Environment 演示:受控环境下的真实LTE实验
Vasilis Maglogiannis, D. Naudts, I. Moerman, N. Makris, T. Korakis
{"title":"Demo: Real LTE Experimentation in a Controlled Environment","authors":"Vasilis Maglogiannis, D. Naudts, I. Moerman, N. Makris, T. Korakis","doi":"10.1145/2746285.2764936","DOIUrl":"https://doi.org/10.1145/2746285.2764936","url":null,"abstract":"LTE, commonly known as 4G, stands for Long-Term Evolution and is a wireless communication technology standardized by 3GPP. LTE adoption has increased drastically over the last years, and today is integrated widely in a vast number of wireless devices. However, significant restrictions, such as the increased equipment cost and the acquisition of licensed spectrum, renders experimentation with real LTE equipment very difficult. Recently, iMinds w-iLab.t testbed has been extended with commercial LTE equipment and an EPC (Evolved Packet Core) software platform, offering the opportunity to orchestrate and execute real LTE experiments, hereby providing full access to the most relevant configurable LTE parameters of the network. In this paper, we describe an LTE demonstration scenario that showcases various use cases and the respective experimental settings that can be conducted on the LTE testbed.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122138519","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}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书