Pub Date : 2011-05-03DOI: 10.1109/SARNOF.2011.5876439
L. Galdino, J. Maranhao, M. Furtado, E. Moschim, L. H. Bonani, F. Durand
The performance of an WDM/OCDM switch architecture is investigated under impairment of Multiple Access Interference (MAI). Analytical models are employed to evaluate the switch resources, such as the number of optical codes carried on each wavelength. In addition, the performance of Sparse Partial Optical Code Conversion (SPOCC) architecture is investigated using a hybrid technology, in Optical Burst Switching (OBS) networks, which employ wavelength and optical code division multiplexing. The simulation results indicate that both the increase of the number of optical codes per wavelength and the utilization SPOCC architecture, leads to considerable decrease of the Burst Blocking Probability (BBP). In addition, such hybrid approach also improves the utilization of network resources.
{"title":"Impact of MAI on the performance of WDM/OCDM OBS networks using 2D wavelength-hopping and time spreading optical codes","authors":"L. Galdino, J. Maranhao, M. Furtado, E. Moschim, L. H. Bonani, F. Durand","doi":"10.1109/SARNOF.2011.5876439","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876439","url":null,"abstract":"The performance of an WDM/OCDM switch architecture is investigated under impairment of Multiple Access Interference (MAI). Analytical models are employed to evaluate the switch resources, such as the number of optical codes carried on each wavelength. In addition, the performance of Sparse Partial Optical Code Conversion (SPOCC) architecture is investigated using a hybrid technology, in Optical Burst Switching (OBS) networks, which employ wavelength and optical code division multiplexing. The simulation results indicate that both the increase of the number of optical codes per wavelength and the utilization SPOCC architecture, leads to considerable decrease of the Burst Blocking Probability (BBP). In addition, such hybrid approach also improves the utilization of network resources.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131322502","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 : 2011-05-03DOI: 10.1109/SARNOF.2011.5876438
I. B. Martins, F. R. Barbosa, E. Moschim, L. H. Bonani
In this paper we study the behavior of traffic in Metropolitan Access Optical Networks with technologies of optical packet/burst switching (OPS/OBS), using computer modeling and simulations. We analyze network performance and the impact of link failure when electronic buffering at ingress (client input) to optical network is implemented. Mesh and ring topologies are chosen and parameters packet loss fraction and average number of hops are adopted for performance metrics. The use of minimum electronic buffering at ingress is demonstrated to improve access to the optical layer, and necessary to keep the packet loss fraction low and throughput high with low latency. We also show that optical buffering is not necessary for adequate network performance.
{"title":"A study in photonic switched networks considering link failure and ingress buffering","authors":"I. B. Martins, F. R. Barbosa, E. Moschim, L. H. Bonani","doi":"10.1109/SARNOF.2011.5876438","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876438","url":null,"abstract":"In this paper we study the behavior of traffic in Metropolitan Access Optical Networks with technologies of optical packet/burst switching (OPS/OBS), using computer modeling and simulations. We analyze network performance and the impact of link failure when electronic buffering at ingress (client input) to optical network is implemented. Mesh and ring topologies are chosen and parameters packet loss fraction and average number of hops are adopted for performance metrics. The use of minimum electronic buffering at ingress is demonstrated to improve access to the optical layer, and necessary to keep the packet loss fraction low and throughput high with low latency. We also show that optical buffering is not necessary for adequate network performance.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121808218","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 : 2011-05-03DOI: 10.1109/SARNOF.2011.5876440
Janusz Kusyk, M. U. Uyar, C. Sahin, E. Urrea, S. Gundry
In this paper, we introduce a new node spreading bio-inspired game (NSBG) combining bio-inspired algorithms and traditional game theory to maximize the area covered by autonomous mobile ad hoc network nodes and to achieve a uniform node distribution while keeping the network connected. NSBG is a distributed and scalable game where each node's selfish actions lead the entire network toward a uniform and stable node distribution without a centralized controller. In NSBG, each mobile node autonomously makes movement decisions based on localized data while the movement probabilities of possible next locations are assigned by a force-based genetic algorithm (FGA). Because FGA takes only into account the current position of the neighboring nodes, our NSBG, combining FGA with traditional and evolutionary game theory, can find even better locations by setting up spatial games among neighbors. NSBG is a good candidate for the node spreading class of applications used in both military and commercial applications. We present a formal analysis of our NSBG to prove that an evolutionary stable state is its convergence point. Simulation experiments demonstrate that NSBG performs well with respect to network area coverage, uniform distribution of mobile nodes, and convergence speed.
{"title":"Game theory based bio-inspired techniques for self-positioning autonomous MANET nodes","authors":"Janusz Kusyk, M. U. Uyar, C. Sahin, E. Urrea, S. Gundry","doi":"10.1109/SARNOF.2011.5876440","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876440","url":null,"abstract":"In this paper, we introduce a new node spreading bio-inspired game (NSBG) combining bio-inspired algorithms and traditional game theory to maximize the area covered by autonomous mobile ad hoc network nodes and to achieve a uniform node distribution while keeping the network connected. NSBG is a distributed and scalable game where each node's selfish actions lead the entire network toward a uniform and stable node distribution without a centralized controller. In NSBG, each mobile node autonomously makes movement decisions based on localized data while the movement probabilities of possible next locations are assigned by a force-based genetic algorithm (FGA). Because FGA takes only into account the current position of the neighboring nodes, our NSBG, combining FGA with traditional and evolutionary game theory, can find even better locations by setting up spatial games among neighbors. NSBG is a good candidate for the node spreading class of applications used in both military and commercial applications. We present a formal analysis of our NSBG to prove that an evolutionary stable state is its convergence point. Simulation experiments demonstrate that NSBG performs well with respect to network area coverage, uniform distribution of mobile nodes, and convergence speed.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122127122","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 : 2011-05-03DOI: 10.1109/SARNOF.2011.5876480
R. Shinkuma, Shweta Jain, R. Yates
This paper examines en-route caching of personal content for mobile users with intermittent connectivity. Our goal is to optimize in-network caching in order to reduce the number of retrieval attempts for each content request. Therefore, we design two distributed caching techniques: in last router caching, a router caches a file only when it detects that the end user has disconnected; in price based caching, users tag their files with a maximum acceptable caching price while routers individually establish caching price to ensure that the average cache holding time is longer than the duration of user disconnection. In both approaches, the least recently used (LRU) cache replacement policy is employed and a reconnecting mobile user seeks the closest cached file copy. Using simple analytic models to set caching prices, we compare these techniques against baseline methods that either perform no caching, or cache files at every intermediate router, or make random caching decisions at each router. Simulation results suggest that our proposed methods reduce the number of retrieval attempts of highly mobile users, without penalizing stationary users.
{"title":"In-network caching mechanisms for intermittently connected mobile users","authors":"R. Shinkuma, Shweta Jain, R. Yates","doi":"10.1109/SARNOF.2011.5876480","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876480","url":null,"abstract":"This paper examines en-route caching of personal content for mobile users with intermittent connectivity. Our goal is to optimize in-network caching in order to reduce the number of retrieval attempts for each content request. Therefore, we design two distributed caching techniques: in last router caching, a router caches a file only when it detects that the end user has disconnected; in price based caching, users tag their files with a maximum acceptable caching price while routers individually establish caching price to ensure that the average cache holding time is longer than the duration of user disconnection. In both approaches, the least recently used (LRU) cache replacement policy is employed and a reconnecting mobile user seeks the closest cached file copy. Using simple analytic models to set caching prices, we compare these techniques against baseline methods that either perform no caching, or cache files at every intermediate router, or make random caching decisions at each router. Simulation results suggest that our proposed methods reduce the number of retrieval attempts of highly mobile users, without penalizing stationary users.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128863383","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 : 2011-05-03DOI: 10.1109/SARNOF.2011.5876451
P. Montezuma, R. Dinis, Miguel Luzio
High power and spectral efficiencies are crucial on modern wireless communications. M-QAM (Quadrature Amplitude Modulation) modulations have been adopted on HSDPA (High Speed Downlink Packet Access) and satellite links, due his higher spectral efficiency. However, due to large envelope fluctuations levels, nonlinear operations such as an high power amplification are undesirable since can they lead to performance degradation and spectral widening. Nonlinearly coded M-OQAM (Offset Quadrature Amplitude Modulation) modulations can be viewed as a particular case of nonlinear OQPSK signals (Offset Quadrature Phase Shift Keying) when the pulse modulation is designed to take advantage from the nonlinear format. In this paper we present nonlinearly encoded 16-OQAM schemes, based on two nonlinear OQPSK signals, designed to allow higher amplification efficiencies due its robustness against nonlinear distortions. The proposed approach assures an higher robustness against nonlinear effects, namely spectral regrowth and performance degradation. The consequences are improved performances over several drive operations of nonlinear amplifiers and a better compromise between bandwidth and power efficiencies. As we can see further the posted simulation results support our assumptions.
{"title":"Power efficient coded 16-OQAM schemes over nonlinear transmitters","authors":"P. Montezuma, R. Dinis, Miguel Luzio","doi":"10.1109/SARNOF.2011.5876451","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876451","url":null,"abstract":"High power and spectral efficiencies are crucial on modern wireless communications. M-QAM (Quadrature Amplitude Modulation) modulations have been adopted on HSDPA (High Speed Downlink Packet Access) and satellite links, due his higher spectral efficiency. However, due to large envelope fluctuations levels, nonlinear operations such as an high power amplification are undesirable since can they lead to performance degradation and spectral widening. Nonlinearly coded M-OQAM (Offset Quadrature Amplitude Modulation) modulations can be viewed as a particular case of nonlinear OQPSK signals (Offset Quadrature Phase Shift Keying) when the pulse modulation is designed to take advantage from the nonlinear format. In this paper we present nonlinearly encoded 16-OQAM schemes, based on two nonlinear OQPSK signals, designed to allow higher amplification efficiencies due its robustness against nonlinear distortions. The proposed approach assures an higher robustness against nonlinear effects, namely spectral regrowth and performance degradation. The consequences are improved performances over several drive operations of nonlinear amplifiers and a better compromise between bandwidth and power efficiencies. As we can see further the posted simulation results support our assumptions.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126227213","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 : 2011-05-03DOI: 10.1109/SARNOF.2011.5876436
Jingjing Zhang, Ting Wang, N. Ansari
This paper proposes a novel scheme which can efficiently reduce the energy consumption of Optical Line Terminals (OLTs) in Time Division Multiplexing (TDM) Passive Optical Networks (PONs) such as EPON and GPON. Currently, OLTs consume a significant amount of energy in PON, which is one of the major FTTx technologies. To be environmental friendly, it is desirable to reduce energy consumption of OLT as much as possible; such requirement becomes even more urgent as OLT keeps increasing its provisioning data rate, and higher data rate provisioning usually implies larger energy consumption. In this paper, we propose a novel energy-efficient OLT structure which guarantees services of end users with the smallest number of power-on OLT line cards. More specifically, we adapt the number of power-on OLT line cards to the real-time incoming traffic. Also, in order to avoid service disruption resulted by powering off OLT line cards, proper optical switches are equipped in OLT to dynamically configure the communications between OLT line cards and ONUs.
{"title":"Designing energy-efficient optical line terminal for TDM passive optical networks","authors":"Jingjing Zhang, Ting Wang, N. Ansari","doi":"10.1109/SARNOF.2011.5876436","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876436","url":null,"abstract":"This paper proposes a novel scheme which can efficiently reduce the energy consumption of Optical Line Terminals (OLTs) in Time Division Multiplexing (TDM) Passive Optical Networks (PONs) such as EPON and GPON. Currently, OLTs consume a significant amount of energy in PON, which is one of the major FTTx technologies. To be environmental friendly, it is desirable to reduce energy consumption of OLT as much as possible; such requirement becomes even more urgent as OLT keeps increasing its provisioning data rate, and higher data rate provisioning usually implies larger energy consumption. In this paper, we propose a novel energy-efficient OLT structure which guarantees services of end users with the smallest number of power-on OLT line cards. More specifically, we adapt the number of power-on OLT line cards to the real-time incoming traffic. Also, in order to avoid service disruption resulted by powering off OLT line cards, proper optical switches are equipped in OLT to dynamically configure the communications between OLT line cards and ONUs.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127272017","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 : 2011-05-03DOI: 10.1109/SARNOF.2011.5876442
S. Gundry, E. Urrea, C. Sahin, Jianmin Zou, M. U. Uyar
We present a convergence analysis of a genetic algorithm based topological control mechanism for the decision making process of evolutionary and autonomous systems that adaptively reconfigures spatial configuration in mobile ad hoc networks (MANETs). Mobile nodes adjust their speed and direction using information collected from the local neighborhood environment in unknown geography. We extend the stochastic model of the genetic operators (i.e., selection, crossover and mutation) called the dynamical system model that represents the behavior of a single node's decision mechanism in the network viewed as a stochastic variable. We introduce an ergodic homogeneous Markov chain to analyze the convergent nature of multiple mobile nodes running our algorithm, called the Force-based Genetic Algorithm (FGA). Here, a state represents an instantaneous spatial configuration of nodes in a MANET. It is shown that the Markov chain model of our FGA is ergodic and its convergence is shown using Dobrushin's contraction coefficients. It is observed that scenarios where nodes have small communication ranges compared to their movement range converge quicker than larger ones due the limited information they have of their neighborhood, making movement decisions simpler, thus conserving energy.
{"title":"Formal convergence analysis for bio-inspired topology control in MANETs","authors":"S. Gundry, E. Urrea, C. Sahin, Jianmin Zou, M. U. Uyar","doi":"10.1109/SARNOF.2011.5876442","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876442","url":null,"abstract":"We present a convergence analysis of a genetic algorithm based topological control mechanism for the decision making process of evolutionary and autonomous systems that adaptively reconfigures spatial configuration in mobile ad hoc networks (MANETs). Mobile nodes adjust their speed and direction using information collected from the local neighborhood environment in unknown geography. We extend the stochastic model of the genetic operators (i.e., selection, crossover and mutation) called the dynamical system model that represents the behavior of a single node's decision mechanism in the network viewed as a stochastic variable. We introduce an ergodic homogeneous Markov chain to analyze the convergent nature of multiple mobile nodes running our algorithm, called the Force-based Genetic Algorithm (FGA). Here, a state represents an instantaneous spatial configuration of nodes in a MANET. It is shown that the Markov chain model of our FGA is ergodic and its convergence is shown using Dobrushin's contraction coefficients. It is observed that scenarios where nodes have small communication ranges compared to their movement range converge quicker than larger ones due the limited information they have of their neighborhood, making movement decisions simpler, thus conserving energy.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132693725","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 : 2011-05-03DOI: 10.1109/SARNOF.2011.5876456
Feichi Long, Tiejun Lv, Ruohan Cao, Hui Gao
In this paper, two low-complexity belief propagation (BP) based detectors are proposed for multiple-input multiple-out (MIMO) system. The factor graph is leveraged to represent the MIMO channels, and based on which our algorithms are developed. Unlike the existing complicated standard BP detectors that consider all the edges when updating the messages, our algorithms only focus on single edge, which largely reduce computational complexity. In particular, we propose a novel Gaussian approximation with feedback information (GF) mechanism to enable the proposed single edge BP detector. In order to further improve the detection performance, we also propose to integrate the linear MIMO detector into the initial GF based single edge BP detector, where the pseudo priori (PP) information obtained from linear detector is judiciously exploited. Convergence and complexity analyses, along with the numerical simulations, verify that the proposed single edge BP detectors outperform the existing BP detectors in performance while with low complexity.
{"title":"Single edge based belief propagation algorithms for MIMO detection","authors":"Feichi Long, Tiejun Lv, Ruohan Cao, Hui Gao","doi":"10.1109/SARNOF.2011.5876456","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876456","url":null,"abstract":"In this paper, two low-complexity belief propagation (BP) based detectors are proposed for multiple-input multiple-out (MIMO) system. The factor graph is leveraged to represent the MIMO channels, and based on which our algorithms are developed. Unlike the existing complicated standard BP detectors that consider all the edges when updating the messages, our algorithms only focus on single edge, which largely reduce computational complexity. In particular, we propose a novel Gaussian approximation with feedback information (GF) mechanism to enable the proposed single edge BP detector. In order to further improve the detection performance, we also propose to integrate the linear MIMO detector into the initial GF based single edge BP detector, where the pseudo priori (PP) information obtained from linear detector is judiciously exploited. Convergence and complexity analyses, along with the numerical simulations, verify that the proposed single edge BP detectors outperform the existing BP detectors in performance while with low complexity.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115932730","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 : 2011-05-03DOI: 10.1109/SARNOF.2011.5876447
Yao Ge, D. G. Daut
Communications receiver performance obtained in conjunction with de-noising of digitally modulated communications signals using wavelet signal processing is described in this paper. The study includes both simulation results and the analytical characterization of the bit error rate (BER) performance obtained for BPSK and QPSK modulation schemes. The digital communications system consists of an MPSK modulator, an additive White Gaussian noise channel, and a receiver that employs a wavelet de-noising operation followed by a matched filter detector. Overall system performance for each modulation type considered is described by means of BER curves over a range of Eb/N0 values. It has been found that the significant improvement in BER compared to systems wherein the matched filter detector is not preceded by a wavelet de-noising operation is due to the effective increase in pre-detection signal-to-noise ratio (SNR). Statistical analysis of the de-noised modulated signals is presented. The corresponding analytical evaluation of BER for receivers using wavelet de-noising is derived.
{"title":"Bit error rate analysis of digital communications signal demodulation using wavelet denoising","authors":"Yao Ge, D. G. Daut","doi":"10.1109/SARNOF.2011.5876447","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876447","url":null,"abstract":"Communications receiver performance obtained in conjunction with de-noising of digitally modulated communications signals using wavelet signal processing is described in this paper. The study includes both simulation results and the analytical characterization of the bit error rate (BER) performance obtained for BPSK and QPSK modulation schemes. The digital communications system consists of an MPSK modulator, an additive White Gaussian noise channel, and a receiver that employs a wavelet de-noising operation followed by a matched filter detector. Overall system performance for each modulation type considered is described by means of BER curves over a range of Eb/N0 values. It has been found that the significant improvement in BER compared to systems wherein the matched filter detector is not preceded by a wavelet de-noising operation is due to the effective increase in pre-detection signal-to-noise ratio (SNR). Statistical analysis of the de-noised modulated signals is presented. The corresponding analytical evaluation of BER for receivers using wavelet de-noising is derived.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116053783","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 : 2011-05-03DOI: 10.1109/SARNOF.2011.5876466
Louise Gabriel, Michel L. F. Grech, Fani Kontothanasi, Amit Mukhopadhyay, Marios Nicoloau, A. Sharma
Initial configuration and on-going optimizations of the Radio Access Network (RAN) are significant expenses for Wireless Service Providers (WSPs). Investments in skilled technicians and engineers as well as test tools are required to ensure a high-performance network. Self Organizing Networks (SONs) minimize the lifecycle cost of running a network — they make it more economical to deploy, operate and maintain. SONs also allow for automated optimization of radio network performance by balancing capacity and coverage based on dynamic demand that help reduce service outages and increase customer satisfaction. The ability of SON features to automate many RAN operational activities is a key to the commercial success of Long Term Evolution (LTE) systems. In this paper, we outline a method for quantifying the economic benefits of SON, clearly showing how individual features contribute to reducing costs and present a case study for commercial adaptation of SON in the industry.
{"title":"Economic benefits of SON features in LTE networks","authors":"Louise Gabriel, Michel L. F. Grech, Fani Kontothanasi, Amit Mukhopadhyay, Marios Nicoloau, A. Sharma","doi":"10.1109/SARNOF.2011.5876466","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876466","url":null,"abstract":"Initial configuration and on-going optimizations of the Radio Access Network (RAN) are significant expenses for Wireless Service Providers (WSPs). Investments in skilled technicians and engineers as well as test tools are required to ensure a high-performance network. Self Organizing Networks (SONs) minimize the lifecycle cost of running a network — they make it more economical to deploy, operate and maintain. SONs also allow for automated optimization of radio network performance by balancing capacity and coverage based on dynamic demand that help reduce service outages and increase customer satisfaction. The ability of SON features to automate many RAN operational activities is a key to the commercial success of Long Term Evolution (LTE) systems. In this paper, we outline a method for quantifying the economic benefits of SON, clearly showing how individual features contribute to reducing costs and present a case study for commercial adaptation of SON in the industry.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123656599","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
扫码关注我们
求助内容：
应助结果提醒方式：