Pub Date : 2018-05-22DOI: 10.23919/WIOPT.2018.8362822
Bart Post, S. Borst, A. Koonen
Network densification has emerged as a powerful paradigm to boost spectral efficiency and accommodate the continual rise in demand for wireless capacity. The corresponding reduction in cell sizes also results however in greater spatial and temporal uncertainty and variation in traffic patterns and more extreme and unpredictable interference conditions. These features create unprecedented challenges for efficient allocation of spectral resources compared to conventional cellular networks. As a further challenge, the allocation of spectral resources needs to be jointly optimized with the assignment of wavelengths in the optical backhaul of Radio-over-Fiber (RoF) networks, which are increasingly used in dense deployments and indoor environments. Motivated by these issues, we develop online algorithms for joint radio frequency and optical wavelength assignment in RoF networks. The proposed algorithms rely on load measurements at the various access points, and involve configurable thresholds for triggering (re)assignment of spectral resources. We provide a detailed specification of a system implementation, and conduct extensive simulation experiments to examine the behaviour in various scenarios and assess the impact of key parameters. The results in particular demonstrate that the proposed algorithms are capable of maintaining adequate load levels for spatially heterogeneous and time-varying traffic conditions, while providing favourable throughput performance.
{"title":"Dynamic resource allocation in radio-over-fiber enabled dense cellular networks","authors":"Bart Post, S. Borst, A. Koonen","doi":"10.23919/WIOPT.2018.8362822","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362822","url":null,"abstract":"Network densification has emerged as a powerful paradigm to boost spectral efficiency and accommodate the continual rise in demand for wireless capacity. The corresponding reduction in cell sizes also results however in greater spatial and temporal uncertainty and variation in traffic patterns and more extreme and unpredictable interference conditions. These features create unprecedented challenges for efficient allocation of spectral resources compared to conventional cellular networks. As a further challenge, the allocation of spectral resources needs to be jointly optimized with the assignment of wavelengths in the optical backhaul of Radio-over-Fiber (RoF) networks, which are increasingly used in dense deployments and indoor environments. Motivated by these issues, we develop online algorithms for joint radio frequency and optical wavelength assignment in RoF networks. The proposed algorithms rely on load measurements at the various access points, and involve configurable thresholds for triggering (re)assignment of spectral resources. We provide a detailed specification of a system implementation, and conduct extensive simulation experiments to examine the behaviour in various scenarios and assess the impact of key parameters. The results in particular demonstrate that the proposed algorithms are capable of maintaining adequate load levels for spatially heterogeneous and time-varying traffic conditions, while providing favourable throughput performance.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117323296","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362855
Apostolos Galanopoulos, G. Iosifidis, T. Salonidis
The emergence of delay sensitive and computationally demanding data analytic applications has burdened the core network with huge data transfers and increased computation load. Furthermore, the increasing number of Internet of Things deployments rely significantly on the execution of such applications. We propose an architecture where devices collaboratively execute data analytic tasks in order to improve their execution delay and accuracy. This is possible by exploiting the aggregate computation capabilities of the abundance of small devices. We design an optimization framework where the nodes decide where their data analytic tasks will be executed, in order to jointly optimize their average execution delay and accuracy, while respecting power consumption constraints. We propose a distributed dual ascent solution to the formulated convex problem, so that the nodes can make the outsourcing decisions by exchanging local information. The results indicate that the nodes can achieve better performance when collaborating than when they locally compute the tasks, depending on the network load.
{"title":"Optimizing data analytics in energy constrained IoT networks","authors":"Apostolos Galanopoulos, G. Iosifidis, T. Salonidis","doi":"10.23919/WIOPT.2018.8362855","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362855","url":null,"abstract":"The emergence of delay sensitive and computationally demanding data analytic applications has burdened the core network with huge data transfers and increased computation load. Furthermore, the increasing number of Internet of Things deployments rely significantly on the execution of such applications. We propose an architecture where devices collaboratively execute data analytic tasks in order to improve their execution delay and accuracy. This is possible by exploiting the aggregate computation capabilities of the abundance of small devices. We design an optimization framework where the nodes decide where their data analytic tasks will be executed, in order to jointly optimize their average execution delay and accuracy, while respecting power consumption constraints. We propose a distributed dual ascent solution to the formulated convex problem, so that the nodes can make the outsourcing decisions by exchanging local information. The results indicate that the nodes can achieve better performance when collaborating than when they locally compute the tasks, depending on the network load.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115336826","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362871
Koji Yamamoto
In most stochastic geometry analyses of cellular networks, a receiving user is selected randomly. Thus, the network performance is equivalent to that obtained with the use of a round-robin scheduler; in other words, channel-aware user scheduling is not applied. The first objective of this study is to clarify the type of channel-aware user scheduling that can be utilized with stochastic geometry. In both Poisson bipolar networks and Poisson cellular networks, the signal-to-interference power ratio (SIR) distribution, average data rate, and scheduling gain of a normalized SNR scheduler are derived. The scheduler selects the user with the largest SNR normalized by the short-term average SNR, and it is equivalent to the well-known proportional fair scheduler when the data rate is proportional to the SNR. The second objective is to discuss the achievable scheduling gain with stochastic geometry when compared with round-robin scheduling. The value of the scheduling gain is examined using numerical integration results.
{"title":"SIR distribution and scheduling gain of normalized SNR scheduling in Poisson networks","authors":"Koji Yamamoto","doi":"10.23919/WIOPT.2018.8362871","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362871","url":null,"abstract":"In most stochastic geometry analyses of cellular networks, a receiving user is selected randomly. Thus, the network performance is equivalent to that obtained with the use of a round-robin scheduler; in other words, channel-aware user scheduling is not applied. The first objective of this study is to clarify the type of channel-aware user scheduling that can be utilized with stochastic geometry. In both Poisson bipolar networks and Poisson cellular networks, the signal-to-interference power ratio (SIR) distribution, average data rate, and scheduling gain of a normalized SNR scheduler are derived. The scheduler selects the user with the largest SNR normalized by the short-term average SNR, and it is equivalent to the well-known proportional fair scheduler when the data rate is proportional to the SNR. The second objective is to discuss the achievable scheduling gain with stochastic geometry when compared with round-robin scheduling. The value of the scheduling gain is examined using numerical integration results.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128705107","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362876
Tingting Yang, Rui Wang, Zhengqi Cui, Jie Dong, Minghua Xia
Maritime intelligent transportation system provides intelligent, safe and efficient maritime transport services, which greatly facilitates the applications related to monitoring, safety, infotainment and cargo online management. The Internet of Things (IoT) is especially suitable for the networked communication environment at sea, and drives the development of maritime intelligent transportation on the trend. However, the existing data processing and forwarding methods pose great challenges to Intelligent Transportation Systems (ITS). In particular, realtime multi-type of data adopts different access technologies in wireless communication systems or use the same wireless access technology but belong to different wireless carriers. Utilizing the existing multi-type wireless communication systems, the architecture of the heterogeneous network through inter-system convergence makes multi-system complement to meet the demand of mobile communication services, so as to comprehensively play their respective advantages. In this paper, we consider a multiattribute decision-making method based on Analytic Hierarchy Process (AHP) and Rough Set based on the architecture of maritime wideband communication system with software defined network (SDN) and fog computing architecture. This paper aims to select a feasible network routing scheme for this heterogeneous network, based on multi-attribute of different networks. Finally, we simulate a communication network selection case based on the future maritime communications architecture, and solve the architecture optimization problem through our proposed algorithm. The issue of such network choice necessarily exists in maritime communications architecture, and our tentative assumptions and solutions will be an important basis for such issues.
{"title":"Multi-attribute selection of maritime heterogenous networks based on SDN and fog computing architecture","authors":"Tingting Yang, Rui Wang, Zhengqi Cui, Jie Dong, Minghua Xia","doi":"10.23919/WIOPT.2018.8362876","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362876","url":null,"abstract":"Maritime intelligent transportation system provides intelligent, safe and efficient maritime transport services, which greatly facilitates the applications related to monitoring, safety, infotainment and cargo online management. The Internet of Things (IoT) is especially suitable for the networked communication environment at sea, and drives the development of maritime intelligent transportation on the trend. However, the existing data processing and forwarding methods pose great challenges to Intelligent Transportation Systems (ITS). In particular, realtime multi-type of data adopts different access technologies in wireless communication systems or use the same wireless access technology but belong to different wireless carriers. Utilizing the existing multi-type wireless communication systems, the architecture of the heterogeneous network through inter-system convergence makes multi-system complement to meet the demand of mobile communication services, so as to comprehensively play their respective advantages. In this paper, we consider a multiattribute decision-making method based on Analytic Hierarchy Process (AHP) and Rough Set based on the architecture of maritime wideband communication system with software defined network (SDN) and fog computing architecture. This paper aims to select a feasible network routing scheme for this heterogeneous network, based on multi-attribute of different networks. Finally, we simulate a communication network selection case based on the future maritime communications architecture, and solve the architecture optimization problem through our proposed algorithm. The issue of such network choice necessarily exists in maritime communications architecture, and our tentative assumptions and solutions will be an important basis for such issues.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131581769","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362821
Qi He, Qi Zhang, Tony Q. S. Quek, Zhi Chen, Shaoqian Li
In this paper, we consider the channel estimation and multi-user detection problems in fog radio access networks (F-RANs). Based on block coordinate descent algorithm, we propose two methods to solve a mixed ℓ2,1-regularization functional which exploits both the sparsity of user activities and the spatial sparsity of user signals in F-RAN. Both of our methods split the computation and corresponding data into multiple units of a cluster and solve the problem in a distributed manner. Hence they can be deployed flexibly at the distributed logical edges as well as the cloud baseband unit pool in F-RAN. The differences between the two methods are that the first one operates in a serial manner and is guaranteed to converge, while the second one works in parallel and under empirical guidance. Deployment details are also provided. Numerical results demonstrate the effectiveness of the proposed methods.
{"title":"Distributed optimization in fog radio access networks — channel estimation and multi-user detection","authors":"Qi He, Qi Zhang, Tony Q. S. Quek, Zhi Chen, Shaoqian Li","doi":"10.23919/WIOPT.2018.8362821","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362821","url":null,"abstract":"In this paper, we consider the channel estimation and multi-user detection problems in fog radio access networks (F-RANs). Based on block coordinate descent algorithm, we propose two methods to solve a mixed ℓ2,1-regularization functional which exploits both the sparsity of user activities and the spatial sparsity of user signals in F-RAN. Both of our methods split the computation and corresponding data into multiple units of a cluster and solve the problem in a distributed manner. Hence they can be deployed flexibly at the distributed logical edges as well as the cloud baseband unit pool in F-RAN. The differences between the two methods are that the first one operates in a serial manner and is guaranteed to converge, while the second one works in parallel and under empirical guidance. Deployment details are also provided. Numerical results demonstrate the effectiveness of the proposed methods.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133299467","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362843
N. Prasad, Xiao-Feng Qi
We consider a long-standing open problem pertaining to scheduling over a wideband multi-user downlink. In this problem a base-station (BS) must assign multiple subbands to its served users such that a weighted sum rate metric is maximized subject to sum power and cardinality constraints. On each subband multiple users can simultaneously be scheduled. Such scheduling is complicated by the fact that the rate achieved by a user on any subband assigned to it depends not only on its own channel condition, but on the set of other users co-scheduled on that subband as well. The latter dependence is via the transmission scheme adopted by the BS in order to simultaneously serve multiple users on the same subband. This problem has received wide attention for over a decade and while numerous heuristics have been designed, there is no known algorithm that offers provable constant-factor worst-case guarantee. In this paper we obtain an important result which demonstrates that when the transmitter employs capacity-optimal dirty paper coding, constant-factor approximation guarantee can be achieved via simple algorithms. Indeed, we show that for a wideband scheduling problem in which a permissible set of user groups is specified as input, a simple deterministic algorithm yields a constant-factor approximation guarantee. Further, for the generalized case where any user group subject to a cardinality constraint is permissible, a greedy algorithm yields a constant-factor guarantee over certain practically relevant regimes.
{"title":"Downlink multi-user MIMO scheduling with performance guarantees","authors":"N. Prasad, Xiao-Feng Qi","doi":"10.23919/WIOPT.2018.8362843","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362843","url":null,"abstract":"We consider a long-standing open problem pertaining to scheduling over a wideband multi-user downlink. In this problem a base-station (BS) must assign multiple subbands to its served users such that a weighted sum rate metric is maximized subject to sum power and cardinality constraints. On each subband multiple users can simultaneously be scheduled. Such scheduling is complicated by the fact that the rate achieved by a user on any subband assigned to it depends not only on its own channel condition, but on the set of other users co-scheduled on that subband as well. The latter dependence is via the transmission scheme adopted by the BS in order to simultaneously serve multiple users on the same subband. This problem has received wide attention for over a decade and while numerous heuristics have been designed, there is no known algorithm that offers provable constant-factor worst-case guarantee. In this paper we obtain an important result which demonstrates that when the transmitter employs capacity-optimal dirty paper coding, constant-factor approximation guarantee can be achieved via simple algorithms. Indeed, we show that for a wideband scheduling problem in which a permissible set of user groups is specified as input, a simple deterministic algorithm yields a constant-factor approximation guarantee. Further, for the generalized case where any user group subject to a cardinality constraint is permissible, a greedy algorithm yields a constant-factor guarantee over certain practically relevant regimes.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122128039","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362869
Tatsuaki Kimura, H. Saito
In this paper, we study the temporal correlation of interference in mobile ad-hoc networks under a correlated shadowing environment. By modeling the node locations as a 1-D Poisson point process with an i.i.d. mobility model and considering spatially correlated shadowing that depends on the distance between nodes, we derive a simple asymptotic expression of the temporal correlation coefficient of interference as the variance of log-normal shadowing increases. This shows a readable relationship between the correlation distance of lognormal shadowing and the temporal correlation of interference and thus can be useful for modeling general wireless systems with spatially correlated shadowing.
{"title":"Temporal correlation of interference under spatially correlated shadowing","authors":"Tatsuaki Kimura, H. Saito","doi":"10.23919/WIOPT.2018.8362869","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362869","url":null,"abstract":"In this paper, we study the temporal correlation of interference in mobile ad-hoc networks under a correlated shadowing environment. By modeling the node locations as a 1-D Poisson point process with an i.i.d. mobility model and considering spatially correlated shadowing that depends on the distance between nodes, we derive a simple asymptotic expression of the temporal correlation coefficient of interference as the variance of log-normal shadowing increases. This shows a readable relationship between the correlation distance of lognormal shadowing and the temporal correlation of interference and thus can be useful for modeling general wireless systems with spatially correlated shadowing.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128320939","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362852
Sen Lin, Junshan Zhang, Lei Ying
We study Waze-inspired spectrum discovery, where the cloud collects the spectrum sensing results from many smartphones and predicts location-specific spectrum availability based on information fusion. Observe that with limited sensing capability, each smartphone can sense only a limited number of channels; and further, the more channels each smartphone senses, the less accurate the sensing results would be. To develop a comprehensive understanding, we cast the spectrum discovery problem as a matrix recovery problem, which is different from the classical matrix completion problem, in the sense that it suffices to determine only part of the matrix entries in the matrix recovery formulation. It is shown that the widely-used similarity-based collaborative filtering method would not work well because it requires each smartphone to sense too many channels. With this motivation, we propose a location-aided smartphone data fusion method and show that the channel numbers each smartphone needs to sense could be dramatically reduced. Moreover, we analyze the partial matrix recovery performance by using the location-aided data fusion method, and numerical results corroborate the intuition that with each smartphone sensing more channels, the recovery performance improves at first but then degrades beyond some point because of the decreasing sensing accuracy.
{"title":"Waze-inspired spectrum discovery via smartphone sensing data fusion","authors":"Sen Lin, Junshan Zhang, Lei Ying","doi":"10.23919/WIOPT.2018.8362852","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362852","url":null,"abstract":"We study Waze-inspired spectrum discovery, where the cloud collects the spectrum sensing results from many smartphones and predicts location-specific spectrum availability based on information fusion. Observe that with limited sensing capability, each smartphone can sense only a limited number of channels; and further, the more channels each smartphone senses, the less accurate the sensing results would be. To develop a comprehensive understanding, we cast the spectrum discovery problem as a matrix recovery problem, which is different from the classical matrix completion problem, in the sense that it suffices to determine only part of the matrix entries in the matrix recovery formulation. It is shown that the widely-used similarity-based collaborative filtering method would not work well because it requires each smartphone to sense too many channels. With this motivation, we propose a location-aided smartphone data fusion method and show that the channel numbers each smartphone needs to sense could be dramatically reduced. Moreover, we analyze the partial matrix recovery performance by using the location-aided data fusion method, and numerical results corroborate the intuition that with each smartphone sensing more channels, the recovery performance improves at first but then degrades beyond some point because of the decreasing sensing accuracy.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127169517","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362877
Khashayar Kamran, Jianan Zhang, E. Yeh, E. Modiano
Complex systems such as smart cities and smart power grids rely heavily on their interdependent components. The failure of a component in one network may lead to the failure of the supported component in another network. Components which support a large number of interdependent components may be more vulnerable to attacks and failures. In this paper, we study the robustness of two interdependent networks under node failures. By modeling each network using a random geometric graph (RGG), we study conditions for the percolation of two interdependent RGGs after in-homogeneous node failures. We derive analytical bounds on the interdependent degree thresholds (k1,k2), such that the interdependent RGGs percolate after removing nodes in Gi that support more than kj nodes in Gj (Vi, j є {1,2},i ≠ j). We verify the bounds using numerical simulation, and show that there is a tradeoff between k1 and k2 for maintaining percolation after the failures.
{"title":"Robustness of interdependent geometric networks under inhomogeneous failures","authors":"Khashayar Kamran, Jianan Zhang, E. Yeh, E. Modiano","doi":"10.23919/WIOPT.2018.8362877","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362877","url":null,"abstract":"Complex systems such as smart cities and smart power grids rely heavily on their interdependent components. The failure of a component in one network may lead to the failure of the supported component in another network. Components which support a large number of interdependent components may be more vulnerable to attacks and failures. In this paper, we study the robustness of two interdependent networks under node failures. By modeling each network using a random geometric graph (RGG), we study conditions for the percolation of two interdependent RGGs after in-homogeneous node failures. We derive analytical bounds on the interdependent degree thresholds (k1,k2), such that the interdependent RGGs percolate after removing nodes in Gi that support more than kj nodes in Gj (Vi, j є {1,2},i ≠ j). We verify the bounds using numerical simulation, and show that there is a tradeoff between k1 and k2 for maintaining percolation after the failures.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114826730","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362873
M. Müller, Stefan Schwarz, M. Rupp
The performance of indoor wireless cellular networks depends on several parameters such as base station density or arrangement, as well as the blockage of the signal by walls. We investigate the dependence of the network performance in terms of coverage probability and also area spectral efficiency in order to demonstrate the influence of the base station density. We analytically derive expressions for both performance metrics including the blockage by walls and compare these results to those of extensive Monte-Carlo simulations. This is performed for different association strategies as well as for random and regular base station placements. It turns out that in general the addition of walls improves the network performance, and does so even more the smaller the base station density becomes.
{"title":"Investigation of area spectral efficiency in indoor wireless communications by blockage models","authors":"M. Müller, Stefan Schwarz, M. Rupp","doi":"10.23919/WIOPT.2018.8362873","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362873","url":null,"abstract":"The performance of indoor wireless cellular networks depends on several parameters such as base station density or arrangement, as well as the blockage of the signal by walls. We investigate the dependence of the network performance in terms of coverage probability and also area spectral efficiency in order to demonstrate the influence of the base station density. We analytically derive expressions for both performance metrics including the blockage by walls and compare these results to those of extensive Monte-Carlo simulations. This is performed for different association strategies as well as for random and regular base station placements. It turns out that in general the addition of walls improves the network performance, and does so even more the smaller the base station density becomes.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122056432","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
扫码关注我们
求助内容：
应助结果提醒方式：