发布求助
文献互助 智能选刊 最新文献

Int. J. Commun. Networks Distributed Syst.最新文献

筛选
英文 中文
Public key cryptography using sphere and spheroid 使用球体和椭球体的公钥加密
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-09-05 DOI: 10.1504/IJCNDS.2018.10015057
K. JohnSingh, Kunal Gagneja
{"title":"Public key cryptography using sphere and spheroid","authors":"K. JohnSingh, Kunal Gagneja","doi":"10.1504/IJCNDS.2018.10015057","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10015057","url":null,"abstract":"Encryption has different requirements such as speed and immunity to side channel attacks. In this paper, a novel mechanism for public key encryption is proposed. It is faster and has inbuilt compression. Experiments are carried out with video, high definition video and image files. Results when compared with various encryption algorithms indicate that the proposed cryptosystem has a stronger and faster architecture. The proposed algorithm can be modified to work both as a block and stream cipher. Generally, block cipher increases the size of ciphertext due to padding. Such phenomenon is lesser observed in the proposed cipher. It makes cipher convenient for resource constraint networks. Most of the symmetric key algorithms have XOR and shuffling in their blocks. This is one of the reasons why they have similar kind of vulnerabilities. Spheroid cryptosystem proved to be at least 77.2% faster than other algorithms.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123398925","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}
引用次数: 0
Multiple criteria-based efficient schemes for participants selection in mobile crowd sensing 基于多准则的移动人群感知参与者选择高效方案
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-09-05 DOI: 10.1504/IJCNDS.2018.10015059
A. A. Gad-Elrab, Almohammady S. Alsharkawy
{"title":"Multiple criteria-based efficient schemes for participants selection in mobile crowd sensing","authors":"A. A. Gad-Elrab, Almohammady S. Alsharkawy","doi":"10.1504/IJCNDS.2018.10015059","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10015059","url":null,"abstract":"Nowadays there is an increasing demand to provide a real-time environmental information. So, the growing number of mobile devices carried by users establishes a new and fast-growing sensing paradigm to satisfy this need which is called mobile crowd sensing (MCS). In MCS, the optimality of sensory data quality may not be satisfied due to the existence of inexperienced users and uncoordinated task management. This paper proposes a novel participant selection schemes for enhancing the data quality in MCS. The proposed selection schemes minimise incentive payments by selecting some participants while still satisfying sensory data quality constraint. Multiple criteria factors are used to evaluate the data quality of candidate users for selecting a minimal set of users with the best data quality values by using fuzzy logic controller. These factors include a user experience and a quality of sensory units of a mobile device with each user. The experimental results by using synthetic and real data show that the proposed selection schemes can gather high-quality sensory data with low cost compared to existing schemes.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"38 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114113869","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}
引用次数: 2
Adaptive spectral subtraction to improve quality of speech in mobile communication 自适应频谱减法提高移动通信语音质量
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-09-05 DOI: 10.1504/IJCNDS.2018.10015053
U. Purushotham, K. Suresh
{"title":"Adaptive spectral subtraction to improve quality of speech in mobile communication","authors":"U. Purushotham, K. Suresh","doi":"10.1504/IJCNDS.2018.10015053","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10015053","url":null,"abstract":"With the development of VLSI technology, mobile communication is supported by smart devices for transmission and reception of information in various forms. In order to improve the quality of speech communication smart devices are provided with pre-processing algorithms. These algorithms should be adaptive in nature to suppress the real-time noise. The performance of smart devices depends on the algorithms. The performance of smart devices is excellent in noise-free surroundings; however, their performances worsen in noisy surroundings. Spectral domain weighting approaches, which estimate spectral density of noise, are considered for speech enhancement. These algorithms process speech in short frames. In this paper, we propose one such novel algorithm for assessment of noise in very small bands based on type of disturbance. Thus, using multiband time-varying filtering coefficients, speech signals are modelled by autoregressive process. Experimental results demonstrate an improvement of 25% to 45% as compared to other conventional multiband approach.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129623449","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}
引用次数: 1
Perturbation-minimising frequency assignment to address short term demand fluctuation in cellular network 解决蜂窝网络短期需求波动的扰动最小化频率分配
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-09-05 DOI: 10.1504/IJCNDS.2018.10015058
Soumen Atta, P. Mahapatra
{"title":"Perturbation-minimising frequency assignment to address short term demand fluctuation in cellular network","authors":"Soumen Atta, P. Mahapatra","doi":"10.1504/IJCNDS.2018.10015058","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10015058","url":null,"abstract":"In cellular network short term demand fluctuation is a very common phenomenon. The demand of any cell may increase or decrease slightly or the system may expand by adding additional cells or the system may shrink if the demands of certain number of cells become zero. In this paper, the perturbation-minimising frequency assignment problem (PMFAP) is considered to address the short term fluctuation in demand vector. PMFAP is a frequency assignment problem in which newly generated demands are satisfied with minimum changes in the already existing frequency assignment keeping all the interference constraints. In this paper, an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. With a slight modification to the proposed algorithm, it can solve the well-known frequency assignment problem (FAP) and its performance is also compared with the existing results using the standard benchmark data sets for FAP.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130444158","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}
引用次数: 0
An enhanced message verification system for vehicle-to-vehicle communication 用于车对车通信的增强型消息验证系统
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-09-05 DOI: 10.1504/IJCNDS.2018.10015055
Trupil Limbasiya, Debasis Das
{"title":"An enhanced message verification system for vehicle-to-vehicle communication","authors":"Trupil Limbasiya, Debasis Das","doi":"10.1504/IJCNDS.2018.10015055","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10015055","url":null,"abstract":"Smart vehicle plays a major role in today's technological universe and we have different vehicle applications with the help of the internet of things. To fulfil it, there is a requirement of expeditious communication along with integrity, availability, high delivery ratio and low overhead assets. Otherwise, specific information or data may be useless or there will be possibility of the serious problem(s). Vehicular communication is mostly preferable to transfer datagrams from one user to other applicants to accomplish these characteristics. However, the delivery of packets successfully is not a simple task and be familiar with the updated information due to various obstacles. Researchers suggested discrete protocols to procure different properties in this noisy vehicular ad-hoc network (VANET). Scientists designed systematic authentication models using user identity for vehicular technology. In this article, we investigate multiple vehicle communication algorithms. But, we find some vulnerabilities after performing analysis on the particular scheme. After that, we propose an enhanced authentication system focused on vehicle-to-vehicle data transmission to overcome the present flaws. In addition, the suggested protocol is protected against multiple attacks and efficient in terms of the execution.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134394093","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}
引用次数: 2
K-mMA VM selection in dynamic VM consolidation for improving energy efficiency at cloud data centre 动态虚拟机整合中的K-mMA虚拟机选择，提高云数据中心的能源效率
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-08-27 DOI: 10.1504/IJCNDS.2018.10014504
G. F. Shidik, Azhari, K. Mustofa
{"title":"K-mMA VM selection in dynamic VM consolidation for improving energy efficiency at cloud data centre","authors":"G. F. Shidik, Azhari, K. Mustofa","doi":"10.1504/IJCNDS.2018.10014504","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10014504","url":null,"abstract":"Dynamic virtual machine (VM) consolidation is an alternative solution for managing and optimising energy efficiency in a cloud data centre. This research proposed VM selection method in dynamic VM consolidation based on K-means clustering technique and computational model Markov normal algorithm (K-mMA). The objective of VM selection is to select proper VM, which should be migrated away from the overloaded physical machine and to avoid oversubscribe host. The VM selection method has been tested in simulation condition using CloudSim and PlanetLabs datasets with various conditions of VM instances (homogeneous and heterogeneous). The performance metrics in this research are energy consumption (EC), SLA time per active host (SLATAH), performance degradation due migration (PDM) and SLA violation (SLAV). Results experiment has shown that K-mMA could improve energy efficiency and quality of service (QOS) at cloud data centre significantly. Compared with existing method such as CFS, MMT, RC, and MC the proposed K-mMA could improve efficiency energy in cloud data centre by optimising VM selection problem up to 3.9%, 6.8%, 5.5%, and 5.3% respectively.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125383322","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}
引用次数: 2
A modified DV-Hop algorithm for wireless sensor network localisation 一种改进的DV-Hop无线传感器网络定位算法
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-08-27 DOI: 10.1504/IJCNDS.2018.10014503
Santar Pal Singh, S. Sharma
{"title":"A modified DV-Hop algorithm for wireless sensor network localisation","authors":"Santar Pal Singh, S. Sharma","doi":"10.1504/IJCNDS.2018.10014503","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10014503","url":null,"abstract":"In previous years, wireless sensor networks (WSNs) have gained significant consideration from the industrial and research community. However, WSNs uses are restricted by many obstacles. In several applications, monitored data is of no importance if sensor location is unknown because location is needed to spot the network task. So; it is most significant that nodes address the information with the positions. Hence, localisation is an essential process to determine the nodes' location. The localisation methods broadly classified as: range-based and range-free. Range-based methods use actual distance measures whereas range-free schemes use approximate measures. Hence, the range-free methods are a cost effective alternative to range-based because they don't need any added hardware. However, range-free methods have higher localisation error compared to range-based methods. In this paper, we propose a modified algorithm for localisation based on DV-Hop. The simulation results confirm that proposed algorithm improves the results with respect to localisation error and error variance.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131778071","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}
引用次数: 2
Detection of wormhole attacks in mobility-based wireless sensor networks 基于移动的无线传感器网络中虫洞攻击的检测
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-08-27 DOI: 10.1504/IJCNDS.2018.10014500
Manish Patel, A. Aggarwal, Nirbhay Chaubey
{"title":"Detection of wormhole attacks in mobility-based wireless sensor networks","authors":"Manish Patel, A. Aggarwal, Nirbhay Chaubey","doi":"10.1504/IJCNDS.2018.10014500","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10014500","url":null,"abstract":"Wireless sensor networks (WSNs) have many limitations in terms of their computational capability, memory, and battery power. In addition, the sensor nodes use insecure wireless communication channels. Thus, WSNs are vulnerable to many types of attacks such as jamming, sinkhole, wormhole, Sybil, and selective forwarding. Among all these attacks, detecting a wormhole attack is very difficult in mobility-based WSNs. In these WSNs, two genuine nodes that are located far apart can become one-hop neighbours for valid reasons. However, the same scenario might indicate the presence of a wormhole attack instead. Differentiating genuine nodes from malicious nodes is a highly challenging task. Our detection method is based on the concept of the rate of change of neighbouring nodes and the length of an alternative path between two nodes. The proposed method does not require any additional hardware such as synchronised clocks or timing information, GPS, or cryptographic methods that require large amounts of computational power. The simulation results indicate that our method has good detection accuracy.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128189848","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}
引用次数: 5
RQ-AQM: a rate and queue-based active queue management using feedback control theory RQ-AQM:基于反馈控制理论的基于速率和队列的主动队列管理
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-08-27 DOI: 10.1504/IJCNDS.2018.10014494
S. Bisoy, P. Pattnaik
{"title":"RQ-AQM: a rate and queue-based active queue management using feedback control theory","authors":"S. Bisoy, P. Pattnaik","doi":"10.1504/IJCNDS.2018.10014494","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10014494","url":null,"abstract":"This work proposes a rate and queue based active queue management (RQ-AQM) algorithm to improve the stability of the network system supporting TCP flows. Classical control theory is employed to analyse the stability of TCP/RQ-AQM system and provide systematic guidelines to select control gain parameters of the RQ-AQM. The performance of the proposed algorithm is evaluated and compared with existing algorithms using network simulator-2 (NS2). Simulation results demonstrate that RQ-AQM achieves stability with faster responsive to the dynamic network conditions. The proposed algorithm obtains better performance with respect to throughput, link utilisation, average delay and achieves fastest settling time than others.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134285195","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}
引用次数: 1
An overview of flow-based anomaly detection 基于流的异常检测概述
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-08-27 DOI: 10.1504/IJCNDS.2018.10014505
Rohini Sharma, Ajay Guleria, R. K. Singla
{"title":"An overview of flow-based anomaly detection","authors":"Rohini Sharma, Ajay Guleria, R. K. Singla","doi":"10.1504/IJCNDS.2018.10014505","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10014505","url":null,"abstract":"Intrusions in computer networks are handled using misuse or anomaly-based solutions. Deep packet inspection is generally incorporated in solutions for better detection and mitigation but with the growth of networks at exponential speed, it has become an expensive solution and makes real-time detection difficult. In this paper, network flows-based anomaly detection techniques are reviewed. The review starts with motivation behind using network flows and justifies why flow-based anomaly detection is the need of the hour. Flow-based datasets are also investigated and reviewed. The main focus is on techniques and methodologies used by researchers for anomaly detection in computer networks. The techniques reviewed are categorised into five classes: statistical, machine learning, clustering, frequent pattern mining and agent-based. At the end the core research problems and open challenges are discussed.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123352034","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}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信