Faraz Fatemi Moghaddam, Maen T. Alrashdan, Omidreza Karimi
{"title":"A Hybrid Encryption Algorithm Based on RSA Small-e and Efficient-RSA for Cloud Computing Environments","authors":"Faraz Fatemi Moghaddam, Maen T. Alrashdan, Omidreza Karimi","doi":"10.7763/JACN.2013.V1.47","DOIUrl":"https://doi.org/10.7763/JACN.2013.V1.47","url":null,"abstract":" Abstract—Cloud computing is an emerging technology that is still unclear to many security problems. Ensuring the security ofstored data in cloud servers is one of the most challenging issues in such environments. Accordingly, this schema presents a Hybrid Encryption algorithm that is based on RSA Small-e and Efficient RSA (HE-RSA) for improving the reliability in cloud computing environments. The main aim of this project is to use the cryptography concepts in cloud computing communications and to increase the security of encrypted data in cloud servers with the least consumption of time and cost at the both of encryption and decryption processes.In the proposed model, the number of key generation exponents has been increased in comparison to the original RSA. Moreover,a dual encryption process has been applied in this algorithm to prevent common attacks against RSA algorithm. In addition, this schema also presents the comparison between HE-RSA and original RSA in terms of security and performance. For this purpose, Key Generation, Encryption and Decryption Time in Original RSA and HE-RSA have been compared according to the different size of exponents. Moreover, some of the common attacks against RSA algorithm have been analysed to detect the resistance of the proposed algorithm against possible attacks. Finally, the effects of using HE-RSA on cloud computing environments have been reviewed in more depth and details.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"35 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":"134211171","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}
Derek Doran, Alberta de la Rosa Algarin, S. Gokhale
{"title":"Characterizing the Activity of Friendship Triads on Facebook","authors":"Derek Doran, Alberta de la Rosa Algarin, S. Gokhale","doi":"10.7763/JACN.2014.V2.78","DOIUrl":"https://doi.org/10.7763/JACN.2014.V2.78","url":null,"abstract":"","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"88 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":"134269227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Flexible Bandwidth Allocation Algorithm for Virtual Machine Live Migration","authors":"S. Kai","doi":"10.18178/JACN.2016.4.2.210","DOIUrl":"https://doi.org/10.18178/JACN.2016.4.2.210","url":null,"abstract":"Abstract—Virtual machine(VM) live migration is a core feature of virtualization which enables dynamic resource requirements to be matched with available physical resources, leading to better performance and reduced energy consumption. A group of pages have been mapped writable in response to the migration algorithm, however there lacks a algorithm to choose the matching algorithm dynamically based on the upper running features. This paper propose FBA algorithm which can first divide all the migrations into two types “sluggish dirty page” and “swifting dirty page” by monitoring the value of skip_to, moreover this paper present corresponding corrective strategies for migrating the two types of application. Finally via simulation and experiments with real system prototypes, the results show that when it belongs to “swifting dirty page”, compared with existing pre-copy algorithm FBA algorithm improve the bandwidth utilization and reduce the total migration time; while for the “sluggish dirty page”, the pre-copy algorithm will fail and FBA algorithm makes a beneficial supplement.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"54 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":"134534172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Real-Time Computer Network Anomaly Detection Using Machine Learning Techniques","authors":"Kriangkrai Limthong","doi":"10.7763/JACN.2013.V1.1","DOIUrl":"https://doi.org/10.7763/JACN.2013.V1.1","url":null,"abstract":"—Detecting a variety of anomalies in computer network, especially zero-day attacks, is one of the real challenges for both network operators and researchers. An efficient technique detecting anomalies in real time would enable network operators and administrators to expeditiously prevent serious consequences caused by such anomalies. We propose an alternative technique, which based on a combination of time series and feature spaces, for using machine learning algorithms to automatically detect anomalies in real time. Our experimental results show that the proposed technique can work well for a real network environment, and it is a feasible technique with flexible capabilities to be applied for real-time anomaly detection.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"83 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":"133126217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel Cross-Layer Network Architecture and Its Performance Analysis Using Mobile Ad Hoc Network Routing Protocol","authors":"Adarsh Kumar, K. Gopal, A. Aggarwal","doi":"10.7763/JACN.2013.V1.41","DOIUrl":"https://doi.org/10.7763/JACN.2013.V1.41","url":null,"abstract":" Abstract—In this work a novel cross layer architecture is proposed for dynamic selection of routing protocol in Mobile Ad Hoc Network (MANET). Switching function is designed based on Quality of Service parameters and performance of proposed cross layer architecture is evaluated over quality of service parameters. Three routing protocols: Ad-Hoc On Demand Distance Vector (AODV), Destination Sequenced Distance Vector (DSDV) and Dynamic Source Routing (DSR) with variable number of nodes are used for performance analysis of proposed cross layer network architecture.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"1 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":"122690759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Adaptive and Robust Routing Approach in Wireless Sensor Networks","authors":"Yan-Jun Zhang","doi":"10.18178/JACN.2017.5.1.235","DOIUrl":"https://doi.org/10.18178/JACN.2017.5.1.235","url":null,"abstract":"In wireless sensor networks (WSNs), realizing the network life cycle maximization is still a huge challenge due to the problems of energy constraint. In this paper, we propose Modified Multi-source Opportunistic Shortcut Routing Algorithm (MMOSRA), which is on the basis of the shortest remaining hops MOSRA algorithm, we add the new parameter ERHi according to the weight value of energy-hop for achieving the purpose of balancing sensor nodes energy consumption. When one flow changes its routing path for some emergency, we can find a optimized routing path with the MMOSRA algorithm and avoid that a slid change in one link causing a huge oscillation of all the network link. Next we use the measured parameters that condition number K(A) of routing matrix to evaluate the impact on the entire network link and select data transmission routing path finally. Compared with the MOSRA algorithm, the MMOSRA rationally utilize residual energy of each node to prolong the network life cycle. Example and simulation demonstrate that our proposed scheme has significantly increased the network lifetime and balanced energy utilization efficiency of all nodes.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"114 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":"124537952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Retransmission Mechanism for Partially Reliable Transport Protocols Based on Multimedia Applications Transmission","authors":"Ching-Neng Lai, Yen-Hung Chen","doi":"10.18178/JACN.2015.3.4.178","DOIUrl":"https://doi.org/10.18178/JACN.2015.3.4.178","url":null,"abstract":"The partially reliable transport protocol can enhance the quality of services (QoS) of multimedia applications because it reliably transmits some packets and unreliably transmits other packets. Nevertheless, determining which packets require reliable, i.e., these packets will be retransmitted if they were lost, significantly influences the performance of multimedia applications. For the determination, existing approaches adopt a fixed threshold or require information from other layers. This paper proposes a Timeliness-aware Retransmission Mechanism (TRM) that dynamically determines which lost packets should be retransmitted without any information provided from other layers. The receiver using TRM determines a threshold, which is the packet sequence number having timeliness, according to the packet consumed rate and the Round-Trip Time (RTT). Thus the sender retransmits lost packets that can timely arrive, namely, the packets have sequence numbers larger than this threshold. Simulation results shows that PR-DCCP, a partially reliable transport protocol, with TRM can efficiently increase the Decodable Frame Ratios (DFRs), which represents QoS, and decrease the Useless Data Received Ratios (UDRRs), which represents the bandwidth waste. In the simulations, TRM can achieve 8.6~10.6% DFR improvement and 15.1%~17.6% UDRR improvement on average, compared with other retransmission methods.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"23 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":"129393980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The System Design and Implementation of Vehicle Management","authors":"Jr-Jen Huang, Yi Chu, Yen-Jen Chen","doi":"10.7763/JACN.2013.V1.2","DOIUrl":"https://doi.org/10.7763/JACN.2013.V1.2","url":null,"abstract":"","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"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":"116345971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mobile Sink Scheduling Method for Wireless Sensor Networks under Travel Time Uncertainty","authors":"M. Karakaya","doi":"10.18178/JACN.2015.3.4.191","DOIUrl":"https://doi.org/10.18178/JACN.2015.3.4.191","url":null,"abstract":"In Wireless Sensor Networks (WSN), timely data collection is an important requirement for the success of the applications. On the other hand, sensor nodes have limited resources, such as battery power and memory capacity which limits their direct participation to data collection process. Therefore, to collect sensory data efficiently, well-designed techniques are to be developed. One of the proposed techniques is to employ mobile sinks (MS) to decrease the energy consumption at sensor nodes spent in forwarding data packages. In this method, MS is scheduled such that it arrive sensor nodes before their memory gets full and overflows. For a successful schedule, the crucial information is the travelling time between sensor nodes in the field. In most cases, it is assumed that the travelling time is known a priori and remains the same all the time. However, in reality, due to various reasons, travelling times can change in course of time and, hence, the planned schedule may not produce the desired output. In this study, we propose an improved scheduling method considering uncertainty in travelling time. Simulation experiments justify the expected success of the proposed method.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"39 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":"115404971","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}
Tayyeba Minhas, Satish Anamalamudi, Xu Ning, Minglu Jin
{"title":"Performance Evolution of MAC Layer in IEEE 802.11g Networks","authors":"Tayyeba Minhas, Satish Anamalamudi, Xu Ning, Minglu Jin","doi":"10.7763/JACN.2013.V1.31","DOIUrl":"https://doi.org/10.7763/JACN.2013.V1.31","url":null,"abstract":"","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"259 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":"114547993","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}