Shreyas Sridhar, K. Madhuri, Shreyas Shah, J. Chaturvedi, A. Vijayarajan, Abhishek M. Appaji
{"title":"A biodesign based study on chronic tinnitus and evaluation of adaptive noise cancellation technology in its management","authors":"Shreyas Sridhar, K. Madhuri, Shreyas Shah, J. Chaturvedi, A. Vijayarajan, Abhishek M. Appaji","doi":"10.1109/COMSNETS.2016.7440012","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440012","url":null,"abstract":"Advancements in technology have aided doctors and patients alike. However, there are always unmet needs and gaps in the market to be filled. In the audiology space, despite many technologies that address tinnitus, successfully implementing a solution for tinnitus is one such challenge. Tinnitus is the perception of sound in the absence of an acoustic stimulus and is heard only by the patient. It has an estimated prevalence of 50 - 70 million people in India, and about 17% of the world population develops this condition sometime in their life. There is a need for a solution that is affordable, and accessible to the majority population. In this study, a structured unmet needs analysis process that is based along the lines of the Biodesign approach has been employed to study and assess this unmet need. An understanding of the current treatment gaps and stakeholder analysis was done, which led to the formulation of a detailed need specification. The proposed concept involves determination of the subject's tinnitus frequency and pitch followed by the application of adaptive noise cancellation techniques to eliminate the noise heard by patient in real time. The implementation of the Biodesign methodology, scientific research on Tinnitus, a technical feasibility study was performed and results of the initial concept study is presented in this paper.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"63 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":"126719912","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":"Per-VM page cache partitioning for cloud computing platforms","authors":"Prateek Sharma, Purushottam Kulkarni, P. Shenoy","doi":"10.1109/COMSNETS.2016.7439971","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439971","url":null,"abstract":"Cloud computing has become popular for shared hosting of third-party applications. A cloud platform may multiplex virtual machines running different customer applications onto a single physical server, raising the potential for performance interference between such applications. In particular, when a hypervisor shares the file system page cache between virtual machines, as is common in Linux environments, it is possible for one VM to impact the performance seen by other co-located VMs. To address this drawback and improve performance isolation, we design a page cache which is partitioned by VMs. Such a design provides the ability to control fine-grained caching parameters such as cache size and eviction policies individually. Furthermore, the deterministic cache allocation and partitioning provides improved performance isolation among VMs. We provide dynamic cache partitioning by using utility derived from the miss-ratio characteristics. We implement our page cache architecture in the Linux kernel and demonstrate its efficacy using disk image files of virtual machines and different types of file access patterns by applications. Experimental results show that the utility-based partitioning can reduce the cache size by up to an order of magnitude while increasing cache hit ratios by up to 20%. Among other features, the per-file page cache has fadvise integration, a scan-resistant eviction algorithm (ARC) and reduced lock-contention and overhead during the eviction process.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"35 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":"121264854","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":"Energy efficient learning and classification for distributed sensing","authors":"Yuan Li, Xin Li, P. Grover","doi":"10.1109/COMSNETS.2016.7439991","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439991","url":null,"abstract":"In order to reduce total energy communicated by distributed sensors, we address the problem where the recipient wants to perform supervised learning and classification on the data received from the sensors. Restricting our attention to a noiseless communication setting under simplistic Gaussian source assumptions, we provide algorithms for performing this supervised learning under energy limitations. The key idea we bring in is to approximate the problem of minimizing classification error-probability by minimizing the distortion in recovering the decision variable. Constraings on energy consumption in sensors is brought in by using simplistic circuit models inspired from the Analog-to-Digital Converter (ADCs) models. We provide an algorithm for learning the distribution-parameters of sensor-data under these energy constraints to arrive at high-reliability energy-allocation strategies, while enabling the energy-allocation algorithm to backtrack when the underlying distributions change, or when there is noise in sensed data that can push the algorithm towards a local minimum. Finally, we present numerical results on simulated data demonstrating the promise of the proposed techniques in reducing energy consumption.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"35 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":"134430844","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":"Compressive cooperative communication with decode and forward relay","authors":"N. Jain, V. Bohara, Anubha Gupta","doi":"10.1109/COMSNETS.2016.7439938","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439938","url":null,"abstract":"The theory of compressive sensing (CS) is acquiring attraction now a days, as it can reconstruct a sparse signal at a sub-Nyquist sampling rate. Recently CS is being used in communication systems for channel estimation, Massive MIMO, cognitive radio etc. In this paper, CS is using in an overlay cooperative spectrum sharing scheme for decode and forward relay, to not only overcome the drawbacks of CSS but also to enhance the performance of the system in terms of achievable rate.","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":"114599068","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":"Energy efficient downlink scheduling in LTE-Advanced networks","authors":"H. Mahdavi-Doost, N. Prasad, S. Rangarajan","doi":"10.1109/COMSNETS.2016.7439928","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439928","url":null,"abstract":"LTE-Advanced (LTE-A) cellular networks are characterized by their use of OFDM based multiple access (OFDMA) and multi-antenna (MIMO) techniques. Starting from the seminal work of Andrews-Zhang, several algorithms for subframe scheduling over such networks, that seek to exploit multi-channel, multi-user and spatial diversity, have been proposed. Recent interest in both industry and academia is to incorporate energy efficiency in the design of such algorithms. In this paper, we formulate a single-cell downlink scheduling problem that exploits all key features and enforces all the main mandatory constraints on the choice of transmission parameters. Linear cost constraints on the set of channels are also imposed in order to accommodate energy efficiency considerations. We show that the resulting problem is equivalent to a combinatorial auction problem with fractionally sub-additive (but not necessarily submodular) valuations and linear constraints on the items being auctioned. The combinatorial auction problem with submodular valuations and without any additional constraints, can be approximately solved using the classical greedy algorithm. For the problem at hand, we instead propose a deterministic multiplicative updates based algorithm. The latter algorithm is simple enough to be implemented in the fine time-scale (1 ms) of subframe scheduling. We rigorously establish the approximation guarantee of our proposed algorithm and evaluate its performance via simulations.","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":"123011145","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":"Monitoring of Android devices using SNMP","authors":"Karan Grover, Vinayak Naik","doi":"10.1109/COMSNETS.2016.7439952","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439952","url":null,"abstract":"Mobile technology is revolutionizing the way companies do business, by improving business processes, increasing productivity and enhancing customer experience. Hence the need to manage/monitor the mobile phones has never been higher. Simple Networking Management Protocol (SNMP), is an internet standard protocol for managing IP devices on a network. Devices that typically support SNMP include routers, switches, servers, workstations, printers, modem racks and more. No doubt then, SNMP must be used to monitor smart phone devices for conditions that warrant administrative attention. In this paper we talk about 1. Building one of the very first SNMP Agents for Android Operating System implementing SNMP version I, II and III, 2. The results after performing benchmark tests on the SNMP Agent and measuring its performance on the phone and in challenging networks like 2G and 3G.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"31 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":"129827635","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":"Resource management for device-to-device multicast in LTE-a network","authors":"Ajay Bhardwaj","doi":"10.1109/COMSNETS.2016.7439992","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439992","url":null,"abstract":"Device-to-Device (D2D) multicast communication is emerging as a practical solution for alleviating severe capacity crunch in data-centric wireless networks and encourage backhaul-free communication directly among devices with similar content requirement. To exploit D2D communication for achieving higher throughput, less delay and efficient spectrum usage, a careful resource allocation is required. In this study, we analyze the resource sharing between cellular users (CUs) and D2D users when one or more than one D2D multicast groups share the resources with a CU, with the objective of maximizing the system throughput and spectrum efficiency, while guaranteeing a certain level of quality of service to CUs and D2D users.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"70 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":"129874364","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}
S. Chaudhary, Tanjot Kaur, N. Aggarwal, B. Raman, D. Bansal, K. Ramakrishnan
{"title":"Bus boarding event detection using smartphone sensors","authors":"S. Chaudhary, Tanjot Kaur, N. Aggarwal, B. Raman, D. Bansal, K. Ramakrishnan","doi":"10.1109/COMSNETS.2016.7439930","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439930","url":null,"abstract":"Rapid growth in smartphones industries has made smartphones omnipresent. The incorporation of a number of powerful sensors in the smartphones lately have enhanced their applicability besides their customary use for communications. Sensors in smartphones can be used to detect users activities and localization. But use of all sensors put a lot of burden on smartphone battery. Battery drainage is a big problem and most commuters do not prefer to use power hungry sensors such as GPS. In this paper, we explored the possibility to use the low power smartphone sensors to detect the initial movement of users such as bus boarding movement which can act as a trigger to collect data from other sensors. The proposed approach is implemented as an android app and consists of two modules. First module is based on accelerometer sensors to detect initial staircase pattern movement of user and triggers the second module. Second module detects linear acceleration of user in one direction and movement of bus using accelerometer and GSM sensors. Various experiments are conducted to find the appropriate features to characterize the bus boarding event. Based on these features a scaled training model is generated. This model is deployed along with the Android application to perform event detection on the smartphone itself. We conducted experiments using five different phones and found promising results of detecting the event.","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":"129359354","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 algorithm to search edge relaxed query graph with minimum support threshold in large communication networks","authors":"P. Nirmala, Nadarajan Rethnasamy","doi":"10.1109/COMSNETS.2016.7439954","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439954","url":null,"abstract":"With the increasing scale and complexity of today's communication network, it is becoming more essential to find the frequent subgraph of a time series of communication network to predict the nodes which are often involved in the communication. This knowledge is useful in devising new routing algorithms, and understanding the frequent communication patterns. It is often required to determine the frequency of a query graph in the graph database to realize how much that query graph is occurred in the communication network and it facilitates to monitor the performance of the nodes which are presented in the query graph. When a query graph does not have an exact match with the graphs in the graph database, the idea of finding approximate match of the query graph is coined to determine the frequency of the query graph by relaxing few edges of it. This paper presents an algorithm which decides whether the query graph is frequent as expected times in the graph database, if not so then the algorithm relax infrequent edges from the query graph to find the subgraph of the query graph with the given minimum support threshold.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"27 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":"124578153","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":"Characterization of the missed spectrum-access opportunities under dynamic spectrum sharing","authors":"Nilesh Khambekar, C. Spooner, V. Chaudhary","doi":"10.1109/COMSNETS.2016.7439929","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439929","url":null,"abstract":"The radio frequency (RF) spectrum has been observed to be underutilized in the space, time, and frequency dimensions. To improve its utilization and meet growing demand, dynamic spectrum-sharing models are being investigated. In order to maximize the use of spectrum, we study how much of the spectrum can be potentially shared and how much is actually shared under the constraints defined by a typical spectrum-sharing model. We characterize and quantify the recovered spectrum using statically defined constraints on the secondary-user (SU) transceivers of minimum primary-user (PU) detection sensitivity and maximum SU transmit power. Simulation experiments reveal the impact of conservative worst-case RF-environment assumptions on missed spectrum-access opportunities.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"11 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":"125082345","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}