Pub Date : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945395
Shabir Ali, Anurag Sewak, M. Pandey, N. Tyagi
Peer-to-Peer (P2P) overlays and Mobile Ad hoc Networks (MANETs) exhibit some common characteristics, such as dynamism, self-organization and decentralized control. The synergy between the two has been utilized by researchers to design distributed applications over MANETs. However, the available simulation platforms are far from perfect to evaluate the proposed designs. In most of the simulation platforms, good support is available for wired networks, wireless ad hoc networks and P2P overlays. However, P2P overlays in these platforms are programmed on top of wired networks, and there is no ready-to-use implementation of P2P over MANETs. In this paper, we present our experience and lessons learnt while simulating P2P over MANETs. We have tried different available platforms and concluded that OverSim over OMNeT++ is the best candidate for P2P simulation over MANET underlay. However, we need to incorporate a lot of changes and configurations to solve the purpose. We have designed a new underlay configurator by modifying an existing underlay model of OverSim to add wireless and mobility support in overlay nodes. The modified simulation setup is used for performance evaluation of P2P overlay over MANET at different mobility speeds and node densities. The results obtained are consistent with mobility and churn dynamics, thereby suggesting the utility of our simulation setup.
{"title":"Simulation of P2P overlays over MANETs: Impediments and proposed solution","authors":"Shabir Ali, Anurag Sewak, M. Pandey, N. Tyagi","doi":"10.1109/COMSNETS.2017.7945395","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945395","url":null,"abstract":"Peer-to-Peer (P2P) overlays and Mobile Ad hoc Networks (MANETs) exhibit some common characteristics, such as dynamism, self-organization and decentralized control. The synergy between the two has been utilized by researchers to design distributed applications over MANETs. However, the available simulation platforms are far from perfect to evaluate the proposed designs. In most of the simulation platforms, good support is available for wired networks, wireless ad hoc networks and P2P overlays. However, P2P overlays in these platforms are programmed on top of wired networks, and there is no ready-to-use implementation of P2P over MANETs. In this paper, we present our experience and lessons learnt while simulating P2P over MANETs. We have tried different available platforms and concluded that OverSim over OMNeT++ is the best candidate for P2P simulation over MANET underlay. However, we need to incorporate a lot of changes and configurations to solve the purpose. We have designed a new underlay configurator by modifying an existing underlay model of OverSim to add wireless and mobility support in overlay nodes. The modified simulation setup is used for performance evaluation of P2P overlay over MANET at different mobility speeds and node densities. The results obtained are consistent with mobility and churn dynamics, thereby suggesting the utility of our simulation setup.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127516974","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945379
Srinka Basu, Saikat Roy, U. Maulik
Understanding the propagation of human health behavior, such as smoking and obesity, and identification of the factors that control such phenomenon is an important area of research in recent years mainly because, in industrialized countries a substantial proportion of the mortality and quality of life is due to particular behavior patterns, and that these behavior patterns are modifiable. Predicting the individuals who are going to be overweight or obese in future, as overweight and obesity propagate over dynamic human interaction network, is an important problem in this area. However, the problem has received limited attention from the network analysis and machine learning perspective till date. In this work, we propose a scalable supervised prediction model based on convolutional regression framework that is particularly suitable for short time series data. We propose various schemes to model social influence for health behavior change. Further we study the contribution of the primary factors of overweight and obesity, like unhealthy diets, recent weight gains and inactivity in the prediction task. A thorough experiment shows the superiority of the proposed method over the state-of-the-art.
{"title":"Convolutional regression framework for health behavior prediction","authors":"Srinka Basu, Saikat Roy, U. Maulik","doi":"10.1109/COMSNETS.2017.7945379","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945379","url":null,"abstract":"Understanding the propagation of human health behavior, such as smoking and obesity, and identification of the factors that control such phenomenon is an important area of research in recent years mainly because, in industrialized countries a substantial proportion of the mortality and quality of life is due to particular behavior patterns, and that these behavior patterns are modifiable. Predicting the individuals who are going to be overweight or obese in future, as overweight and obesity propagate over dynamic human interaction network, is an important problem in this area. However, the problem has received limited attention from the network analysis and machine learning perspective till date. In this work, we propose a scalable supervised prediction model based on convolutional regression framework that is particularly suitable for short time series data. We propose various schemes to model social influence for health behavior change. Further we study the contribution of the primary factors of overweight and obesity, like unhealthy diets, recent weight gains and inactivity in the prediction task. A thorough experiment shows the superiority of the proposed method over the state-of-the-art.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121668563","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945367
Dhritiman Das, Siddharth Deshmukh
In this paper we investigate cooperative spectrum sensing technique in which double threshold based energy detection is used at local cognitive radio (CR) sensors. Cooperative spectrum sensing improves reliability in detection of underutilized spectrum by fusing the decisions of local CR sensors. Local CR sensors use two thresholds, λ1 and λ2 (with λ2 > λ1). If the sensed energy is greater than λ2 or less than λ1 then with complete certainty local sensors decide for the presence or absence of primary user (PU) respectively. The difference between λ2 and λ1 defines the ambiguity region, i.e., Δth = λ2 — λ1 in which local CRs are unable to decide the presence or absence of PU. In this work local sensors report the decision along with situation in which sensed energy falls in ambiguity region. In our analysis we use majority rule at the fusion center and compute an analytical expression of average probability of sensing error as a function of width of ambiguity region, i.e., Δth. Using the derived analytical expression and by simulation we show that there exists an optimal value of Δth for which the probability of sensing error is minimum.
{"title":"Ambiguity-region analysis for double threshold energy detection in cooperative spectrum sensing","authors":"Dhritiman Das, Siddharth Deshmukh","doi":"10.1109/COMSNETS.2017.7945367","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945367","url":null,"abstract":"In this paper we investigate cooperative spectrum sensing technique in which double threshold based energy detection is used at local cognitive radio (CR) sensors. Cooperative spectrum sensing improves reliability in detection of underutilized spectrum by fusing the decisions of local CR sensors. Local CR sensors use two thresholds, λ<inf>1</inf> and λ<inf>2</inf> (with λ<inf>2</inf> > λ<inf>1</inf>). If the sensed energy is greater than λ<inf>2</inf> or less than λ<inf>1</inf> then with complete certainty local sensors decide for the presence or absence of primary user (PU) respectively. The difference between λ<inf>2</inf> and λ<inf>1</inf> defines the ambiguity region, i.e., Δ<inf>th</inf> = λ<inf>2</inf> — λ<inf>1</inf> in which local CRs are unable to decide the presence or absence of PU. In this work local sensors report the decision along with situation in which sensed energy falls in ambiguity region. In our analysis we use majority rule at the fusion center and compute an analytical expression of average probability of sensing error as a function of width of ambiguity region, i.e., Δ<inf>th</inf>. Using the derived analytical expression and by simulation we show that there exists an optimal value of Δ<inf>th</inf> for which the probability of sensing error is minimum.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"9 42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123807575","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945387
Neelam Dayal, S. Srivastava
Software Defined Network (SDN) facilitates network programmers with easier network monitoring, identification of anomalies, instant implementation of changes, central control to the whole network in a cost effective and efficient manner. These features could be beneficial for securing and maintaining entire network. Being a promising network paradigm, it draws a lot of attention from researchers in security domain. But it's logically centralized control tends to single point of failure, increasing the risk of attacks such as Distributed Denial of Service (DDoS) attack. In this paper, we have tried to identify various possibilities of DDoS attacks in SDN environment with the help of attack tree and an attack model. Further, an attempt to analyze the impact of various traditional DDoS attacks on SDN components is done. Such analysis helps in identifying the type of DDoS attacks that impose bigger threat on SDN architecture and also the features that could play important role in identification of these attacks are deduced.
{"title":"Analyzing behavior of DDoS attacks to identify DDoS detection features in SDN","authors":"Neelam Dayal, S. Srivastava","doi":"10.1109/COMSNETS.2017.7945387","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945387","url":null,"abstract":"Software Defined Network (SDN) facilitates network programmers with easier network monitoring, identification of anomalies, instant implementation of changes, central control to the whole network in a cost effective and efficient manner. These features could be beneficial for securing and maintaining entire network. Being a promising network paradigm, it draws a lot of attention from researchers in security domain. But it's logically centralized control tends to single point of failure, increasing the risk of attacks such as Distributed Denial of Service (DDoS) attack. In this paper, we have tried to identify various possibilities of DDoS attacks in SDN environment with the help of attack tree and an attack model. Further, an attempt to analyze the impact of various traditional DDoS attacks on SDN components is done. Such analysis helps in identifying the type of DDoS attacks that impose bigger threat on SDN architecture and also the features that could play important role in identification of these attacks are deduced.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125812537","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945385
David Dietrich, C. Papagianni, Panagiotis Papadimitriou, J. Baras
The proliferation of mobiles devices, application sprawl, and the ever-increasing data volume generates significant stress on cellular networks and particularly on the cellular core, also known as the Evolved Packet Core (EPC). This is further exacerbated by the deployment of hardware appliances for the implementation of a wide range of network functions (e.g., gateways, mobility management, firewalls, network address translation), hindering any opportunity for elastic provisioning, and eventually leading to high operational costs and a significant degree of load imbalance across the EPC. Network Function Virtualization (NFV) has been seen a promising solution in order to enable elasticity in the cellular core. Applying NFV to the EPC raises the need for network function (NF) placement, which in turn entails significant challenges, due to the stringent delay budgets among cellular core components and the coexistence of communicating data and control plane elements. To address these challenges, we present a linear programming (LP) formulation for the computation of NF placements that strikes a balance between optimality and time complexity. Our evaluation results show that the LP achieves significantly better load balancing, request acceptance rate, and resource utilization compared to a greedy algorithm that performs NF placement inline with carriers' common practice today.
{"title":"Network function placement on virtualized cellular cores","authors":"David Dietrich, C. Papagianni, Panagiotis Papadimitriou, J. Baras","doi":"10.1109/COMSNETS.2017.7945385","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945385","url":null,"abstract":"The proliferation of mobiles devices, application sprawl, and the ever-increasing data volume generates significant stress on cellular networks and particularly on the cellular core, also known as the Evolved Packet Core (EPC). This is further exacerbated by the deployment of hardware appliances for the implementation of a wide range of network functions (e.g., gateways, mobility management, firewalls, network address translation), hindering any opportunity for elastic provisioning, and eventually leading to high operational costs and a significant degree of load imbalance across the EPC. Network Function Virtualization (NFV) has been seen a promising solution in order to enable elasticity in the cellular core. Applying NFV to the EPC raises the need for network function (NF) placement, which in turn entails significant challenges, due to the stringent delay budgets among cellular core components and the coexistence of communicating data and control plane elements. To address these challenges, we present a linear programming (LP) formulation for the computation of NF placements that strikes a balance between optimality and time complexity. Our evaluation results show that the LP achieves significantly better load balancing, request acceptance rate, and resource utilization compared to a greedy algorithm that performs NF placement inline with carriers' common practice today.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"99 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115157871","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945438
G. Mandyam
Remote attestation is the procedure in which a relying party verifies the environment in which a device is carrying out cryptographic operations. Relying parties can leverage attestation data as part of their authentication and authorization procedures. However many Internet-of-Things (IoT) devices either do not have direct connectivity to relying parties, or may simply not be able to provide reliable attestation data. This paper introduces the concept of tiered attestation, where edge routing entities (i.e. gateways) can augment attestation data for relying parties while still accounting for limitations in the actual IoT devices.
{"title":"Tiered attestation for Internet-of-Things (IoT) devices","authors":"G. Mandyam","doi":"10.1109/COMSNETS.2017.7945438","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945438","url":null,"abstract":"Remote attestation is the procedure in which a relying party verifies the environment in which a device is carrying out cryptographic operations. Relying parties can leverage attestation data as part of their authentication and authorization procedures. However many Internet-of-Things (IoT) devices either do not have direct connectivity to relying parties, or may simply not be able to provide reliable attestation data. This paper introduces the concept of tiered attestation, where edge routing entities (i.e. gateways) can augment attestation data for relying parties while still accounting for limitations in the actual IoT devices.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116459019","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945381
Ashutosh Jha, Debashis Saha
Offering pan-India broadband connectivity over 4G LTE networks involves massive total cost of ownership (TCO) for the operators, which includes acquiring newer spectrum through an immensely competitive auction mechanism. Their bidding process usually follows an opportunity cost approach that attempts to trade off the investments in network infrastructure against the acquisition of bigger spectrum blocks in cost-effective bands. To help them understand better the effectiveness of the newly opened 700 MHz band in India, this paper compares the overall financial implications of deploying 4G LTE services on 700 MHz band with those on 1800 MHz and 2100 MHz bands over a 20-year horizon across 22 telecom circles. We use a combination of Okumara-Hata/Cost-231 model, cell-dimensioning approach and Bass model based adoption forecasts to determine coverage, capacity, and number of subscribers, respectively. After estimating the TCO and the revenue figures for all the three bands, we apply the discounted cash flow method to analyze their comparative profitability. Our results show that, in addition to giving better cellular coverage, 700 MHz is the most cost-effective band, its TCO being approximately one-fourth of that of 1800 MHz band, and one-sixth of that of 2100 MHz band. Moreover, the circle-wise profitability of 700 MHz is the highest amongst all the three bands, with maximum profitability being in Metro circles, followed by Category C circles. Interestingly, the potential for a better profitability in Category C circles, which are crucial to ensure the mandated last-mile coverage for rural villages, further increases the attractiveness of 700 MHz band. We also find that the smaller circles in Category B hold out better promises for profitability, compared to the larger circles in Category A. Hence, overall there is a genuine need for a consolidated approach in spectrum acquisition by an incumbent operator to reap synergistic benefit in aggregate profitability.
{"title":"Why is 700 MHz band a good proposition for provisioning pan-India 4G LTE services?: A comparative techno-economic evaluation study","authors":"Ashutosh Jha, Debashis Saha","doi":"10.1109/COMSNETS.2017.7945381","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945381","url":null,"abstract":"Offering pan-India broadband connectivity over 4G LTE networks involves massive total cost of ownership (TCO) for the operators, which includes acquiring newer spectrum through an immensely competitive auction mechanism. Their bidding process usually follows an opportunity cost approach that attempts to trade off the investments in network infrastructure against the acquisition of bigger spectrum blocks in cost-effective bands. To help them understand better the effectiveness of the newly opened 700 MHz band in India, this paper compares the overall financial implications of deploying 4G LTE services on 700 MHz band with those on 1800 MHz and 2100 MHz bands over a 20-year horizon across 22 telecom circles. We use a combination of Okumara-Hata/Cost-231 model, cell-dimensioning approach and Bass model based adoption forecasts to determine coverage, capacity, and number of subscribers, respectively. After estimating the TCO and the revenue figures for all the three bands, we apply the discounted cash flow method to analyze their comparative profitability. Our results show that, in addition to giving better cellular coverage, 700 MHz is the most cost-effective band, its TCO being approximately one-fourth of that of 1800 MHz band, and one-sixth of that of 2100 MHz band. Moreover, the circle-wise profitability of 700 MHz is the highest amongst all the three bands, with maximum profitability being in Metro circles, followed by Category C circles. Interestingly, the potential for a better profitability in Category C circles, which are crucial to ensure the mandated last-mile coverage for rural villages, further increases the attractiveness of 700 MHz band. We also find that the smaller circles in Category B hold out better promises for profitability, compared to the larger circles in Category A. Hence, overall there is a genuine need for a consolidated approach in spectrum acquisition by an incumbent operator to reap synergistic benefit in aggregate profitability.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127368440","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945411
Shreyata Sharma, S. Darak, A. Srivastava
Energy efficient operation of heterogeneous networks (HetNets) has become extremely crucial owing to their fast increasing deployment. This work presents a novel approach in which an actor-critic (AC) reinforcement learning (RL) framework is used to enable traffic based ON/OFF switching of base stations (BSs) in a HetNet leading to a reduction in overall energy consumption. Further, previously estimated traffic statistics is exploited in future scenarios which speeds up the learning process and provide additional improvement in energy saving. The presented scheme leads to up to 82% drop in energy consumption which is a quite significant amount. Furthermore, the analysis of system delay and energy saving trade-off is done.
{"title":"Energy saving in heterogeneous cellular network via transfer reinforcement learning based policy","authors":"Shreyata Sharma, S. Darak, A. Srivastava","doi":"10.1109/COMSNETS.2017.7945411","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945411","url":null,"abstract":"Energy efficient operation of heterogeneous networks (HetNets) has become extremely crucial owing to their fast increasing deployment. This work presents a novel approach in which an actor-critic (AC) reinforcement learning (RL) framework is used to enable traffic based ON/OFF switching of base stations (BSs) in a HetNet leading to a reduction in overall energy consumption. Further, previously estimated traffic statistics is exploited in future scenarios which speeds up the learning process and provide additional improvement in energy saving. The presented scheme leads to up to 82% drop in energy consumption which is a quite significant amount. Furthermore, the analysis of system delay and energy saving trade-off is done.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126280170","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945416
M. Giri, S. Jyothi, C. Vorugunti
Twitter, an Internet based social networking application has gained a tremendous popularity as a means of convenient social networking. The inherent structure and possibility of rapid information propagation provides an opportunity for adversaries to use Twitter as a medium to spread malware. It is critical to examine the data dissemination process in Twitter in terms of speed and reachability. Existing literature proposed a mathematical model for malware propagation in Twitter based on the malicious code propagation in Wireless Sensor Networks. In this context, we thought that the malicious code propagation model based on WSN doesn't suit for Twitter. Therefore, we have proposed a first of its kind of a mathematical framework for malware propagation in Twitter based on epidemic theory. Our preliminary analysis demonstrates that even with users having a lower degree of connectivity and lower probability of clicking links, Twitter and its communication structure can be exploited to spread malware and infect many accounts.
{"title":"Epidemic model based evaluation of malware propagation in Twitter","authors":"M. Giri, S. Jyothi, C. Vorugunti","doi":"10.1109/COMSNETS.2017.7945416","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945416","url":null,"abstract":"Twitter, an Internet based social networking application has gained a tremendous popularity as a means of convenient social networking. The inherent structure and possibility of rapid information propagation provides an opportunity for adversaries to use Twitter as a medium to spread malware. It is critical to examine the data dissemination process in Twitter in terms of speed and reachability. Existing literature proposed a mathematical model for malware propagation in Twitter based on the malicious code propagation in Wireless Sensor Networks. In this context, we thought that the malicious code propagation model based on WSN doesn't suit for Twitter. Therefore, we have proposed a first of its kind of a mathematical framework for malware propagation in Twitter based on epidemic theory. Our preliminary analysis demonstrates that even with users having a lower degree of connectivity and lower probability of clicking links, Twitter and its communication structure can be exploited to spread malware and infect many accounts.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124235824","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945436
A. Roy, Pranabesh Maji, Gowthamkrishnan Cherukuri, S. Kundu
In this paper, we analyze the secrecy performance of a two hop communication system with a Decode-and-Forward (DF) relay in a k-μ fading channel for Internet of Things (IOT) applications in the presence of an eavesdropper. The eavesdropper wiretaps from a single hop in the first case and from both the hops in second case. Analytical expressions for Secrecy Outage Probability (SOP) and Strictly Positive Secrecy Capacity (SPSC) have been derived. MATLAB based simulation has been carried out to evaluate the secrecy performance following our analytical formulation. Effects of channel and network parameters on secrecy performance are indicated.
{"title":"PHY layer security for IOT in κ-μ fading channel","authors":"A. Roy, Pranabesh Maji, Gowthamkrishnan Cherukuri, S. Kundu","doi":"10.1109/COMSNETS.2017.7945436","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945436","url":null,"abstract":"In this paper, we analyze the secrecy performance of a two hop communication system with a Decode-and-Forward (DF) relay in a k-μ fading channel for Internet of Things (IOT) applications in the presence of an eavesdropper. The eavesdropper wiretaps from a single hop in the first case and from both the hops in second case. Analytical expressions for Secrecy Outage Probability (SOP) and Strictly Positive Secrecy Capacity (SPSC) have been derived. MATLAB based simulation has been carried out to evaluate the secrecy performance following our analytical formulation. Effects of channel and network parameters on secrecy performance are indicated.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126986821","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
扫码关注我们
求助内容：
应助结果提醒方式：