{"title":"Efficient mmWave wireless backhauling for dense small-cell deployments","authors":"Po-Han Huang, K. Psounis","doi":"10.1109/WONS.2017.7888769","DOIUrl":"https://doi.org/10.1109/WONS.2017.7888769","url":null,"abstract":"Dense small-cell deployments of 5G networks require a wireless backhaul to efficiently connect the small cells to the macro base station (BS). We envision a wireless backhaul architecture where cells are grouped into clusters. One small cell per cluster plays the role of a cluster head connecting the rest of the small cells to the macro cell via a mmWave MIMO link. We formulate the problem of jointly selecting the cluster heads and the number of BS antennas dedicated to each mmWave MIMO link between the BS and each cluster head as a mixed integer nonlinear program (MINLP) and prove its NP-hardness. We propose a Alternate Convex Search Heuristic (ACSH) to handle the tradeoff between having faster backhaul links versus having more cluster heads and show it is near-optimal via extensive simulations. Last, we show that our heuristic has a 20%–50% performance gain compared to prior work.","PeriodicalId":110653,"journal":{"name":"2017 13th Annual Conference on Wireless On-demand Network Systems and Services (WONS)","volume":"10 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133735804","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}
{"title":"Enhancing the solvability of network optimization problems through model augmentations","authors":"Amr Nabil, H. Sherali, Mustafa ElNainay","doi":"10.1109/WONS.2017.7888764","DOIUrl":"https://doi.org/10.1109/WONS.2017.7888764","url":null,"abstract":"Intensive research effort has been dedicated to tackle multi-hop network problems. Joint consideration across multiple layers is required to achieve optimal performance. The general trend in solving these problems is to develop strong mathematical programming formulations that are capable of providing near-optimal solutions to practical-sized problems. For the class of problems studied, we show that a traditionally formulated model turns out to be insufficient from a problem-solving perspective. When the size of the problem increases, even state-of-the-art optimizers cannot obtain an optimal solution because of running out of memory. In this work, we show that augmenting the model with suitable additional constraints and structure enables the optimizer to derive optimal solutions, or significantly reduce the optimality gap, which were previously elusive given available memory restrictions.","PeriodicalId":110653,"journal":{"name":"2017 13th Annual Conference on Wireless On-demand Network Systems and Services (WONS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129461391","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}
{"title":"Competition and investment in on-demand networking technology","authors":"Chang Liu, Yuanzhang Xiao, Ermin Wei, R. Berry","doi":"10.1109/WONS.2017.7888761","DOIUrl":"https://doi.org/10.1109/WONS.2017.7888761","url":null,"abstract":"Modern on-demand networking technologies (e.g., WiFi-Direct) improve users' networking experiences (e.g., enable them to connect to any WiFi enabled devices). Manufactures of wireless devices may choose to provide these technologies to make their products more appealing and charge a higher price. The perceived benefits from these technologies depend on how many other users are in the network, which we refer to as “positive network effect”. In this paper, we study such a scenario and develop a price-competition based model for the market, where device manufacturers may choose to invest in on-demand technology with positive network effect and consumers choose whether to participate in the market and which manufacturer to buy from. While the positive network effect can give some firms a competitive advantage, leading to a monopolistic market outcome, we show that market equilibrium always exists and the social welfare is larger when the network effect is strong enough. This is because although only the “best” firms have positive market shares at equilibrium, competition from other firms limits the best firms' actions. For a case study of linear demand and network effects, we have analytical characterizations of the equilibrium and show that competition drives firms to invest more on technology and set lower prices at equilibrium, which improves equilibrium social welfare. Numerical studies suggest that these observations may hold in more general settings.","PeriodicalId":110653,"journal":{"name":"2017 13th Annual Conference on Wireless On-demand Network Systems and Services (WONS)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123112036","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}
{"title":"On the feasibility of collision detection in full-duplex 802.11 radio","authors":"Michele Segata, R. Cigno","doi":"10.1109/WONS.2017.7888755","DOIUrl":"https://doi.org/10.1109/WONS.2017.7888755","url":null,"abstract":"Full-duplex radios are becoming a feasible reality thanks to recent advances in self-interference cancellation. Switching from half- to full-duplex requires a major re-design of many network features and characteristics, including the MAC layer. The literature provides several new proposals or improvements that are applicable in different topologies: centralized, distributed, and multi-hop Wireless LANs (WLANs). These proposals, however, mostly focus on directional, unicast communication. While the main goal of unicast-focused approaches is to get as close as possible to doubling the throughput, it is still unclear how to exploit full-duplex radios in broadcast-like environments such as the vehicular one or in general in WiFi-like scenarios where interference is the dominating impairment. In this work we analyze the possible benefits and drawbacks of exploiting self-interference cancellation in full-duplex radios to implement collision detection. We show that, if proved feasible, the required changes to the MAC layer of an 802.11-based transceiver would be minimal, and could largely improve the performance with respect to a standard collision avoidance mechanism. In addition, the paper discusses the tricky aspects and the parameters required to identify a collision in a wireless network and discusses the many differences between managing collisions in a wired and in a wireless environment.","PeriodicalId":110653,"journal":{"name":"2017 13th Annual Conference on Wireless On-demand Network Systems and Services (WONS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126881560","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}
{"title":"Promotion of cooperation in public goods game by Socialized Speed-Restricted movement","authors":"Pengyuan Du, M. Gerla","doi":"10.1109/WONS.2017.7888770","DOIUrl":"https://doi.org/10.1109/WONS.2017.7888770","url":null,"abstract":"This paper studies the formation of cooperation in mobile networks following an Evolutionary Game Theory (EGT) approach. Motivated by real-world human motions in mobile social networks, we propose a Socialized Speed-Restricted Mobility (SSRM) model to simulate users' movement. Interactions among mobile users are formulated as public goods game. To validate the SSRM model, we first derive its approximated degree distribution, and prove that exponential and power-law degree networks can be constructed from SSRM. Then we conduct extensive simulations to study the evolution of cooperation. In contrast to the recent work which concluded that random and homogeneous movement is harmful to cooperation, we find cooperation is in fact promoted in mobile networks driven by SSRM. This is mainly due to a reduction of randomness in users' neighborhood, as well as the degree heterogeneity. Results in this paper are helpful in understanding cooperative behaviors in mobile social networks. Our EGT framework can be further used to study the performance of specific cooperation-based protocols.","PeriodicalId":110653,"journal":{"name":"2017 13th Annual Conference on Wireless On-demand Network Systems and Services (WONS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123344368","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}
{"title":"Offloading on the edge: Performance and cost analysis of local data storage and offloading in HetNets","authors":"Pavlos Sermpezis, T. Spyropoulos","doi":"10.1109/WONS.2017.7888775","DOIUrl":"https://doi.org/10.1109/WONS.2017.7888775","url":null,"abstract":"The rapid increase in data traffic demand has overloaded existing cellular networks. Planned upgrades in the communication architecture (e.g. LTE), while helpful, are not expected to keep up with demand. As a result, extensive densification through small cells, caching content closer to or even at the device, device-to-device (D2D) communications, and delayed content delivery are seen as necessary components for future heterogeneous cellular networks to withstand the data crunch. Nevertheless, these options imply new CAPEX and OPEX costs, extensive backhaul support, and contract plan incentives for D2D. A number of interesting tradeoffs, relating to performance and costs, arise thus for the operator. In this paper, we analytically investigate the extent to which local storage and communication through “edge” nodes could help offload traffic in a heterogeneous network (HetNet). We propose a model that can capture generic HetNet setups (comprising small cells, D2D communication, delayed delivery schemes, transmission costs, etc.). We analyse (a) the offloading performance and (b) the costs involved for the operator, and derive simple closed-form expressions as a function of the network parameters. Our results can be useful in performance evaluation and optimization of offloading and caching strategies, network dimensioning, pricing policies, etc.","PeriodicalId":110653,"journal":{"name":"2017 13th Annual Conference on Wireless On-demand Network Systems and Services (WONS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126820508","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}
{"title":"An alternative congestion control using an enhanced contention based forwarding for vehicular networks","authors":"Thiwiza Bellache, O. Shagdar, S. Tohmé","doi":"10.1109/WONS.2017.7888763","DOIUrl":"https://doi.org/10.1109/WONS.2017.7888763","url":null,"abstract":"Many ITS (Intelligent Transportation Systems) applications require multi-hop forwarding of Decentralised Event Notification Message (DENM). If not well designed, multi-hop forwarding algorithms provide negative impact on the IEEE 802.11p vehicular systems, which already suffer from channel congestion caused by e.g., Cooperative Awareness Messages (CAM). In this paper, we propose an enhancement of the contention based forwarding (CBF) by a congestion control functionality. Specifically, we propose CBF2C packet forwarding algorithm, which is designed to fit into the distributed congestion control (DCC) framework specified by ETSI. In order to efficiently utilise the channel, CBF2C adapts retransmission count based on channel load status. Extensive simulation evaluations on communication performances and channel utilisation are carried out targeting scenarios, where the wireless channel is shared by DENM and CAM packets. The performances of CBF2C is compared against those of an enhanced flooding and an ETSI-standardised scheme, CBF-RT. Moreover, two cases, with and without congestion control on the CAM rate, are considered in the performance evaluations. The simulation results show a positive impact of the dual DCC, CAM rate control at the facilities layer and DENM retransmission count control at the networking layer.","PeriodicalId":110653,"journal":{"name":"2017 13th Annual Conference on Wireless On-demand Network Systems and Services (WONS)","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129376129","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}
{"title":"Designing sensor networks to protect primary users in spectrum access systems","authors":"Matthew A. Clark, K. Psounis","doi":"10.1109/WONS.2017.7888767","DOIUrl":"https://doi.org/10.1109/WONS.2017.7888767","url":null,"abstract":"In response to increasing demand on the radio frequency spectrum, regulators are implementing new spectrum access systems to share spectrum among diverse users. These systems leverage cognitive radio concepts to automatically identify suitable spectrum for users, avoiding harmful interference with higher priority users. An infrastructure of spectrum sensors is a key component of the spectrum access system, providing the means for the system to identify necessary protections. The geolocation precision of the sensing system will be limited in practice due to privacy concerns of the priority users as well as cost limitations. In this work, we examine the design options for the sensing component of a spectrum access system in terms of user performance and privacy. We apply machine learning techniques to treat the problem of estimating the priority users' state from sensor measurements, finding that the geolocation precision is closely tied to the density of the sensor deployment, and that the secondary user performance degrades rapidly if the density is too low, highlighting a tradeoff between priority user privacy and secondary user performance.","PeriodicalId":110653,"journal":{"name":"2017 13th Annual Conference on Wireless On-demand Network Systems and Services (WONS)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134423653","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}
Lars Baumgärtner, Pablo Graubner, Jonas Höchst, A. Klein, Bernd Freisleben
{"title":"Speak less, hear enough: On dynamic announcement intervals in wireless on-demand networks","authors":"Lars Baumgärtner, Pablo Graubner, Jonas Höchst, A. Klein, Bernd Freisleben","doi":"10.1109/WONS.2017.7888768","DOIUrl":"https://doi.org/10.1109/WONS.2017.7888768","url":null,"abstract":"Several protocols used in wireless networks rely on nodes announcing information to other nodes. This can be illustrated by service announcements sent in ZeroConf, routing announcements used in OLSR, and peer announcements in wireless peer-to-peer or delay-tolerant networking systems such as Forban and Serval. The main problem is that these protocols use fixed time intervals between subsequent broadcast announcements. Fixed intervals can either lead to high network load (if the announcement interval is too short) or delay the distribution of information between peers (if the announcement interval is too long). Repeatedly broadcasting announcements after fixed intervals also has an impact on the energy consumption of mobile devices operating in wireless networks. In this paper, we present several approaches to realize dynamic announcement intervals that facilitate fast reception from at least one other node while trying to keep the overall communication overhead as low as possible. Experimental results in terms of performance properties and energy consumption are presented to illustrate the benefits of dynamic announcement intervals in wireless on-demand networks.","PeriodicalId":110653,"journal":{"name":"2017 13th Annual Conference on Wireless On-demand Network Systems and Services (WONS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129516556","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}
{"title":"Ensuring quality services on WiFi networks for offloaded cellular traffic","authors":"G. Pibiri, Ciarán Mc Goldrick, M. Huggard","doi":"10.1109/WONS.2017.7888766","DOIUrl":"https://doi.org/10.1109/WONS.2017.7888766","url":null,"abstract":"One of the more obvious ways to reduce the volume of data traffic on cellular networks is through the use of handover to fixed networks via WiFi and other radio channels. With the growing focus on emerging 5G concepts and technologies, there has been a corresponding focus on the functional mechanisms needed to achieve this handover in a timely fashion. Much less attention has been paid to the practicalities, in terms of ensuring that the end-user experiences little or no loss in the quality of their network services when the handover occurs. In this paper, a methodology for managing such handover traffic in a WiFi network is proposed. The approach integrates and leverages aspects of three quality control mechanisms to enable stable, higher quality delivery of enhanced WiFi network services. It combines i) information adduced from a theoretical model with ii) a low complexity Quality of Experience metric that is quick and easy to estimate and iii) a queue management scheme.","PeriodicalId":110653,"journal":{"name":"2017 13th Annual Conference on Wireless On-demand Network Systems and Services (WONS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124075298","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}