Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413663
M. Devi, N. Sarma, S. Deka
Unpredictable channel availability in cognitive radio networks (CRNs) account for routing becoming a challenging issue in such network environments. This paper presents a routing scheme for ad hoc CRNs that emphasizes on construction of virtual backbone structure across the network for routing and data transport. The proposed solution features channel adaptive characteristic while performing end-to-end data transmission. Simulation results unveil the effectiveness of this approach.
{"title":"Dynamic virtual backbone based routing in cognitive radio networks","authors":"M. Devi, N. Sarma, S. Deka","doi":"10.1109/ANTS.2015.7413663","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413663","url":null,"abstract":"Unpredictable channel availability in cognitive radio networks (CRNs) account for routing becoming a challenging issue in such network environments. This paper presents a routing scheme for ad hoc CRNs that emphasizes on construction of virtual backbone structure across the network for routing and data transport. The proposed solution features channel adaptive characteristic while performing end-to-end data transmission. Simulation results unveil the effectiveness of this approach.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129057463","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413637
Abhishek Parakh
In this paper we develop the concept of quantifying the security of a quantum cryptographic scheme. We focus on BB84 and develop a model for measuring the security offered by protocols that follow a similar model. We also present a new model for entropy of detection assuming a binomial probability distribution.
{"title":"Quantifying the security of a QKD protocol","authors":"Abhishek Parakh","doi":"10.1109/ANTS.2015.7413637","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413637","url":null,"abstract":"In this paper we develop the concept of quantifying the security of a quantum cryptographic scheme. We focus on BB84 and develop a model for measuring the security offered by protocols that follow a similar model. We also present a new model for entropy of detection assuming a binomial probability distribution.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126353025","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413654
S. Anjana, N. SahanaM., S. Ankith, K. Natarajan, K. R. Shobha, A. Paventhan
During the past decade, water needs have risen exponentially to an unprecedented scale in India. The demand for water supply is ever increasing and satisfying this requirement has been a major challenge for many countries around the world. Urbanization, climatic changes and wasteful usage has further depleted the resource. Water being one of the major requirements for human survival, conservation and management of the resource must be given utmost importance. Ensuring access to safe and clean water is another issue that requires attention. In this paper, we present an IPv6 network connected IoT design for real-time water flow metering and quality monitoring. Our prototype implementation uses CoAP for monitoring and control approach which supports internet based data collection. The system addresses new challenges in the water sector - ease of billing, fair billing and the need for a study of supply versus consumption of water in order to create awareness to curb water wastage and encourage its conservation. Automatic detection of leakage through any of the outlets is notified to the user. We also measure the quality of water distributed to every household by deploying pH and ORP sensors. The traditional water metering systems require periodic manual intervention for both metering and maintenance making it inconvenient and often least effective. Shortcomings of the existing models call for a ubiquitous usage of wireless systems for smart water flow metering and quality monitoring. We propose to do this with the aid of CC2538 motes programmed using ContikiOS to monitor the water consumption and communicate the data to a gateway wirelessly.
{"title":"An IoT based 6LoWPAN enabled experiment for water management","authors":"S. Anjana, N. SahanaM., S. Ankith, K. Natarajan, K. R. Shobha, A. Paventhan","doi":"10.1109/ANTS.2015.7413654","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413654","url":null,"abstract":"During the past decade, water needs have risen exponentially to an unprecedented scale in India. The demand for water supply is ever increasing and satisfying this requirement has been a major challenge for many countries around the world. Urbanization, climatic changes and wasteful usage has further depleted the resource. Water being one of the major requirements for human survival, conservation and management of the resource must be given utmost importance. Ensuring access to safe and clean water is another issue that requires attention. In this paper, we present an IPv6 network connected IoT design for real-time water flow metering and quality monitoring. Our prototype implementation uses CoAP for monitoring and control approach which supports internet based data collection. The system addresses new challenges in the water sector - ease of billing, fair billing and the need for a study of supply versus consumption of water in order to create awareness to curb water wastage and encourage its conservation. Automatic detection of leakage through any of the outlets is notified to the user. We also measure the quality of water distributed to every household by deploying pH and ORP sensors. The traditional water metering systems require periodic manual intervention for both metering and maintenance making it inconvenient and often least effective. Shortcomings of the existing models call for a ubiquitous usage of wireless systems for smart water flow metering and quality monitoring. We propose to do this with the aid of CC2538 motes programmed using ContikiOS to monitor the water consumption and communicate the data to a gateway wirelessly.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116195980","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413619
Binod Prasad, Sanjay Dhar Roy, S. Kundu
In this paper performance of a cognitive relay network (CRN) is studied under imperfect channel state information (CSI) where a secondary user (SU) transmits using a decode and forward (DF) relay. The DF relay is assumed to harvest energy from the radio frequency (RF) signal transmitted by SU. The performance is evaluated in terms of throughput in an underlay scenario with the energy harvesting relay. The CSI of the interfering links i.e. links from SU transmitter as well as from relay to the primary user (PU) receiver, available at the SU transmitter and the relay, are assumed to be imperfect. A scaling factor based power control is used for the SU and relay in order to protect the PU satisfying an outage constraint. The impact of energy harvesting time, imperfect CSI, PU outage constraint and interference threshold on the throughput of the SU network is indicated. Further the impact of the above parameters on the average transmit power of the relay is also indicated. The performance is assessed using a test bed developed in MATLAB.
{"title":"Secondary throughput in underlay cognitive radio network with imperfect CSI and energy harvesting relay","authors":"Binod Prasad, Sanjay Dhar Roy, S. Kundu","doi":"10.1109/ANTS.2015.7413619","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413619","url":null,"abstract":"In this paper performance of a cognitive relay network (CRN) is studied under imperfect channel state information (CSI) where a secondary user (SU) transmits using a decode and forward (DF) relay. The DF relay is assumed to harvest energy from the radio frequency (RF) signal transmitted by SU. The performance is evaluated in terms of throughput in an underlay scenario with the energy harvesting relay. The CSI of the interfering links i.e. links from SU transmitter as well as from relay to the primary user (PU) receiver, available at the SU transmitter and the relay, are assumed to be imperfect. A scaling factor based power control is used for the SU and relay in order to protect the PU satisfying an outage constraint. The impact of energy harvesting time, imperfect CSI, PU outage constraint and interference threshold on the throughput of the SU network is indicated. Further the impact of the above parameters on the average transmit power of the relay is also indicated. The performance is assessed using a test bed developed in MATLAB.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122814176","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413621
Ayan Paul, Mainak Sengupta, M. Maitra
Dynamic spectrum allocation (DSA) approach offers an effective means to wireless service providers (WSPs) for efficient utilization of their spectrum resources in order to manage their heterogeneous network (HetNet). The architecture for implementation of DSA has been proposed in IEEE 1900.4 standard. Under the IEEE 1900.4 framework, we envisage a scenario in which, the spectrum available with the WSP is inadequate to serve the aggregate demands of channels or the spectrum, from its radio access networks (RANs). Hence, a plausible solution has been sought in this work that employs and implements the notion of the Bankruptcy Game to formulate a policy decision which would certainly be agreeable to all the RANs. Maximization of proportional fairness (PF) is selected as the potential objective of the WSP. To arrive at an efficient solution that suits the objective of the WSP, we have proposed a novel heuristic namely, H_MPF and have compared the performance of the H_MPF with those of the Shapley value and simulated annealing based channel allocation (SACA) techniques considering solution quality and computational time as the performance indices.
{"title":"Planning of dynamic channel allocation in HetNet under IEEE 1900.4 framework","authors":"Ayan Paul, Mainak Sengupta, M. Maitra","doi":"10.1109/ANTS.2015.7413621","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413621","url":null,"abstract":"Dynamic spectrum allocation (DSA) approach offers an effective means to wireless service providers (WSPs) for efficient utilization of their spectrum resources in order to manage their heterogeneous network (HetNet). The architecture for implementation of DSA has been proposed in IEEE 1900.4 standard. Under the IEEE 1900.4 framework, we envisage a scenario in which, the spectrum available with the WSP is inadequate to serve the aggregate demands of channels or the spectrum, from its radio access networks (RANs). Hence, a plausible solution has been sought in this work that employs and implements the notion of the Bankruptcy Game to formulate a policy decision which would certainly be agreeable to all the RANs. Maximization of proportional fairness (PF) is selected as the potential objective of the WSP. To arrive at an efficient solution that suits the objective of the WSP, we have proposed a novel heuristic namely, H_MPF and have compared the performance of the H_MPF with those of the Shapley value and simulated annealing based channel allocation (SACA) techniques considering solution quality and computational time as the performance indices.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122629554","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413612
Ashutosh Jha, Debashis Saha
This paper aims at determining the feasibility of LTE-based 4G-network deployment for providing high-speed broadband access in rural India. Such connectivity is one of the important priorities of the `Digital India' initiative of the Government of India, which would be a primary enabler in the fulfillment of other goals envisaged in the initiative. The assessment is done through a techno-economic analysis, using discounted cash flow approach, taking into account the technical parameters of LTE network components, likely subscriber population (using the Bass model forecasting), and the coverage area matched to the service capacity (using a cell dimensioning approach). We have determined the cost of infrastructure deployment that would meet the demand, estimated the potential revenue from users, and calculated the break-even period given the Average Revenue per User (ARPU). We find that, for a right mix of data-volume offerings in the product package, the annual ARPU can be both affordable to the rural population as well as profitable for the operator. With some amount of stimuli and demand inducing initiatives from the government, 4G investments in the rural India can be an attractive option to the operators.
{"title":"Techno-economic assessment of the potential for LTE based 4G mobile services in rural India","authors":"Ashutosh Jha, Debashis Saha","doi":"10.1109/ANTS.2015.7413612","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413612","url":null,"abstract":"This paper aims at determining the feasibility of LTE-based 4G-network deployment for providing high-speed broadband access in rural India. Such connectivity is one of the important priorities of the `Digital India' initiative of the Government of India, which would be a primary enabler in the fulfillment of other goals envisaged in the initiative. The assessment is done through a techno-economic analysis, using discounted cash flow approach, taking into account the technical parameters of LTE network components, likely subscriber population (using the Bass model forecasting), and the coverage area matched to the service capacity (using a cell dimensioning approach). We have determined the cost of infrastructure deployment that would meet the demand, estimated the potential revenue from users, and calculated the break-even period given the Average Revenue per User (ARPU). We find that, for a right mix of data-volume offerings in the product package, the annual ARPU can be both affordable to the rural population as well as profitable for the operator. With some amount of stimuli and demand inducing initiatives from the government, 4G investments in the rural India can be an attractive option to the operators.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122874502","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413605
F. Dikbiyik, B. Mukherjee
Network virtualization has become an important feature for cloud-based services. Virtual networks can be set up over high-capacity optical networks. They consist of virtual links and nodes, which are mapped over physical resources. Operational virtual networks get gradually upgraded to avoid capacity exhaustion and create resources to handle traffic growth. These upgrades require leasing of new virtual resources (e.g., additional bandwidth for virtual links) and might be costly to network operators. The additional capital expenditure (CapEx) to upgrade the network can be reduced or eliminated by relocating spare virtual resources which were already-leased in the network, but are unused (e.g., due to optimistic forecasts or excessive overprovisioning). Relocating, here, is basically release some of the unused bandwidth from a virtual link and lease the same amount of bandwidth for another virtual link that will be upgraded. We investigate a cost-effective scheme to relocate spare virtual capacity in a virtual network over an optical WDM backbone network to (i) reduce or eliminate upgrade costs, (ii) avoid capacity exhaustion (by migrating resources from underutilized links to overutilized links), and (iii) improve network robustness (by migrating resources from links supported by unreliable lightpaths to links supported by reliable lightpaths). We propose an efficient relocation scheme to avoid capacity exhaustion and improve network robustness while minimizing or even eliminating requirement of new bandwidth. We build our problem into a mathematical formulation which turns out to be an Integer Linear Program (ILP). Our results show that network operator can significantly reduce CapEx while upgrading/improving a virtual network by using our relocation scheme.
{"title":"Efficient relocation of virtual spare resources over optical backbone networks","authors":"F. Dikbiyik, B. Mukherjee","doi":"10.1109/ANTS.2015.7413605","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413605","url":null,"abstract":"Network virtualization has become an important feature for cloud-based services. Virtual networks can be set up over high-capacity optical networks. They consist of virtual links and nodes, which are mapped over physical resources. Operational virtual networks get gradually upgraded to avoid capacity exhaustion and create resources to handle traffic growth. These upgrades require leasing of new virtual resources (e.g., additional bandwidth for virtual links) and might be costly to network operators. The additional capital expenditure (CapEx) to upgrade the network can be reduced or eliminated by relocating spare virtual resources which were already-leased in the network, but are unused (e.g., due to optimistic forecasts or excessive overprovisioning). Relocating, here, is basically release some of the unused bandwidth from a virtual link and lease the same amount of bandwidth for another virtual link that will be upgraded. We investigate a cost-effective scheme to relocate spare virtual capacity in a virtual network over an optical WDM backbone network to (i) reduce or eliminate upgrade costs, (ii) avoid capacity exhaustion (by migrating resources from underutilized links to overutilized links), and (iii) improve network robustness (by migrating resources from links supported by unreliable lightpaths to links supported by reliable lightpaths). We propose an efficient relocation scheme to avoid capacity exhaustion and improve network robustness while minimizing or even eliminating requirement of new bandwidth. We build our problem into a mathematical formulation which turns out to be an Integer Linear Program (ILP). Our results show that network operator can significantly reduce CapEx while upgrading/improving a virtual network by using our relocation scheme.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128715467","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413646
Priya Singhal, Parag Aggarwal, V. Bohara
This paper presents the theoretical characterization of nonlinear distortion effects on a concurrent multi-band orthogonal frequency division multiplexed (OFDM) signal when passed through a nonlinear high power amplifier (HPA). The behavioural model of HPA considered for theoretical analysis is a 2-D memory polynomial model (MPM), which is a truncated form of the Volterra series. We show that the inband and cross modulation distortion introduced due to nonlinear amplification of aggregated OFDM signals can be modelled as a complex attenuation factor and Gaussian nonlinear noise that distorted the received data symbol. Generalised expressions for the complex attenuation factor and Gaussian nonlinear noise in Rayleigh multi-path fading channel have been derived. From the derived expressions, received signal to noise ratio and probability of symbol error for each subcarrier is evaluated and illustrated for N band carrier aggregated OFDM system. Simulation results demonstrate the validity of analytically derived expressions.
{"title":"Nonlinear distortion analysis of multi-band carrier aggregated OFDM signals","authors":"Priya Singhal, Parag Aggarwal, V. Bohara","doi":"10.1109/ANTS.2015.7413646","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413646","url":null,"abstract":"This paper presents the theoretical characterization of nonlinear distortion effects on a concurrent multi-band orthogonal frequency division multiplexed (OFDM) signal when passed through a nonlinear high power amplifier (HPA). The behavioural model of HPA considered for theoretical analysis is a 2-D memory polynomial model (MPM), which is a truncated form of the Volterra series. We show that the inband and cross modulation distortion introduced due to nonlinear amplification of aggregated OFDM signals can be modelled as a complex attenuation factor and Gaussian nonlinear noise that distorted the received data symbol. Generalised expressions for the complex attenuation factor and Gaussian nonlinear noise in Rayleigh multi-path fading channel have been derived. From the derived expressions, received signal to noise ratio and probability of symbol error for each subcarrier is evaluated and illustrated for N band carrier aggregated OFDM system. Simulation results demonstrate the validity of analytically derived expressions.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128934971","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413641
S. Nadaf, H. Rath, V. ArunKumarA., S. Shailendra, Anantha Simha
Cloud provisioning is an emerging area and highly embraced by Enterprises. There are several commercial and open source solutions available in the market. We discuss the problem areas in NaaS with respect to the available solutions and our approach to address the concerns by means of an open source middle layer single umbrella platform called “TCS Network as a Service (TNaaS)”. This platform is modular in nature and provides a vendor agnostic NaaS for cloud provisioning. We also provide a lab based evaluation comprising of OpenStack cloud software, TNaaS, open vSwitches and Floodlight Software Defined Network (SDN) controller.
{"title":"An open source based network as a service (NaaS) platform for cloud provisioning","authors":"S. Nadaf, H. Rath, V. ArunKumarA., S. Shailendra, Anantha Simha","doi":"10.1109/ANTS.2015.7413641","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413641","url":null,"abstract":"Cloud provisioning is an emerging area and highly embraced by Enterprises. There are several commercial and open source solutions available in the market. We discuss the problem areas in NaaS with respect to the available solutions and our approach to address the concerns by means of an open source middle layer single umbrella platform called “TCS Network as a Service (TNaaS)”. This platform is modular in nature and provides a vendor agnostic NaaS for cloud provisioning. We also provide a lab based evaluation comprising of OpenStack cloud software, TNaaS, open vSwitches and Floodlight Software Defined Network (SDN) controller.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"354 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133978172","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413659
Suchita Jain, Vanya Sharma, Rishabh Kaushal
Twitter is fast becoming the most popular platform for spread of information in general and pertaining to political views in particular. Like any other social networking site, Twitter is a medium to socialize with people and particularly in political space, it is pertinent to gauge the public opinion from time to time. One of the key requirements is to find people with similar political opinions in order to consolidate and find new political friends (online sepoys). In this work, our objective is to assist political parties in addressing this issue through a recommendation system which recommends new people to an already registered party worker based on participation of this worker on Twitter in the trending hashtags. Our proposed system is based on a new metric that we call relatedness between any two users on twitter. This metric is derived from analysis of two sources namely link and content of the tweets. The link source is characterized by participation of party worker on Twitter in form of @Mentions and @RT (retweet) that he/she posts in trending hashtags. The content source is characterized by the words appearing in the tweets posted by party worker combined with the hashtags present in them. We construct a directed weighted graph and use the proposed relatedness metric as weight of edges in the graph, whereas the users are considered as nodes of the graph. A well known WalkTrap community detection algorithm is then used to identify clusters of people with similar views based on which recommendation is done. A prototype system called PoliticAlly is developed which provides a simple web interface for party workers to use and get friend recommendations.
{"title":"PoliticAlly: Finding political friends on twitter","authors":"Suchita Jain, Vanya Sharma, Rishabh Kaushal","doi":"10.1109/ANTS.2015.7413659","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413659","url":null,"abstract":"Twitter is fast becoming the most popular platform for spread of information in general and pertaining to political views in particular. Like any other social networking site, Twitter is a medium to socialize with people and particularly in political space, it is pertinent to gauge the public opinion from time to time. One of the key requirements is to find people with similar political opinions in order to consolidate and find new political friends (online sepoys). In this work, our objective is to assist political parties in addressing this issue through a recommendation system which recommends new people to an already registered party worker based on participation of this worker on Twitter in the trending hashtags. Our proposed system is based on a new metric that we call relatedness between any two users on twitter. This metric is derived from analysis of two sources namely link and content of the tweets. The link source is characterized by participation of party worker on Twitter in form of @Mentions and @RT (retweet) that he/she posts in trending hashtags. The content source is characterized by the words appearing in the tweets posted by party worker combined with the hashtags present in them. We construct a directed weighted graph and use the proposed relatedness metric as weight of edges in the graph, whereas the users are considered as nodes of the graph. A well known WalkTrap community detection algorithm is then used to identify clusters of people with similar views based on which recommendation is done. A prototype system called PoliticAlly is developed which provides a simple web interface for party workers to use and get friend recommendations.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"19 3-4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116682719","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
扫码关注我们
求助内容：
应助结果提醒方式：