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

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

筛选
英文 中文
CETM: a conflict-free energy efficient transmission policy in mobile cloud computing 移动云计算中无冲突的节能传输策略
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-02-10 DOI: 10.1504/IJCNDS.2018.10010381
Bibudhendu Pati, C. Panigrahi, J. Sarkar
{"title":"CETM: a conflict-free energy efficient transmission policy in mobile cloud computing","authors":"Bibudhendu Pati, C. Panigrahi, J. Sarkar","doi":"10.1504/IJCNDS.2018.10010381","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10010381","url":null,"abstract":"The rapid advancement of mobile devices creates huge interest to the users for performing various applications. For running those applications, sufficient energy is required which can fulfil the user requirements. To accommodate this challenge, in this work an energy optimal scheduling policy for mobile cloud computing (MCC) named as CETM has been proposed. There are a number of work have been proposed in the literature which focus on energy efficiency of mobile devices but they do not support conflict-free scheduling. In CETM, the applications of mobile devices are split into a number of tasks and the inter release time of two consecutive tasks maintain atleast δ steps. The CETM also supports offloading scheme to reduce the consumption of energy of mobile devices. The simulation results indicate that the proposed approach performs better as compared to the existing approaches such as eTime and ThinkAir.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133216463","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}
引用次数: 4
A new proposed cloud computing based architecture for space ground data systems 一种新的基于云计算的空间地面数据系统架构
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-02-10 DOI: 10.1504/IJCNDS.2018.10010390
Ali Kaddouri, Mustapha Guezouri, N. Mbarek
{"title":"A new proposed cloud computing based architecture for space ground data systems","authors":"Ali Kaddouri, Mustapha Guezouri, N. Mbarek","doi":"10.1504/IJCNDS.2018.10010390","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10010390","url":null,"abstract":"Many companies decided to move towards the cloud computing technology in order to manage, monitor and explore huge space data amount in the space ground data systems. The corresponding transition adaptation needs a study to classify each space related service in the appropriate cloud computing service model layer; SaaS, PaaS and IaaS. In this paper, we specify a representation of proposed cloud computing based ground data system architecture for earth observation missions. The proposed architecture takes into consideration the collaboration aspect between multiple space agencies. We evaluate the time, storage and processing performance when using the cloud computing environment. The obtained results show a good performance where contact time increases significantly and more data was processed compared to the classic approach using hard CPU units. These results and especially the obtained contact time increase provide multiple agencies with more opportunities to intervene in cases of anomalies or disaster.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"40 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132153676","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 swarm intelligence learning model of adaptive incentive protocols for P2P networks P2P网络自适应激励协议的群体智能学习模型
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-02-10 DOI: 10.1504/IJCNDS.2018.10010389
Zheng Wang
{"title":"A swarm intelligence learning model of adaptive incentive protocols for P2P networks","authors":"Zheng Wang","doi":"10.1504/IJCNDS.2018.10010389","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10010389","url":null,"abstract":"Incentive protocols are critical for promoting contribution and cooperation among peers in P2P networks. The behaviour of peers has a significant impact on the effects of incentive protocols. Inspired by the biological systems, a swarm intelligence learning model of adaptive incentive protocols is proposed for P2P networks. The learning model is designed by having peers as particles in the moving swarm. The learning and adaption of peers are guided by the current best strategy as well as the best strategy in history. Simulation results demonstrate that the proposed learning model has a faster convergence rate towards at least the quasi-optimum than the two existing learning models.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115409264","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
Investigation a new technique of automatic variable key using two dimensional matrix approach to achieve perfect security 研究了一种利用二维矩阵方法实现自动可变密钥安全的新技术
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-02-10 DOI: 10.1504/IJCNDS.2018.10010387
M. Das, Pranab Roy, R. Goswami, C. Bhunia
{"title":"Investigation a new technique of automatic variable key using two dimensional matrix approach to achieve perfect security","authors":"M. Das, Pranab Roy, R. Goswami, C. Bhunia","doi":"10.1504/IJCNDS.2018.10010387","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10010387","url":null,"abstract":"In all cryptosystem, the major challenge is to make the key unbreakable. Shannon proposed that, key would be impossible to break if the key is made time variant. The variable keys are highly enforced to provide the perfect security in automatic variable key which is more novel approaches in information security field. The time variant key can be implemented by changing keys from session to session during data transfer for achieving perfect security. To attain this goal, key should be made variable by an agreement that creates new key for each session of data transfer at both sender and receiver sides. In this paper, we have proposed a new technique to generate time variant key by enhancing the randomness between two successive keys. The main purpose of this technique is to produce numerous keys in symmetric key cryptosystem with a behaviour which will be difficult to guess by the attacker.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124788898","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
Achieving a high throughput and a low latency through a modular packet scheduler 通过模块化数据包调度器实现高吞吐量和低延迟
Int. J. Commun. Networks Distributed Syst. Pub Date : 2017-12-12 DOI: 10.1504/IJCNDS.2017.10004206
M. Casoni, Carlo Augusto Grazia, P. Valente
{"title":"Achieving a high throughput and a low latency through a modular packet scheduler","authors":"M. Casoni, Carlo Augusto Grazia, P. Valente","doi":"10.1504/IJCNDS.2017.10004206","DOIUrl":"https://doi.org/10.1504/IJCNDS.2017.10004206","url":null,"abstract":"Providing QoS guarantees in a wireless environment is a challenging task because of the idiosyncrasies of the wireless media. State-of-the-art solutions for QoS provisioning over wireless links are based on cross-layering packet schedulers that deal both with the QoS guarantees and the wireless link issues. Unfortunately, such an approach is not flexible and requires technology-dependent solutions. To address these issues, we present a modular architecture which permits the use of existing high-performance packet schedulers for wired links over generic wireless technologies, as they are, and at the same time allows the flexibility to adapt to different channel conditions. We validate the effectiveness of our modular solution through a formal analysis. We also present high-throughput twin fair scheduler (HFS), a novel packet scheduler based on the modular architecture. HFS has constant execution time, accurate fairness, and low latency.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122277178","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
An enhanced anonymous remote user authentication scheme using smart card in insecure communication channel 一种在不安全通信信道中使用智能卡的增强匿名远程用户认证方案
Int. J. Commun. Networks Distributed Syst. Pub Date : 2017-10-16 DOI: 10.1504/IJCNDS.2017.10007999
Subhasish Banerjee, M. P. Dutta, C. Bhunia
{"title":"An enhanced anonymous remote user authentication scheme using smart card in insecure communication channel","authors":"Subhasish Banerjee, M. P. Dutta, C. Bhunia","doi":"10.1504/IJCNDS.2017.10007999","DOIUrl":"https://doi.org/10.1504/IJCNDS.2017.10007999","url":null,"abstract":"To prove the legitimacy among the users and to ensure the secure communication over the insecure network the remote user authentication using smart card and password is one of the simplest and efficient mechanisms. In this context, Kumari et al. proposed an improved remote user authentication scheme and claimed, their scheme is more user friendly, can resist various possible attacks at very low cost than existing ones. Unfortunately, during our research we have found this is not the case, their scheme cannot sustain against all those attacks for which the scheme was meant. In this paper, we have pointed out that their scheme not only can suffer from user anonymity problem but also fails to resist against offline password guessing attack, server masquerading attack and can create the risk of session key agreement too. Then, while retaining the original merits of their scheme we propose an efficient and modified scheme to overcome from aforesaid weaknesses, but at low computational cost.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124088980","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
k-hop neighbour knowledge-based clustering in CRN under opportunistic channel access 机会通道接入下基于k-hop邻居知识的CRN聚类
Int. J. Commun. Networks Distributed Syst. Pub Date : 2017-10-16 DOI: 10.1504/IJCNDS.2017.10007987
R. Misra, R. Yadav
{"title":"k-hop neighbour knowledge-based clustering in CRN under opportunistic channel access","authors":"R. Misra, R. Yadav","doi":"10.1504/IJCNDS.2017.10007987","DOIUrl":"https://doi.org/10.1504/IJCNDS.2017.10007987","url":null,"abstract":"Cognitive radio networks (CRNs) enables cognitive users (CUs) to use available spectrum of primary users (PUs) using innovative techniques. On appearance of PUs, the available channel of CUs at different position may have different available channels which changes dynamically over time. Due to temporal and spatial variations of opportunistic channel availability, to ensure connectivity and robustness in CRN is of great research interests. We have proposed novel approach of k-hop neighbour knowledge-based clustering algorithm which guarantees robustness in CRN and converges in O(n2m), for n CUs and m clusters in the network. We have evaluated for varying 3-hop, 4-hop, … k-hop through simulation which shows that our scheme achieves 25%-30% more numbers of outward common channels and outperforms in terms of inner common channel index, outward common channel index, number of isolated nodes, throughput and frequency of route discovery compared to the competitive approaches.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129966696","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 effective resource management in cloud computing 云计算中有效的资源管理
Int. J. Commun. Networks Distributed Syst. Pub Date : 2017-10-16 DOI: 10.1504/IJCNDS.2017.10007995
P. Shameem, N. Johnson, Shaji Ramaswamy Swarnammal, E. Arun
{"title":"An effective resource management in cloud computing","authors":"P. Shameem, N. Johnson, Shaji Ramaswamy Swarnammal, E. Arun","doi":"10.1504/IJCNDS.2017.10007995","DOIUrl":"https://doi.org/10.1504/IJCNDS.2017.10007995","url":null,"abstract":"Provision of resources must be provided such that all resources are made available to user's request in efficient manner to satisfy their needs. Resource allocation in virtualised environment should provide elasticity. When the workload increases, existing approaches cannot respond to the growing performance in an effective way. This may lead to the violation of service level agreement (SLA) which will decrease the quality of service (QoS). Existing methods cannot take an accurate decision on the allocation of resources in an optimal way and are not predictive in nature. Before any problems occur, they cannot take a precaution on resource management. Therefore, a framework is used to ensure effective resource management. This framework uses rough set algorithm in order to make an accurate decision on the allocation of resources. Variation in workloads is adapted by considering new parameters like type of application, garbage processing policy and internal application resources.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129268662","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 fuzzy-based mechanism for delay window adjustment to improve TCP performance in wireless multi-hop networks 一种基于模糊的延迟窗口调整机制以提高无线多跳网络中TCP的性能
Int. J. Commun. Networks Distributed Syst. Pub Date : 2017-10-16 DOI: 10.1504/IJCNDS.2017.10007997
M. Nassiri, Mojtaba Mehdizadeh
{"title":"A fuzzy-based mechanism for delay window adjustment to improve TCP performance in wireless multi-hop networks","authors":"M. Nassiri, Mojtaba Mehdizadeh","doi":"10.1504/IJCNDS.2017.10007997","DOIUrl":"https://doi.org/10.1504/IJCNDS.2017.10007997","url":null,"abstract":"TCP protocol was initially designed for wired networks to guarantee reliable data transfer. In wired networks, TCP assumes congestion if data packets are dropped. However, this assumption does not hold when the end-to-end path includes wireless links, where, high bit error rate (BER), shared medium and dynamic nature of the wireless channel may cause packet loss. This results in a severe degrade in performance of standard TCP in wireless networks. On the other hand, TCP cannot be changed fundamentally due to the large base of installation in the wired network. Delayed-ACK generation at the TCP receiver has been proposed to mitigate collision rate within wireless network. However, choosing appropriate delayed window size is an important issue. In this article, we propose a new delayed-ACK approach based on a fuzzy controller to improve TCP performance in wireless networks. The major advantage of our mechanism is reducing the overhead and the collision rate in multi-hop wireless networks. We also compare our proposal with some of well-known studies. Simulations results confirm good performance of our mechanism.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123171957","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
Route recommendation system to support multiple destinations and multiple routes to minimise road congestion 路线推荐系统，支持多个目的地和多条路线，以减少道路挤塞
Int. J. Commun. Networks Distributed Syst. Pub Date : 2017-10-16 DOI: 10.1504/IJCNDS.2017.10007998
Chayanon Sub-r-pa, G. Chakraborty, B. Sinha
{"title":"Route recommendation system to support multiple destinations and multiple routes to minimise road congestion","authors":"Chayanon Sub-r-pa, G. Chakraborty, B. Sinha","doi":"10.1504/IJCNDS.2017.10007998","DOIUrl":"https://doi.org/10.1504/IJCNDS.2017.10007998","url":null,"abstract":"Multiple destinations routing is important for car navigation when a user requests for a service instead of a specific destination. Existing navigation systems can suggest k shortest routes to a destination, where the cost is defined in terms of distance, travel time, or other parameter. In case of a special event like a festival or an unforeseen situation such as tsunami, a large number of users would require the same service, e.g., a parking lot or a safe shelter, not a specific destination. When service points are known, the proposed algorithm first computes multiple near-optimal routes to those destinations, and then optimally distributes the traffic along those routes based on respective costs. This reduces congestion both on road network as well as at service points. Our proposed algorithm has been simulated with real-life traffic data on real city road network, showing encouraging results compared to conventional routing.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126450805","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
首页 上一页
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学术官方微信