Pub Date : 2020-02-07DOI: 10.1504/ijims.2020.105027
Monika Yadav, A. Mishra, B. Balusamy
In cloud computing, distributed resources are used on demand basis without having the physical infrastructure at the client end. Cloud has a large number of users and to deal with large number of task, so scheduling in cloud plays a vital role for task execution. Scheduling of various multitask jobs on clouds is considered as an NP-hard problem (Horng and Lin, 2017). In order to reduce the large scheduling search space, an iterative ordinal optimisation (IOO) method has already proposed. In this paper, a set of 30 candidate schedules denoted by set U are created. The set U is used in the exhaustive search of the best schedule. After analysing the set U, an ordered schedule vs. makespan graph is plotted. So in this work, set U is defined and created a base for applying IOO method to get optimal schedules. In this work, CloudSim version 3.0 has been used to test and analyse policies.
在云计算中，分布式资源按需使用，客户端不需要物理基础设施。云拥有大量的用户和处理大量的任务，因此云中的调度对任务的执行起着至关重要的作用。云上各种多任务作业的调度被认为是NP-hard问题(hong and Lin, 2017)。为了减小调度搜索空间，提出了一种迭代有序优化方法。本文创建了一个30个候选调度的集合，用集合U表示。集合U用于穷举搜索最优调度。在分析了集合U之后，绘制了有序的进度与完工时间图。因此，本文定义了集合U，并为应用IOO方法获得最优调度创建了基础。在这项工作中，使用了CloudSim 3.0版本来测试和分析策略。
{"title":"Design of candidate schedules for applying iterative ordinal optimisation for scheduling technique on cloud computing platform","authors":"Monika Yadav, A. Mishra, B. Balusamy","doi":"10.1504/ijims.2020.105027","DOIUrl":"https://doi.org/10.1504/ijims.2020.105027","url":null,"abstract":"In cloud computing, distributed resources are used on demand basis without having the physical infrastructure at the client end. Cloud has a large number of users and to deal with large number of task, so scheduling in cloud plays a vital role for task execution. Scheduling of various multitask jobs on clouds is considered as an NP-hard problem (Horng and Lin, 2017). In order to reduce the large scheduling search space, an iterative ordinal optimisation (IOO) method has already proposed. In this paper, a set of 30 candidate schedules denoted by set U are created. The set U is used in the exhaustive search of the best schedule. After analysing the set U, an ordered schedule vs. makespan graph is plotted. So in this work, set U is defined and created a base for applying IOO method to get optimal schedules. In this work, CloudSim version 3.0 has been used to test and analyse policies.","PeriodicalId":39293,"journal":{"name":"International Journal of Internet Manufacturing and Services","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/ijims.2020.105027","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48824084","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}
Pub Date : 2020-02-07DOI: 10.1504/ijims.2020.105037
Lei Ma, Ying-jian Kang, Hua Han, Gihong Min
In current virus propagation defence methods, immunisation failures, as well as combination influence of infectious vector and propagation delay in propagation are not considered. Therefore, propagation of computer singularity virus is hard to control. A new SIS propagation model is proposed based on mean field theory with infectious vector and propagation delay. The influence of computer virus in complex sensor networks on the propagation property is analysed. A new cellular automata model is built to simulate computer virus propagation. With abstraction layer from computer singularity virus detection model based on immunisation principle, a fusion method for singularity virus detection is proposed. Through fusion of different antigen presentation gene library, ability of defence of computer singularity virus propagation is improved. Experimental results show that target immune network connectivity factor ratio of our method is only 0.18, lower than 0.37 multiples of nearest neighbour immunity.
{"title":"Research on virus diffusion prevention method for computer singularity in complex sensor networks","authors":"Lei Ma, Ying-jian Kang, Hua Han, Gihong Min","doi":"10.1504/ijims.2020.105037","DOIUrl":"https://doi.org/10.1504/ijims.2020.105037","url":null,"abstract":"In current virus propagation defence methods, immunisation failures, as well as combination influence of infectious vector and propagation delay in propagation are not considered. Therefore, propagation of computer singularity virus is hard to control. A new SIS propagation model is proposed based on mean field theory with infectious vector and propagation delay. The influence of computer virus in complex sensor networks on the propagation property is analysed. A new cellular automata model is built to simulate computer virus propagation. With abstraction layer from computer singularity virus detection model based on immunisation principle, a fusion method for singularity virus detection is proposed. Through fusion of different antigen presentation gene library, ability of defence of computer singularity virus propagation is improved. Experimental results show that target immune network connectivity factor ratio of our method is only 0.18, lower than 0.37 multiples of nearest neighbour immunity.","PeriodicalId":39293,"journal":{"name":"International Journal of Internet Manufacturing and Services","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/ijims.2020.105037","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42964537","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}
Pub Date : 2020-02-07DOI: 10.1504/ijims.2020.105042
P. Govindaraj, Jaisankar Natarajan
Efficient task scheduling plays a critical role in cloud computing environment. In this paper, we proposed a novel trust-based fruit fly optimisation algorithm (TFOA) for task scheduling. Even though traditional scheduling algorithms, namely first come first serve, round robin, ant colony optimisation and so on are used broadly in cloud computing process but still efficient scheduling is not achieved. In general cloud service provider desires to receive the customer task in a faster rate allocated on the most trustworthy resource by using TFOA. Simulation outcomes show that the proposed algorithm performs better than the existing transitional algorithms like round robin and particle swarm optimisation (PSO) in terms of reduced makespan and turnaround time and efficient resource utilisation.
{"title":"Trust-based fruit fly optimisation algorithm for task scheduling in a cloud environment","authors":"P. Govindaraj, Jaisankar Natarajan","doi":"10.1504/ijims.2020.105042","DOIUrl":"https://doi.org/10.1504/ijims.2020.105042","url":null,"abstract":"Efficient task scheduling plays a critical role in cloud computing environment. In this paper, we proposed a novel trust-based fruit fly optimisation algorithm (TFOA) for task scheduling. Even though traditional scheduling algorithms, namely first come first serve, round robin, ant colony optimisation and so on are used broadly in cloud computing process but still efficient scheduling is not achieved. In general cloud service provider desires to receive the customer task in a faster rate allocated on the most trustworthy resource by using TFOA. Simulation outcomes show that the proposed algorithm performs better than the existing transitional algorithms like round robin and particle swarm optimisation (PSO) in terms of reduced makespan and turnaround time and efficient resource utilisation.","PeriodicalId":39293,"journal":{"name":"International Journal of Internet Manufacturing and Services","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/ijims.2020.105042","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48675063","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}
Pub Date : 2020-02-07DOI: 10.1504/ijims.2020.105043
Tete Lv, Xiyan Lv
This study investigated factors that affected users' stickiness and interrelationships among confirmation, perceived usefulness, satisfaction, continuance intention and users' stickiness in online car-hailing platforms. An empirical approach was adopted through online questionnaire survey to find out the formation mechanism of users' stickiness. The results indicated that perceived usefulness and satisfaction were positively associated with continuance intention, thereby leading to the increase of users' stickiness. And perceived usefulness also affected the satisfaction positively. What's more, confirmation was found to be the strongest predictor of perceived usefulness. The findings of this study may not only verify the extended model of IT continuance, but provide managerial guidelines for online car-hailing platform, thereby enhancing users' stickiness.
{"title":"Factors affecting users' stickiness in online car-hailing platforms: an empirical study","authors":"Tete Lv, Xiyan Lv","doi":"10.1504/ijims.2020.105043","DOIUrl":"https://doi.org/10.1504/ijims.2020.105043","url":null,"abstract":"This study investigated factors that affected users' stickiness and interrelationships among confirmation, perceived usefulness, satisfaction, continuance intention and users' stickiness in online car-hailing platforms. An empirical approach was adopted through online questionnaire survey to find out the formation mechanism of users' stickiness. The results indicated that perceived usefulness and satisfaction were positively associated with continuance intention, thereby leading to the increase of users' stickiness. And perceived usefulness also affected the satisfaction positively. What's more, confirmation was found to be the strongest predictor of perceived usefulness. The findings of this study may not only verify the extended model of IT continuance, but provide managerial guidelines for online car-hailing platform, thereby enhancing users' stickiness.","PeriodicalId":39293,"journal":{"name":"International Journal of Internet Manufacturing and Services","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/ijims.2020.105043","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45670779","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}
Pub Date : 2020-02-07DOI: 10.1504/ijims.2020.105041
Jasem M. Alostad
Network lifetime is identified as the most crucial parameters in under water wireless sensor networks (UWSN) in Internet of underwater things (IoUT) applications. Other challenges include: limited bandwidth, high attenuation, high path loss, limited battery life etc. The main focus of this paper is to consider a trade-off between the energy consumption and network lifetime. This paper proposes an optimal routing protocol called the energy dynamic adaptive routing (DAR) protocol. The DAR protocol maintains a trade-off between the reliability or packet delivery ratio (PDR) of sensor nodes and bit error ratio (BER) using an optimal dynamic adaptive routing approach. An optimal directed acyclic graph (DAG)-based route selection is exploited to select the neighbour and successor nodes. The cost function with a directed acyclic graph is utilised for better transmission of packets. The experimental results with BEAR show that the proposed method deals with the issues raised in the conventional protocol and improve the reliability of packets with higher BER.
{"title":"Reliability in IoUT enabled underwater sensor networks using dynamic adaptive routing protocol","authors":"Jasem M. Alostad","doi":"10.1504/ijims.2020.105041","DOIUrl":"https://doi.org/10.1504/ijims.2020.105041","url":null,"abstract":"Network lifetime is identified as the most crucial parameters in under water wireless sensor networks (UWSN) in Internet of underwater things (IoUT) applications. Other challenges include: limited bandwidth, high attenuation, high path loss, limited battery life etc. The main focus of this paper is to consider a trade-off between the energy consumption and network lifetime. This paper proposes an optimal routing protocol called the energy dynamic adaptive routing (DAR) protocol. The DAR protocol maintains a trade-off between the reliability or packet delivery ratio (PDR) of sensor nodes and bit error ratio (BER) using an optimal dynamic adaptive routing approach. An optimal directed acyclic graph (DAG)-based route selection is exploited to select the neighbour and successor nodes. The cost function with a directed acyclic graph is utilised for better transmission of packets. The experimental results with BEAR show that the proposed method deals with the issues raised in the conventional protocol and improve the reliability of packets with higher BER.","PeriodicalId":39293,"journal":{"name":"International Journal of Internet Manufacturing and Services","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/ijims.2020.105041","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49164907","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}
Pub Date : 2020-02-07DOI: 10.1504/ijims.2020.105031
Jun Ma, Mingshun Guo
With the development of the society, science and technology innovation becomes the development foundation of the equipment manufacturing industry enterprises. According to the questionnaires of 29 equipment manufacturing industries in Shenyang, the paper summarises the factors that affect the enterprise performance based on grounded theory. In order to study the relationships between the influencing factors and enterprise performance, multiple linear regression analysis is conducted by Statistical Product and Service Solutions (SPSS) software.
{"title":"Analysis of scientific and technological innovation influence factors affect enterprise performance","authors":"Jun Ma, Mingshun Guo","doi":"10.1504/ijims.2020.105031","DOIUrl":"https://doi.org/10.1504/ijims.2020.105031","url":null,"abstract":"With the development of the society, science and technology innovation becomes the development foundation of the equipment manufacturing industry enterprises. According to the questionnaires of 29 equipment manufacturing industries in Shenyang, the paper summarises the factors that affect the enterprise performance based on grounded theory. In order to study the relationships between the influencing factors and enterprise performance, multiple linear regression analysis is conducted by Statistical Product and Service Solutions (SPSS) software.","PeriodicalId":39293,"journal":{"name":"International Journal of Internet Manufacturing and Services","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/ijims.2020.105031","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45782743","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}
Pub Date : 2020-02-07DOI: 10.1504/ijims.2020.105036
Yunfan Lu, Zhenjia Zhu, Xu Tan
The information transmission path planning is conducive to the improvement of efficiency of information transmission, which matches requests of development of era. However, most of the information transmission path plans select transmission paths based on ID format. Although this algorithm can make nodes in big data environment reach the optimal path of sink node, it has high computational complexity. Therefore, an information transmission path planning algorithm based on an ingress-priority under big data environment is proposed. Based on this algorithm, a method for evaluating the information transmission path planning is obtained. Then analysis model of the information transmission path planning is constructed. Based on these, dynamic information transmission path planning is implemented by utilising priority multi-actuators. Experiments show that our proposed method can effectively improve the efficiency of information transmission path planning, ensure the accuracy of information after transmission and improve the quality of information transmission. Therefore, our proposed method is significant in application.
{"title":"Research on algorithm of information transmission path planning in big data environment","authors":"Yunfan Lu, Zhenjia Zhu, Xu Tan","doi":"10.1504/ijims.2020.105036","DOIUrl":"https://doi.org/10.1504/ijims.2020.105036","url":null,"abstract":"The information transmission path planning is conducive to the improvement of efficiency of information transmission, which matches requests of development of era. However, most of the information transmission path plans select transmission paths based on ID format. Although this algorithm can make nodes in big data environment reach the optimal path of sink node, it has high computational complexity. Therefore, an information transmission path planning algorithm based on an ingress-priority under big data environment is proposed. Based on this algorithm, a method for evaluating the information transmission path planning is obtained. Then analysis model of the information transmission path planning is constructed. Based on these, dynamic information transmission path planning is implemented by utilising priority multi-actuators. Experiments show that our proposed method can effectively improve the efficiency of information transmission path planning, ensure the accuracy of information after transmission and improve the quality of information transmission. Therefore, our proposed method is significant in application.","PeriodicalId":39293,"journal":{"name":"International Journal of Internet Manufacturing and Services","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/ijims.2020.105036","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42198772","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}
Pub Date : 2020-02-07DOI: 10.1504/ijims.2020.105038
Yongjun Qin, Gihong Min
In the outlier data mining with traditional methods, as the data is complex, the outlier data is not effectively classified, which increase the complexity of data classification and reduce the precision of data mining. In this paper, an outlier data mining method of time series based on association mapping is proposed. By using association rule mapping between datasets, the association rule of datasets is determined. The mining factor and relative error are introduced to improve the precision of data mining. The shuffled frog leaping clustering algorithm is applied to cluster the mining factor. The cluster-based multivariate time series classification is used for classification of clusters based on training set category of time series combined with modified K-nearest neighbour algorithm to achieve classification of time series data and outlier data mining. Experimental results show that running time is only 12.9 s when the number of datasets is 200. Compared with traditional methods, our proposed method can effectively improve the precision of data mining.
{"title":"Outlier data mining of multivariate time series based on association rule mapping","authors":"Yongjun Qin, Gihong Min","doi":"10.1504/ijims.2020.105038","DOIUrl":"https://doi.org/10.1504/ijims.2020.105038","url":null,"abstract":"In the outlier data mining with traditional methods, as the data is complex, the outlier data is not effectively classified, which increase the complexity of data classification and reduce the precision of data mining. In this paper, an outlier data mining method of time series based on association mapping is proposed. By using association rule mapping between datasets, the association rule of datasets is determined. The mining factor and relative error are introduced to improve the precision of data mining. The shuffled frog leaping clustering algorithm is applied to cluster the mining factor. The cluster-based multivariate time series classification is used for classification of clusters based on training set category of time series combined with modified K-nearest neighbour algorithm to achieve classification of time series data and outlier data mining. Experimental results show that running time is only 12.9 s when the number of datasets is 200. Compared with traditional methods, our proposed method can effectively improve the precision of data mining.","PeriodicalId":39293,"journal":{"name":"International Journal of Internet Manufacturing and Services","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/ijims.2020.105038","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47704485","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}
Pub Date : 2020-02-07DOI: 10.1504/ijims.2020.105045
Heng Li
In order to protect the confidentiality and integrity of sensitive data in accounting information processing system, it was necessary to study the sensitive data encryption method. The current encryption method was mainly used different technology to make encryption for the sensitivity of sensitive data, which caused a problem of poor security. In order to improve the security of encryption, a hybrid encryption method for sensitive data of accounting information processing system was proposed. Firstly, the sensitive data was preprocessed. Then, based on the elliptic curve encryption mechanism, the additive and multiplicative homomorphic encryption methods of sensitive data were constructed respectively. Experimental results showed that the cryptographic running time obtained by our proposed method was relatively small and the increase in decryption computation overhead was smaller than the traditional method which was good to improve encryption security.
{"title":"Research and analysis on sensitive data encryption method in accounting information processing system","authors":"Heng Li","doi":"10.1504/ijims.2020.105045","DOIUrl":"https://doi.org/10.1504/ijims.2020.105045","url":null,"abstract":"In order to protect the confidentiality and integrity of sensitive data in accounting information processing system, it was necessary to study the sensitive data encryption method. The current encryption method was mainly used different technology to make encryption for the sensitivity of sensitive data, which caused a problem of poor security. In order to improve the security of encryption, a hybrid encryption method for sensitive data of accounting information processing system was proposed. Firstly, the sensitive data was preprocessed. Then, based on the elliptic curve encryption mechanism, the additive and multiplicative homomorphic encryption methods of sensitive data were constructed respectively. Experimental results showed that the cryptographic running time obtained by our proposed method was relatively small and the increase in decryption computation overhead was smaller than the traditional method which was good to improve encryption security.","PeriodicalId":39293,"journal":{"name":"International Journal of Internet Manufacturing and Services","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/ijims.2020.105045","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47754874","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}
Pub Date : 2020-02-07DOI: 10.1504/ijims.2020.105032
Jianfeng Cui, Weina Fu
Traditional mobile self-organising network (MSON) positioning algorithms cannot correct position node's space and lead to low positioning accuracy. Node clustering is optimised DV-hop algorithm, and applied to node location of MSON. Narrative principle of MSON is completed by building RSSI ranging model. Strength of MSON transmission signal and propagation loss of MSON signal are calculated by combined RSSI technology in three-dimensional MSON model structure. Then, transmission loss is converted into node propagation distance, and node position of MSON is calculated. DV-hop algorithm is used for positioning by distance between nodes and position of anchor point. Positioning accuracy is improved and positioning range is expanded without increasing hardware overhead of mobile ad hoc network space node. Simulation experiment results show that node coverage of DV-hop positioning algorithm is higher than traditional algorithm. Besides, spatial localisation of MSON nodes expands network space node coverage rate, thereby improve the positioning accuracy.
{"title":"Mobile self-organising network positioning algorithm based on node clustering","authors":"Jianfeng Cui, Weina Fu","doi":"10.1504/ijims.2020.105032","DOIUrl":"https://doi.org/10.1504/ijims.2020.105032","url":null,"abstract":"Traditional mobile self-organising network (MSON) positioning algorithms cannot correct position node's space and lead to low positioning accuracy. Node clustering is optimised DV-hop algorithm, and applied to node location of MSON. Narrative principle of MSON is completed by building RSSI ranging model. Strength of MSON transmission signal and propagation loss of MSON signal are calculated by combined RSSI technology in three-dimensional MSON model structure. Then, transmission loss is converted into node propagation distance, and node position of MSON is calculated. DV-hop algorithm is used for positioning by distance between nodes and position of anchor point. Positioning accuracy is improved and positioning range is expanded without increasing hardware overhead of mobile ad hoc network space node. Simulation experiment results show that node coverage of DV-hop positioning algorithm is higher than traditional algorithm. Besides, spatial localisation of MSON nodes expands network space node coverage rate, thereby improve the positioning accuracy.","PeriodicalId":39293,"journal":{"name":"International Journal of Internet Manufacturing and Services","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/ijims.2020.105032","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43782733","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：