{"title":"Estimating the real with the virtual: How does the accuracy relate to the internet penetration?","authors":"Ignacio Castro, Sergey Gorinsky","doi":"10.1109/COMSNETS.2016.7440009","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440009","url":null,"abstract":"Direct measurements of the real world are typically expensive and time-consuming. Recent studies have revealed the promising quick alternative where real-world characteristics are indirectly estimated based on data readily available in the Internet. Such methods for indirect virtual-world estimation of real-world properties rely on the implicit hypothesis that the estimation accuracy depends on how extensively the Internet penetrates into the real world. Our paper makes the first step towards validating this hypothesis. We adopt a simple statistical model to quantify the relationship between an index of consumer prices and online searches for respective categories of goods and services across 19 countries. We also show how the strength of this relationship depends on Internet-penetration and other socioeconomic variables.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"3 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":"133890992","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":"Cumulant based automatic modulation classification of QPSK, OQPSK, 8-PSK and 16-PSK","authors":"Dibyajyoti Das, P. Bora, R. Bhattacharjee","doi":"10.1109/COMSNETS.2016.7439996","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439996","url":null,"abstract":"An automatic modulation classification (AMC) method based on the fourth-order cumulants is proposed to classify QPSK, OQPSK, 8-PSK and 16-PSK. The method consists of two steps: (1) classification of QPSK and OQPSK using the fourth order zero-conjugate cumulant of backward differences of the samples of the received nosiy signal and (2) classification of QPSK, 8-PSK and 16-PSK using the fourth order zero-conjugate cumulant of the received noisy signal and their squares. Step 1 is guided by the observation that the fourth order zero-conjugate cumulants of backward differences are distinct for those two modulation formats. Step 2 is based on the fact that the squaring of an MPSK signal results in another MPSK signal with M/2 phase states. The Monte Carlo simulation results show that the proposed method is able to classify the afore-mentioned modulation schemes at moderately low signal to noise ratios with a small sample size. The proposed method is robust to the presence of carrier phase and frequency estimation errors.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"87 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":"132719391","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":"Efficient ECG data compression and transmission algorithm for telemedicine","authors":"C. Jha, M. Kolekar","doi":"10.1109/COMSNETS.2016.7439988","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439988","url":null,"abstract":"This paper presents an efficient electrocardiogram (ECG) data compression and transmission algorithm based on discrete wavelet transform and run length encoding. The proposed algorithm provides comparatively high compression ratio and low percent root-mean-square difference values. 48 records of ECG signals are taken from MIT-BIH arrhythmia database for performance evaluation of the proposed algorithm. Each record of ECG signals are of duration one minute and sampled at sampling frequency of 360 Hz over 11-bit resolution. Discrete wavelet transform has been used by means of linear orthogonal transformation of original signal. Using discrete wavelet transform, signal can be analyzed in time and frequency domain both. It also preserves the local features of the signal very well. After thresholding and quantization of wavelet transform coefficients, signals are encoded using run length encoding which improves compression significantly. The proposed algorithm offers average values of compression ratio, percentage root mean square difference, normalized percentage root mean square difference, quality score and signal to noise ratio of 44.0, 0.36, 5.87, 143, 3.53 and 59.52 respectively over 48 records of ECG data.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"233 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":"133021363","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":"On the topology of Indian and Western road networks","authors":"Sarath Babu, B. S. Manoj","doi":"10.1109/COMSNETS.2016.7440027","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440027","url":null,"abstract":"Road networks form a class of complex networks with wide-ranging properties evolved from history and technological development. In this paper we study the graph theoretical properties of Indian and Western road networks (from US and Europe) using primal graph approach. We consider the type of road as an important parameter and define metrics Link Type Proportion (Pi), Link Type Dominance (Di), and Link Type Index (Si) for analysis of an important property that defines the quality of road networks. Our results show that Indian and European cities do not provide road-types sufficient enough to handle their domination in shortest paths. While US roads maintain a surplus in terms of Si, Indian and European roads provide a deficit for highly dominating types and surplus for types with low domination. Thus, the behavior of Si provides clues toward the existing problems in complex road networks in Indian as well as European cities.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"17 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":"130156443","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":"Estimating the degree centrality ranking","authors":"A. Saxena, Vaibhav Malik, S. Iyengar","doi":"10.1109/COMSNETS.2016.7440022","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440022","url":null,"abstract":"Complex networks have gained more attention from the last few years. The size of the real world complex networks, such as online social networks, WWW networks, collaboration networks, is exponentially increasing with time. It is not feasible to completely collect, store and process these networks. In the present work, we propose a method to estimate degree centrality ranking of a node without having complete structure of the graph. The proposed method uses degree of a node and power law exponent of the degree distribution to calculate the ranking. We also study simulation results on Barabasi-Albert model. Simulation results show that average error in the calculated ranking is approximately 5% of total number of nodes.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"16 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":"123784237","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":"Image-based data interfaces revisited: Barcodes and watermarks for the mobile and digital worlds","authors":"Gaurav Sharma","doi":"10.1109/COMSNETS.2016.7440021","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440021","url":null,"abstract":"The ubiquitous availability of image sensors in smartphones and other mobile computing devices makes feasible new applications for both barcodes that encode data as image patterns and watermarks that hide data in images. To support these new applications, a number of new methods have been developed for these long-standing image-based data communication interfaces, methods that are better suited for use with the image sensors. In this paper, we review these developments and the applications they enable, drawing upon examples from our own prior work in this area. We highlight key attributes that distinguish these image-based communications interfaces from other noncontact modes of communication and make their continued use an attractive option.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"2 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":"126356503","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":"cStream: Cloud based high performance video delivery network","authors":"V. Mann, Aastha Tripathi, S. Ghosal","doi":"10.1109/COMSNETS.2016.7439990","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439990","url":null,"abstract":"Live streaming and video-on demand are increasing at a rapid pace. Global Over-the-top (OTT) video market is estimated to grow to $37.2 billion by 2017. However, live video streaming continues to suffer from high buffering ratios, high join times, high join failures and low average bit rates. The economic impact of these user experience metrics is huge. A recent white paper from Akamai states that 10-second delay in video streaming caused by startup time triggers over a 45% decline in viewership (and revenue). Recent studies have shown that traditional CDNs account for more than 20% of these join failure and bit rate degradation issues. In this paper, we present CSTREAM- a high performance cloud based live video delivery network. CSTREAM leverages the Cloud provider's global footprint, Cloud provider's high performance backbone network between different data centers, social media analytics and a UDP based fast data transfer protocol to optimize the quality of experience for end users, and the total cost incurred by the cloud provider in terms of network bandwidth and compute resources. CSTREAM allows a video broadcaster to be redirected to its closest publishing point (PP - hosted inside the “closest” Cloud data center), and then transfers the live stream at high speed using a UDP based fast protocol to one or more receiver side proxy (RSP) nodes (hosted on different Cloud data centers) worldwide, before being delivered to the eventual receiver devices. Our preliminary experiments indicate that CSTREAM can improve throughput and transfer times by up to 14 times for a transmission across the globe from San Jose to Hong Kong.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"32 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":"117197574","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}
Abhiroop Bhatnagar, Amit Kumar, R. Ghosh, R. Shyamasundar
{"title":"A framework of community inspired distributed message dissemination and emergency alert response system over smart phones","authors":"Abhiroop Bhatnagar, Amit Kumar, R. Ghosh, R. Shyamasundar","doi":"10.1109/COMSNETS.2016.7439956","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439956","url":null,"abstract":"In this paper, we propose a framework for distributed dissemination of messages over the GSM network by leveraging the capabilities of smart phones. The major contribution of this work is an implementation of a broker-based peer to peer protocol for prioritized delivery of messages in order to support a fast emergency alert and response mechanisms. We have implemented a distributed phone book for controlled dissemination of messages along with a framework for handling responses appropriate to alert messages. In particular, our focus is on the origin and theoretical rationale of system design and the implementation of Data Cart and Data Cart Tracker. The two key features we have preserved in the implementation are: (i) energy efficiency, and (ii) prioritized delivery of messages.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"10 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":"124534881","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":"Spherule diagrams with graph for social network visualization","authors":"Mithileysh Sathiyanarayanan, Donato Pirozzi","doi":"10.1109/COMSNETS.2016.7439961","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439961","url":null,"abstract":"As social network information keeps growing, there is always a need for better information visualization techniques for carrying out multifarious analysis, which is commonly called as social network analysis. Social networks have become a big platform for advertisements, where a company targets highly connected than to more isolated users. To target highly connected users and their activities, visualizations such as Euler diagrams, Treemap diagrams, graphs and their combinations were tested by various researchers. Though Euler diagrams combined with graph and Treemap diagrams with graph have provided some interesting results, the one question yet to be answered is the scalability. In this paper, we propose a novel visual technique, “Spherule diagrams with graph”, which addresses the scalability issue. The novel technique is then compared with the traditional Euler diagrams with graph using a twitter case study in an empirical form. Twenty-eight participants were exposed to eighteen diagrams (nine diagrams of each type of visualization) in a software which recorded accuracy and response time (i.e., performance measure). The results of 504 observations indicate that (a) there is no significant difference between the visualizations in terms of accuracy and (b) there is a significant difference between the visualizations in terms of response time. Also, users were asked to aggrandize between the two visualizations (i.e., preference measure), where 75% preferred Spherule diagrams with graph for its simplicity, comprehensiveness, navigation, alignment (layout), set ordering and data items ordering characteristics. We conclude that, Spherule diagrams with graph will be beneficial for researchers and practitioners in the information visualization community who are exploring social networks for business.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"6 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":"122584117","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":"Conflict graph based Community Detection","authors":"Priti Singh, Abhishek Chakraborty, B. S. Manoj","doi":"10.1109/COMSNETS.2016.7439934","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439934","url":null,"abstract":"Community is a network's subgraph where vertices share similar properties and reflect interesting characteristics for understanding complex networks more closely. Therefore, community structure analysis is important in understanding and exploring complex networks and helps in describing relationship among nodes in a network. However, efficiently finding communities in a complex network still remains an open problem. Since there exists numerous ways of defining a community, existing strategies have adopted different parameters to reflect varied behavior of a community structure and trying to give a coarser or finer community distribution. In this paper, we propose Conflict graph Transform based Community Detection (CTCD) strategy to improve the quality of community distributions. CTCD focuses on the impact of degree of influence to detect more favorable community partitions. A well known measure, known as Surprise, is used to evaluate and compare the quality of the community distributions obtained using CTCD. Finally, in order to study the performance and usefulness of our strategy, CTCD is applied in real-world networks. Using CTCD, we are able to obtain better community distributions with higher Surprise value in real-world networks. We observe that 1-hop and 2-hop influences improve the Surprise value in higher and lower average clustering coefficient networks, respectively. Moreover, CTCD can efficiently extract the hierarchical nature of communities within networks.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"94 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":"130937184","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}