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

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

筛选
英文 中文
Intelligence in wireless network routing through reinforcement learning 通过强化学习的无线网络路由智能
Int. J. Commun. Networks Distributed Syst. Pub Date : 2019-05-29 DOI: 10.1504/IJCNDS.2019.10021600
S. Simi, M. Ramesh
{"title":"Intelligence in wireless network routing through reinforcement learning","authors":"S. Simi, M. Ramesh","doi":"10.1504/IJCNDS.2019.10021600","DOIUrl":"https://doi.org/10.1504/IJCNDS.2019.10021600","url":null,"abstract":"One of the critical challenges in mobile wireless network is resource optimised routing of messages without compromising the performance criteria of the network. Routing in wireless networks has been extensively studied and a variety of routing protocols have been proposed. But these protocols experiences problems due to the dynamism in network topology. To address these problems, reinforcement learning approaches are integrated in routing solutions. This review focuses on the impact of reinforcement learning algorithms to achieve intelligence in wireless network routing. We provide contexts and benefits of applying reinforcement learning paradigm and discuss the major techniques applied to optimise routing solutions. A survey of state of the art reinforcement learning-based routing protocols is presented and categorised these protocols according to the learning strategies. We also provide open issues and suggestions for future research in improving routing solutions.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133157442","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
Service composition approaches for internet of things: a review 物联网服务组合方法综述
Int. J. Commun. Networks Distributed Syst. Pub Date : 2019-05-29 DOI: 10.1504/IJCNDS.2019.10017271
Idir Aoudia, Saber Benharzallah, L. Kahloul, O. Kazar
{"title":"Service composition approaches for internet of things: a review","authors":"Idir Aoudia, Saber Benharzallah, L. Kahloul, O. Kazar","doi":"10.1504/IJCNDS.2019.10017271","DOIUrl":"https://doi.org/10.1504/IJCNDS.2019.10017271","url":null,"abstract":"The internet of things (IoT) is the integration of information space and physical space, becoming more and more popular in several places. In order to answer the complicated user request, most IoT devices do not work alone, a multiple service composition must be made, and it is defined as the services composition. A number of approaches to IoT's service composition have been proposed in the literature. We have noticed a lack of studies that review the different works of the service composition in IoT. Thereby, in this paper, we present a review of existing approaches for service composition in IoT. It describes and compares them among each other with respect to some criteria, which we have defined based on the different challenges of service composition in IoT. Finally, we conclude by discussing open research issues and avenues for further work.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121846323","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}
引用次数: 21
Interference aware frequency assignment and association control for uplink and downlink traffic in WLAN 无线局域网上下行业务的干扰感知频率分配与关联控制
Int. J. Commun. Networks Distributed Syst. Pub Date : 2019-05-29 DOI: 10.1504/IJCNDS.2019.10021599
Babul P. Tewari, Sasthi C. Ghosh
{"title":"Interference aware frequency assignment and association control for uplink and downlink traffic in WLAN","authors":"Babul P. Tewari, Sasthi C. Ghosh","doi":"10.1504/IJCNDS.2019.10021599","DOIUrl":"https://doi.org/10.1504/IJCNDS.2019.10021599","url":null,"abstract":"In IEEE 802.11 wireless local area network, interference management and association control play a significant role to determine the network performance. The problem of interference management becomes more challenging in simultaneous presence of uplink and downlink communication traffic. This paper addresses the issue of interference not only from the perspective of access points but also from the perspective of clients considering a mixed traffic. We first define several types of transmission conflicts influenced by different communication traffic and based on that we model effective interference. Importance of such effective interference has been described through a motivational example. We then propose an efficient greedy algorithm that jointly considers association control and frequency assignment to avoid the effective interference for maximising the aggregate throughput. The novelty of the proposed approach is evaluated through extensive simulations. We also have shown that the proposed algorithm gives comparable results with other existing approaches.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134107488","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
Task allocation-based modified bacterial foraging algorithm for maximising reliability of a heterogeneous distributed system 基于任务分配的异构分布式系统可靠性最大化改进细菌觅食算法
Int. J. Commun. Networks Distributed Syst. Pub Date : 2019-05-29 DOI: 10.1504/IJCNDS.2019.10013812
Farid Abbache, Hamoudi Kalla
{"title":"Task allocation-based modified bacterial foraging algorithm for maximising reliability of a heterogeneous distributed system","authors":"Farid Abbache, Hamoudi Kalla","doi":"10.1504/IJCNDS.2019.10013812","DOIUrl":"https://doi.org/10.1504/IJCNDS.2019.10013812","url":null,"abstract":"modified bacterial foraging algorithm for allocation and scheduling tasks on processors and links with high reliability is proposed (MBFA). MBFA ensure high reliability without redundancy of processors or links by using an efficient and simple structure. MBFA is improved by adding an efficient model to deal with the weak solution (i.e., allocation with low reliability). Also a simulated annealing technique is integrated into MBFA in order to strengthen the search of best solution. The efficiency and effectiveness of MBFA are tested using random generated problems. MBFA is tested over the published approaches HPSO and GAA using density parameter (DS), number of nodes (N) and the communication to computation ratio parameter (CCR). The results show the superiority of MBFA over the published approaches in all test cases.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132578205","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
A multi-agent system approach for service deployment in the cloud 用于在云中部署服务的多代理系统方法
Int. J. Commun. Networks Distributed Syst. Pub Date : 2019-05-07 DOI: 10.1504/IJCNDS.2019.10021073
Abdelhak Merizig, O. Kazar, M. López-Sánchez
{"title":"A multi-agent system approach for service deployment in the cloud","authors":"Abdelhak Merizig, O. Kazar, M. López-Sánchez","doi":"10.1504/IJCNDS.2019.10021073","DOIUrl":"https://doi.org/10.1504/IJCNDS.2019.10021073","url":null,"abstract":"Nowadays, cloud computing is regarded as a new paradigm in the field of information technology. Since the emergence of this paradigm, most of corporations have started using it through the deployment or the use of its services. Furthermore, service deployment in the cloud forms its kernel function. To ensure a good function of service deployment we need to combine a set of services. In fact, to find a limited number candidate services constitutes a problem due to the absence of a unified service description. In this paper, we propose a solution to solve the deployment problem by considering it as a service composition taking into account the quality of service. Since we have many atomic services, this paper transforms this composition problem into an optimisation problem. Moreover, to reduce the number of service candidates we propose a new service description language to assist the discovery process. The implementation of this model has been provided in order to evaluate our system. The obtained results demonstrate the effectiveness of our proposed system.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116529263","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
Geographic opportunistic routing protocol based on two-hop information for wireless sensor networks 基于两跳信息的无线传感器网络地理机会路由协议
Int. J. Commun. Networks Distributed Syst. Pub Date : 2019-05-07 DOI: 10.1504/IJCNDS.2019.10021074
Venkatesh, L. A. Achar, P. Kushal, K. Venugopal
{"title":"Geographic opportunistic routing protocol based on two-hop information for wireless sensor networks","authors":"Venkatesh, L. A. Achar, P. Kushal, K. Venugopal","doi":"10.1504/IJCNDS.2019.10021074","DOIUrl":"https://doi.org/10.1504/IJCNDS.2019.10021074","url":null,"abstract":"To improve energy efficiency and packet delivery ratio in WSNs. We propose a two-hop geographic opportunistic routing (THGOR) protocol that selects a subset of 2-hop neighbours of node which have higher packet reception ratio and residual energy as the next forwarder node, it also selects 1-hop neighbours that have excellent coverage of 2-hop neighbours as relay nodes. The proposed protocol is compared with geographic opportunistic routing (GOR) and efficient QoS-aware geographic opportunistic (EQGOR). GOR and EQGOR select a forwarding sensor node on the basis of distance. However, GOR and EQGOR results in lower packet delivery rate, and quick depletion of energy. The THGOR is comprehensively evaluated through NS-2 and compared results with EQGOR and GOR. Simulation results show that THGOR significant improvement in packet advancement, reliable transmission, energy efficiency and optimises packet transmission delay.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115321324","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
Graph-based analysis of cloud connectivity at the internet protocol level 在互联网协议级别对云连接进行基于图的分析
Int. J. Commun. Networks Distributed Syst. Pub Date : 2019-05-07 DOI: 10.1504/IJCNDS.2019.10021075
Sebastian Dombrowski, Tatiana Ermakova, Benjamin Fabian
{"title":"Graph-based analysis of cloud connectivity at the internet protocol level","authors":"Sebastian Dombrowski, Tatiana Ermakova, Benjamin Fabian","doi":"10.1504/IJCNDS.2019.10021075","DOIUrl":"https://doi.org/10.1504/IJCNDS.2019.10021075","url":null,"abstract":"Internet connectivity of cloud services is of exceptional importance for both their providers and consumers. This article demonstrates the outlines of a method for measuring cloud-service connectivity at the internet protocol level from a client's perspective. For this, we actively collect connectivity data via traceroute measurements from PlanetLab to several major cloud services. Furthermore, we construct graph models from the collected data, and analyse the connectivity of the services based on important graph-based measures. Then, random and targeted node removal attacks are simulated, and the corresponding vulnerability of cloud services is evaluated. Our results indicate that cloud service hosts are, on average, much better connected than average hosts. However, when interconnecting nodes are removed in a targeted manner, cloud connectivity is dramatically reduced.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128825040","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
Performance evaluation of various link quality metrics using cross layer routing for wireless multimedia sensor networks 无线多媒体传感器网络中使用跨层路由的各种链路质量指标的性能评估
Int. J. Commun. Networks Distributed Syst. Pub Date : 2019-05-07 DOI: 10.1504/IJCNDS.2019.10021070
S. Aswale, V. Ghorpade
{"title":"Performance evaluation of various link quality metrics using cross layer routing for wireless multimedia sensor networks","authors":"S. Aswale, V. Ghorpade","doi":"10.1504/IJCNDS.2019.10021070","DOIUrl":"https://doi.org/10.1504/IJCNDS.2019.10021070","url":null,"abstract":"For the past few years, link quality estimation has been an active area of research in wireless networks. Low-power wireless links are error-prone, asymmetric and unreliable in nature. Therefore, understanding the behaviour and characteristics of low-power radio links is essential to design effective and efficient routing protocol in wireless networks. The objective of this paper is to estimate and evaluate the quality of a link with single link quality metric and amalgamated link quality metric. In addition, these estimated link quality metrics are respectively used in a generic routing cost function of the proposed link quality-based cross layer routing (LQCLR) protocol. Extensive simulation results are presented, which give insights on how estimated link quality with single and amalgamated link quality metrics affects the performance of routing protocol in wireless multimedia sensor network (WMSN).","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132515572","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
A novel approach to improve handover performance 一种改进切换性能的新方法
Int. J. Commun. Networks Distributed Syst. Pub Date : 2019-05-07 DOI: 10.1504/IJCNDS.2019.10021072
Jyoti Verma, Sunanda Gupta, Pratima Manhas, Vasudha Arora
{"title":"A novel approach to improve handover performance","authors":"Jyoti Verma, Sunanda Gupta, Pratima Manhas, Vasudha Arora","doi":"10.1504/IJCNDS.2019.10021072","DOIUrl":"https://doi.org/10.1504/IJCNDS.2019.10021072","url":null,"abstract":"Nowadays, mobile communications have heterogeneous wireless networks offering variable coverage and quality of service (QoS). The availability of alternatives generates a problem of occurrence of unnecessary handoff that results in wastage of network resources. In order to maintain seamless mobility, service continuity and optimise usage of network resources, it is desirable to minimise handover failures and unnecessary handovers. In this paper, a handover necessity estimation algorithm is introduced. This algorithm is made up of two modules. The first module estimates handoff necessity. It involves received signal strength (RSS) prediction, travelling distance estimation and velocity estimation. In a second module, candidate networks are discovered from the available networks. Based upon the predicted future values of RSS and travelling distance inside the wireless local area network (WLAN), the proposed algorithm improves the probability of unnecessary handoff and handover failures.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121108375","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
Reinforcement learning-based real time search algorithm for routing optimisation in wireless sensor networks using fuzzy link cost estimation 基于模糊链路代价估计的无线传感器网络路由优化强化学习实时搜索算法
Int. J. Commun. Networks Distributed Syst. Pub Date : 2019-03-28 DOI: 10.1504/IJCNDS.2019.10020185
Kuldeep Singh, J. Malhotra
{"title":"Reinforcement learning-based real time search algorithm for routing optimisation in wireless sensor networks using fuzzy link cost estimation","authors":"Kuldeep Singh, J. Malhotra","doi":"10.1504/IJCNDS.2019.10020185","DOIUrl":"https://doi.org/10.1504/IJCNDS.2019.10020185","url":null,"abstract":"Internet of things is a technological advancement of wireless sensor networks (WSNs) which are characterised by highly complex, large scale, heterogeneous, dynamically changing and asymmetric networks. Such constraints make routing in WSNs a difficult task. This paper introduces fuzzy link cost estimation-based real time search routing algorithm (fuzzy RTS) in which link cost estimation is obtained from physical and MAC layer parameters like residual energy, packet drop rate and RSSI. Its performance has been evaluated with traditional reinforcement learning-based algorithms like real time search, adaptive tree, ant routing and constrained flooding algorithms on the basis of metrics like throughput, loss rate, success rate, energy consumption, energy efficiency and node battery life. The simulation results reveal that fuzzy RTS algorithm is most appropriate reinforcement learning-based routing algorithm among given algorithms for ensuring energy efficient and QoS aware routing in dynamically changing, asymmetric and unreliable environment of WSNs.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124866580","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
首页 上一页 下一页 尾页
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学术官方微信