Pub Date : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583460
Alexandros Palaios, Janne Riihijärvi, P. Mähönen, P. V. Wesemael, M. Desmet, A. Dejonghe
We present results from the comparison of measurements between dedicated embedded spectrum sensing chip targeting low-cost and low-power applications and a high-end spectrum analyzer. We use different signal types, including actual spectrum usage measured simultaneously with the two devices. We analyze the typical problems such devices suffer from. Finally we also study how to estimate the spectrum sensing results once the device type is taken into account.
{"title":"Performance evaluation of single-chip spectrum sensing platform for portable spectrum measurements","authors":"Alexandros Palaios, Janne Riihijärvi, P. Mähönen, P. V. Wesemael, M. Desmet, A. Dejonghe","doi":"10.1109/WoWMoM.2013.6583460","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583460","url":null,"abstract":"We present results from the comparison of measurements between dedicated embedded spectrum sensing chip targeting low-cost and low-power applications and a high-end spectrum analyzer. We use different signal types, including actual spectrum usage measured simultaneously with the two devices. We analyze the typical problems such devices suffer from. Finally we also study how to estimate the spectrum sensing results once the device type is taken into account.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124389654","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}
Pub Date : 2013-06-04DOI: 10.1109/wowmom.2013.6583420
C. Brandolese, W. Fornaciari, L. Rucco
This paper proposes and studies an hibernation technique and optimal hibernation policies aimed at minimizing the power consumption, while allowing stateful processing and the adoption of more powerful nodes. To this purpose the paper models the energy trade-off for hibernating the system rather than putting it in a memory-retention sleep mode between two consecutive bursts of processing. Thanks to a simplified notion of system state, the paper formally determines the optimal conditions for deciding whether to hibernate or not the system during idle periods. Hibernation policies have been implemented as a module of the operating system and results demonstrate energy savings up to 50% compared to trivial hibernation approaches. Moreover, the hibernation policy proved to be robust and stable with respect to changes of the application parameters.
{"title":"Optimal hibernation policies for energy efficient stateful operation in high-end wireless sensor nodes","authors":"C. Brandolese, W. Fornaciari, L. Rucco","doi":"10.1109/wowmom.2013.6583420","DOIUrl":"https://doi.org/10.1109/wowmom.2013.6583420","url":null,"abstract":"This paper proposes and studies an hibernation technique and optimal hibernation policies aimed at minimizing the power consumption, while allowing stateful processing and the adoption of more powerful nodes. To this purpose the paper models the energy trade-off for hibernating the system rather than putting it in a memory-retention sleep mode between two consecutive bursts of processing. Thanks to a simplified notion of system state, the paper formally determines the optimal conditions for deciding whether to hibernate or not the system during idle periods. Hibernation policies have been implemented as a module of the operating system and results demonstrate energy savings up to 50% compared to trivial hibernation approaches. Moreover, the hibernation policy proved to be robust and stable with respect to changes of the application parameters.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116007360","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}
Pub Date : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583501
Tayeb Lemlouma, Sébastien Laborie, P. Roose
In this work, we propose a framework for automatic dependency evaluation that can notify the changes of the elderly dependency, hence providing persons with required services in time. In order to validate our approach, we target the French dependent population. Especially, we focus our proposal on the AGGIR dependency model used in the French medical field. Our objective is to provide a flexible architecture and an extensible model linked to opened data that can refer to a wide variety of services (hardware sensors and software; simple or composed services).
{"title":"Toward a context-aware and automatic evaluation of elderly dependency in smart homes and cities","authors":"Tayeb Lemlouma, Sébastien Laborie, P. Roose","doi":"10.1109/WoWMoM.2013.6583501","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583501","url":null,"abstract":"In this work, we propose a framework for automatic dependency evaluation that can notify the changes of the elderly dependency, hence providing persons with required services in time. In order to validate our approach, we target the French dependent population. Especially, we focus our proposal on the AGGIR dependency model used in the French medical field. Our objective is to provide a flexible architecture and an extensible model linked to opened data that can refer to a wide variety of services (hardware sensors and software; simple or composed services).","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126367686","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}
Pub Date : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583411
Yunsheng Wang, Jie Wu
A mobile opportunistic social network (MOSN) is a new type of delay tolerant network (DTN), in which the mobile users contact each other opportunistically. Information dissemination is a challenging problem in MOSNs, due to uncertainty and intermittent connectivity. In this paper, we propose a distributed social tie strength calculation mechanism to identify the relationship between each set of pairwise mobile nodes. Following arguments originally proposed by Mark Granovetter's seminal 1973 paper, The Strength of Weak Ties, the majority of the novel information dissemination is generated by weak ties. We first evaluate the strength of weak ties in MIT reality mining data. Then, a social-tie-based information dissemination protocol is presented, which is a token-based information dissemination scheme, including two phases: weak tie-driven forwarding and strong tie-driven forwarding. In the weak tie-driven forwarding phase, the susceptible nodes with more weak ties will receive more tokens for future forwarding. The number of forwarding tokens is related to the number of weak ties of two encountered nodes. After a while, the information will have been spread to multiple communities. Our scheme switches to a strong tie driven forwarding phase, in which the influential nodes are more important. The number of forwarding tokens is proportional to the number of strong ties of two encountered nodes. Extensive simulations are conducted in comparison to several approaches in real world mobile traces.
移动机会主义社交网络(MOSN)是一种新型的容忍延迟网络(DTN)，在这种网络中，移动用户之间的联系是机会主义的。由于不确定性和间歇性连接，在mosn中信息传播是一个具有挑战性的问题。在本文中，我们提出了一种分布式社会联系强度计算机制来识别每组成对移动节点之间的关系。根据Mark Granovetter 1973年开创性论文《弱联系的强度》(The Strength of Weak Ties)最初提出的论点，大多数新信息传播是由弱联系产生的。我们首先评估MIT现实挖掘数据中弱联系的强度。然后，提出了一种基于社会联系的信息传播协议，即基于令牌的信息传播方案，包括弱联系驱动转发和强联系驱动转发两个阶段。在弱联系驱动的转发阶段，弱联系越多的敏感节点将获得更多的令牌用于未来的转发。转发令牌的数量与两个遇到的节点的弱连接的数量有关。一段时间后，这些信息就会传播到多个社区。我们的方案切换到强联系驱动的转发阶段，其中有影响力的节点更加重要。转发令牌的数量与两个遇到的节点的强连接数量成正比。广泛的模拟进行了比较，几种方法在现实世界的移动轨迹。
{"title":"Social-tie-based information dissemination in mobile opportunistic social networks","authors":"Yunsheng Wang, Jie Wu","doi":"10.1109/WoWMoM.2013.6583411","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583411","url":null,"abstract":"A mobile opportunistic social network (MOSN) is a new type of delay tolerant network (DTN), in which the mobile users contact each other opportunistically. Information dissemination is a challenging problem in MOSNs, due to uncertainty and intermittent connectivity. In this paper, we propose a distributed social tie strength calculation mechanism to identify the relationship between each set of pairwise mobile nodes. Following arguments originally proposed by Mark Granovetter's seminal 1973 paper, The Strength of Weak Ties, the majority of the novel information dissemination is generated by weak ties. We first evaluate the strength of weak ties in MIT reality mining data. Then, a social-tie-based information dissemination protocol is presented, which is a token-based information dissemination scheme, including two phases: weak tie-driven forwarding and strong tie-driven forwarding. In the weak tie-driven forwarding phase, the susceptible nodes with more weak ties will receive more tokens for future forwarding. The number of forwarding tokens is related to the number of weak ties of two encountered nodes. After a while, the information will have been spread to multiple communities. Our scheme switches to a strong tie driven forwarding phase, in which the influential nodes are more important. The number of forwarding tokens is proportional to the number of strong ties of two encountered nodes. Extensive simulations are conducted in comparison to several approaches in real world mobile traces.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127729604","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}
Pub Date : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583441
Victor Ramiro, E. Lochin, P. Sénac, T. Rakotoarivelo
Compared to wired networks, Delay/Disruption Tolerant Networks (DTN) are challenging to monitor due to their lack of infrastructure and the absence of end-to-end paths. This work studies the feasibility, limits and convergence of monitoring such DTNs. More specifically, we focus on the efficient monitoring of intercontact time distribution (ICT) between DTN participants. Our contribution is two-fold. First we propose two schemes to sample data using monitors deployed within the DTN. In particular, we sample and estimate the ICT distribution. Second, we evaluate this scheme over both simulated DTN networks and real DTN traces. Our initial results show that (i) there is a high correlation between the quality of sampling and the sampled mobility type, and (ii) the number and placement of monitors impact the estimation of the ICT distribution of the whole DTN.
{"title":"On the limits of DTN monitoring","authors":"Victor Ramiro, E. Lochin, P. Sénac, T. Rakotoarivelo","doi":"10.1109/WoWMoM.2013.6583441","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583441","url":null,"abstract":"Compared to wired networks, Delay/Disruption Tolerant Networks (DTN) are challenging to monitor due to their lack of infrastructure and the absence of end-to-end paths. This work studies the feasibility, limits and convergence of monitoring such DTNs. More specifically, we focus on the efficient monitoring of intercontact time distribution (ICT) between DTN participants. Our contribution is two-fold. First we propose two schemes to sample data using monitors deployed within the DTN. In particular, we sample and estimate the ICT distribution. Second, we evaluate this scheme over both simulated DTN networks and real DTN traces. Our initial results show that (i) there is a high correlation between the quality of sampling and the sampled mobility type, and (ii) the number and placement of monitors impact the estimation of the ICT distribution of the whole DTN.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126134831","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}
Pub Date : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583492
P. Tilanus, B. Ran, M. Faeth, Dimitris Kelaidonis, V. Stavroulaki
Today there are more sensors and actuators in isolated intranets of things than in the overall internet of things (IoT). This paper discusses the motives to open up an intranet of things and make the things part of the global IoT, identifies the requirements from the involved parties, and extracts the essential architectural implications from these requirements. The proposed solution comprises the definition and control of Access Rights to the discovery and use of Virtual Objects (VO). This approach builds upon the widely accepted view that Virtual Objects serve as digital representation and gateway to Real World Objects (sensors, actuators, etc), and where VO databases serve to find these virtual counterparts. The Access Rights determine not only who may use a function of a Virtual Object and the conditions for that access, but also determine their discoverability when searching the database of virtual objects counterparts. Access Rights solve important requirements for security, privacy, and accountability, that are prerequisite to the expected economic and innovation benefits of an internet of things across organisational domains. Since verification of Access Rights to a VO plays a central role in the deployment of the IoT the scalable implementation with semantic technologies remains a challenge.
{"title":"Virtual Object access rights to enable multi-party use of sensors","authors":"P. Tilanus, B. Ran, M. Faeth, Dimitris Kelaidonis, V. Stavroulaki","doi":"10.1109/WoWMoM.2013.6583492","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583492","url":null,"abstract":"Today there are more sensors and actuators in isolated intranets of things than in the overall internet of things (IoT). This paper discusses the motives to open up an intranet of things and make the things part of the global IoT, identifies the requirements from the involved parties, and extracts the essential architectural implications from these requirements. The proposed solution comprises the definition and control of Access Rights to the discovery and use of Virtual Objects (VO). This approach builds upon the widely accepted view that Virtual Objects serve as digital representation and gateway to Real World Objects (sensors, actuators, etc), and where VO databases serve to find these virtual counterparts. The Access Rights determine not only who may use a function of a Virtual Object and the conditions for that access, but also determine their discoverability when searching the database of virtual objects counterparts. Access Rights solve important requirements for security, privacy, and accountability, that are prerequisite to the expected economic and innovation benefits of an internet of things across organisational domains. Since verification of Access Rights to a VO plays a central role in the deployment of the IoT the scalable implementation with semantic technologies remains a challenge.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116591864","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}
Pub Date : 2013-06-04DOI: 10.1109/WOWMOM.2013.6583449
Vangelis Angelakis, A. Capone, Alexandros G. Fragkiadakis, S. Napoli, Stefanos Papadakis, G. Perantinos, Vassilis Spitadakis, E. Tragos, D. Yuan
The MESH-WISE project is aiming to address key fundamental issues in wireless mesh networking that span from fundamental performance characterization to prototyping heterogeneous-access mesh networking solutions for emergency response scenarios. In this paper we present the infrastructures that will be leveraged in this project and the latest results that have been acquired from the ones that are deployed. We further discuss the state of the art in academic and industrial resource and network management platforms and discuss how we will use existing know-how towards a centralized solution.
{"title":"Experience from testbeds and management platforms towards mesh networking with heterogeneous wireless access","authors":"Vangelis Angelakis, A. Capone, Alexandros G. Fragkiadakis, S. Napoli, Stefanos Papadakis, G. Perantinos, Vassilis Spitadakis, E. Tragos, D. Yuan","doi":"10.1109/WOWMOM.2013.6583449","DOIUrl":"https://doi.org/10.1109/WOWMOM.2013.6583449","url":null,"abstract":"The MESH-WISE project is aiming to address key fundamental issues in wireless mesh networking that span from fundamental performance characterization to prototyping heterogeneous-access mesh networking solutions for emergency response scenarios. In this paper we present the infrastructures that will be leveraged in this project and the latest results that have been acquired from the ones that are deployed. We further discuss the state of the art in academic and industrial resource and network management platforms and discuss how we will use existing know-how towards a centralized solution.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116917286","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}
Pub Date : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583428
Maneesha Sharma
The availability of Channel State Information (CSI) at the transmitter in Multi User -Multiple Input Multiple Output (MU-MIMO) has been a popular research topic in recent years. The CSI makes it possible to adapt transmissions to current channel conditions, which is crucial for achieving reliable communication with high data rates in multi antenna systems. Basically there are two methods that allow the transmitter to obtain CSI from the receiver. This paper highlights both of these mechanisms and presents the basis of a novel feedback mechanism that efficiently provides the transmitter with minimum CSI to allow knowledge of a rapidly changing channel at the transmitter end of a MU-MIMO system. Preliminary simulation results show that channel capacity in a 4 × 4 MIMO system increases by up to 20% with the availability of CSI at the transmitter.
{"title":"Novel adaptive Channel State Information feedback for multiuser MIMO in wireless broadband communications","authors":"Maneesha Sharma","doi":"10.1109/WoWMoM.2013.6583428","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583428","url":null,"abstract":"The availability of Channel State Information (CSI) at the transmitter in Multi User -Multiple Input Multiple Output (MU-MIMO) has been a popular research topic in recent years. The CSI makes it possible to adapt transmissions to current channel conditions, which is crucial for achieving reliable communication with high data rates in multi antenna systems. Basically there are two methods that allow the transmitter to obtain CSI from the receiver. This paper highlights both of these mechanisms and presents the basis of a novel feedback mechanism that efficiently provides the transmitter with minimum CSI to allow knowledge of a rapidly changing channel at the transmitter end of a MU-MIMO system. Preliminary simulation results show that channel capacity in a 4 × 4 MIMO system increases by up to 20% with the availability of CSI at the transmitter.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"53 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114042094","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}
Pub Date : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583475
Sascha Gübner, C. Lindemann
Recently, two trends in wireless communication are observable. First, traffic patterns tend to be unsaturated, due to an enormous increase of traffic types like mobile video and voice streaming. Second, new standards like IEEE 802.11n or IEEE 802.11ac allow huge physical data rates up to several Gbit/s. However, to utilize these data rates an efficient usage of the new frame aggregation feature is necessary. We formulate an analytical model that captures the impact of frame aggregation on routing and transform it into an integer linear program. Furthermore, we propose a heuristic approach that simplifies the computational complexity and show both through extensive simulations and real-world testbed experiments that an aggregation-aware routing scheme helps to efficiently aggregate several unsaturated flows and leads to decreased end-to-end delay and decreased contention in wireless multi-hop networks.
{"title":"Aggregation-aware routing in wireless multi-hop networks with frame aggregation","authors":"Sascha Gübner, C. Lindemann","doi":"10.1109/WoWMoM.2013.6583475","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583475","url":null,"abstract":"Recently, two trends in wireless communication are observable. First, traffic patterns tend to be unsaturated, due to an enormous increase of traffic types like mobile video and voice streaming. Second, new standards like IEEE 802.11n or IEEE 802.11ac allow huge physical data rates up to several Gbit/s. However, to utilize these data rates an efficient usage of the new frame aggregation feature is necessary. We formulate an analytical model that captures the impact of frame aggregation on routing and transform it into an integer linear program. Furthermore, we propose a heuristic approach that simplifies the computational complexity and show both through extensive simulations and real-world testbed experiments that an aggregation-aware routing scheme helps to efficiently aggregate several unsaturated flows and leads to decreased end-to-end delay and decreased contention in wireless multi-hop networks.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114138191","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}
Pub Date : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583380
Vincenzo Sciancalepore, V. Mancuso, A. Banchs
The increasing demand for higher data rates in cellular network results in increasing network density. As a consequence, inter-cell interference is becoming the most serious obstacle towards spectral efficiency. Therefore, considering that radio resources are limited and expensive, new techniques are required for efficient radio resource allocation in next generation cellular networks. In this paper, we propose a pure frequency reuse 1 scheme based on base station scheduling rather than the commonly adopted user scheduling. In particular, we formulate a base station scheduling problem to determine which base stations can be scheduled to simultaneously transmit, without causing excessive interference to any user of any of the scheduled base stations. We show that finding the optimal base station scheduling is NP-hard, and formulate the BASICS (BAse Station Inter-Cell Scheduling) algorithm, a novel heuristic to approximate the optimal solution at low complexity cost. The proposed algorithm is in line with the ABSF (almost blank sub-frame) technique recently standardized at the 3GPP. By means of numerical and packet-level simulations, we prove the effectiveness and superiority of BASICS as compared to the state of the art of inter-cell interference mitigation schemes.
蜂窝网络对更高数据速率的需求日益增长，导致网络密度不断增加。因此，小区间干扰成为提高频谱效率的最严重障碍。因此，考虑到无线资源的有限和昂贵，下一代蜂窝网络需要新的技术来有效地分配无线资源。本文提出了一种基于基站调度的纯频率复用方案，取代了常用的用户调度方案。特别是，我们制定了一个基站调度问题，以确定哪些基站可以被调度同时发射，而不会对任何调度基站的任何用户造成过多的干扰。我们证明了寻找最优基站调度是np困难的，并提出了一种新的启发式算法BASICS (base station Inter-Cell scheduling)，以低复杂度成本近似最优解。提出的算法符合最近在3GPP标准化的ABSF(几乎空白子帧)技术。通过数值和分组级仿真，我们证明了BASICS与现有小区间干扰缓解方案相比的有效性和优越性。
{"title":"BASICS: Scheduling base stations to mitigate interferences in cellular networks","authors":"Vincenzo Sciancalepore, V. Mancuso, A. Banchs","doi":"10.1109/WoWMoM.2013.6583380","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583380","url":null,"abstract":"The increasing demand for higher data rates in cellular network results in increasing network density. As a consequence, inter-cell interference is becoming the most serious obstacle towards spectral efficiency. Therefore, considering that radio resources are limited and expensive, new techniques are required for efficient radio resource allocation in next generation cellular networks. In this paper, we propose a pure frequency reuse 1 scheme based on base station scheduling rather than the commonly adopted user scheduling. In particular, we formulate a base station scheduling problem to determine which base stations can be scheduled to simultaneously transmit, without causing excessive interference to any user of any of the scheduled base stations. We show that finding the optimal base station scheduling is NP-hard, and formulate the BASICS (BAse Station Inter-Cell Scheduling) algorithm, a novel heuristic to approximate the optimal solution at low complexity cost. The proposed algorithm is in line with the ABSF (almost blank sub-frame) technique recently standardized at the 3GPP. By means of numerical and packet-level simulations, we prove the effectiveness and superiority of BASICS as compared to the state of the art of inter-cell interference mitigation schemes.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132314465","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
扫码关注我们
求助内容：
应助结果提醒方式：