Pub Date : 2019-03-31DOI: 10.33832/ijfgcn.2019.12.1.01
Aritra De, Tirthankar Datta
{"title":"MIMO Interference and Path Loss Reduction using Adaptive Antenna System along with Optimization of Frequency for Zero Path Loss","authors":"Aritra De, Tirthankar Datta","doi":"10.33832/ijfgcn.2019.12.1.01","DOIUrl":"https://doi.org/10.33832/ijfgcn.2019.12.1.01","url":null,"abstract":"","PeriodicalId":45234,"journal":{"name":"International Journal of Future Generation Communication and Networking","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41432145","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 : 2019-03-31DOI: 10.33832/ijfgcn.2019.12.1.02
T Vandanababu, Raju Bhukya, D. Veeraiah, P. V. Paul
{"title":"A MapReduce Framework for Detection of Tandem Repeats in DNA Sequences","authors":"T Vandanababu, Raju Bhukya, D. Veeraiah, P. V. Paul","doi":"10.33832/ijfgcn.2019.12.1.02","DOIUrl":"https://doi.org/10.33832/ijfgcn.2019.12.1.02","url":null,"abstract":"","PeriodicalId":45234,"journal":{"name":"International Journal of Future Generation Communication and Networking","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42854048","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 : 2019-03-31DOI: 10.33832/ijfgcn.2019.12.1.03
C. Sudhakar, N. Thirupathi Rao, D. Bhattacharyya
{"title":"Early Assortment of Routes for Transfer of Packets in Communication Networks","authors":"C. Sudhakar, N. Thirupathi Rao, D. Bhattacharyya","doi":"10.33832/ijfgcn.2019.12.1.03","DOIUrl":"https://doi.org/10.33832/ijfgcn.2019.12.1.03","url":null,"abstract":"","PeriodicalId":45234,"journal":{"name":"International Journal of Future Generation Communication and Networking","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46825745","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-09-30DOI: 10.14257/ijfgcn.2018.11.5.04
Suraj Srivastava, Dinesh Grover
WSN is termed as wireless sensor network that consists of very large number of nodes that are connected with each other. These nodes are used to sense large amount of distinct data, interact with each other, and are computationally capable. The sensor nodes deployed in wireless network are light in weight and have constrained battery power. Hence, energy is a main problem of wireless sensor networks. This paper proposes a method for energy minimization with efficient clustering using GSA algorithm in Wireless Sensor Network. To compute cluster head election probability this work uses Genetic Algorithm method. Various parameters are used to evaluate the performance of the proposed technique. Experimental results demonstrate that the proposed technique outperforms existing techniques by various parameters.
{"title":"GA GSA-based Energy Efficient Pegasis Protocol for WSN","authors":"Suraj Srivastava, Dinesh Grover","doi":"10.14257/ijfgcn.2018.11.5.04","DOIUrl":"https://doi.org/10.14257/ijfgcn.2018.11.5.04","url":null,"abstract":"WSN is termed as wireless sensor network that consists of very large number of nodes that are connected with each other. These nodes are used to sense large amount of distinct data, interact with each other, and are computationally capable. The sensor nodes deployed in wireless network are light in weight and have constrained battery power. Hence, energy is a main problem of wireless sensor networks. This paper proposes a method for energy minimization with efficient clustering using GSA algorithm in Wireless Sensor Network. To compute cluster head election probability this work uses Genetic Algorithm method. Various parameters are used to evaluate the performance of the proposed technique. Experimental results demonstrate that the proposed technique outperforms existing techniques by various parameters.","PeriodicalId":45234,"journal":{"name":"International Journal of Future Generation Communication and Networking","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42708140","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-09-30DOI: 10.14257/IJFGCN.2018.11.5.05
Nikita Malik, Prakash Rao Ragiri, Aarti Jain
A large number of small sensor nodes or motes can be randomly distributed in any environment. These nodes communicate with each other over a low power wireless communication medium since they are severely restricted in their resources. Owing to these constraints, nodes in low power and lossy networks (LLNs) need to collaborate in order to establish a multi-hop network in which data is transmitted over several nodes to reach the sink node(s). Such communications over the radio environment are prone to various attacks, such as the RPL (Routing Protocol for Low Power and Lossy Networks) Packet Drop attack, which participates in the routing process to accept packets from the neighboring motes, only to drop them instead of forwarding in the route to the destination. Such an attack is generally hard to detect and to provide defenses against. In this paper, through simulations on Contiki’s network simulator COOJA, the impact of RPL Packet Drop attack on Contiki RPL is observed for performance based on average power consumption, received packet count, expected transmission count and hop count. Based on the results, several security schemes to tackle RPL in LLN have been studied.
在任何环境中都可以随机分布大量的小传感器节点或微点。由于这些节点的资源受到严格限制，因此它们通过低功率无线通信介质相互通信。由于这些限制，低功耗和有损网络(lln)中的节点需要协作以建立一个多跳网络，其中数据通过多个节点传输以到达汇聚节点。这种无线环境下的通信容易受到各种攻击，例如RPL (Routing Protocol for Low Power and Lossy Networks)丢包攻击(Packet Drop attack，低功耗网络路由协议)，这种攻击是指在路由过程中接受来自相邻节点的报文，而不是在到达目的地的路由中转发这些报文。这种攻击通常很难检测到，也很难提供防御。本文通过在Contiki的网络模拟器COOJA上进行仿真，从平均功耗、接收包数、期望传输数和跳数四个方面观察RPL丢包攻击对Contiki RPL性能的影响。在此基础上，研究了几种解决LLN中RPL的安全方案。
{"title":"Study of Security Mechanisms and Simulation Analysis of Packet Drop in RPL in Low Power Lossy Networks","authors":"Nikita Malik, Prakash Rao Ragiri, Aarti Jain","doi":"10.14257/IJFGCN.2018.11.5.05","DOIUrl":"https://doi.org/10.14257/IJFGCN.2018.11.5.05","url":null,"abstract":"A large number of small sensor nodes or motes can be randomly distributed in any environment. These nodes communicate with each other over a low power wireless communication medium since they are severely restricted in their resources. Owing to these constraints, nodes in low power and lossy networks (LLNs) need to collaborate in order to establish a multi-hop network in which data is transmitted over several nodes to reach the sink node(s). Such communications over the radio environment are prone to various attacks, such as the RPL (Routing Protocol for Low Power and Lossy Networks) Packet Drop attack, which participates in the routing process to accept packets from the neighboring motes, only to drop them instead of forwarding in the route to the destination. Such an attack is generally hard to detect and to provide defenses against. In this paper, through simulations on Contiki’s network simulator COOJA, the impact of RPL Packet Drop attack on Contiki RPL is observed for performance based on average power consumption, received packet count, expected transmission count and hop count. Based on the results, several security schemes to tackle RPL in LLN have been studied.","PeriodicalId":45234,"journal":{"name":"International Journal of Future Generation Communication and Networking","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41338279","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-09-30DOI: 10.14257/IJFGCN.2018.11.5.01
Piyush Rawat, S. Chauhan
The network lifetime is considered as the major concern in the area of WSN because of the huge quantity of sensor nodes and their distribution in the network. When the size of the network gets expanded the selection of the routing protocol become a crucial issue. A good routing protocol can help in enhancing the network lifetime. In this article, we are exhibiting a routing protocol which is based on existing LEACH protocol named as Random Number based LEACH (RN-LEACH) protocol. The results generated through simulation illustrate that the RN-LEACH algorithm has enhanced the working of the network in terms of energy consumption, network lifetime and packet received compared to existing LEACH protocol. The RN-LEACH protocol has increased the network lifetime by approximately more than 90% as compared to LEACH which shows the good agreement of RN-LEACH algorithm as contrasted to the previous technique.
{"title":"Performance Analysis of RN-LEACH Protocol over LEACH Protocol","authors":"Piyush Rawat, S. Chauhan","doi":"10.14257/IJFGCN.2018.11.5.01","DOIUrl":"https://doi.org/10.14257/IJFGCN.2018.11.5.01","url":null,"abstract":"The network lifetime is considered as the major concern in the area of WSN because of the huge quantity of sensor nodes and their distribution in the network. When the size of the network gets expanded the selection of the routing protocol become a crucial issue. A good routing protocol can help in enhancing the network lifetime. In this article, we are exhibiting a routing protocol which is based on existing LEACH protocol named as Random Number based LEACH (RN-LEACH) protocol. The results generated through simulation illustrate that the RN-LEACH algorithm has enhanced the working of the network in terms of energy consumption, network lifetime and packet received compared to existing LEACH protocol. The RN-LEACH protocol has increased the network lifetime by approximately more than 90% as compared to LEACH which shows the good agreement of RN-LEACH algorithm as contrasted to the previous technique.","PeriodicalId":45234,"journal":{"name":"International Journal of Future Generation Communication and Networking","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42215238","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-09-30DOI: 10.14257/IJFGCN.2018.11.5.06
U. Rabab, Irfan Uddin Ahmed, M. Aslam, Muhammad Usman
In this paper, we present the results of hardware implementation of our previously proposed lightweight encryption algorithm named as Secure Internet of Things (SIT). By virtue of its low cost and computational simplicity, SIT can be a good candidate to meet the needs of resource constraint applications related to the futuristic demands of Internet of Things. In this work, we have implemented our proposed SIT algorithm on Field Programmable Gate Array (FPGA) and compared the results with the similar implementations reported in the literature. During the hardware implementation, we focused on obtaining high throughput area ratio which is essential parameter for the applications focusing on internet of things. Our implementation of the SIT algorithm on FPGA achieved a throughput of 4899 Mbps with encryption while using only 711 logic elements resulting in throughput area ratio of 6.89.
{"title":"FPGA Implementation of Secure Internet of Things (SIT) Algorithm for High Throughput Area Ratio","authors":"U. Rabab, Irfan Uddin Ahmed, M. Aslam, Muhammad Usman","doi":"10.14257/IJFGCN.2018.11.5.06","DOIUrl":"https://doi.org/10.14257/IJFGCN.2018.11.5.06","url":null,"abstract":"In this paper, we present the results of hardware implementation of our previously proposed lightweight encryption algorithm named as Secure Internet of Things (SIT). By virtue of its low cost and computational simplicity, SIT can be a good candidate to meet the needs of resource constraint applications related to the futuristic demands of Internet of Things. In this work, we have implemented our proposed SIT algorithm on Field Programmable Gate Array (FPGA) and compared the results with the similar implementations reported in the literature. During the hardware implementation, we focused on obtaining high throughput area ratio which is essential parameter for the applications focusing on internet of things. Our implementation of the SIT algorithm on FPGA achieved a throughput of 4899 Mbps with encryption while using only 711 logic elements resulting in throughput area ratio of 6.89.","PeriodicalId":45234,"journal":{"name":"International Journal of Future Generation Communication and Networking","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46623150","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-09-30DOI: 10.14257/ijfgcn.2018.11.5.07
Junxuan Wang, Ruixin Li, Tianxiang Ji
{"title":"A Scheme of Mobility Management in UDN Based on PPP","authors":"Junxuan Wang, Ruixin Li, Tianxiang Ji","doi":"10.14257/ijfgcn.2018.11.5.07","DOIUrl":"https://doi.org/10.14257/ijfgcn.2018.11.5.07","url":null,"abstract":"","PeriodicalId":45234,"journal":{"name":"International Journal of Future Generation Communication and Networking","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41328270","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-09-30DOI: 10.14257/IJFGCN.2018.11.5.02
Bilal Karim Mughal, S. Hameed, B. Hameed
Although software-defined networks have seen a sharp increase in their deployment around the world, with big tech companies including Microsoft and Google, to name a few, tapping into the enormous potential that these networks offer, there are still various security loopholes that need to be plugged. One such security-related issues is that of a rogue controller bringing down an entire network. As we shall see in this paper, this problem is still short of any definitive solutions, especially when it comes to distributed software-defined networks. We attempt to resolve this issue by developing a centrally managed trust and reputation scheme. By proactively comparing the policies/flow rules that need to be installed in the switches with those that are actually installed, our scheme singles out a malicious controller. We have evaluated the scheme for scalability, message overhead, and for bad-mouthing attacks. Our results suggest that using trust and reputation system can greatly enhance the network security in this scenario as demonstrated by rigorous evaluations in Emulab network emulation testbed.
{"title":"Isolating Malicious Controller(s) In Distributed Software-Defined Networks with Centralized Reputation Management","authors":"Bilal Karim Mughal, S. Hameed, B. Hameed","doi":"10.14257/IJFGCN.2018.11.5.02","DOIUrl":"https://doi.org/10.14257/IJFGCN.2018.11.5.02","url":null,"abstract":"Although software-defined networks have seen a sharp increase in their deployment around the world, with big tech companies including Microsoft and Google, to name a few, tapping into the enormous potential that these networks offer, there are still various security loopholes that need to be plugged. One such security-related issues is that of a rogue controller bringing down an entire network. As we shall see in this paper, this problem is still short of any definitive solutions, especially when it comes to distributed software-defined networks. We attempt to resolve this issue by developing a centrally managed trust and reputation scheme. By proactively comparing the policies/flow rules that need to be installed in the switches with those that are actually installed, our scheme singles out a malicious controller. We have evaluated the scheme for scalability, message overhead, and for bad-mouthing attacks. Our results suggest that using trust and reputation system can greatly enhance the network security in this scenario as demonstrated by rigorous evaluations in Emulab network emulation testbed.","PeriodicalId":45234,"journal":{"name":"International Journal of Future Generation Communication and Networking","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46515942","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-07-31DOI: 10.14257/IJFGCN.2018.11.4.06
Supreeti Bal, M. Rai, Hye-jin Kim, R. Saha
{"title":"An Adaptive Parallel Interference Mitigation Technique using Artificial Neural Network in Complementary Coded MC-CDMA","authors":"Supreeti Bal, M. Rai, Hye-jin Kim, R. Saha","doi":"10.14257/IJFGCN.2018.11.4.06","DOIUrl":"https://doi.org/10.14257/IJFGCN.2018.11.4.06","url":null,"abstract":"","PeriodicalId":45234,"journal":{"name":"International Journal of Future Generation Communication and Networking","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.14257/IJFGCN.2018.11.4.06","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47895431","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
扫码关注我们
求助内容：
应助结果提醒方式：