Nowadays, many base stations (BSs) are equipped with batteries to provide services even during blackouts due to severe events such as disasters. In this paper, we propose a scheduling algorithm to adjust cell sizes, aka cell zooming, of battery-operated BSs in order for efficient use of energy. Our goal is to balance the tradeoff between user coverage and battery lifetime. For this purpose, we define the energy efficiency as user coverage per energy and maximize the efficiency under the assumption that future user distribution is roughly given. We propose a greedy algorithm to solve the problem that is formulated as an integer linear programming problem. The simulation results show that user coverage increases by 17% compared with the case without cell zooming.
{"title":"A Scheduling Algorithm of Cell Zooming for Energy Efficiency in Disasters","authors":"A. Uchiyama, K. Kitada, T. Higashino","doi":"10.1145/2810362.2810369","DOIUrl":"https://doi.org/10.1145/2810362.2810369","url":null,"abstract":"Nowadays, many base stations (BSs) are equipped with batteries to provide services even during blackouts due to severe events such as disasters. In this paper, we propose a scheduling algorithm to adjust cell sizes, aka cell zooming, of battery-operated BSs in order for efficient use of energy. Our goal is to balance the tradeoff between user coverage and battery lifetime. For this purpose, we define the energy efficiency as user coverage per energy and maximize the efficiency under the assumption that future user distribution is roughly given. We propose a greedy algorithm to solve the problem that is formulated as an integer linear programming problem. The simulation results show that user coverage increases by 17% compared with the case without cell zooming.","PeriodicalId":332932,"journal":{"name":"Proceedings of the 13th ACM International Symposium on Mobility Management and Wireless Access","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124277674","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}
In this paper we present a new class of MAC protocols for wireless LANs based on sharing of transmission intentions. We develop an example protocol implementation based on distributed, co-operative scheduling of data frames. Schedules are non-binding, requiring minimal negotiation between nodes. The protocol is implemented on top of standard 802.11 so that backwards compatibility with legacy nodes is maintained. We have developed efficient algorithms to merge multiple schedules from neighbouring nodes and find suitable gaps in which to schedule a given node's frames. To test the protocol's performance, we conducted simulation studies using OMNeT++. Our results show that our protocol achieves higher throughput and lower delay than 802.11 under high offered loads, and eliminates frame collisions.
{"title":"Intention Sharing for Medium Access Control in Wireless LANs","authors":"Emma Fitzgerald, S. Bastani, B. Landfeldt","doi":"10.1145/2810362.2810367","DOIUrl":"https://doi.org/10.1145/2810362.2810367","url":null,"abstract":"In this paper we present a new class of MAC protocols for wireless LANs based on sharing of transmission intentions. We develop an example protocol implementation based on distributed, co-operative scheduling of data frames. Schedules are non-binding, requiring minimal negotiation between nodes. The protocol is implemented on top of standard 802.11 so that backwards compatibility with legacy nodes is maintained. We have developed efficient algorithms to merge multiple schedules from neighbouring nodes and find suitable gaps in which to schedule a given node's frames. To test the protocol's performance, we conducted simulation studies using OMNeT++. Our results show that our protocol achieves higher throughput and lower delay than 802.11 under high offered loads, and eliminates frame collisions.","PeriodicalId":332932,"journal":{"name":"Proceedings of the 13th ACM International Symposium on Mobility Management and Wireless Access","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121616833","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}
Vehicular safety applications are based on broadcasting of safety messages to the neighboring vehicles. As LTE is an infrastructure-based network, vehicles cannot broadcast their safety messages directly to their neighbors; thus, all messages should pass through the infrastructure. However, these messages may congest the network and lead to high delays for some vehicles. Furthermore, in vehicular safety applications, faster vehicles are more sensitive to delay, since their positions change more frequently than slower vehicles within the same time frame. Therefore faster vehicles should be assigned a higher priority to send messages in order to have low delay. Existing LTE schedulers do not consider this factor when allocating resources. This leads to high delays and unacceptable position errors for faster vehicles. In this paper we propose a Speed and Location Aware (SLA) scheduler for LTE which is suitable for vehicular applications. SLA scheduler considers the speed and location of vehicles in order to assign priorities for resource allocation. Faster vehicles receive priority for the allocation of Physical Resource Blocks (PRB). Simulation results show that SLA scheduler outperforms existing algorithms by preventing high delays and large position errors for faster vehicles.
{"title":"SLA: Speed and Location Aware LTE Scheduler for Vehicular Safety Applications","authors":"Hossein Soleimani, A. Boukerche","doi":"10.1145/2810362.2810366","DOIUrl":"https://doi.org/10.1145/2810362.2810366","url":null,"abstract":"Vehicular safety applications are based on broadcasting of safety messages to the neighboring vehicles. As LTE is an infrastructure-based network, vehicles cannot broadcast their safety messages directly to their neighbors; thus, all messages should pass through the infrastructure. However, these messages may congest the network and lead to high delays for some vehicles. Furthermore, in vehicular safety applications, faster vehicles are more sensitive to delay, since their positions change more frequently than slower vehicles within the same time frame. Therefore faster vehicles should be assigned a higher priority to send messages in order to have low delay. Existing LTE schedulers do not consider this factor when allocating resources. This leads to high delays and unacceptable position errors for faster vehicles. In this paper we propose a Speed and Location Aware (SLA) scheduler for LTE which is suitable for vehicular applications. SLA scheduler considers the speed and location of vehicles in order to assign priorities for resource allocation. Faster vehicles receive priority for the allocation of Physical Resource Blocks (PRB). Simulation results show that SLA scheduler outperforms existing algorithms by preventing high delays and large position errors for faster vehicles.","PeriodicalId":332932,"journal":{"name":"Proceedings of the 13th ACM International Symposium on Mobility Management and Wireless Access","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127944334","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}
The country of Luxembourg possesses a road network topology that provides direct highway connectivities to its three neighbouring countries. Its economic strength attracts cross-border commuters who represent approximately half of the work force in Luxembourg. As a consequence, significant flows of vehicles coming from France, Germany and Belgium significantly contribute to the daily traffic load distribution of Luxembourg. In this paper we propose to analyse the mobility of drivers in Luxembourg, as well as cross-border traffic. We use a loop detector traffic dataset, based on the road traffic counting architecture of Ponts et Chaussées (PCH) recorded in 2010. We propose to describe the behaviour of drivers in the spatial and time domains for the Luxembourg use case. Our first contribution is the analysis of the daily traffic demand profile of each counter and their classification into inbound, outbound and neutral profiles. The evaluation of these demand profiles will help to better understand and meet the actual demand of commuters. Our second contribution is the detection of inbound and outbound anomalies and the analysis of typical cross-border traffic characteristics in Luxembourg.
卢森堡拥有一个路网拓扑结构，为其三个邻国提供了直接的公路连接。它的经济实力吸引了跨境通勤者，他们约占卢森堡劳动力的一半。因此，来自法国、德国和比利时的大量车辆大大增加了卢森堡的每日交通负荷分布。在本文中，我们建议分析卢森堡司机的流动性，以及跨境交通。我们使用了一个环路检测器交通数据集，该数据集基于2010年记录的Ponts et chausssames (PCH)的道路交通计数架构。我们建议在卢森堡用例的空间和时间域描述驾驶员的行为。我们的第一个贡献是分析每个柜台的每日交通需求概况，并将其分为入境，出境和中性概况。对这些需求概况的评估，有助我们更了解和切合乘客的实际需求。我们的第二个贡献是对入境和出境异常的检测以及对卢森堡典型跨境交通特征的分析。
{"title":"Asymmetry Analysis of Inbound/Outbound Car Traffic Load distribution in Luxembourg","authors":"F. Melakessou, Thierry Derrmann, T. Engel","doi":"10.1145/2810362.2810374","DOIUrl":"https://doi.org/10.1145/2810362.2810374","url":null,"abstract":"The country of Luxembourg possesses a road network topology that provides direct highway connectivities to its three neighbouring countries. Its economic strength attracts cross-border commuters who represent approximately half of the work force in Luxembourg. As a consequence, significant flows of vehicles coming from France, Germany and Belgium significantly contribute to the daily traffic load distribution of Luxembourg. In this paper we propose to analyse the mobility of drivers in Luxembourg, as well as cross-border traffic. We use a loop detector traffic dataset, based on the road traffic counting architecture of Ponts et Chaussées (PCH) recorded in 2010. We propose to describe the behaviour of drivers in the spatial and time domains for the Luxembourg use case. Our first contribution is the analysis of the daily traffic demand profile of each counter and their classification into inbound, outbound and neutral profiles. The evaluation of these demand profiles will help to better understand and meet the actual demand of commuters. Our second contribution is the detection of inbound and outbound anomalies and the analysis of typical cross-border traffic characteristics in Luxembourg.","PeriodicalId":332932,"journal":{"name":"Proceedings of the 13th ACM International Symposium on Mobility Management and Wireless Access","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132040842","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":"Proceedings of the 13th ACM International Symposium on Mobility Management and Wireless Access","authors":"","doi":"10.1145/2810362","DOIUrl":"https://doi.org/10.1145/2810362","url":null,"abstract":"","PeriodicalId":332932,"journal":{"name":"Proceedings of the 13th ACM International Symposium on Mobility Management and Wireless Access","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126539506","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：