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

筛选
英文 中文
Efficient online coflow routing and scheduling 高效的在线coflow路由和调度
Yupeng Li, S. Jiang, Haisheng Tan, Chenzi Zhang, Guihai Chen, Jipeng Zhou, F. Lau
{"title":"Efficient online coflow routing and scheduling","authors":"Yupeng Li, S. Jiang, Haisheng Tan, Chenzi Zhang, Guihai Chen, Jipeng Zhou, F. Lau","doi":"10.1145/2942358.2942367","DOIUrl":"https://doi.org/10.1145/2942358.2942367","url":null,"abstract":"A coflow is a collection of related parallel flows that occur typically between two stages of a multi-stage compute task in a network, such as shuffle flows in MapReduce. The coflow abstraction allows applications to convey their semantics to the network so that application-level requirements (e.g., minimizing the completion time of the slowest flow) can be better satisfied. In this paper, we study the routing and scheduling of multiple coflows to minimize the average coflow completion time (CCT). We first propose a rounding-based randomized approximation algorithm, called OneCoflow, for single coflow routing and scheduling. The multiple coflow problem is more challenging as coexisting coflows will compete for the same network resources such as link bandwidths. To minimize the average CCT, we derive an online multiple coflow routing and scheduling algorithm, called OMCoflow, and prove that it has a reasonably good competitive ratio. To the best of our knowledge, this is the first online algorithm with theoretical performance guarantees which considers routing and scheduling simultaneously for multi-coflows. Compared with existing methods, OMCoflow runs more efficiently, and it avoids the problem of frequently rerouting the flows. Extensive simulations on a Facebook data trace show that OMCoflow outperforms the state-of-the-art heuristic schemes significantly (e.g., reducing the average CCT by up to 41.8% and the execution time by up to 99.2% against RAPIER [28]).","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114774141","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}
引用次数: 62
Mobility resilience and overhead constrained adaptation in directional 60 GHz WLANs: protocol design and system implementation 定向60ghz无线局域网的移动弹性和开销约束自适应:协议设计和系统实现
M. Haider, E. Knightly
{"title":"Mobility resilience and overhead constrained adaptation in directional 60 GHz WLANs: protocol design and system implementation","authors":"M. Haider, E. Knightly","doi":"10.1145/2942358.2942380","DOIUrl":"https://doi.org/10.1145/2942358.2942380","url":null,"abstract":"High directivity of 60 GHz links introduces new link training and adaptation challenges due to both client and environmental mobility. In this paper, we design, implement and evaluate MOCA, a protocol for Mobility resilience and Overhead Constrained Adaptation for directional 60 GHz links. Since mobility-induced link blockage and misalignment cannot be countered with data rate adaptation alone, we introduce Beam Sounding as a mechanism invoked before each data transmission to estimate the link quality for selected beams, and identify and adapt to link impairments. We devise proactive techniques to restore broken directional links with low overhead and design a mechanism to jointly adapt beamwidth and data rate, targeting throughput maximization that incorporates data rate, overhead for beam alignment, and mobility resilience. We implement a programmable node and testbed using software defined radios with commercial 60 GHz transceivers, and conduct an extensive over-the-air measurement study to collect channel traces for various environments. Based on trace based emulations and the IEEE 802.11ad channel model, we evaluate MOCA under a variety of propagation environments and mobility scenarios. Our experiments show that MOCA achieves up to 2x throughput gains compared to a baseline WLAN scheme in a diverse set of operational conditions.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124349825","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}
引用次数: 89
Analysis of region of interest (RoI) of multimedia content using eye-tracker: poster 利用眼动仪分析多媒体内容的感兴趣区域:海报
B. Vinodh, A. S. Charan, R. Assfalg, H. Venkataraman
{"title":"Analysis of region of interest (RoI) of multimedia content using eye-tracker: poster","authors":"B. Vinodh, A. S. Charan, R. Assfalg, H. Venkataraman","doi":"10.1145/2942358.2942407","DOIUrl":"https://doi.org/10.1145/2942358.2942407","url":null,"abstract":"With the advent of smart-phones and YouTube, viewing video and multimedia content over wireless medium has gained enormous interest. In this regard, encoding the video with high-quality encoder results in humongous increase in the data-rate. Given that users tend to focus more on certain parts of video, the region of video frame that is highly viewed is encoded with best-possible quality and the other regions are encoded with decreasing quality. However, the main challenge is to ensure that adaptive encoding does not result in significant perceivable degradation in video quality. In this 2-pager for poster, the nature of region of interest (RoI) is analyzed by identifying the user's focus while watching video captured with two different camera technology. It has been observed that user's RoI follows a Gaussian distribution from left to right of the screen. At the same time, the user's RoI from top to bottom follows a distribution that is almost Gaussian, but varies with the nature of the video content. This is a significant result that will play a key role in designing an adaptive RoI for reducing the data rate while transmitting multimedia content over the network.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124273442","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
Charge me if you can: charging path optimization and scheduling in mobile networks Charge me if you can:移动网络中充电路径优化与调度
Lin Chen, Shan Lin, Hua Huang
{"title":"Charge me if you can: charging path optimization and scheduling in mobile networks","authors":"Lin Chen, Shan Lin, Hua Huang","doi":"10.1145/2942358.2942364","DOIUrl":"https://doi.org/10.1145/2942358.2942364","url":null,"abstract":"We study a class of generic optimization problems on charger scheduling and charging path planing. These problems arise from emerging networking applications where mobile chargers are dispatched to deliver energy to mobile agents (e.g., robots, drones, and vehicles), which have specified tasks and mobility patterns. We instantiate our work by focusing on finding the charging path maximizing the number of nodes charged within a fixed time horizon. We prove that this problem is APX-hard. By recursively decomposing the problem into sub-problems of searching sub-paths, we design a quasi-polynomial time algorithm that achieves poly-logarithmic approximation to the optimum charging path. Our approximation algorithm can be further adapted and extended to solve a variety of charging path optimization and scheduling problems with realistic constraints, such as limited time and energy budget.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128411547","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}
引用次数: 39
Multi-channel access and rendezvous in CRNs: demo crn中的多通道访问和会合:演示
Jiaxun Li, Haitao Zhao, Haijun Wang, Li Zhou, Jibo Wei
{"title":"Multi-channel access and rendezvous in CRNs: demo","authors":"Jiaxun Li, Haitao Zhao, Haijun Wang, Li Zhou, Jibo Wei","doi":"10.1145/2942358.2942395","DOIUrl":"https://doi.org/10.1145/2942358.2942395","url":null,"abstract":"Cognitive radio (CR) has emerged as a promising technology to increase the utilization of spectrum resource. A pivotal challenge in CR lies on secondary users' (SU) finding each other on the frequency band, i.e., the spectrum locating. In this demo, we implement two kinds of multi-channel rendezvous technology to solve the problem of spectrum locating: (i) the common control channel (CCC) based rendezvous scheme, which is simple and effective when a control channel is always available; and (ii) the channel-hopping (CH) based blind rendezvous, which could also obtain guaranteed rendezvous on all commonly available channels of pairwise SUs in a short time without a CCC. Furthermore, the cognitive nodes in the demonstration could adjust their communication channels autonomously according to the dynamic spectrum environment for continuous data transmission.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128715417","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
INCEPTION: incentivizing privacy-preserving data aggregation for mobile crowd sensing systems 开始:激励保护隐私的数据聚合移动人群传感系统
Haiming Jin, Lu Su, Houping Xiao, K. Nahrstedt
{"title":"INCEPTION: incentivizing privacy-preserving data aggregation for mobile crowd sensing systems","authors":"Haiming Jin, Lu Su, Houping Xiao, K. Nahrstedt","doi":"10.1145/2942358.2942375","DOIUrl":"https://doi.org/10.1145/2942358.2942375","url":null,"abstract":"The recent proliferation of human-carried mobile devices has given rise to mobile crowd sensing (MCS) systems that outsource the collection of sensory data to the public crowd equipped with various mobile devices. A fundamental issue in such systems is to effectively incentivize worker participation. However, instead of being an isolated module, the incentive mechanism usually interacts with other components which may affect its performance, such as data aggregation component that aggregates workers' data and data perturbation component that protects workers' privacy. Therefore, different from past literature, we capture such interactive effect, and propose INCEPTION, a novel MCS system framework that integrates an incentive, a data aggregation, and a data perturbation mechanism. Specifically, its incentive mechanism selects workers who are more likely to provide reliable data, and compensates their costs for both sensing and privacy leakage. Its data aggregation mechanism also incorporates workers' reliability to generate highly accurate aggregated results, and its data perturbation mechanism ensures satisfactory protection for workers' privacy and desirable accuracy for the final perturbed results. We validate the desirable properties of INCEPTION through theoretical analysis, as well as extensive simulations.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126820913","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}
引用次数: 160
Deploying carrier-grade WiFi: offload traffic, not money 部署运营商级WiFi:卸载流量,而不是金钱
Konstantinos Poularakis, G. Iosifidis, L. Tassiulas
{"title":"Deploying carrier-grade WiFi: offload traffic, not money","authors":"Konstantinos Poularakis, G. Iosifidis, L. Tassiulas","doi":"10.1145/2942358.2942365","DOIUrl":"https://doi.org/10.1145/2942358.2942365","url":null,"abstract":"WiFi data offloading provides a promising auxiliary to alleviate network congestion by diverting traffic from the cellular infrastructure onto WiFi access points (APs). Despite the importance and momentum of this method, the current deployment of APs by the carriers follows mostly a heuristic approach. In addition, the prevalent free-of-charge WiFi access approach may result in significant opportunity costs for the carriers as this traffic could yield non-negligible revenues. In this paper, we propose and study the problem of optimizing the deployment of WiFi offloading infrastructure, and pricing the offloading service with the goal of maximizing carrier profits. Addressing this problem is a prerequisite for the efficient integration of WiFi technology to next generation of cellular systems and the development of carrier-grade offloading solutions. Our framework considers a fundamental, intuitive model of carrier costs and revenues, and two demand models that predict how traffic will change in response to alteration in the price and the set of deployed APs. We present both analytical and approximate solutions for this intricate problem, and reveal how key network parameters shape the offloading benefits. Using a dataset of WiFi access patterns collected from real users, we evaluate the impact of offloading for different regional markets around the world. We find that in mature markets WiFi can help carriers reduce their costs, while charging users up to 50% lower than the cellular service. The gains are higher for small \"virtual carriers\" who resell other's mobile data services (up to a factor of 2). However, in less mature markets where the AP deployment or access costs are higher, deploying APs can actually lead to a net loss for the carrier. Our evaluation code is publicly available for the benefit of research community.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126564047","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
Monitoring vital signs using millimeter wave 用毫米波监测生命体征
Zhicheng Yang, P. Pathak, Yunze Zeng, Xixi Liran, P. Mohapatra
{"title":"Monitoring vital signs using millimeter wave","authors":"Zhicheng Yang, P. Pathak, Yunze Zeng, Xixi Liran, P. Mohapatra","doi":"10.1145/2942358.2942381","DOIUrl":"https://doi.org/10.1145/2942358.2942381","url":null,"abstract":"Continuous monitoring of human's breathing and heart rates is useful in maintaining better health and early detection of many health issues. Designing a technique that can enable contactless and ubiquitous vital sign monitoring is a challenging research problem. This paper presents mmVital, a system that uses 60 GHz millimeter wave (mmWave) signals for vital sign monitoring. We show that the mmWave signals can be directed to human's body and the RSS of the reflections can be analyzed for accurate estimation of breathing and heart rates. We show how the directional beams of mmWave can be used to monitor multiple humans in an indoor space concurrently. mmVital relies on a novel human finding procedure where a human can be located within a room by reflection loss based object/human classification. We evaluate mmVital using a 60 GHz testbed in home and office environment and show that it provides the mean estimation error of 0.43 Bpm (breathing rate) and 2.15 bpm (heart rate). Also, it can locate the human subject with 98.4% accuracy within 100 ms of dwell time on reflection. We also demonstrate that mmVital is effective in monitoring multiple people in parallel and even behind the wall.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116059886","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}
引用次数: 133
High-rate WiFi broadcasting in crowded scenarios via lightweight coordination of multiple access points 通过多个接入点的轻量级协调,在拥挤的场景下进行高速WiFi广播
Hang Qiu, K. Psounis, G. Caire, K. Chugg, Kaidong Wang
{"title":"High-rate WiFi broadcasting in crowded scenarios via lightweight coordination of multiple access points","authors":"Hang Qiu, K. Psounis, G. Caire, K. Chugg, Kaidong Wang","doi":"10.1145/2942358.2942372","DOIUrl":"https://doi.org/10.1145/2942358.2942372","url":null,"abstract":"The enormous success of advanced wireless devices is pushing the demand for higher wireless data rates. The industry is satisfying this increasing demand by densely deploying large numbers of access points (APs). Unfortunately, unicast rates, especially in crowded scenarios, remain very low due to severe interference and time-sharing. However, one may take advantage of the broadcasting nature of wireless transmissions to offer high multicast rates. Motivated by this, we present coordinated broadcasting (Co-BCast), a system which coordinates multiple APs to provide participants of big events with high multicast rates that can support multiple high definition video streams. Co-BCast requires no complicated time or frequency synchronization and no instantaneous channel state information. Yet, despite the time and frequency offsets among concurrent transmitters, the aggregate signal from the coordinated APs offers uniform coverage and high SINR to all users. We explore the challenges of such asynchronous transmissions through theoretical analysis and wireless experiments on software defined radio (SDR) testbeds. We use a number of PHY techniques to address those challenges and implement our coordination scheme on top of an 802.11 reference design. Both wireless experiments and large-scale simulations demonstrate that Co-BCast can achieve multicast rates in the order of 100Mbps even in the most crowded scenarios. These rates are orders of magnitude higher than the unicast and multicast rates achieved by uncoordinated transmissions.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131888931","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
Combinatorics, algorithms and systems for sensor deployment with line-of-sight constraints: poster 组合学,算法和系统的传感器部署与视线限制:海报
Kin Sum Liu, B. Schiller, Jie Gao, Shan Lin, Joseph S. B. Mitchell
{"title":"Combinatorics, algorithms and systems for sensor deployment with line-of-sight constraints: poster","authors":"Kin Sum Liu, B. Schiller, Jie Gao, Shan Lin, Joseph S. B. Mitchell","doi":"10.1145/2942358.2947403","DOIUrl":"https://doi.org/10.1145/2942358.2947403","url":null,"abstract":"In this paper we investigate sensor deployment and coverage algorithms for using infrared signals in indoor applications. Infrared signals are directional and reliable signals that have little interference with other electromagnetic signals that are commonly found in the deployment domain such as visible light and wireless radio waves. Since the angle of arrival is used, and line of sight is the main constraint for IR signals, we investigate the problem called robust guarding, i.e., placing emitters to ensure that all points of the domain are robustly covered by two emitters that are from sufficiently different directions. We prove combinatorial upper and lower bounds for the number of emitters needed and prove that finding the minimum number of guards is NP-hard. We show that n/2 guards are always sufficient and sometimes necessary for rectilinear polygons and we provide practical algorithms in general. We also developed a testbed with low cost off-the-shelf infrared (IR) emitters and sensors for indoor device-free localization. We tested the algorithms for using infrared sensors for indoor localization and our system achieves an average accuracy of 11.7 cm in a typical office setting.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"244 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124300216","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
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学术官方微信
小红书