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

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

筛选
英文 中文
Distributed compressed sensing multi-target positioning method based on wavelet transform 基于小波变换的分布式压缩感知多目标定位方法
Int. J. Commun. Networks Distributed Syst. Pub Date : 2021-01-25 DOI: 10.1504/ijcnds.2021.10033229
Wei Wang, Xuqi Wang, Zhenzheng Liu, Yuangang Zhang, Fangyuan He
{"title":"Distributed compressed sensing multi-target positioning method based on wavelet transform","authors":"Wei Wang, Xuqi Wang, Zhenzheng Liu, Yuangang Zhang, Fangyuan He","doi":"10.1504/ijcnds.2021.10033229","DOIUrl":"https://doi.org/10.1504/ijcnds.2021.10033229","url":null,"abstract":"In the environment of coal mine underground tunnel, it is difficult to establish a unified electromagnetic propagation model because of the factors that multi-path effect and electromagnetic wave propagation loss are numerous and complicated, in addition, the trilateral positioning of electromagnetic wave ranging is very demanding on the hardware system. In order to solve the problems, a multi-target positioning method of distributed compressed sensing based on wavelet transform is proposed, which is on the basis of researching the low power consumption and lightweight design of underground tunnel hardware. The method makes full use of the spatial correlation information of the nodes in the tunnel and transforms the target positioning problem into a joint recovery problem of signal group data. The target positions can be achieved through a non-cooperative manner and a small number of sample values, which effectively reduces the additional energy consumption caused by the exchange of data between nodes. The simulation results show that the proposed method satisfies the application of underground hardware nodes in an energy efficient way.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127823781","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
Gateway Controller with Deep Sensing: Learning to be Autonomic in Intelligent Internet of Things 具有深度感知的网关控制器:在智能物联网中学习自治
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-09-18 DOI: 10.1504/ijcnds.2021.10031028
R. Rahmani, Ramin Firouzi
{"title":"Gateway Controller with Deep Sensing: Learning to be Autonomic in Intelligent Internet of Things","authors":"R. Rahmani, Ramin Firouzi","doi":"10.1504/ijcnds.2021.10031028","DOIUrl":"https://doi.org/10.1504/ijcnds.2021.10031028","url":null,"abstract":"The Internet of Things(IoT) will revolutionize the Future Internet through ubiquitous sensing. One of the challenges of having the hundreds of billions of devices that are estimated to be deployed would be rise of an enormous amount of data, along with the devices ability to manage. This paper presents an approach as a controller solution and designed specifically for autonomous management, connectivity and data interoperability in an IoT gateway. The approach supports distributed IoT nodes with both management and data interoperability with other cloud-based solutions. The concept further allows gateways to easily collect and process interoperability of data from IoT devices. We demonstrated the feasibility of the approach and evaluate its advantages regarding deep sensing and autonomous enabled gateway as an edge computational intelligence.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130267261","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 naive time of flight ranging scheme for wireless sensor networks 一种朴素的无线传感器网络飞行时间测距方案
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-05-08 DOI: 10.1504/ijcnds.2020.10028908
A. Baba, Fan Wu, Tanvir Ahmed
{"title":"A naive time of flight ranging scheme for wireless sensor networks","authors":"A. Baba, Fan Wu, Tanvir Ahmed","doi":"10.1504/ijcnds.2020.10028908","DOIUrl":"https://doi.org/10.1504/ijcnds.2020.10028908","url":null,"abstract":"Recently wireless sensor network (WSN) applications have been in high demand. The key aspects of these applications is 'localisation'. Due to low energy and limited processing capability, many sensor nodes do not have any knowledge about their location, thus requires a method to get localised within a network. Nodes can be localised based on the measurements estimated using different techniques. In this paper, a naive time of flight (ToF) ranging measurement scheme is presented which minimises the error coming from low resolution clocks of the deployed nodes and removes the effect of clock drift on ranging measurements. The proposed scheme uses inter-arrival time of multiple ranging requests on the receiver side and uses solely the receiver node's clock to calculate the time of flight. The accuracy achieved with the proposed method is better than other existing approaches. The results demonstrate that the proposed scheme achieved the accuracy within 1m.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132454254","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
Selective-path clustered-based routing protocol for large scale wireless sensor networks 大规模无线传感器网络的选择路径聚类路由协议
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-05-05 DOI: 10.1504/ijcnds.2020.10028905
O. Ogundile, M. Oloyede, O. Osanaiye, E. Falayi, A. A. Okusanya
{"title":"Selective-path clustered-based routing protocol for large scale wireless sensor networks","authors":"O. Ogundile, M. Oloyede, O. Osanaiye, E. Falayi, A. A. Okusanya","doi":"10.1504/ijcnds.2020.10028905","DOIUrl":"https://doi.org/10.1504/ijcnds.2020.10028905","url":null,"abstract":"Wireless sensor networks (WSNs) consist of large number of small low-powered electronic sensor devices. Therefore, reliable power saving schemes must be developed in order to manage the energy dissipated and extend the network life and functionality for a meaningful time. Arranging sensor nodes (SNs) into clusters has been viewed as an efficient approach of balancing the energy dissipated in WSNs. Regardless, a clustered WSN needs a robust energy efficient (EE) and energy balanced (EB) routing communication protocol. This paper proposes a selective-path priority table (SPT) EE and EB routing protocol (RP) ideal for most conventional clustering algorithms. The SPT RP forms the priority table by prioritising the k nearest multi-hop paths to the cluster heads (CHs) and/or base station (BS) based on some robust rules. These rules are compiled using a combination of some routing metrics which include the residual energy (RE) and transmission range/power. Firstly, the simulation results indicate that the SPT RP can be combined with most of the conventional clustering algorithm irrespective of the number of deployed SNs. Secondly, the performance of the SPT RP improves as the value of the selected number of routing paths (k) increase. More so, the simulation results show that the SPT RP reduces the energy dissipated and can prolong the network life and throughput as compared to related routing schemes.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115368539","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
Fast SDN updates using tree-based architecture 快速SDN更新使用基于树的架构
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-05-05 DOI: 10.1504/ijcnds.2020.10028906
R. Hatami, H. Bahramgiri
{"title":"Fast SDN updates using tree-based architecture","authors":"R. Hatami, H. Bahramgiri","doi":"10.1504/ijcnds.2020.10028906","DOIUrl":"https://doi.org/10.1504/ijcnds.2020.10028906","url":null,"abstract":"Network updates and configurations in software-defined networking (SDN) are critical and occur frequently. The effectiveness of many systems depends on the speed of adaption to their current workload and updates. Slower updates would reduce network utilisation because during a longer period it can lead to congestion and packet loss. Hence, quickly updating is a challenge in SDN architecture. In this paper, we propose a practical method for implementing a system for fast updates, using tree-based architecture. It can be used to implement the inserting, deleting and modifying rules on the flow-table quickly, and achieves a reduction in the update time. Experimental results show that our design can improve the median update speed.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115081924","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
Multi-level data fusion algorithm towards privacy protection in wireless sensor networks 面向无线传感器网络隐私保护的多级数据融合算法
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-05-05 DOI: 10.1504/ijcnds.2020.10028909
Xiaojun Yu, Wenjun Zhou, Liang Li, D. Wu, Chen Ao, Zheng Wang
{"title":"Multi-level data fusion algorithm towards privacy protection in wireless sensor networks","authors":"Xiaojun Yu, Wenjun Zhou, Liang Li, D. Wu, Chen Ao, Zheng Wang","doi":"10.1504/ijcnds.2020.10028909","DOIUrl":"https://doi.org/10.1504/ijcnds.2020.10028909","url":null,"abstract":"Data fusion is one of the key technologies in wireless sensor networks. To promote secure and efficient data fusion for wireless sensor networks, a privacy protection-based multi-level data fusion algorithm is proposed. In order to minimise the network energy consumption, the optimal number of cluster heads is selected and the adaptive clustering is performed according to the node energy and the positional relationship between nodes. Then, the cluster members collect and encrypt data, whereas the cluster head cleans and integrates the encrypted data. Furthermore, by analysing the correlation between data and constructing the BP neural network, cluster heads and the sink node can fuse the data in a cluster and the data between clusters to achieve the optimal data fusion. Results show that the mechanism proposed in this paper can significantly reduce resource overheads, effectively guarantee data security and fusion efficiency.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121646648","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
Analysis of spectrum handoff delay using finite queuing model in cognitive radio networks 基于有限排队模型的认知无线电网络频谱切换延迟分析
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-05-05 DOI: 10.1504/ijcnds.2020.10023989
Shashank Shekhar, S. Hoque, W. Arif
{"title":"Analysis of spectrum handoff delay using finite queuing model in cognitive radio networks","authors":"Shashank Shekhar, S. Hoque, W. Arif","doi":"10.1504/ijcnds.2020.10023989","DOIUrl":"https://doi.org/10.1504/ijcnds.2020.10023989","url":null,"abstract":"Spectrum handoff is an inevitable phenomenon to exploit dynamic spectrum access in cognitive radio networks (CRNs) for better spectrum utilisation. When a licensed or primary user reclaims its operating channel, the cognitive user has to initiate a suitable handoff procedure for successful completion of its ongoing transmission. This paper analyses the prioritised proactive spectrum handoff decision for a finite capacity cognitive radio network using preemptive resume priority (PRP) M/G/1/K queuing model. Cumulative handoff delay (CHD) and total service time (TST) are taken to investigate the performance of the handoff strategies. We establish an analytical model of cumulative handoff delay and total service time of proactive switching spectrum handoff for the proposed finite length queuing network. The impact of queue length on performance measuring metrics such as CHD and TST in terms of arrival rate of primary users and mobility factor of spectrum holes are presented extensively.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127118436","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
Joint user scheduling and power allocation in two-tier heterogeneous networks 两层异构网络中的联合用户调度与功率分配
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-05-03 DOI: 10.1504/ijcnds.2020.10024450
Xin Song, Lei Qin, Haijun Qian, Y. Ni, Zhigang Xie
{"title":"Joint user scheduling and power allocation in two-tier heterogeneous networks","authors":"Xin Song, Lei Qin, Haijun Qian, Y. Ni, Zhigang Xie","doi":"10.1504/ijcnds.2020.10024450","DOIUrl":"https://doi.org/10.1504/ijcnds.2020.10024450","url":null,"abstract":"An appropriate scheme is proposed based on QoE and energy consumption in this paper for the fact that the impact of imbalanced loading on resource availability cannot be neglected, which jointly optimises user scheduling and power allocation. In this proposed scheme, the bias factor is optimised to balance the fairness for users' distribution and system resource allocation. A new dynamic linear user scheduling algorithm based on bias programming is presented, in which the negative and the positive bias factors are both considered that are optimised by iterative method to achieve load balancing. Then QoE models of different types of services are built to allocate resource, in which Boolean type dual iterative algorithm is applied to obtain the globally optimal solution. The time and space complexity for the proposed two algorithms are analysed. Simulation results demonstrate the effectiveness and stability of the proposed approaches.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126888781","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
QoS and traffic aware greedy resource allocation in foggy internet of things 雾蒙蒙物联网中QoS与流量感知的贪婪资源分配
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-05-01 DOI: 10.1504/IJCNDS.2020.10022190
Hamidreza Mahini, Reza Hajisheykhi, Mina Shahini
{"title":"QoS and traffic aware greedy resource allocation in foggy internet of things","authors":"Hamidreza Mahini, Reza Hajisheykhi, Mina Shahini","doi":"10.1504/IJCNDS.2020.10022190","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10022190","url":null,"abstract":"Fog computing is a response to the increasing growth of data generated by the internet of things (IoT) applications developed in the cloud computing platform. It is a solution to materialise the IoT and helps to improve the resource allocation problem. In this paper, we propose an effective method to conquer the resource allocation problem in IoT applications. Our method defines two important objectives: 1) reducing the internet core traffic; 2) serving subscribers with the appropriate quality of service level. The experimental results, which are reported in form of numerous and various scenarios, indicate that the suggested MMGM method can reduce the internet core traffic up to 50%. Also, the minimum deviation from the required or the contracted quality level of service is realised with the help of the Most Graceful Matching (MGM) assignment method.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126999895","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
Cryptosystem by a community of devices with limited resources 一个由有限资源的设备组成的社区的密码系统
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-05-01 DOI: 10.1504/IJCNDS.2020.10021742
Rebiha Hadaoui, K. Tamine, M. Daoui, M. Lalam
{"title":"Cryptosystem by a community of devices with limited resources","authors":"Rebiha Hadaoui, K. Tamine, M. Daoui, M. Lalam","doi":"10.1504/IJCNDS.2020.10021742","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10021742","url":null,"abstract":"Rivest-Shamir-Adleman (RSA) is an encryption algorithm with public-key and is the most widely used for secure data transmission. It provides high safety and consists of modular exponential operation on large numbers. We propose an original approach which makes a distributed calculation of RSA encryption by a community of users endowed with low resources equipment. When a user u of the community wants to encrypte a data X, he exploits the resources of his community. For that, we replace the modular exponentiation operation by a set of calculations dependent of each other and which use fewer resources. These calculations are spread over the members of the user's community to help him perform the operation.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116227826","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
下一页 尾页
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学术官方微信