{"title":"Spectrum sharing: How much to give","authors":"Dileep Kumar, D. Manjunath, J. Nair","doi":"10.1109/COMSNETS.2016.7439962","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439962","url":null,"abstract":"Spectrum holding per cellular telephony service provider in India is significantly lower than the world average. The spectrum is also severely fragmented across bands and the fragments also have different license conditions. Regulators in India have recently recognized that such spectrum fragmentation is a source of inefficiency for the service providers and have allowed sharing of spectrum among the providers. The genesis of this paper is this regulatory order and it has a three-fold objective. We first study an example spectrum allocation. By assuming GSM-like voice telephony service, we analyse the spectrum holding in one service area in some detail. Using simple calculations, we see that complete pooling of resources by the providers may not be stable-one provider may have a lower blocking probability if it does not form a coalition. This leads us to our second objective of developing analytically tractable partial sharing models where the providers do not pool all their resources. For a probabilistic spectrum sharing model, we analyse a simple system and obtain the partial sharing that will make the coalition stable and Pareto efficient. This model is then extended to a larger system and numerical results from the analytical model are used to obtain additional insights. We then consider a deterministic sharing model for which we also present a similar analysis for this system. We also show that the deterministic sharing system can be analysed via a suitably defined circuit multiplexed network that allows us to use Kelly's Erlang fixed point approximation which in turn provides economic insights. The final objective is to develop a game theoretic model for partial sharing. We provide a Nash bargaining framework for partial sharing. We also discuss some revenue sharing mechanisms when the providers' benefits from partial sharing are asymmetric.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126568039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Benchmarks to compare cloud service providers for seamless customer migration","authors":"K. Ravindran, Arun Adiththan, Michael Iannelli","doi":"10.1109/COMSNETS.2016.7439957","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439957","url":null,"abstract":"The paper advocates a seamless cloud abstraction to enable the mobility of clients: i.e., a cloud that appears to offer the same service-level properties despite the heterogeneous nature and geographic location of the cloud providers. The paper concretely defines the service attributes experienced by a client application: such as availability, elasticity, resilience, and mobility, in terms of the cloud infrastructure parameters (i.e., VM instances and network bandwidth). Since the IaaS parameters are hard to measure directly, we map the client-visible SaaS-layer attributes onto the IaaS parameters of the CSP. The paper describes SaaS layer measurements of an image data service on the PlanetLab, as an instance of seamless cloud.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116872351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A computational study of a variant of the Optimal Velocity Model with no collisions","authors":"G. Kamath, K. Jagannathan, G. Raina","doi":"10.1109/COMSNETS.2016.7439972","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439972","url":null,"abstract":"The Optimal Velocity Model (OVM) is a car-following model that captures some interesting real-world phenomena. There are two key variants of this model, which depend on whether they capture the dynamics of a platoon of vehicles travelling on a circular loop, or on an infinitely long road. In this paper, we numerically compare the OVM analysed by Orosz et al. [8] (which considers a circular loop) and the recently-proposed Modified Optimal Velocity Model (MOVM) (which considers an infinitely long road). A key insight obtained is that the variant with periodic boundary conditions could lead to collisions, which appears to be absent in the MOVM. We also derive a necessary condition for non-oscillatory convergence of the MOVM for autonomous vehicles to avoid oscillatory movements.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117065705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Link dynamics in scientific collaboration networks","authors":"Roshni Chakraborty, Joydeep Chandra","doi":"10.1109/COMSNETS.2016.7440004","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440004","url":null,"abstract":"Links in collaboration networks exhibit certain temporal behavior that leads to the emergence of several dynamic properties. In this paper, we introduce social yield as a measure of collaboration success of the collaborating authors in a co-authorship network. We, then attempt to empirically observe the link dynamics in collaboration networks induced by the social yield of the collaborations. Observations indicate that certain properties of scientific collaboration networks like community dynamics and resilience can be explained by the distribution of social yield among the collaborations.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128256694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An improved multiple feedback successive interference cancellation algorithm for MIMO detection","authors":"Manish Mandloi, M. A. Hussain, V. Bhatia","doi":"10.1109/COMSNETS.2016.7439983","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439983","url":null,"abstract":"Symbol vector detection in multiple-input multiple-output (MIMO) spatial multiplexing systems is gaining a lot of research attention. The optimal (minimum) bit error rate (BER) performance in spatially multiplexed MIMO systems can be achieved by employing maximum likelihood detection (MLD) at the receiver end. However, MLD performs an exhaustive search over all possible transmit vectors which is computationally impractical when number of antennas or the modulation order increases. With the motivation of detecting symbol vector in MIMO systems with less computational complexity, we propose an improved multiple feedback successive interference cancellation (IMF-SIC) algorithm in this paper. The multiple feedback (MF) strategy in successive interference cancellation (SIC) is based on the concept of shadow area constraint (SAC) where multiple neighboring constellation points are used in the decision feedback loop if the decision falls in the shadow region. In improved MF strategy, the SAC criteria is checked recursively which results in a better BER performance. Further, to achieve a higher detection diversity, we also propose a multiple branch IMF-SIC (MB-IMF-SIC) algorithm where we incorporate the concept of multiple branch (MB) processing. Simulation results show that the proposed algorithms outperform the existing SIC and MF-SIC based MIMO detectors, and achieves a near optimal BER performance.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131548383","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}
Meera Radhakrishnan, Sougata Sen, Vigneshwaran Subbaraju, Archan Misra, R. Balan
{"title":"IoT+Small Data: Transforming in-store shopping analytics & services","authors":"Meera Radhakrishnan, Sougata Sen, Vigneshwaran Subbaraju, Archan Misra, R. Balan","doi":"10.1109/COMSNETS.2016.7439946","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439946","url":null,"abstract":"We espouse a vision of small data-based immersive retail analytics, where a combination of sensor data, from personal wearable-devices and store-deployed sensors & IoT devices, is used to create real-time, individualized services for in-store shoppers. Key challenges include (a) appropriate joint mining of sensor & wearable data to capture a shopper's product-level interactions, and (b) judicious triggering of power-hungry wearable sensors (e.g., camera) to capture only relevant portions of a shopper's in-store activities. To explore the feasibility of our vision, we conducted experiments with 5 smartwatch-wearing users who interacted with objects placed on cupboard racks in our lab (to crudely mimic corresponding grocery store interactions). Initial results show significant promise: 94% accuracy in identifying an item-picking gesture, 85% accuracy in identifying the shelf-location from where the item was picked and 61% accuracy in identifying the exact item picked (via analysis of the smartwatch camera data).","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123926324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Approximate analysis of MIMO based cooperative communication in α - μ channel distribution","authors":"A. K. Saxena, Shashank Goyal, R. S. Kshetrimayum","doi":"10.1109/COMSNETS.2016.7440029","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440029","url":null,"abstract":"In the present work we have analysed the performance of a dual hop cooperative communication system. Multiple relays are taken for DF (Decode and Forward) relaying of signal from source to the destination over i.i.d. α - μ generalized fading channel distribution. Multiple antennas are realized at all the receive and transmit nodes on the source, relay and destination with Orthogonal Space Time Block Coding (OSTBC) implementation. Theoretical approximation for Symbol Error Rate (SER) performance is evaluated for Binary Phase Shift Keying (BPSK) and 4-Quadrature Amplitude Modulation (4-QAM) schemes as a function of Signal to Noise Ratio (SNR) using the Moment Generating Function (MGF) of the channel distribution. The variation of performance with number of relays used is studied. Monte Carlo simulation is used for verification of the analytical expression obtained.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124843727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An efficient algorithm for PMFAP","authors":"Soumen Atta, P. Mahapatra","doi":"10.1109/COMSNETS.2016.7440013","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440013","url":null,"abstract":"Perturbation-Minimizing Frequency Assignment Problem (PMFAP) is a frequency assignment problem in which newly generated demands are satisfied with minimum change in the already existing frequency assignment keeping all the interference constraints. In this paper an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. The proposed algorithm also works for the well-known Frequency Assignment Problem (FAP) and its performance is compared with the existing results for the standard benchmark data sets.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126597495","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}
Hema Kumar Yarnagula, Shubham Luhadia, S. Datta, V. Tamarapalli
{"title":"Quality of experience assessment of rate adaptation algorithms in DASH: An experimental study","authors":"Hema Kumar Yarnagula, Shubham Luhadia, S. Datta, V. Tamarapalli","doi":"10.1109/COMSNETS.2016.7440008","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440008","url":null,"abstract":"With the widespread use of dynamic adaptive streaming over HTTP (DASH) for online video streaming, ensuring the user's quality of experience (QoE) is of importance to both service and network providers to improve their revenue. DASH aims to adapt the bitrate based on the available bandwidth, while minimizing the number of playback interruptions. This is typically achieved with a rate adaptation algorithm, that chooses an appropriate representation for the next video segment. Most of the algorithms use buffer occupancy, measured throughput, or a combination of these to decide the best representation for next segment. In this paper, we investigate the influence of rate adaptation algorithms on the QoE metrics. We implement five different rate adaptation algorithms and experimentally evaluate them under varying bandwidth and network scenarios. We use objective metrics such as, playback start time, average bitrate played, number of bitrate switching events, number of interruptions and duration of the interruptions to assess the QoE. Our results demonstrate that algorithms that consider both throughput and buffer occupancy results in better QoE. Further, we observe that algorithms considering segment size remove the interruptions alongside improving average bitrate played. We observe that due to the mutual dependency of QoE metrics, most of the algorithms do not necessarily improve QoE while selecting the best bitrate.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116757500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Channel sensing based dynamic adjustment of contention window in LAA-LTE networks","authors":"Anand M. Baswade, T. B. Reddy","doi":"10.1109/COMSNETS.2016.7440028","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440028","url":null,"abstract":"3GPP is introducing Licensed Assisted Access (LAA) in Release 13 [1], for LTE operation in unlicensed bands, to provide high data rate and to reduce the load on licensed spectrum. One of the mandatory functionalities of LAA is Listen Before Talk (LBT) to co-exist fairly with other technologies in unlicensed bands like Wi-Fi. Contention Window (CW) adjustment is one of the important issues in LAA LBT. Hence in this paper, we propose a dynamic CW adjustment algorithm for LAA based on channel sensing and then evaluated the performance of Wi-Fi in Wi-Fi - Wi-Fi and LAA - Wi-Fi scenarios. Our simulation results show that LAA with proposed CW adjustment algorithm can fairly co-exist with Wi-Fi.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126862806","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}