Pub Date : 2018-12-01DOI: 10.1109/ants.2018.8710122
{"title":"ANTS 2018 Welcome Message from WIE","authors":"","doi":"10.1109/ants.2018.8710122","DOIUrl":"https://doi.org/10.1109/ants.2018.8710122","url":null,"abstract":"","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123973199","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710119
Yugnanda Malhotra
The traditional approach of Fixed Base Units (FBU) in Unequally Spaced (US) Dense Wavelength Division Multiplexed (DWDM) systems outperforms Equally Spaced (ES)DWDM Systems. Currently in the scenarios of diverse bandwidth requirements for next generation optical communication systems, a novel Dynamic Base Unit (DBU) unequal channel (US) allocation strategy is designed, and the performance benefits are investigated over the traditional existing Fixed Base channel allocations. The proposed algorithm decides the total number of base units covering the optical bandwidth. After the channel allocation in the first base unit $BU_{i=0}$ the current work discusses the case of reducing the number of channels in subsequent Base Unit $(BU_{i=1,2,..})$ by a factor of 2. Moreover, the adjacent base units are allotted even and odd frequency slots. Thus, this is an optimum strategy where maximum non-uniformity is taken care of in channel allocations. This drastically reduces the nonlinear effects of Four Wave Mixing (FWM) prominent in DWDM systems using Dispersion Shifted Fibers. The proposed algorithm is evaluated in terms of the bandwidth occupancy and number of Four Wave Mixing products. Performance up to greater than 34.6% reduction in FWM is observed. Bandwidth occupancy shows 13.7%, 6.25% and 7.45% reduction than the popular Unequally Repeated US(URUS), Paired URUS and Alternately Paired RUS (PURUS) schemes respectively. The high improvement factor is observed when using DBU-US. It is concluded that Dynamic Base Unit-Unequally Spaced channel allocation is superior and is considered a suitable candidate for high speed DWDM transmission systems.
{"title":"Investigation of Transmission Impairment for Dynamic Base Unit Channel Allocation in DWDM Systems","authors":"Yugnanda Malhotra","doi":"10.1109/ANTS.2018.8710119","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710119","url":null,"abstract":"The traditional approach of Fixed Base Units (FBU) in Unequally Spaced (US) Dense Wavelength Division Multiplexed (DWDM) systems outperforms Equally Spaced (ES)DWDM Systems. Currently in the scenarios of diverse bandwidth requirements for next generation optical communication systems, a novel Dynamic Base Unit (DBU) unequal channel (US) allocation strategy is designed, and the performance benefits are investigated over the traditional existing Fixed Base channel allocations. The proposed algorithm decides the total number of base units covering the optical bandwidth. After the channel allocation in the first base unit $BU_{i=0}$ the current work discusses the case of reducing the number of channels in subsequent Base Unit $(BU_{i=1,2,..})$ by a factor of 2. Moreover, the adjacent base units are allotted even and odd frequency slots. Thus, this is an optimum strategy where maximum non-uniformity is taken care of in channel allocations. This drastically reduces the nonlinear effects of Four Wave Mixing (FWM) prominent in DWDM systems using Dispersion Shifted Fibers. The proposed algorithm is evaluated in terms of the bandwidth occupancy and number of Four Wave Mixing products. Performance up to greater than 34.6% reduction in FWM is observed. Bandwidth occupancy shows 13.7%, 6.25% and 7.45% reduction than the popular Unequally Repeated US(URUS), Paired URUS and Alternately Paired RUS (PURUS) schemes respectively. The high improvement factor is observed when using DBU-US. It is concluded that Dynamic Base Unit-Unequally Spaced channel allocation is superior and is considered a suitable candidate for high speed DWDM transmission systems.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125096260","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710169
A. Kumar, K. Anusha, S. Hegde
The distributed computing models such as MapReduce, Dryad, cluster based file systems, query to web search engine, parallel scientific applications and many other are associated with problems such as incast congestion, queue buildup and memory pressure. These adversities hinders the flows to meet their associated deadlines and ultimately the service level agreement (SLA). There are two classes of solutions proposed for the problems of congestion and meeting deadlines for the flows - a congestion control at the transport layer and resource allocation at the network layer. The proposed solutions at the transport layer modulated the TCP window size according to the extent of congestion and the deadline value associated with the flows. These solutions are proposed based on the assumption that the intermediate switches maintain soft-state about the flows. Thus, the entire flow has to follow a static path from begin to end.Contrast to this, the location based routing proposed for DCN tries to utilize the path diversity provided by the underlying architectures by distributing the flows among all the available outgoing paths using the Equal Cost Multiple Paths (ECMP). In this paper, we propose a packet scheduler that helps the flow to meet their associated deadline. We consider our proposed $4-4,1-4$ architecture as an example architecture for location based routing. Packet scheduler for $4-4, 1-4$ helps the flows to meet their deadline by arranging the packets at the intermediate switches according to their associated deadlines. With prioritizing and scheduling the packets at the network layer, the flows are not constrained to assign to a static path and the intermediate switches need not to maintain any flow state information.
{"title":"Packet scheduler for meeting deadline in 4-4; 1-4 architecture","authors":"A. Kumar, K. Anusha, S. Hegde","doi":"10.1109/ANTS.2018.8710169","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710169","url":null,"abstract":"The distributed computing models such as MapReduce, Dryad, cluster based file systems, query to web search engine, parallel scientific applications and many other are associated with problems such as incast congestion, queue buildup and memory pressure. These adversities hinders the flows to meet their associated deadlines and ultimately the service level agreement (SLA). There are two classes of solutions proposed for the problems of congestion and meeting deadlines for the flows - a congestion control at the transport layer and resource allocation at the network layer. The proposed solutions at the transport layer modulated the TCP window size according to the extent of congestion and the deadline value associated with the flows. These solutions are proposed based on the assumption that the intermediate switches maintain soft-state about the flows. Thus, the entire flow has to follow a static path from begin to end.Contrast to this, the location based routing proposed for DCN tries to utilize the path diversity provided by the underlying architectures by distributing the flows among all the available outgoing paths using the Equal Cost Multiple Paths (ECMP). In this paper, we propose a packet scheduler that helps the flow to meet their associated deadline. We consider our proposed $4-4,1-4$ architecture as an example architecture for location based routing. Packet scheduler for $4-4, 1-4$ helps the flows to meet their deadline by arranging the packets at the intermediate switches according to their associated deadlines. With prioritizing and scheduling the packets at the network layer, the flows are not constrained to assign to a static path and the intermediate switches need not to maintain any flow state information.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124031158","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710142
U. K. Singh, R. Mitra, V. Bhatia, A. Mishra
Recently, kernel-based adaptive filtering (KAF) algorithms have found widespread application in numerous nonlinear signal processing problems; one of them being radar signal processing. In particular, considering the inherent non-linearity in a radar system, KAF has been recently applied for estimation of delay and found to achieve lower variance as compared to classical Fourier-Transform based approach. However, as the radar-return is complex-valued in general, using a traditional complex Gaussian kernel in KAF based estimator yields inaccurate estimates. In this work, we explore Wirtinger’s calculus-based complexification of a reproducing kernel Hilbert space (RKHS) for estimation of delay and Doppler-shift, which guarantees lower estimator-variance, and kernel-stability. Furthermore, since the choice of suitable kernel-width is crucial for RKHS-based estimation of delay and Doppler parameters, we derive an adaption for joint-estimation of kernel-width for the proposed normalized complex kernel least mean square (NCKLMS) based estimator from the radar return. Simulations performed over orthogonal frequency division multiplexed (OFDM)-radar system indicate that the proposed NCKLMS based estimator converges to a significantly lower dictionary-size, thereby leading to simpler implementation, receiver-simplicity, and latency whilst maintaining equivalent squared error performance, which makes the proposed estimators suitable for practical OFDM-radar systems.
{"title":"Low-Complexity Complex KLMS based Non-linear Estimators for OFDM Radar System","authors":"U. K. Singh, R. Mitra, V. Bhatia, A. Mishra","doi":"10.1109/ANTS.2018.8710142","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710142","url":null,"abstract":"Recently, kernel-based adaptive filtering (KAF) algorithms have found widespread application in numerous nonlinear signal processing problems; one of them being radar signal processing. In particular, considering the inherent non-linearity in a radar system, KAF has been recently applied for estimation of delay and found to achieve lower variance as compared to classical Fourier-Transform based approach. However, as the radar-return is complex-valued in general, using a traditional complex Gaussian kernel in KAF based estimator yields inaccurate estimates. In this work, we explore Wirtinger’s calculus-based complexification of a reproducing kernel Hilbert space (RKHS) for estimation of delay and Doppler-shift, which guarantees lower estimator-variance, and kernel-stability. Furthermore, since the choice of suitable kernel-width is crucial for RKHS-based estimation of delay and Doppler parameters, we derive an adaption for joint-estimation of kernel-width for the proposed normalized complex kernel least mean square (NCKLMS) based estimator from the radar return. Simulations performed over orthogonal frequency division multiplexed (OFDM)-radar system indicate that the proposed NCKLMS based estimator converges to a significantly lower dictionary-size, thereby leading to simpler implementation, receiver-simplicity, and latency whilst maintaining equivalent squared error performance, which makes the proposed estimators suitable for practical OFDM-radar systems.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126712725","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710092
Venkatesh Chakravartula, Dhanalakshmi Samiappan
As developing countries like India continue to witness an unprecedented growth in urban population, the climate becomes more susceptible to change. In this context, a weather monitoring technique inspired by the extent and efficiency of sensors on insect antennae is presented. Antennae are a subject of current heuristic intrigue and have motivated robots and sensors with applications ranging from material characterization to chemical volatility and tactility. This approach is taken a step forward by implementing an integrated sensor network, simultaneously picking up variations in pressure, temperature, relative humidity and wind speed. The basic construction and operating principle of the sensor is inspired by the pressure detecting element, the Campaniform Sensilla, on insect antennae. This hypothesis is supported by a set of equations relating the various factors. Then the model is tested for sensitivity, effectiveness of integration and feasibility. Multi– sensing is deemed desirable in smart cities, where sensory overload and the resultant power shortage are likely to pose major technical hindrances. This device promises compactness combined with accuracy and precision and can be implemented anywhere from next - generation cars to airplanes.
{"title":"Integrated Weather Monitoring Device for Multi-Parameter Sensing Modelled on Insect Antennae","authors":"Venkatesh Chakravartula, Dhanalakshmi Samiappan","doi":"10.1109/ANTS.2018.8710092","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710092","url":null,"abstract":"As developing countries like India continue to witness an unprecedented growth in urban population, the climate becomes more susceptible to change. In this context, a weather monitoring technique inspired by the extent and efficiency of sensors on insect antennae is presented. Antennae are a subject of current heuristic intrigue and have motivated robots and sensors with applications ranging from material characterization to chemical volatility and tactility. This approach is taken a step forward by implementing an integrated sensor network, simultaneously picking up variations in pressure, temperature, relative humidity and wind speed. The basic construction and operating principle of the sensor is inspired by the pressure detecting element, the Campaniform Sensilla, on insect antennae. This hypothesis is supported by a set of equations relating the various factors. Then the model is tested for sensitivity, effectiveness of integration and feasibility. Multi– sensing is deemed desirable in smart cities, where sensory overload and the resultant power shortage are likely to pose major technical hindrances. This device promises compactness combined with accuracy and precision and can be implemented anywhere from next - generation cars to airplanes.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126348711","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710114
Rene Wuerll, J. Robert, G. Kilian, Gerd Heuberger
Unidirectional low power wide area network (LP-WAN) transmissions originating from energy-constrained sensor nodes can only be detected once at the receiver or the transmitted information is lost forever. The usually low-budget transmitters are not synchronized with the receiver and have a significant frequency offset. Hence, we design an optimal detector that maximizes the probability of detection with a hypothesis testing approach using a likelihood ratio test (LRT). The theoretically optimal detector is simulated but not implementable. For practical applications, we present approximated detectors, which are very close to the ideal performance.
{"title":"Optimal One-Shot Detection of Preambles with Frequency Offset","authors":"Rene Wuerll, J. Robert, G. Kilian, Gerd Heuberger","doi":"10.1109/ANTS.2018.8710114","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710114","url":null,"abstract":"Unidirectional low power wide area network (LP-WAN) transmissions originating from energy-constrained sensor nodes can only be detected once at the receiver or the transmitted information is lost forever. The usually low-budget transmitters are not synchronized with the receiver and have a significant frequency offset. Hence, we design an optimal detector that maximizes the probability of detection with a hypothesis testing approach using a likelihood ratio test (LRT). The theoretically optimal detector is simulated but not implementable. For practical applications, we present approximated detectors, which are very close to the ideal performance.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127343912","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710069
K. R. Sekhar, R. Mitra
Visible light communication (VLC) has emerged as a viable supplement to existing RF based communication systems. To enhance the achievable rate of VLC systems, the use of massive arrays of light emitting diodes (LEDs) and photodetectors (PDs) have been recently proposed, resulting in a massive multiple input multiple output (m-MIMO) VLC system. Furthermore, orthogonal frequency division multiple access (OFDM) has been explored for mitigating the inter-symbol interference due to limited modulation-bandwidth of the LED, and reflections from walls. One of the drawbacks of m-MIMO over VLC channels is the ill-conditioned nature of the VLC channel. To mitigate this, a zero-forcing successive interference cancellation (ZF-SIC) receiver with SVD (singular-value decomposition-based index precoding has been proposed recently. In this work, we propose and analyze the performance of minimum mean squared error (MMSE) based receiver for DC-biased O-OFDM (DCO-OFDM) for a m-MIMO VLC channel. Simulations performed over various m-MIMO VLC channels indicate that the derived analytical expressions for BER closely match with the simulated BER. Furthermore, MMSE-SIC is found to outperform ZF-SIC, which makes the proposed receiver viable for potential VLC deployments.
{"title":"Performance analysis of DCO-OFDM over precoded massive MIMO VLC channel","authors":"K. R. Sekhar, R. Mitra","doi":"10.1109/ANTS.2018.8710069","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710069","url":null,"abstract":"Visible light communication (VLC) has emerged as a viable supplement to existing RF based communication systems. To enhance the achievable rate of VLC systems, the use of massive arrays of light emitting diodes (LEDs) and photodetectors (PDs) have been recently proposed, resulting in a massive multiple input multiple output (m-MIMO) VLC system. Furthermore, orthogonal frequency division multiple access (OFDM) has been explored for mitigating the inter-symbol interference due to limited modulation-bandwidth of the LED, and reflections from walls. One of the drawbacks of m-MIMO over VLC channels is the ill-conditioned nature of the VLC channel. To mitigate this, a zero-forcing successive interference cancellation (ZF-SIC) receiver with SVD (singular-value decomposition-based index precoding has been proposed recently. In this work, we propose and analyze the performance of minimum mean squared error (MMSE) based receiver for DC-biased O-OFDM (DCO-OFDM) for a m-MIMO VLC channel. Simulations performed over various m-MIMO VLC channels indicate that the derived analytical expressions for BER closely match with the simulated BER. Furthermore, MMSE-SIC is found to outperform ZF-SIC, which makes the proposed receiver viable for potential VLC deployments.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127347945","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710160
Koushik Maddali, Indranil Roy, K. Sinha, B. Gupta, H. Hexmoor, Swathi Kaluvakuri
Application level multicast has started gaining importance, as it is independent of router infrastructure unlike router-based IP multicast. The existing DHT-based application level multicast protocols work efficiently as long as there is almost no churn; otherwise, their performances start degrading drastically, because DHT – based structured architecture cannot handle churn effectively. Besides, most of these multicast protocols consider single data source and do not consider peer heterogeneity. In this work, we have considered an existing non-DHT based P2P architecture, which has already been shown to perform much better than some well-known DHT-based architectures from the viewpoints of speed of unicast communication and churn handling. Here, we have presented a highly efficient capacity-constrained and any source multicast protocol suitable for the non-DHT based P2P architecture as mentioned above.
{"title":"Efficient Any Source Capacity-Constrained Overlay Multicast in LDE-Based P2P Networks","authors":"Koushik Maddali, Indranil Roy, K. Sinha, B. Gupta, H. Hexmoor, Swathi Kaluvakuri","doi":"10.1109/ANTS.2018.8710160","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710160","url":null,"abstract":"Application level multicast has started gaining importance, as it is independent of router infrastructure unlike router-based IP multicast. The existing DHT-based application level multicast protocols work efficiently as long as there is almost no churn; otherwise, their performances start degrading drastically, because DHT – based structured architecture cannot handle churn effectively. Besides, most of these multicast protocols consider single data source and do not consider peer heterogeneity. In this work, we have considered an existing non-DHT based P2P architecture, which has already been shown to perform much better than some well-known DHT-based architectures from the viewpoints of speed of unicast communication and churn handling. Here, we have presented a highly efficient capacity-constrained and any source multicast protocol suitable for the non-DHT based P2P architecture as mentioned above.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134008403","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710078
S. Pradhan, S. Tripathy, Sukumar Nandi
Peer to Peer (P2P) is a dynamic and self-organized technology, popularly used in File sharing applications to achieve better performance and avoids single point of failure. The popularity of this network has attracted many attackers framing different attacks including Sybil attack, Routing Table Insertion attack (RTI) and Free Riding. Many mitigation methods are also proposed to defend or reduce the impact of such attacks. However, most of those approaches are protocol specific. In this work, we propose a Blockchain based security framework for P2P network to address such security issues. which can be tailored to any P2P file-sharing system.
P2P (Peer to Peer)是一种动态的、自组织的技术，广泛应用于文件共享应用中，以获得更好的性能和避免单点故障。该网络的普及吸引了许多攻击者，包括Sybil攻击、路由表插入攻击(RTI)和Free Riding攻击。还提出了许多缓解方法来防御或减少此类攻击的影响。然而，大多数这些方法都是特定于协议的。在这项工作中，我们提出了一个基于区块链的P2P网络安全框架来解决这些安全问题。它可以适用于任何P2P文件共享系统。
{"title":"Blockchain based Security Framework for P2P Filesharing system","authors":"S. Pradhan, S. Tripathy, Sukumar Nandi","doi":"10.1109/ANTS.2018.8710078","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710078","url":null,"abstract":"Peer to Peer (P2P) is a dynamic and self-organized technology, popularly used in File sharing applications to achieve better performance and avoids single point of failure. The popularity of this network has attracted many attackers framing different attacks including Sybil attack, Routing Table Insertion attack (RTI) and Free Riding. Many mitigation methods are also proposed to defend or reduce the impact of such attacks. However, most of those approaches are protocol specific. In this work, we propose a Blockchain based security framework for P2P network to address such security issues. which can be tailored to any P2P file-sharing system.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116847374","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710087
Rakhi Khedkar, R. Patil
For optimal Dynamic Spectrum Allocation (DSA) in multi-PU (Primary User) multi-SU (Secondary User) Cognitive Radio Network (CRN), it is necessary to study the comprehensive behavior of each SU. In this paper, we have designed a database assisted CRN using Coalition Game Theory (CGT) to increase the involvement of the maximum number of SUs in the spectrum sensing and allocation. In this model, we have formed Pareto optimal coalitions considering hidden/mobile/remotely located SUs. To enlarge the spectrum allocation rate of this CRN, we have proposed a DSA technique using an even and odd channel allocation scheme. In this scheme, we have used a comprehensive function to determine the payoff of each SU. The simulation result shows that the proposed channel allocation scheme enriching in the payoff of each SU and spectrum allocation rate of the CRN compared with the former coalition game scheme.
为了实现多pu (Primary User)多SU (Secondary User)认知无线网络(CRN)的最优动态频谱分配(DSA)，有必要研究每个SU的综合行为。本文利用联盟博弈论(Coalition Game Theory, CGT)设计了一个数据库辅助的CRN，以增加最大数量的SU参与频谱感知和分配。在这个模型中，我们已经形成了考虑隐藏/移动/远程定位su的帕累托最优联盟。为了提高该CRN的频谱分配率，我们提出了一种采用奇偶信道分配方案的DSA技术。在该方案中，我们使用了一个综合函数来确定每个SU的收益。仿真结果表明，与之前的联盟博弈方案相比，所提出的信道分配方案丰富了每个SU的收益和CRN的频谱分配率。
{"title":"Comprehensive Dynamic Spectrum Allocation in multi-PU multi-SU CRN using Coalition Game Theory","authors":"Rakhi Khedkar, R. Patil","doi":"10.1109/ANTS.2018.8710087","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710087","url":null,"abstract":"For optimal Dynamic Spectrum Allocation (DSA) in multi-PU (Primary User) multi-SU (Secondary User) Cognitive Radio Network (CRN), it is necessary to study the comprehensive behavior of each SU. In this paper, we have designed a database assisted CRN using Coalition Game Theory (CGT) to increase the involvement of the maximum number of SUs in the spectrum sensing and allocation. In this model, we have formed Pareto optimal coalitions considering hidden/mobile/remotely located SUs. To enlarge the spectrum allocation rate of this CRN, we have proposed a DSA technique using an even and odd channel allocation scheme. In this scheme, we have used a comprehensive function to determine the payoff of each SU. The simulation result shows that the proposed channel allocation scheme enriching in the payoff of each SU and spectrum allocation rate of the CRN compared with the former coalition game scheme.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131399011","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
扫码关注我们
求助内容：
应助结果提醒方式：