Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing最新文献_第3页

Age-based Scheduling: Improving Data Freshness for Wireless Real-Time Traffic 基于年龄的调度:提高无线实时流量的数据新鲜度

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3209602

N. Lu, Bo Ji, Bin Li

{"title":"Age-based Scheduling: Improving Data Freshness for Wireless Real-Time Traffic","authors":"N. Lu, Bo Ji, Bin Li","doi":"10.1145/3209582.3209602","DOIUrl":"https://doi.org/10.1145/3209582.3209602","url":null,"abstract":"We consider the problem of scheduling real-time traffic with hard deadlines in a wireless ad hoc network. In contrast to existing real-time scheduling policies that merely ensure a minimal timely throughput, our design goal is to provide guarantees on both the timely throughput and data freshness in terms of age-of-information (AoI), which is a newly proposed metric that captures the \"age\" of the most recently received information at the destination of a link. The main idea is to introduce the AoI as one of the driving factors in making scheduling decisions. We first prove that the proposed scheduling policy is feasibility-optimal, i.e., satisfying the per-traffic timely throughput requirement. Then, we derive an upper bound on a considered data freshness metric in terms of AoI, demonstrating that the network-wide data freshness is guaranteed and can be tuned under the proposed scheduling policy. Interestingly, we reveal that the improvement of network data freshness is at the cost of slowing down the convergence of the timely throughput. Extensive simulations are performed to validate our analytical results. Both analytical and simulation results confirm the capability of the proposed scheduling policy to improve the data freshness without sacrificing the feasibility optimality.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129299631","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}

引用次数: 98

mmChoir

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3209608

Ding Zhang, Mihir Garude, P. Pathak

引用次数: 19

Densification Leveraging Mobility: An IoT Architecture Based on Mesh Networking and Vehicles 利用移动性的致密化:基于网状网络和车辆的物联网架构

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3209590

Chang-Sik Choi, F. Baccelli, G. Veciana

{"title":"Densification Leveraging Mobility: An IoT Architecture Based on Mesh Networking and Vehicles","authors":"Chang-Sik Choi, F. Baccelli, G. Veciana","doi":"10.1145/3209582.3209590","DOIUrl":"https://doi.org/10.1145/3209582.3209590","url":null,"abstract":"Disruptive changes are underway in the automotive industry as large-scale platforms based on vehicular fleets are deployed to deliver ride sharing and delivery services. Such platforms can also be leveraged to deliver wireless connectivity services, e.g., large-scale connectivity for the Internet of Things (IoT). This paper examines a network architecture based on a mesh of IoT devices, roadside repositories and vehicular mobile gateways -- referred to as mesh+vehicular. We propose a system-level model to study its relative merits versus conventional infrastructure-based IoT architectures-- referred to as mesh+cellular. The model reflects the salient properties of the architectures including the key interplay among the variability in the network geometries, routing trees, wireless capacity and eventually IoT queue stability. The paper provides an initial study of the scaling of the IoT sensing capacity of the routing trees per repository and base station respectively for the two architectures: i.e., the scaling the maximum common traffic rate the trees' IoT devices can generate while maintaining the stability of its queues. We then define the harvesting capacity per mobile gateway and base station in the two architectures, i.e., the average aggregate IoT rate each can extract assuming IoT devices are limited to their sensing capacity in each tree. Perhaps surprisingly, we show that as the spatial density λs of IoT devices and corresponding density of repositories along roads scale up, the proposed mesh+vehicular architecture has a gain in its harvesting capacity of order at least λsγ/4 where γ is the wireless path loss exponent. Underlying such gains is a fundamental shift in network geometry and information flows: in mesh+cellular systems IoT data is routed toward cells' sinks (zero-dimensional objects) while in mesh+vehicular data is routed to road induced cell edges (one-dimensional objects). Detailed system-level simulations validate the obtained scaling results.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134613815","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

On the Theory of Function Placement and Chaining for Network Function Virtualization 网络功能虚拟化中的功能布局与链接理论研究

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3209592

Jinbei Zhang, Weijie Wu, John C.S. Lui

{"title":"On the Theory of Function Placement and Chaining for Network Function Virtualization","authors":"Jinbei Zhang, Weijie Wu, John C.S. Lui","doi":"10.1145/3209582.3209592","DOIUrl":"https://doi.org/10.1145/3209582.3209592","url":null,"abstract":"Network function virtualization (NFV) can significantly reduce the operation cost and speed up the deployment for network services to markets. Under NFV, a network service is composed by a chain of ordered virtual functions, or we call a \"network function chain.\" A fundamental question is when given a number of network function chains, on which servers should we place these functions and how should we form a chain on these functions? This is challenging due to the intricate dependency relationship of functions and the intrinsic complex nature of the optimization. In this paper, we formulate the function placement and chaining problem as an integer optimization, where each variable is an indicator whether one service chain can be deployed on a configuration (or a possible function placement of a service chain). While this problem is generally NP-hard, our contribution is to show that it can be mapped to an exponential number of min-cost flow problems. Instead of solving all the min-cost problems, one can select a small number of mapped min-cost problems, which are likely to have a low cost. To achieve this, we relax the integer problem into a fractional linear problem, and theoretically prove that the fractional solutions possess some desirable properties, i.e., the number and the utilization of selected configurations can be upper and lower bounded, respectively. Based on such properties, we determine some \"good\" configurations selected from the fractional solution and determine the mapped min-cost flow problem, and this helps us to develop efficient algorithms for network function placement and chaining. Via extensive simulations, we show that our algorithms significantly outperform state-of-art algorithms and achieve near-optimal performance.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115061054","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

Discount Allocation for Revenue Maximization in Online Social Networks 在线社交网络中收益最大化的折扣分配

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3209595

K. Han, Chaoting Xu, Fei Gui, Shaojie Tang, He Huang, Jun Luo

{"title":"Discount Allocation for Revenue Maximization in Online Social Networks","authors":"K. Han, Chaoting Xu, Fei Gui, Shaojie Tang, He Huang, Jun Luo","doi":"10.1145/3209582.3209595","DOIUrl":"https://doi.org/10.1145/3209582.3209595","url":null,"abstract":"Viral marketing through online social networks (OSNs) has aroused great interests in the literature. However, the fundamental problem of how to optimize the \"pure gravy\" of a marketing strategy through influence propagation in OSNs still remains largely open. In this paper, we consider a practical setting where the \"seed nodes\" in an OSN can only be probabilistically activated by the product discounts allocated to them, and make the first attempt to seek a discount allocation strategy to maximize the expected difference of profit and cost (i.e., revenue) of the strategy. We show that our problem is much harder than the conventional influence maximization issues investigated by previous work, as it can be formulated as a non-monotone and non-submodular optimization problem. To address our problem, we propose a novel \"surrogate optimization\" approach as well as two randomized algorithms which can find approximation solutions with constant performance ratios with high probability. We evaluate the performance of our approach using real social networks. The extensive experimental results demonstrate that our proposed approach significantly outperforms previous work both on the revenue and on the running time.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129440738","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}

引用次数: 17

WNOS

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3209607

Zhangyu Guan, L. Bertizzolo, Emrecan Demirors, T. Melodia

{"title":"WNOS","authors":"Zhangyu Guan, L. Bertizzolo, Emrecan Demirors, T. Melodia","doi":"10.1145/3209582.3209607","DOIUrl":"https://doi.org/10.1145/3209582.3209607","url":null,"abstract":"This article investigates the basic design principles for a new Wireless Network Operating System (WNOS), a radically different approach to software-defined networking (SDN) for infrastructure-less wireless networks. Departing from well-understood approaches inspired by OpenFlow, WNOS provides the network designer with an abstraction hiding (i) the lower-level details of the wireless protocol stack and (ii) the distributed nature of the network operations. Based on this abstract representation, the WNOS takes network control programs written on a centralized, high-level view of the network and automatically generates distributed cross-layer control programs based on distributed optimization theory that are executed by each individual node on an abstract representation of the radio hardware. We first discuss the main architectural principles of WNOS. Then, we discuss a new approach to automatically generate solution algorithms for each of the resulting subproblems in an automated fashion. Finally, we illustrate a prototype implementation of WNOS on software-defined radio devices and test its effectiveness by considering specific cross-layer control problems. Experimental results indicate that, based on the automatically generated distributed control programs, WNOS achieves 18%, 56% and 80.4% utility gain in networks with low, medium and high levels of interference; maybe more importantly, we illustrate how the global network behavior can be controlled by modifying a few lines of code on a centralized abstraction.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131034338","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}

引用次数: 21

Uplink MU-MIMO in Asynchronous Wireless LANs 异步无线局域网中的上行MU-MIMO

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3209585

Huacheng Zeng, Hongxiang Li, Qiben Yan

引用次数: 7

Priority Based Wireless Multi-Network Selection Games 基于优先级的无线多网络选择游戏

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3209612

Mohit Hota, S. Kapoor

引用次数: 1

Spatio-Temporal Aware Collaborative Mobile Sensing with Online Multi-Hop Calibration 基于在线多跳校准的时空感知协同移动传感

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3225202

Teng Xi, Wendong Wang, E. Ngai, Xiuming Liu

引用次数: 2

Multi-Dimensional Contract Design for Mobile Data Plan with Time Flexibility 具有时间灵活性的移动数据计划多维契约设计

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3209588

Zhiyuan Wang, Lin Gao, Jianwei Huang

{"title":"Multi-Dimensional Contract Design for Mobile Data Plan with Time Flexibility","authors":"Zhiyuan Wang, Lin Gao, Jianwei Huang","doi":"10.1145/3209582.3209588","DOIUrl":"https://doi.org/10.1145/3209582.3209588","url":null,"abstract":"Mobile network operators (MNOs) have been offering mobile data plans with different data caps and subscription fees as an effective way of achieving price discrimination and improving revenue. Recently, some MNOs are investigating innovative data plans with time flexibility based on the multi-cap scheme. The rollover data plan and the credit data plan are such innovative data plans with time flexibility. In this paper, we study how the MNO optimizes its multi-cap data plan with time flexibility in the realistic asymmetric information scenario, where each user is associated with multidimensional private information, i.e., the data valuation and the network substitutability. Specifically, we consider a multi-dimensional contract-theoretic approach, and analyze the optimal data caps and the subscription fees design systematically. We find that each user's willingness-to-pay for a particular data cap can be captured by the slope of his indifference curve on the contract plane, and the feasible contract (satisfying the incentive compatibility and individual rationality conditions) will allocate larger data caps for users with higher willingness-to-pay. Furthermore, we conduct a market survey to estimate the statistical distribution of users' private information, and examine the performance of our proposed multi-dimensional contract design using the empirical data. Numerical results further reveal that the optimal contract may provide price discounts (i.e., negative subscription fees) to attract low valuation users to select a small-cap (possibly zero-cap) contract item. A data mechanism with better time flexibility brings users higher payoffs and the MNO more profit, hence increases the social welfare.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131915664","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}

引用次数: 17