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

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

筛选
英文 中文
QoS enhanced distributed load balancing and task scheduling framework for wireless networks using hybrid optimisation algorithm 基于混合优化算法的无线网络分布式负载平衡和任务调度框架
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-08-27 DOI: 10.1504/IJCNDS.2018.10014506
Abhijit A. Rajguru, S. Apte
{"title":"QoS enhanced distributed load balancing and task scheduling framework for wireless networks using hybrid optimisation algorithm","authors":"Abhijit A. Rajguru, S. Apte","doi":"10.1504/IJCNDS.2018.10014506","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10014506","url":null,"abstract":"Quality of service (QoS) is the main challenging issue in load balancing, task scheduling process in dynamic systems, such as grid system, peer-to-peer system, ad hoc networks, cloud computing system, pervasive computing system, and online social network system. The inefficient task scheduling process reduces QoS parameters, such as energy consumption, throughput, network lifetime, deadline missing ratio and schedule delay time. In this paper, we proposed QoS enhanced distributed load balancing, task scheduling frameworks for wireless networks (WNs) using hybrid optimisation algorithm (EDFHOA). We improve QoS of distributed frameworks by two phase system through an efficient clustering methodology using particle swarm optimisation (PSO) algorithm for load balancing in the first phase. A cuckoo search (CS) algorithm with load balanced for task scheduling in the second phase. The proposed two-phase hybrid algorithms enhance task scheduling, such as latency experienced by the balanced clustering, energy consumption, throughput, network lifetime, efficient resource utilisation and less processing time requirement and highly accurate than fault tolerant task allocation algorithm (FTAOA).","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"6 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":"133420771","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
Implementation of two fuzzy-based systems for IoT device selection in opportunistic networks: effect of storage parameter on IoT device selection 机会网络中两个基于模糊的物联网设备选择系统的实现:存储参数对物联网设备选择的影响
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-07-27 DOI: 10.1504/IJCNDS.2018.10013894
Miralda Cuka, Donald Elmazi, Elis Kulla, Tetsuya Oda, Makoto Ikeda, L. Barolli
{"title":"Implementation of two fuzzy-based systems for IoT device selection in opportunistic networks: effect of storage parameter on IoT device selection","authors":"Miralda Cuka, Donald Elmazi, Elis Kulla, Tetsuya Oda, Makoto Ikeda, L. Barolli","doi":"10.1504/IJCNDS.2018.10013894","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10013894","url":null,"abstract":"Recently, there are many research works on opportunistic networks and internet of things (IoT). In this paper, we integrate these two technologies by using fuzzy logic. We propose a fuzzy-based approach and implement two fuzzy-based systems for IoT device selection in opportunistic networks. We call the implemented systems: FSIO1 and FSIO2. For FSIO1, we use three input parameters: IoT device speed (IDS), IoT device distance from task (IDDT) and IoT device remaining energy (IDRE). The output parameter is IoT device selection decision (IDSD). For FSIO2, we consider four input parameters by adding IoT device storage (IDST) as a new parameter. Comparing complexity of FSIO1 and FSIO2, the FSIO2 is more complex than FSIO1. But, the FSIO2 is more flexible and makes a better selection of IoT devices than FSIO1.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131755317","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
Implementation and performance evaluation of an intelligent fuzzy-based testbed for WSANs: a case study for object tracking 基于模糊的无线局域网智能测试平台的实现与性能评估——以目标跟踪为例
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-07-27 DOI: 10.1504/IJCNDS.2018.10013893
Donald Elmazi, Makoto Ikeda, L. Barolli
{"title":"Implementation and performance evaluation of an intelligent fuzzy-based testbed for WSANs: a case study for object tracking","authors":"Donald Elmazi, Makoto Ikeda, L. Barolli","doi":"10.1504/IJCNDS.2018.10013893","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10013893","url":null,"abstract":"Wireless sensor and actor networks (WSANs) have emerged as a variation of wireless sensor networks. WSANs are capable of monitoring physical phenomenons, processing sensed data, making decisions based on the sensed data and completing appropriate tasks when needed. In this paper, we propose an intelligent fuzzy-based testbed that based on data provided by sensors and actors selects an appropriate actor node. From the evaluation results, the system selects the actors in order to have low latency and proper task assignment considering multi actors for different job types.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123554777","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
Simple algorithms for selecting an energy-efficient server in a cluster of servers 在服务器集群中选择节能服务器的简单算法
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-07-27 DOI: 10.1504/IJCNDS.2018.10013878
Dilawaer Duolikun, Hiroki Kataoka, T. Enokido, M. Takizawa
{"title":"Simple algorithms for selecting an energy-efficient server in a cluster of servers","authors":"Dilawaer Duolikun, Hiroki Kataoka, T. Enokido, M. Takizawa","doi":"10.1504/IJCNDS.2018.10013878","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10013878","url":null,"abstract":"Electric energy consumed by computers, especially servers in scalable clusters has to be reduced to realise eco society. In this paper, we first propose a multi-level power consumption (MLPCM) model which gives how much electric power a server consumes to perform application processes. We also propose an multi-level computation (MLCM) model which shows the expected execution time of an application process performed on a server. By using the MLPCM and MLCM models, we propose a pair of simple locally energy-aware (SLEA) and simple globally energy-aware (SGEA) algorithms to select a host server to perform an application process issued by a client. In the SLEA algorithm, a host server is selected, which is expected to consume the minimum electric energy to perform the process. In the SGEA algorithm, a host server is selected, where the total expected electric energy consumption of not only the host server but also the other servers is minimum. In the evaluation, we show the total electric energy consumption and active time of servers and the average execution time of processes can be reduced in the SGEA algorithm compared with other algorithms.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116549936","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}
引用次数: 18
Performance efficiency of a predictive scheme into publish/subscribe 将预测模式转换为发布/订阅的性能效率
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-07-27 DOI: 10.1504/IJCNDS.2018.10013896
F. Abdennadher, M. B. Jemaa
{"title":"Performance efficiency of a predictive scheme into publish/subscribe","authors":"F. Abdennadher, M. B. Jemaa","doi":"10.1504/IJCNDS.2018.10013896","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10013896","url":null,"abstract":"Nowadays, the importance of mobility into publish/subscribe systems has increased due to the increased number of applications into handheld devices. For offering the best service to mobile subscribers, mobility management is very much necessary. Previous mobility management schemes suffer from an increase in the transfer delay, message loss and network load. In this paper a predictive mobility management scheme has been proposed to overcome these problems. The proposed scheme selects the most probable candidate's brokers for being the caching points. This selection is based on the probabilities of movements higher than the threshold value. The proposed scheme and previous proactive scheme have been compared through set experiments. Performance comparison shows that our approach performs better than previous works in terms of messages loss, network load and transfer delay under distinct factors such as frequency of movements, period of disconnection and publication rate.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126278836","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
Adaptive jitter buffer management: a game theoretic approach 自适应抖动缓冲管理:一种博弈论方法
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-07-27 DOI: 10.1504/IJCNDS.2018.10011127
P. Chandran, Chelpa Lingam
{"title":"Adaptive jitter buffer management: a game theoretic approach","authors":"P. Chandran, Chelpa Lingam","doi":"10.1504/IJCNDS.2018.10011127","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10011127","url":null,"abstract":"Network impairments like delay and jitter significantly affect the quality of voice over internet protocol (VoIP) calls. The main challenge is the synchronous playout of voice packets at the receiver side in face of varying jitter. This is typically solved using a jitter buffer so that the playout time of received packets can be delayed to accommodate late packets. In this paper, we propose a game theoretic approach to solve the trade-off between additional buffer delay and buffer scaling. We formulate the model as a zero-sum game between players, i.e., the playout scheduler and buffer manager, to adaptively adjust buffer size according to the buffer delay of the packets and is solved using uncertainty principle of game theory. Experimental results show that the proposed model allocates optimal buffer space with lowest late loss rate when compared with other algorithms.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124282301","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
Secure multipath routing for multimedia communication in cognitive radio networks 认知无线网络中多媒体通信的安全多径路由
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-07-27 DOI: 10.1504/IJCNDS.2018.10013879
Ansuman Bhattacharya, Sasthi C. Ghosh, K. Sinha, B. Sinha
{"title":"Secure multipath routing for multimedia communication in cognitive radio networks","authors":"Ansuman Bhattacharya, Sasthi C. Ghosh, K. Sinha, B. Sinha","doi":"10.1504/IJCNDS.2018.10013879","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10013879","url":null,"abstract":"In this paper, a novel technique for secure multihop communication in cognitive radio networks is proposed which allows the use of non-contiguous channels for communication of multimedia data without compromising the desired QoS. This technique first creates a number of sub-packets formed by suitably shuffling the bits of the original packet, finds multiple routes by executing the max-flow algorithm on a derivative of the network graph to meet the required bandwidth, suitably allocates channels for each hop in the multiple paths using the features of cognitive radio networks, and sends the sub-packets along these channels which are received by the destination node to form the original packet. This strategy also leads to significantly enhanced security of the data packets against the eavesdropping attack when multiple node-disjoint paths are chosen for transmitting the sub-packets.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121809009","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
Energy efficient with time synchronised and service coverage guarantee in wireless sensor networks 无线传感器网络节能、时间同步和服务覆盖保证
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-07-27 DOI: 10.1504/IJCNDS.2018.10013880
Chirihane Gherbi, Z. Aliouat, M. Benmohammed
{"title":"Energy efficient with time synchronised and service coverage guarantee in wireless sensor networks","authors":"Chirihane Gherbi, Z. Aliouat, M. Benmohammed","doi":"10.1504/IJCNDS.2018.10013880","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10013880","url":null,"abstract":"In this paper, a novel hierarchical approach called distributed energy efficient adaptive clustering protocol with data gathering, load-balancing and self-adaptation (ACP) is proposed for wireless sensor network. We have proposed (ACP) approach to reach the following objectives: reduce the overall network energy consumption, balance the energy consumption among the sensors and extend the lifetime of the network, the clustering must be completely distributed, the clustering should be efficient in complexity of message and time, the cluster-heads should be well-distributed across the network, the load balancing should be done well, the clustered WSN should be fully-connected. We consider the problem of conserving energy by turning off the node's radio for periods of a fixed time length. As a result transmission power of the node is reduced, which subsequently reduce the energy consumption of the node. Our proposed work is simulated through network simulator (NS-2). Simulations show that (ACP) clusters have good performance characteristics.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"744 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132651932","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
E-ABRM: enhanced ABRM routing protocol for MSNs with multiple mobile sinks E-ABRM:针对具有多个移动sink的msn的增强型ABRM路由协议
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-06-07 DOI: 10.1504/IJCNDS.2018.10013191
Maged S. Soliman, H. Fahmy
{"title":"E-ABRM: enhanced ABRM routing protocol for MSNs with multiple mobile sinks","authors":"Maged S. Soliman, H. Fahmy","doi":"10.1504/IJCNDS.2018.10013191","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10013191","url":null,"abstract":"The recent technological advances in the field of wireless sensor networks (WSNs) have expanded the range of WSN applications. In some of these applications, sensor nodes are mobile rather than static. Also, the recent advances in personal digital assistants (PDAs) allow the existence of multiple mobile sinks to collect the sensors data. These characteristics require the design of new routing protocols to meet the existence of mobile sensors and multiple mobile sinks while taking into consideration the limited resources for sensor nodes especially the energy. In-network aggregation is one of the important techniques used to save power consumption by aggregating the data on sensor nodes before transmitting towards the sinks and hence reduce the number of transmissions required. ABRM, as previously proposed, is an aggregation based routing protocol for mobile sensor networks (MSNs) with multiple mobile sinks. This paper proposes enhanced ABRM (E-ABRM) to improve the aggregation results and reduce the routing overhead and power consumption. E-ABRM is compared to ABRM and CCBR through mathematical analysis and simulation results. The comparisons show that E-ABRM reduces aggregation error, routing overhead, and energy consumption.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132829279","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
Data anonymisation of vertically partitioned data using Map Reduce techniques on cloud 利用mapreduce技术实现云上垂直分区数据的匿名化
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-06-07 DOI: 10.1504/IJCNDS.2018.10013192
Thangaramya Kalidoss, S. Ganapathy, S. Lakshmanan, K. Kulothungan, A. Kannan
{"title":"Data anonymisation of vertically partitioned data using Map Reduce techniques on cloud","authors":"Thangaramya Kalidoss, S. Ganapathy, S. Lakshmanan, K. Kulothungan, A. Kannan","doi":"10.1504/IJCNDS.2018.10013192","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10013192","url":null,"abstract":"Data anonymisation in cloud is used for enhancing the security which is effectively implemented using vertical fragmentation along with encryption and compression techniques. In the existing cloud databases, distributed storage and processing of data are performed by applying fragmentation and search techniques. In order to improve the performance of distributed access plans, Map Reduce techniques can be used which provide fast search and retrieval. Hence, a new distributed security processing mechanism is proposed in this paper to enhance the security of cloud networks which consists of two phases namely encryption and verification phases. For this purpose, a new triple advanced encryption standard algorithm is proposed in this paper that performs secured key distribution based on verification using secured hash algorithm. Moreover, this work uses Map Reduce techniques for fast processing. Experimental results of this work show that our approach provides higher security and effective storage over the existing approaches.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123821683","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术官方微信