Ying Wang, Xiangming Dai, Jason Min Wang, B. Bensaou
{"title":"Potential Game based Energy Efficient Resource Allocation in HeNB Networks","authors":"Ying Wang, Xiangming Dai, Jason Min Wang, B. Bensaou","doi":"10.1145/2811587.2811589","DOIUrl":"https://doi.org/10.1145/2811587.2811589","url":null,"abstract":"Powering an individual LTE femtocell base station, or Home eNodeB (HeNB) in the LTE jargon, requires relatively very little energy. It is only when HeNBs are deployed massively, as has happened in the past few years, that energy efficiency becomes an important issue. With large numbers of co-located HeNBs and the increased inter-cell interference resource utilization becomes highly inefficient resulting in a high unnecessary energy consumption. To tackle this problem, coordination techniques could be invoked by the network operator to consolidate the offered workload to the network on as few HeNBs as possible and power down idle ones. Recognizing, however, that such techniques usually impair user-perceived quality of service (QoS), especially with bursty traffic, more sophisticated methods need to be investigated to also consider QoS. Despite the volume of prior work, the key issue -- viz. simultaneously reducing energy waste, increasing bandwidth utilization while guaranteeing user-perceived QoS -- has not been properly considered so far. In this paper, we model the trade-off between energy efficiency and QoS preservation by manipulating user equipment (UE) association and OFDMA scheduling in controlled networks of HeNBs. The problem being NP-hard, we propose two distributed learning algorithms, within a potential game-based framework, to obtain good and fast solutions to the problem. We demonstrate via numerical results the effectiveness of the proposed algorithms in achieving better performance in terms of utility, power, energy efficiency, convergence speed, and complexity compared to other alternatives.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125333872","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}
Felipe S. Dantas Silva, A. Neto, D. Maciel, José Castillo Lema, Flávio de Oliveira Silva, P. F. Rosa
{"title":"SDN Based Control Plane Extensions for Mobility Management Improvement in Next Generation ETArch Networks","authors":"Felipe S. Dantas Silva, A. Neto, D. Maciel, José Castillo Lema, Flávio de Oliveira Silva, P. F. Rosa","doi":"10.1145/2811587.2811632","DOIUrl":"https://doi.org/10.1145/2811587.2811632","url":null,"abstract":"Mobility support is a requirement in next generation networks. The entity Title Architecture (ETArch) is a clean-slate network architecture that uses a naming and addressing scheme based on the Title and has a natural match with Software Defined Networking (SDN) paradigm. ETArch aims at satisfying applications requirements such as mobility. On a previous work, we demonstrated the use of ETArch in order to keep ongoing sessions during handover with no packet loss. The initial approach however, performed the handover without taking into account QoS guarantees during the selection of new Point of Attachments (PoAs). This work proposes an extension to the legacy ETArch Mobility Manager, called Quality-oriented Mobility Management Approach (QoMMA), to support a quality-oriented handover management. This extension enables a network-initiated mobility control that improves resources allocation and execute a quality-oriented access point selection. The QoMMA also performs a mobility load balancing in order to maximize admissions of mobile sessions in conditions of congestion. The evaluations were carried out on a testbed that considered real events, and provided evidence that the proposal outperforms legacy ETArch mobility control functionalities.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127927575","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":"Autoregressive Integrated Model for Time Synchronization in Wireless Sensor Networks","authors":"Wasif Masood, J. F. Schmidt","doi":"10.1145/2811587.2811591","DOIUrl":"https://doi.org/10.1145/2811587.2811591","url":null,"abstract":"Time synchronization is challenging in wireless sensor networks due to the use of low-precision oscillators and the limited computational capacity of resources limited sensor nodes. While several schemes exist, the performance analysis of a majority of them is based on simulations and fail to capture key features of real world deployments. This paper explores the use of autoregressive integrated moving average models to provide a general clock model for sensor nodes with low precision oscillators and limited computational power. Based on measurements with off-the-shelf sensor devices Z1, an autoregressive integrated model for time synchronization is proposed. We derive a synchronization scheme (ARI-Sync) based on this model and compare it against the well known Flooding Time Synchronization Protocol (FTSP) observing significantly improved accuracy, roughly doubling the resynchronization period of Z1 nodes for a typical wireless sensor network application.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132527793","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}
C. Angelopoulos, Julia Buwaya, Orestis Evangelatos, J. Rolim
{"title":"Traversal Strategies for Wireless Power Transfer in Mobile Ad-Hoc Networks","authors":"C. Angelopoulos, Julia Buwaya, Orestis Evangelatos, J. Rolim","doi":"10.1145/2811587.2811603","DOIUrl":"https://doi.org/10.1145/2811587.2811603","url":null,"abstract":"We investigate the problem of wireless power transfer in mobile ad-hoc networks. In particular we investigate which traversal strategy should a Mobile Charger follow in order to efficiently recharge agents that are randomly and dynamically moving inside an area of interest. We first formally define this problem as the Charger Traversal Decision Problem and prove its computational hardness. We then define a weighting function which evaluates several network parameters in order to prioritize the nodes during the charging process. Based on this function we define three traversal strategies for the MC; a global-knowledge strategy that uses an Integer Linear Program to optimize its trajectory; a global-knowledge strategy which tessellates the network area and prioritizes the charging process over each tile; a local-knowledge strategy that uses local network information collected and ferried distributively by the moving agents. We also evaluate two naive zero-knowledge strategies; a space-filling deterministic one in which the MC systematically sweeps the network area and a randomized one in which the MC performs a blind random walk. We evaluate these strategies both in homogeneous and heterogeneous agent distributions and for various network sizes with respect to number of alive nodes over time, energy distribution among the nodes over time and charging efficiency over distance traveled. Our findings indicate that in small networks network agnostic strategies are sufficient. However, as the network scales the use of local distributed network information achieves good performance-overhead trade-offs.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114584889","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":"Minimizing Access Delay for M2M Traffic in Multi-RAT HetNets","authors":"Prajwal Osti, S. Aalto, P. Lassila","doi":"10.1145/2811587.2811602","DOIUrl":"https://doi.org/10.1145/2811587.2811602","url":null,"abstract":"We study the cell selection techniques for M2M traffic between an LTE macrocell and WLAN femtocells in a heterogeneous network deployment scenario. With the dense deployment of femtocells (operating in WLAN), M2M traffic can primarily be served by them while the macrocell (operating in LTE) can be used by the machines in case of congestion in their own femtocell. We study various load balancing strategies that aid the machines to select a proper cell in such a multi-RAT heterogeneous network deployment scenario so that the access delay for the M2M traffic is minimized. In particular, we derive the optimal static policy of choosing between the WLAN femtocell and the LTE macrocell. In addition, we develop dynamic policies based on the information about the arrivals and the number of backlogged users, and compare their performance against each other and with the optimal static policy. Our results indicate that the potential gains from the dynamic policies can be significant. Moreover, simple backlog-based heuristics perform close to or better than the optimal static policy.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126056180","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":"The Effect of Emerging Traffic Patterns on High Speed Wireless LANs","authors":"Emma Fitzgerald, B. Landfeldt","doi":"10.1145/2811587.2811600","DOIUrl":"https://doi.org/10.1145/2811587.2811600","url":null,"abstract":"As average packet sizes in wireless networks shrink and data rates increase, the fundamental CSMA mechanism in the 802.11 protocol family is put under stress. With the emerging 802.11ax standard, the carrier sensing mechanism is lowering the efficiency of the protocol to the level of random access (ALOHA), and as future-generation 802.11 standards emerge, CSMA-based protocols will fall below this level. In this paper we make two main contributions to the literature. First, we will extend previous analysis to examine more closely the quality of the information obtained from channel sensing, in particular the probability of this information being incorrect and the correlation between true and sensed channel state. Second, we examine how to use this analysis to improve existing CSMA-based protocols, in particular the 802.11 protocol family.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133664757","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":"EasiPCC: Popularity-aware Collaborative Caching for Web Requests in Low-Duty-Cycle Sensor Networks","authors":"Chenying Hou, Dong Li, Li Cui","doi":"10.1145/2811587.2811626","DOIUrl":"https://doi.org/10.1145/2811587.2811626","url":null,"abstract":"The lightweight RESTful protocols, such as CoAP, have been proposed to provide web service on resource constrained devices. However, these devices normally operate in battery and work in sleeping mode most time to prolong lifetime. Consequently it is difficult to maintain persistent end-to-end connection and leads to the high access delay for web requests. In this paper, we propose a collaborative caching scheme to solve this problem. Initially we define sleep probability based on the feature of low-duty-cycle networks to decide what data to cache. Then we introduce the definition of node popularity, which focuses nodes that are on the request forwarding public paths and forward most web requests. A centralized algorithm is presented based on the theory of gravity center to find which nodes to cache. Finally, we propose a cache discovery method. Experiments show that our caching scheme significantly improves the performance of web data access in low-duty-cycle sensor networks.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"76 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132156962","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":"Phase-based Ranging of RFID Tags with Applications to Shopping Cart Localization","authors":"Jihoon Ryoo, Samir R Das","doi":"10.1145/2811587.2811620","DOIUrl":"https://doi.org/10.1145/2811587.2811620","url":null,"abstract":"In this work, we investigate the problem of localizing RFID tags using a ranging method used in frequency-modulated radars. The idea is to exploit the phase change of the tag response due to frequency changes that normally happen as the RFID reader frequency hops. We demonstrate the general feasibility of this technique in ranging standard RFID tags using commodity readers. We then use it for a localization application - localizing shopping carts in supermarket aisles. We show that the ranging and localization accuracies are very good (median errors 5cm and 10cm respectively) even at distances over 4m making the technique competitive with existing techniques that require more complex set up.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131663867","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":"Rendezvous In Cognitive Radio Ad-Hoc Networks With Channel Ranking","authors":"Md. Akbar Hossain, N. Sarkar","doi":"10.1145/2811587.2811607","DOIUrl":"https://doi.org/10.1145/2811587.2811607","url":null,"abstract":"In distributed cognitive radio (CR) networks, rendezvous (RDV) is one of the most critical issues. Due to the dynamic radio environment, achieving RDV on a predetermined common control channel (CCC) is a challenging task. Channel hopping (CH) provides an effective method to guarantee RDV in cognitive radio ad-hoc networks (CRAHNs). Most of the existing CH schemes utilize the channel quantity as an input to the family of mathematical concepts such as prime number theory, Chinese remainder theory (CRT), quorum system and combinatorial block design to achieve RDV. However, RDV on a channel is rather influenced by channel quality or CR user's preference on which it wants to achieve RDV on available channels. Based on this philosophy, a channel rank based torus quorum CH RDV protocol (TQCH) is proposed which finds a commonly available channel between a pair of CR nodes. We formulate the channel ranking as a linear optimisation problem based on the channel availability under collision constraints. A detailed mathematical formulation is derived to estimate the degree of overlap in terms of expected quorum overlap size. Simulation results show that the proposed TQCH scheme outperforms than that of other CH schemes in terms of average time-to-rendezvous (ATTR) and the degree of overlap in asymmetric channel scenario.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124282738","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}
Meriam Bouzouita, Y. H. Aoul, N. Zangar, G. Rubino, S. Tabbane
{"title":"Multiple Access Class Barring Factors Algorithm for M2M Communications in LTE-advanced Networks","authors":"Meriam Bouzouita, Y. H. Aoul, N. Zangar, G. Rubino, S. Tabbane","doi":"10.1145/2811587.2811624","DOIUrl":"https://doi.org/10.1145/2811587.2811624","url":null,"abstract":"The forecast dramatic growth, of the number of Machine-to-Machine (M2M) communications, challenges the traditional networks of Mobile Network Operators (MNO). In fact, a large number of devices may attempt simultaneously to access the base station, which may result in severe congestions at the random-access channel (RACH) level. To alleviate such congestion while regulating the M2M devices' opportunities to transmit, the Access Class Barring (ACB) process was proposed. In this article, we proposed a novel implementation of the ACB mechanism in the context of multiple M2M traffic classes. Based on a scheduling algorithm, we have applied a PID controller to adjust dynamically multiple ACB factors related to each class category, guaranteeing a number of devices around an optimal value that maximizes the Random Access (RA) success probability. The obtained results demonstrate the efficiency of the proposed mechanism by increasing the success probability and minimizing radio resources' underutilization with respect to each class priority.","PeriodicalId":371317,"journal":{"name":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115310900","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}