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

筛选
英文 中文
ConMap: A Novel Framework for Optimizing Multicast Energy in Delay-constrained Mobile Wireless Networks 延迟受限移动无线网络中优化组播能量的新框架
Xinzhe Fu, Zhiying Xu, Qianyang Peng, Jie You, Luoyi Fu, Xinbing Wang, Songwu Lu
{"title":"ConMap: A Novel Framework for Optimizing Multicast Energy in Delay-constrained Mobile Wireless Networks","authors":"Xinzhe Fu, Zhiying Xu, Qianyang Peng, Jie You, Luoyi Fu, Xinbing Wang, Songwu Lu","doi":"10.1145/3084041.3084047","DOIUrl":"https://doi.org/10.1145/3084041.3084047","url":null,"abstract":"This paper studies the problem of optimizing multicast energy consumption in delay-constrained mobile wireless networks, where information from the source needs to be delivered to all the k destinations within an imposed delay constraint. Most existing works simply focus on deriving transmission schemes with the minimum transmitting energy, overlooking the energy consumption at the receiver side. Therefore, in this paper, we propose ConMap, a novel and general framework for efficient transmission scheme design that jointly optimizes both the transmitting and receiving energy. In doing so, we formulate our problem of designing minimum energy transmission scheme, called DeMEM, as a combinatorial optimization one, and prove that the approximation ratio of any polynomial time algorithm for DeMEM cannot be better than ¼ ln k. Aiming to provide more efficient approximation schemes, the proposed ConMap first converts DeMEM into an equivalent directed Steiner tree problem through creating auxiliary graph gadgets to capture energy consumption, then maps the computed tree back into a transmission scheme. The advantages of ConMap are threefolded: i) Generality-- ConMap exhibits strong applicability to a wide range of energy models; ii) Flexibility-- Any algorithm designed for the problem of directed Steiner tree can be embedded into our ConMap framework to achieve different performance guarantees and complexities; iii) Efficiency-- ConMap preserves the approximation ratio of the embedded Steiner tree algorithm, to which only slight overhead will be incurred. The three features are then empirically validated, with ConMap also yielding near-optimal transmission schemes compared to a brute-force exact algorithm. To our best knowledge, this is the first work that jointly considers both the transmitting and receiving energy in the design of multicast transmission schemes in mobile wireless networks.","PeriodicalId":202936,"journal":{"name":"Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122394809","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}
引用次数: 15
Efficient MU-MIMO via Switched-beam Antennas 通过开关波束天线的高效MU-MIMO
Yonglong Zhang, K. Psounis
{"title":"Efficient MU-MIMO via Switched-beam Antennas","authors":"Yonglong Zhang, K. Psounis","doi":"10.1145/3084041.3084051","DOIUrl":"https://doi.org/10.1145/3084041.3084051","url":null,"abstract":"The demand for wireless bandwidth is rising to unprecedented levels. The industry has responded with the inclusion of advanced PHY techniques, most notably multi-user (MU) MIMO, in the most recent WiFi and LTE standards. However, despite the theoretical promise for large multiplexing gains, in practice the rate gains are modest due to a combination of large overhead to collect channel state information and not-so-well-conditioned channel matrices. In this paper we propose to replace omni-directional antennas with inexpensive switched-beam antennas to produce well-conditioned channel matrices for MU-MIMO purposes with very low overhead. Remarkably, experimental results with both software defined radios and commercial WiFi chipsets show that, when appropriate antenna modes are used, this leads to a 3.5x-5x average throughput improvement in indoor environments. What is more, our backward compatible protocol extension coupled with an efficient algorithm to select appropriate antenna modes, achieve the aforementioned gains with almost zero overhead.","PeriodicalId":202936,"journal":{"name":"Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125460120","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}
引用次数: 6
Smart User Authentication through Actuation of Daily Activities Leveraging WiFi-enabled IoT 通过利用支持wifi的物联网实现日常活动的智能用户身份验证
Cong Shi, Jian Liu, Hongbo Liu, Yingying Chen
{"title":"Smart User Authentication through Actuation of Daily Activities Leveraging WiFi-enabled IoT","authors":"Cong Shi, Jian Liu, Hongbo Liu, Yingying Chen","doi":"10.1145/3084041.3084061","DOIUrl":"https://doi.org/10.1145/3084041.3084061","url":null,"abstract":"User authentication is a critical process in both corporate and home environments due to the ever-growing security and privacy concerns. With the advancement of smart cities and home environments, the concept of user authentication is evolved with a broader implication by not only preventing unauthorized users from accessing confidential information but also providing the opportunities for customized services corresponding to a specific user. Traditional approaches of user authentication either require specialized device installation or inconvenient wearable sensor attachment. This paper supports the extended concept of user authentication with a device-free approach by leveraging the prevalent WiFi signals made available by IoT devices, such as smart refrigerator, smart TV and thermostat, etc. The proposed system utilizes the WiFi signals to capture unique human physiological and behavioral characteristics inherited from their daily activities, including both walking and stationary ones. Particularly, we extract representative features from channel state information (CSI) measurements of WiFi signals, and develop a deep learning based user authentication scheme to accurately identify each individual user. Extensive experiments in two typical indoor environments, a university office and an apartment, are conducted to demonstrate the effectiveness of the proposed authentication system. In particular, our system can achieve over 94% and 91% authentication accuracy with 11 subjects through walking and stationary activities, respectively.","PeriodicalId":202936,"journal":{"name":"Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122477061","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}
引用次数: 204
Radiation Constrained Scheduling of Wireless Charging Tasks 无线充电任务的辐射约束调度
Haipeng Dai, Huizhen Ma, A. Liu
{"title":"Radiation Constrained Scheduling of Wireless Charging Tasks","authors":"Haipeng Dai, Huizhen Ma, A. Liu","doi":"10.1145/3084041.3084060","DOIUrl":"https://doi.org/10.1145/3084041.3084060","url":null,"abstract":"This paper studies the problem of Radiation cOnstrained scheduling of wireless Charging tasKs (ROCK), that is, given wireless charging tasks with required charging energy and charging deadline for rechargeable devices, scheduling the power of wireless chargers to maximize the overall effective charging energy for all rechargeable devices, and further to minimize the total charging time, while guaranteeing electromagnetic radiation (EMR) safety, i.e., no point on the considered 2D area has EMR intensity exceeding a given threshold. To address ROCK, we first present a centralized algorithm. We transform ROCK from nonlinear problem to linear problem by applying two approaches of area discretization and solution regularization, and then propose a linear programming based greedy test algorithm to solve it. We also propose a distributed algorithm by presenting an area partition scheme and two approaches called area-scaling and EMR-scaling, and prove that it achieves effective charging energy no less than (1 -- ε) of that of the optimal solution, and charging time no more than that of the optimal solution. We conduct both simulation and field experiments to validate our theoretical findings. The results show that our algorithm achieves 94.9% of the optimal effective charging energy and requires 47.1% smaller charging time compared with the optimal one when ε ≥ 0.2, and outperforms the other algorithms by at least 350.1% in terms of charging time with even more effective charging energy.","PeriodicalId":202936,"journal":{"name":"Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115508939","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}
引用次数: 56
Core Percolation in Coupled Networks 耦合网络中的岩心渗流
Jiayu Pan, Yuhang Yao, Luoyi Fu, Xinbing Wang
{"title":"Core Percolation in Coupled Networks","authors":"Jiayu Pan, Yuhang Yao, Luoyi Fu, Xinbing Wang","doi":"10.1145/3084041.3098919","DOIUrl":"https://doi.org/10.1145/3084041.3098919","url":null,"abstract":"Core percolation is crucial in network controllability and robustness. Prior works are mainly based on single, non-interacting network where core nodes are obtained by a classic Greedy Leaf Removal (GLR) procedure that takes of leaf nodes along with their neighbors iteratively. We take a first look into core percolation in coupled networks with two fully-interdependent networks. To obtain core nodes in both networks, we propose a new algorithm, called Alternating GLR procedure, that recursively switches between networks in carrying out GLR for node removal. We prove that the proposed algorithm can guarantee the uniqueness in the sense that the final remaining nodes and edges in either of the coupled networks remain the same, and then present analytical solutions for the fraction of core nodes that will be ultimately left when the algorithm terminates. Our simulation demonstrates that the presence of core exhibits a jump at the critical point as a first order transition in coupled networks.","PeriodicalId":202936,"journal":{"name":"Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128706525","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
Maintaining Social Links through Amplify-and-Forward in Wireless Networks 通过无线网络的放大转发维持社会联系
Li Qiu, G. Cao
{"title":"Maintaining Social Links through Amplify-and-Forward in Wireless Networks","authors":"Li Qiu, G. Cao","doi":"10.1145/3084041.3084055","DOIUrl":"https://doi.org/10.1145/3084041.3084055","url":null,"abstract":"It is critical to maintain the communication links between important social pairs. However, maintaining the social links between faraway nodes in wireless networks is extremely difficult. Although multi-hop transmission can be used, if two nodes in the routing path are out of the wireless transmission range, a network partition is possible. To address this problem, we adopt a cooperative amplify-and-forward strategy, where nodes (relays) cooperate to improve the signal strength at the destination. We formulate and study two optimization problems for maintaining the required link throughput: Min-Energy and Min-Relay, where the goal of Min-Energy is to minimize the power consumption of the relays, and the goal of Min-Relay is to minimize the number of active relays. Since the Min-Energy problem is a non-convex problem, we solve it based on an approximation technique and prove that our solution is a feasible, in fact optimal solution. We formulate the Min-Relay problem as an integer programming problem, and propose a polynomial-time algorithm which can select the minimum number of relays to maintain the social link. Evaluation results show that Min-Relay can significantly reduce the number of active relays compared to Min-Energy, while achieving comparable power consumption.","PeriodicalId":202936,"journal":{"name":"Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126035465","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
CSIsnoop: Attacker Inference of Channel State Information in Multi-User WLANs CSIsnoop:多用户无线局域网中信道状态信息的攻击推断
Xu Zhang, E. Knightly
{"title":"CSIsnoop: Attacker Inference of Channel State Information in Multi-User WLANs","authors":"Xu Zhang, E. Knightly","doi":"10.1145/3084041.3084048","DOIUrl":"https://doi.org/10.1145/3084041.3084048","url":null,"abstract":"Channel State Information (CSI) has been proposed to enhance physical layer security between a transmitter and a receiver because it decorrelates over half wavelength distances in rich scattering environments. Consequently, CSI was employed to generate passwords, to authenticate the source of packets, and to inject artificial noise to thwart eavesdroppers. However, in this paper, we present CSIsnoop, and show that an attacker can infer CSI in a multi-user WLAN, even if both channel sounding sequences from the access point and CSI measurement feedback from the clients are encrypted. The insights of CSIsnoop are that the CSI of clients can be computed based on transmit beamforming weights at the access point, and that the transmit beamforming weights can be estimated from downlink multi-user transmission. We implement CSIsnoop on a software defined radio and conduct experiments in various indoor environments. Our results show that on average CSIsnoop can infer CSI of the target client with an absolute normalized correlation of over 0.99, thereby urging reconsideration of the use of CSI as a tool to enhance physical layer security in multi-user WLANs.","PeriodicalId":202936,"journal":{"name":"Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122542845","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
Towards Maximizing Throughput and Coverage of a Novel Heterogeneous Maritime Communication Network 一种新型异构海上通信网络的吞吐量和覆盖最大化
J. Dhivvya, Sethuraman N. Rao, S. Simi
{"title":"Towards Maximizing Throughput and Coverage of a Novel Heterogeneous Maritime Communication Network","authors":"J. Dhivvya, Sethuraman N. Rao, S. Simi","doi":"10.1145/3084041.3084077","DOIUrl":"https://doi.org/10.1145/3084041.3084077","url":null,"abstract":"Marine fishermen are unable to economically communicate either with other boats over the ocean or with the people on the shore due to the shortcomings in the available cellular and satellite communication. Project OceanNet bridges this gap to deploy a heterogeneous wireless communication system to provide internet access to the fishermen's smart phones in the boat helping them to reach out for help in critical situations. This work involves designing a wireless multi-hop backhaul network to extend the coverage and to improve the connectivity through an ad hoc mesh network between the access routers in different boats. Selecting the best path from the fishermen's end devices in the heterogeneous network can increase the throughput. The design and implementation of an elimination algorithm is dicussed to spectacle the improvement of the throughput and coverage. The algorithm is based on the analysis of the quality of various types of links using Signal-to-noise ratio(SNR) and Expected Transmission Count(ETX) metrics. The performance analysis in hardware test bed prove that the packet delivery ratio is substantially improved by the proposed path selection algorithm in the network.","PeriodicalId":202936,"journal":{"name":"Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114485187","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}
引用次数: 14
Adaptive Discount Allocation in Social Networks 社会网络中的自适应折扣分配
Jing Yuan, Shaojie Tang
{"title":"Adaptive Discount Allocation in Social Networks","authors":"Jing Yuan, Shaojie Tang","doi":"10.1145/3084041.3084043","DOIUrl":"https://doi.org/10.1145/3084041.3084043","url":null,"abstract":"It has been reported that 40% of consumers will share an email offer with their friend and 28% of consumers will share deals via social media platforms. This motivates us to study the influence maximization discount allocation problem: given a social network and a limited marketing budget, which set of initial users should be selected to receive the discount, and how much should the discounts be worth? Our goal is to maximize the number of customers who finally adopt the target product. We investigate this problem under both non-adaptive and adaptive settings. In the first setting, we have to commit the set of initial users and corresponding discounts all at once in advance. In the latter case, given that an user has been offered a discount, we are able to know immediately her decision on whether or not to accept that discount, therefore, the decision process is performed in a sequential manner based on the feedback from previously selected users. We propose a simple greedy policy with an approximation ratio of (1-1/e) in non-adaptive setting. For the significantly more complex adaptive setting, we propose a series of adaptive policies with bounded approximation ratio in terms of expected utility.","PeriodicalId":202936,"journal":{"name":"Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126151204","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
Emulating Round-Robin in Wireless Networks 无线网络中的轮询仿真
Bin Li, A. Eryilmaz, R. Srikant
{"title":"Emulating Round-Robin in Wireless Networks","authors":"Bin Li, A. Eryilmaz, R. Srikant","doi":"10.1145/3084041.3084052","DOIUrl":"https://doi.org/10.1145/3084041.3084052","url":null,"abstract":"Round robin and its variants are well known scheduling policies that are popular in wireline networks due to their throughput optimality, delay insensitivity to file size distributions and short-term fairness. The latter two properties are also extremely important for emerging wireless applications, such as Internet of Things and cyber-physical systems. However, there is no direct wireless analog of round robin with all the desirable properties in wireless networks, where wireless interference and channel fading are predominant. The main reason is due to the fact that it is very difficult to even define what round robin means in wireless networks. This motivates us to develop a round-robin-like algorithm in wireless networks that has nice properties as round robin in wireline networks. To that end, we utilize a counter called the Time-Since-Last-Service (TSLS) that keeps track of the time of each file since its last service, and observe that scheduling a file with maximum TSLS in a single server is equivalent to serving files in a round robin fashion. Based on this key observation, we develop a TSLS-based algorithm that balances the tradeoff between the TSLS value and the channel rate for each link and show that the proposed algorithm achieves maximum system throughput, which demands a nontraditional approach due to the abrupt dynamics of the TSLS metrics. Numerous simulations are provided to validate its desired properties such as delay insensitivity and excellent short-term fairness performance as in the case of round robin algorithms of wireline networks.","PeriodicalId":202936,"journal":{"name":"Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132806146","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
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学术官方微信
小红书