Pub Date : 2014-12-08DOI: 10.1109/GLOCOM.2014.7037237
M. Hussein, G. Jakllari, B. Paillassa
We address the problem of routing for extending the service life of satellites in Iridium-like LEO constellations. Satellites in LEO constellations can spend over 30% of their time under the earth's umbra, time during which they are powered by batteries. While the batteries are recharged by solar energy, the depth of discharge they reach during eclipse significantly affects their lifetime - and by extension, the service life of the satellites themselves. For batteries of the type that power Iridium satellites, a 15% increase to the depth of discharge can practically cut their service lives in half. We present two new routing metrics - LASER and SLIM - that try to strike a balance between performance and battery depth of discharge in LEO satellite constellations. Our basic approach is to leverage the deterministic movement of satellites for favoring routing traffic over satellites exposed to the sun as opposed to the eclipsed satellites, thereby decreasing the average battery depth of discharge - all without adversely affecting network performance. Simulations show that LASER and SLIM can reduce the depth of discharge by about 11% and 16%, respectively, which can lead to as much as 100% increase in the satellite batteries lifetime. This is accomplished by trading off very little in terms of end-to-end delay.
{"title":"On routing for extending satellite service life in LEO satellite networks","authors":"M. Hussein, G. Jakllari, B. Paillassa","doi":"10.1109/GLOCOM.2014.7037237","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037237","url":null,"abstract":"We address the problem of routing for extending the service life of satellites in Iridium-like LEO constellations. Satellites in LEO constellations can spend over 30% of their time under the earth's umbra, time during which they are powered by batteries. While the batteries are recharged by solar energy, the depth of discharge they reach during eclipse significantly affects their lifetime - and by extension, the service life of the satellites themselves. For batteries of the type that power Iridium satellites, a 15% increase to the depth of discharge can practically cut their service lives in half. We present two new routing metrics - LASER and SLIM - that try to strike a balance between performance and battery depth of discharge in LEO satellite constellations. Our basic approach is to leverage the deterministic movement of satellites for favoring routing traffic over satellites exposed to the sun as opposed to the eclipsed satellites, thereby decreasing the average battery depth of discharge - all without adversely affecting network performance. Simulations show that LASER and SLIM can reduce the depth of discharge by about 11% and 16%, respectively, which can lead to as much as 100% increase in the satellite batteries lifetime. This is accomplished by trading off very little in terms of end-to-end delay.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"8 1","pages":"2832-2837"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78775752","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 : 2014-12-08DOI: 10.1109/GLOCOM.2014.7037471
D. To, H. Nguyen, Quoc-Tuan Vien, Li-Ke Huang
This paper investigates power allocation for reliable downlink transmission in cellular networks subject to quality-of-service (QoS) constraints. The reliability of data transmissions is assured by hybrid automatic repeat request protocol with incremental redundancy (HARQ-IR). By evaluating the effective throughput of the HARQ-IR protocol for the downlink transmission under QoS constraints, we propose a novel power allocation policy to efficiently exploit the available resources. Furthermore, based on the derived effective throughput, optimization problem is formulated and solved, in which all channels are effectively allocated to all users. Finally, numerical results are provided to support theoretical findings.
{"title":"Resource allocation for HARQ-IR systems with QoS constraints and limited feedback","authors":"D. To, H. Nguyen, Quoc-Tuan Vien, Li-Ke Huang","doi":"10.1109/GLOCOM.2014.7037471","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037471","url":null,"abstract":"This paper investigates power allocation for reliable downlink transmission in cellular networks subject to quality-of-service (QoS) constraints. The reliability of data transmissions is assured by hybrid automatic repeat request protocol with incremental redundancy (HARQ-IR). By evaluating the effective throughput of the HARQ-IR protocol for the downlink transmission under QoS constraints, we propose a novel power allocation policy to efficiently exploit the available resources. Furthermore, based on the derived effective throughput, optimization problem is formulated and solved, in which all channels are effectively allocated to all users. Finally, numerical results are provided to support theoretical findings.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"333 1 1","pages":"4226-4231"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77412495","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 : 2014-12-08DOI: 10.1109/GLOCOM.2014.7037079
M. Al-Naday, Andreas Bontozoglou, V. Vassilakis, M. Reed
QoS provisioning is one of the key challenges facing current as well as future Internet architectures. Its dependency on content recognition does not allow a straightforward support of QoS in the IP, host-centric, model. In contrast, Information-Centric Networking (ICN) offers native content identification in the network, which can be exploited to develop a common, elegant, framework for supporting QoS-based delivery. Therefore, ICN may naturally overcome many of the cumbersome fixes and limitations of today's solutions. In this work, we exploit the flexibility in semantic representation offered by ICN to present a flexible and scalable ICN-based QoS model. Our model defines QoS requirements as information items that can be linked to the content at various aggregation levels, independent of the communication approach. Therefore, it can be applied uniformly to various network types and hierarchies. Furthermore, our model offers enhanced traffic treatment as well as resource utilization while significantly reducing the overhead on the network.
{"title":"Quality of service in an information-centric network","authors":"M. Al-Naday, Andreas Bontozoglou, V. Vassilakis, M. Reed","doi":"10.1109/GLOCOM.2014.7037079","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037079","url":null,"abstract":"QoS provisioning is one of the key challenges facing current as well as future Internet architectures. Its dependency on content recognition does not allow a straightforward support of QoS in the IP, host-centric, model. In contrast, Information-Centric Networking (ICN) offers native content identification in the network, which can be exploited to develop a common, elegant, framework for supporting QoS-based delivery. Therefore, ICN may naturally overcome many of the cumbersome fixes and limitations of today's solutions. In this work, we exploit the flexibility in semantic representation offered by ICN to present a flexible and scalable ICN-based QoS model. Our model defines QoS requirements as information items that can be linked to the content at various aggregation levels, independent of the communication approach. Therefore, it can be applied uniformly to various network types and hierarchies. Furthermore, our model offers enhanced traffic treatment as well as resource utilization while significantly reducing the overhead on the network.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"1 1","pages":"1861-1866"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83624296","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 : 2014-12-08DOI: 10.1109/GLOCOM.2014.7036909
Babar Aziz, S. Traore, A. Nafkha, Daniel Le Guennec
Spectrum sensing is the very task upon which the entire operation of Cognitive Radio rests. In this paper, we propose a spectrum sensing technique based on the estimates of the spectrum of a multiband signal obtained from its non-uniform compressed multicoset samples. We show that our proposed spectrum sensing method provides accurate results using less data samples. We discuss in detail the effect of false detections on the quality of the reconstructed signal obtained from non-uniform multicoset samples.
{"title":"Spectrum sensing for cognitive radio using multicoset sampling","authors":"Babar Aziz, S. Traore, A. Nafkha, Daniel Le Guennec","doi":"10.1109/GLOCOM.2014.7036909","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036909","url":null,"abstract":"Spectrum sensing is the very task upon which the entire operation of Cognitive Radio rests. In this paper, we propose a spectrum sensing technique based on the estimates of the spectrum of a multiband signal obtained from its non-uniform compressed multicoset samples. We show that our proposed spectrum sensing method provides accurate results using less data samples. We discuss in detail the effect of false detections on the quality of the reconstructed signal obtained from non-uniform multicoset samples.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"10 1","pages":"816-821"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85431850","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 : 2014-12-08DOI: 10.1109/GLOCOM.2014.7036862
Ludovic Jacquin, V. Roca, Jean-Louis Roch
This work introduces the "Packet Too Big"-"Packet Too Small" ICMP based attack against IPsec gateways. We explain how an attacker having eavesdropping and packet injection capabilities, from the insecure network where he only sees encrypted packets, can force a gateway to reduce the Path MTU of an IPsec tunnel to the minimum, which triggers severe issues for the hosts behind this gateway: depending on the Path MTU discovery algorithm in use, the attack either creates a Denial of Service or major performance penalties. This attack highlights two fundamental problems that we discuss, along with potential counter-measures to mitigate the attack while keeping ICMP benefits.
{"title":"Too big or too small? The PTB-PTS ICMP-based attack against IPsec gateways","authors":"Ludovic Jacquin, V. Roca, Jean-Louis Roch","doi":"10.1109/GLOCOM.2014.7036862","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036862","url":null,"abstract":"This work introduces the \"Packet Too Big\"-\"Packet Too Small\" ICMP based attack against IPsec gateways. We explain how an attacker having eavesdropping and packet injection capabilities, from the insecure network where he only sees encrypted packets, can force a gateway to reduce the Path MTU of an IPsec tunnel to the minimum, which triggers severe issues for the hosts behind this gateway: depending on the Path MTU discovery algorithm in use, the attack either creates a Denial of Service or major performance penalties. This attack highlights two fundamental problems that we discuss, along with potential counter-measures to mitigate the attack while keeping ICMP benefits.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"14 1","pages":"530-536"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83363485","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 : 2014-12-08DOI: 10.1109/GLOCOM.2014.7037187
F. Giroire, J. Moulierac, T. K. Phan
Software-defined Networks (SDN), in particular OpenFlow, is a new networking paradigm enabling innovation through network programmability. Over past few years, many applications have been built using SDN such as server load balancing, virtual-machine migration, traffic engineering and access control. In this paper, we focus on using SDN for energy-aware routing (EAR). Since traffic load has a small influence on power consumption of routers, EAR allows to put unused links into sleep mode to save energy. SDN can collect traffic matrix and then computes routing solutions satisfying QoS while being minimal in energy consumption. However, prior works on EAR have assumed that the table of OpenFlow switch can hold an infinite number of rules. In practice, this assumption does not hold since the flow table is implemented with Ternary Content Addressable Memory (TCAM) which is expensive and power-hungry. In this paper, we propose an optimization method to minimize energy consumption for a backbone network while respecting capacity constraints on links and rule space constraints on routers. In details, we present an exact formulation using Integer Linear Program (ILP) and introduce efficient greedy heuristic algorithm. Based on simulations, we show that using this smart rule space allocation, it is possible to save almost as much power consumption as the classical EAR approach.
{"title":"Optimizing rule placement in software-defined networks for energy-aware routing","authors":"F. Giroire, J. Moulierac, T. K. Phan","doi":"10.1109/GLOCOM.2014.7037187","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037187","url":null,"abstract":"Software-defined Networks (SDN), in particular OpenFlow, is a new networking paradigm enabling innovation through network programmability. Over past few years, many applications have been built using SDN such as server load balancing, virtual-machine migration, traffic engineering and access control. In this paper, we focus on using SDN for energy-aware routing (EAR). Since traffic load has a small influence on power consumption of routers, EAR allows to put unused links into sleep mode to save energy. SDN can collect traffic matrix and then computes routing solutions satisfying QoS while being minimal in energy consumption. However, prior works on EAR have assumed that the table of OpenFlow switch can hold an infinite number of rules. In practice, this assumption does not hold since the flow table is implemented with Ternary Content Addressable Memory (TCAM) which is expensive and power-hungry. In this paper, we propose an optimization method to minimize energy consumption for a backbone network while respecting capacity constraints on links and rule space constraints on routers. In details, we present an exact formulation using Integer Linear Program (ILP) and introduce efficient greedy heuristic algorithm. Based on simulations, we show that using this smart rule space allocation, it is possible to save almost as much power consumption as the classical EAR approach.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"194 1","pages":"2523-2529"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75551050","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037110
Shuna Yang, N. Stol
Optical buffering is one major challenge in realizing all-optical packet switching. In this paper we focus on a delay-line buffer architecture, called a Multiple-Input Single-Output FIFO (MISO-FIFO) optical buffer. This architecture reduces the physical size of a buffer by up to an order of magnitude or more by allowing reuse of its basic optical delay line elements. We consider the MISO-FIFO optical buffers in a network scenario where the incoming packets are asynchronous and of variable length. A simple Markov model is developed to analyze the performance of our buffering scheme, in terms of packet loss ratio, average packet delay and the output link utilization. Both simulation and analytical results show that increasing the buffer size will significantly improve the performance of this optical buffer under low system load. However, under high system load, its performance will deteriorate when increasing the buffer size. In addition, this paper gives clear guidelines for designing the optimal basic delay line lengths under different system loads, in order to get the minimal packet loss. It is noticeable that this optimal basic length value is independent of the buffer sizes.
{"title":"Multiple input single output optical buffers for asynchronous optical packet switched networks","authors":"Shuna Yang, N. Stol","doi":"10.1109/GLOCOM.2014.7037110","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037110","url":null,"abstract":"Optical buffering is one major challenge in realizing all-optical packet switching. In this paper we focus on a delay-line buffer architecture, called a Multiple-Input Single-Output FIFO (MISO-FIFO) optical buffer. This architecture reduces the physical size of a buffer by up to an order of magnitude or more by allowing reuse of its basic optical delay line elements. We consider the MISO-FIFO optical buffers in a network scenario where the incoming packets are asynchronous and of variable length. A simple Markov model is developed to analyze the performance of our buffering scheme, in terms of packet loss ratio, average packet delay and the output link utilization. Both simulation and analytical results show that increasing the buffer size will significantly improve the performance of this optical buffer under low system load. However, under high system load, its performance will deteriorate when increasing the buffer size. In addition, this paper gives clear guidelines for designing the optimal basic delay line lengths under different system loads, in order to get the minimal packet loss. It is noticeable that this optimal basic length value is independent of the buffer sizes.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"2 1","pages":"2054-2059"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73845681","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037086
Femando Lopez-Rodriguez, Divanilson R. Campelo
Large scale networks, such as those deployed by Service Providers (SPs), employ robust architectures, capable of supporting large volumes of traffic with very different characteristics. Their network equipment has significant processing load, being responsible for building both a routing logic and the routing of traffic itself. By having the network control implemented in a distributed manner and being built with a limited number of vendors, these networks have limitations of control and traffic engineering, hindering the differentiation among SPs. Additionally, the network intelligence is hidden in the network equipment, making innovations very slow and conditioned to the vendors interests. As an alternative option, this work proposes a Software Defined Networking (SDN)-OpenFlow network architecture that attempts to improve the previously mentioned problems, and, at the same time, to solve the arising difficulties related to the SDN network centralized feature. With the proposed architecture, a robust SP SDN-OpenFlow network is created to support high controller response times and controller outages, without additional delays in the creation of flows and with significant reduction of the controller load. A prototype has been built using Open vSwitch as a virtualization software for OpenFlow clients, Mininet for the topology construction and Ryu as the controller, all with OpenFlow 1.3 support. The obtained results are general and can be extended to other types of networks.
{"title":"A robust SDN network architecture for service providers","authors":"Femando Lopez-Rodriguez, Divanilson R. Campelo","doi":"10.1109/GLOCOM.2014.7037086","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037086","url":null,"abstract":"Large scale networks, such as those deployed by Service Providers (SPs), employ robust architectures, capable of supporting large volumes of traffic with very different characteristics. Their network equipment has significant processing load, being responsible for building both a routing logic and the routing of traffic itself. By having the network control implemented in a distributed manner and being built with a limited number of vendors, these networks have limitations of control and traffic engineering, hindering the differentiation among SPs. Additionally, the network intelligence is hidden in the network equipment, making innovations very slow and conditioned to the vendors interests. As an alternative option, this work proposes a Software Defined Networking (SDN)-OpenFlow network architecture that attempts to improve the previously mentioned problems, and, at the same time, to solve the arising difficulties related to the SDN network centralized feature. With the proposed architecture, a robust SP SDN-OpenFlow network is created to support high controller response times and controller outages, without additional delays in the creation of flows and with significant reduction of the controller load. A prototype has been built using Open vSwitch as a virtualization software for OpenFlow clients, Mininet for the topology construction and Ryu as the controller, all with OpenFlow 1.3 support. The obtained results are general and can be extended to other types of networks.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"36 1","pages":"1903-1908"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74088115","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036781
Hichem Sedjelmaci, Tarek Bouali, S. Senouci
In this paper, we design and implement a new intrusion detection and prevention schema for vehicular networks. It has the ability to detect and predict with a high accuracy a future malicious behavior of an attacker. This is unlike the current detection schémas, where there is no prevention technique since they aim to detect only current attackers that occur in the network. We used game theory concept to predict the future behavior of the monitored vehicle and categorize it into the appropriate list (White, White & Gray, Gray, and Revocation_Black) according to its predicted attack severity. In this paper, our aim is to prevent from the most dangerous attack that targets a vehicular network, which is false alert's generation attack. Simulation results show that our intrusion detection and prevention schema exhibits a high detection rate and generates a low false positive rate. In addition, it requires a low overhead to achieve a high-level security.
{"title":"Detection and prevention from misbehaving intruders in vehicular networks","authors":"Hichem Sedjelmaci, Tarek Bouali, S. Senouci","doi":"10.1109/GLOCOM.2014.7036781","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036781","url":null,"abstract":"In this paper, we design and implement a new intrusion detection and prevention schema for vehicular networks. It has the ability to detect and predict with a high accuracy a future malicious behavior of an attacker. This is unlike the current detection schémas, where there is no prevention technique since they aim to detect only current attackers that occur in the network. We used game theory concept to predict the future behavior of the monitored vehicle and categorize it into the appropriate list (White, White & Gray, Gray, and Revocation_Black) according to its predicted attack severity. In this paper, our aim is to prevent from the most dangerous attack that targets a vehicular network, which is false alert's generation attack. Simulation results show that our intrusion detection and prevention schema exhibits a high detection rate and generates a low false positive rate. In addition, it requires a low overhead to achieve a high-level security.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"2015 1","pages":"39-44"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74271062","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036874
A. Houjeij, W. Saad, T. Başar
In this paper, we investigate the problem of placing small cell base stations (SCBSs) in adversarial heterogeneous wireless networks. We consider a continuum of wireless users facing potential eavesdropping and jamming attacks. For each such attack, we first propose a suitable utility function for the wireless users. Then, we propose a novel optimal placement algorithm for finding the optimal locations of the SCBSs given the underlying security considerations. In eavesdropping scenarios, we consider the prospective eavesdroppers to be spread over a given region. The SCBSs are then placed in such a way to minimize the eavesdroppers' effect without having any information about their exact locations. In jamming scenarios, we consider a cost constrained jammer to be present in the network. The SCBSs are then placed in order to minimize the effect of the jammer's signal on the quality of the user's transmission. We simulate the developed algorithm for both types of attacks and for various network configurations. Simulation results show that the proposed solution approach yields significant improvements in the spatial SINR of all users when compared with conventional placement techniques.
{"title":"Optimal deployment of wireless small cell base stations with security considerations","authors":"A. Houjeij, W. Saad, T. Başar","doi":"10.1109/GLOCOM.2014.7036874","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036874","url":null,"abstract":"In this paper, we investigate the problem of placing small cell base stations (SCBSs) in adversarial heterogeneous wireless networks. We consider a continuum of wireless users facing potential eavesdropping and jamming attacks. For each such attack, we first propose a suitable utility function for the wireless users. Then, we propose a novel optimal placement algorithm for finding the optimal locations of the SCBSs given the underlying security considerations. In eavesdropping scenarios, we consider the prospective eavesdroppers to be spread over a given region. The SCBSs are then placed in such a way to minimize the eavesdroppers' effect without having any information about their exact locations. In jamming scenarios, we consider a cost constrained jammer to be present in the network. The SCBSs are then placed in order to minimize the effect of the jammer's signal on the quality of the user's transmission. We simulate the developed algorithm for both types of attacks and for various network configurations. Simulation results show that the proposed solution approach yields significant improvements in the spatial SINR of all users when compared with conventional placement techniques.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"11 1","pages":"607-612"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75180836","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
扫码关注我们
求助内容：
应助结果提醒方式：