Pub Date : 2019-04-02DOI: 10.1504/IJWMC.2019.10020382
Hu Hui, Cai Zhaoquan, Hu Song, Cai Yingxue, Chen Jia, Huang Sibo
Recently, inspired by the behaviour of monarch butterfly in North America, Wang et al. proposed a new kind of swarm intelligence algorithm, called Monarch Butterfly Optimisation (MBO). Since it was proposed, it has been widely studied and applied in various engineering fields. In this paper, we apply MBO algorithm to solve CEC 2017 competition on constrained real-parameter optimisation. Also, the performance of MBO on 21 constrained CEC 2017 real-parameter optimisation problems is compared with five other state-of-the-art evolutionary algorithms. The experimental results indicate that MBO algorithm performs much better than other five evolutionary algorithms on most cases. It is strongly proven that MBO is a very promising algorithm for solving constrained engineering problems.
{"title":"Constrained solution of CEC 2017 with monarch butterfly optimisation","authors":"Hu Hui, Cai Zhaoquan, Hu Song, Cai Yingxue, Chen Jia, Huang Sibo","doi":"10.1504/IJWMC.2019.10020382","DOIUrl":"https://doi.org/10.1504/IJWMC.2019.10020382","url":null,"abstract":"Recently, inspired by the behaviour of monarch butterfly in North America, Wang et al. proposed a new kind of swarm intelligence algorithm, called Monarch Butterfly Optimisation (MBO). Since it was proposed, it has been widely studied and applied in various engineering fields. In this paper, we apply MBO algorithm to solve CEC 2017 competition on constrained real-parameter optimisation. Also, the performance of MBO on 21 constrained CEC 2017 real-parameter optimisation problems is compared with five other state-of-the-art evolutionary algorithms. The experimental results indicate that MBO algorithm performs much better than other five evolutionary algorithms on most cases. It is strongly proven that MBO is a very promising algorithm for solving constrained engineering problems.","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"16 1","pages":"138"},"PeriodicalIF":0.0,"publicationDate":"2019-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45195645","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 : 2018-09-11DOI: 10.1504/IJWMC.2018.10015854
Yuan Jiangjun, Wang Jie
Recent years have seen the rapid improvement of smart terminals and wireless networks, and a lot of smart applications have come to the fore. Taking advantages of fast developed smart terminals, more and more complicated sensing tasks can be taken over and finished. Data aggregation is an important application which is required by many tasks. The sensing devices in mobile sensing systems get time-series data, which can be used for supply forecast and leakage detection. As people nowadays pay more attention on privacy issues, to let people use today's data aggregation application, the first task is to solve their privacy concerns. Here, we propose a fast encryption/decryption mechanism for addition operations on keyed hash functions, based on multi-threads computation and parallel computation on multi-cores architecture. The advanced protocol presented by us works better for large systems and requires less time cost for both mobile sensors and aggregator. The experiments show the performance benefits of the presented protocol.
{"title":"Fast computation method for privacy-preserving data aggregation protocol","authors":"Yuan Jiangjun, Wang Jie","doi":"10.1504/IJWMC.2018.10015854","DOIUrl":"https://doi.org/10.1504/IJWMC.2018.10015854","url":null,"abstract":"Recent years have seen the rapid improvement of smart terminals and wireless networks, and a lot of smart applications have come to the fore. Taking advantages of fast developed smart terminals, more and more complicated sensing tasks can be taken over and finished. Data aggregation is an important application which is required by many tasks. The sensing devices in mobile sensing systems get time-series data, which can be used for supply forecast and leakage detection. As people nowadays pay more attention on privacy issues, to let people use today's data aggregation application, the first task is to solve their privacy concerns. Here, we propose a fast encryption/decryption mechanism for addition operations on keyed hash functions, based on multi-threads computation and parallel computation on multi-cores architecture. The advanced protocol presented by us works better for large systems and requires less time cost for both mobile sensors and aggregator. The experiments show the performance benefits of the presented protocol.","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"15 1","pages":"47-51"},"PeriodicalIF":0.0,"publicationDate":"2018-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66705655","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 : 2017-11-18DOI: 10.1007/978-981-13-1648-7_41
Q. Cai, Chengtian Ouyang, Yiwang Huang
{"title":"Improved location algorithm based on DV-hop for the indoor internet of things","authors":"Q. Cai, Chengtian Ouyang, Yiwang Huang","doi":"10.1007/978-981-13-1648-7_41","DOIUrl":"https://doi.org/10.1007/978-981-13-1648-7_41","url":null,"abstract":"","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"1 1","pages":"483-491"},"PeriodicalIF":0.0,"publicationDate":"2017-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42821284","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 : 2017-07-31DOI: 10.1504/IJWMC.2017.10006563
Yuan Jiangjun, Wang Jie
Wireless sensor network uses a large number of sensing nodes to collect real-time data of the deployed environment, and then send these data to the base station. For limited resources and energy, we have to consider the energy consumption problem in practical applications. In addition, data aggregation protocols need privacy protection. We have found out the high energy cost issue of the basic privacy-preserving data aggregation protocol and introduce two novel elements into the basic protocol: mobile sink and straw-man structure. Combining these two novel elements, we propose the new energy-saving privacy-preserving data aggregation protocol. In the basic protocol, the sensor nodes in each sensing period need to receive and send multiple ciphertexts. While in our proposed new protocol, the sensor nodes in each sensing period only need to send a ciphertext. Therefore, our protocol can reduce the energy consumption of the whole network and prolong the service life of wireless sensor networks.
{"title":"Energy-saving privacy-preserving data aggregation protocol with mobile sink","authors":"Yuan Jiangjun, Wang Jie","doi":"10.1504/IJWMC.2017.10006563","DOIUrl":"https://doi.org/10.1504/IJWMC.2017.10006563","url":null,"abstract":"Wireless sensor network uses a large number of sensing nodes to collect real-time data of the deployed environment, and then send these data to the base station. For limited resources and energy, we have to consider the energy consumption problem in practical applications. In addition, data aggregation protocols need privacy protection. We have found out the high energy cost issue of the basic privacy-preserving data aggregation protocol and introduce two novel elements into the basic protocol: mobile sink and straw-man structure. Combining these two novel elements, we propose the new energy-saving privacy-preserving data aggregation protocol. In the basic protocol, the sensor nodes in each sensing period need to receive and send multiple ciphertexts. While in our proposed new protocol, the sensor nodes in each sensing period only need to send a ciphertext. Therefore, our protocol can reduce the energy consumption of the whole network and prolong the service life of wireless sensor networks.","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"378 1","pages":"335-340"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77338589","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 : 2016-01-01DOI: 10.1504/IJWMC.2016.10003221
Shu Ying-Li, K. Wende
A novel switching group-size genetic algorithm (GA) based on Hierarchical Reinforcement Learning (HRL) is proposed to improve the global optimisation performance by accelerating the convergence speed of genetic algorithm and improving the computational efficiency. In the early stage of the evolution, the group can be expanded to increase diversity, while the group should be downsized to protect the more adaptive individuals in the latter stage. Chromosome crossover operation in the HRL algorithm is regarded as behaviour. Choosing the optimal method according to the specific evolution of the chromosome reflects the optimisation selection. At the same time, abstract and hierarchical system is used to decompose the problem to multilevel sub-task space. The convergence speed is improved by learning strategically in each sub-task space and multiplexing the sub-strategy between layers. The experiment has proved the validity of the algorithm.
{"title":"A novel switching group-size GA based on HRL","authors":"Shu Ying-Li, K. Wende","doi":"10.1504/IJWMC.2016.10003221","DOIUrl":"https://doi.org/10.1504/IJWMC.2016.10003221","url":null,"abstract":"A novel switching group-size genetic algorithm (GA) based on Hierarchical Reinforcement Learning (HRL) is proposed to improve the global optimisation performance by accelerating the convergence speed of genetic algorithm and improving the computational efficiency. In the early stage of the evolution, the group can be expanded to increase diversity, while the group should be downsized to protect the more adaptive individuals in the latter stage. Chromosome crossover operation in the HRL algorithm is regarded as behaviour. Choosing the optimal method according to the specific evolution of the chromosome reflects the optimisation selection. At the same time, abstract and hierarchical system is used to decompose the problem to multilevel sub-task space. The convergence speed is improved by learning strategically in each sub-task space and multiplexing the sub-strategy between layers. The experiment has proved the validity of the algorithm.","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"11 1","pages":"277-282"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66705644","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 : 2016-01-01DOI: 10.1504/IJWMC.2016.077232
K. Wende
A preferential vector algorithm of particle swarm with hierarchical reinforcement learning is proposed to solve the balance problem of global searching range and local searching precision, and the problem of fixedly adjusting strategy of inertia weight. Firstly, the preferential particle position with crossover operation was introduced on the standard particle swarm algorithm. The sequential adding operations on single step of particle position were divided into the seeking of middle particles. The operations of crossover and mutation were combined to keep the elite particle swarm. Secondly, the adjusting strategies of inertia weight were treated as the actions. The hierarchical learning was executed in every iteration of particle swarm and the strategy with maximal discounted profit was selected. The experiment proved the validity of the algorithm.
{"title":"Study of preferential vector of particle swarm with hierarchical reinforcement","authors":"K. Wende","doi":"10.1504/IJWMC.2016.077232","DOIUrl":"https://doi.org/10.1504/IJWMC.2016.077232","url":null,"abstract":"A preferential vector algorithm of particle swarm with hierarchical reinforcement learning is proposed to solve the balance problem of global searching range and local searching precision, and the problem of fixedly adjusting strategy of inertia weight. Firstly, the preferential particle position with crossover operation was introduced on the standard particle swarm algorithm. The sequential adding operations on single step of particle position were divided into the seeking of middle particles. The operations of crossover and mutation were combined to keep the elite particle swarm. Secondly, the adjusting strategies of inertia weight were treated as the actions. The hierarchical learning was executed in every iteration of particle swarm and the strategy with maximal discounted profit was selected. The experiment proved the validity of the algorithm.","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"10 1","pages":"293-300"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/IJWMC.2016.077232","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66705588","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 : 2015-05-01DOI: 10.1504/IJWMC.2015.069391
Wang Mei-ping, Tian Qi
Considering the questions of complex non-linearity, large thermal inertia, retardance of a district heating system, it is very difficult to establish accurate mathematical models of heating parameters prediction for the heating system. Correlation analysis of influence factors is used to obtain the major factors influencing heating parameters through analysing operational data of a heating system; these factors serve as input parameters of the predicting model. This paper describes a prediction method that combines Support Vector Machine SVM with neural network. The method creates a network structure between heating parameters and its influence factors. Evaluation indexes of relative error and correlation coefficients are given to analyse the feasibility of the method within the scope of engineering applications through using the network model to regress and predict the heating parameters and compare them with testing data. It turned out that the prediction technique provides powerful guidance for operation of the district heating system.
{"title":"Prediction of heating parameters based on support vector machine","authors":"Wang Mei-ping, Tian Qi","doi":"10.1504/IJWMC.2015.069391","DOIUrl":"https://doi.org/10.1504/IJWMC.2015.069391","url":null,"abstract":"Considering the questions of complex non-linearity, large thermal inertia, retardance of a district heating system, it is very difficult to establish accurate mathematical models of heating parameters prediction for the heating system. Correlation analysis of influence factors is used to obtain the major factors influencing heating parameters through analysing operational data of a heating system; these factors serve as input parameters of the predicting model. This paper describes a prediction method that combines Support Vector Machine SVM with neural network. The method creates a network structure between heating parameters and its influence factors. Evaluation indexes of relative error and correlation coefficients are given to analyse the feasibility of the method within the scope of engineering applications through using the network model to regress and predict the heating parameters and compare them with testing data. It turned out that the prediction technique provides powerful guidance for operation of the district heating system.","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"8 1","pages":"294-300"},"PeriodicalIF":0.0,"publicationDate":"2015-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/IJWMC.2015.069391","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66705575","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}
This paper addresses the problem of path planning for Unmanned Aerial Vehicles UAVs in an unknown directional region. Paths are planned to maximise the amount of information from desired region whi...
研究了无人机在未知方向区域的路径规划问题。路径的规划是为了最大限度地从期望区域获取信息，而……
{"title":"Coverage path planning for UAVs in unknown directional regions","authors":"WangXiaoliang, LiDeshi","doi":"10.5555/2782689.2782699","DOIUrl":"https://doi.org/10.5555/2782689.2782699","url":null,"abstract":"This paper addresses the problem of path planning for Unmanned Aerial Vehicles UAVs in an unknown directional region. Paths are planned to maximise the amount of information from desired region whi...","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"53 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2015-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71134973","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 : 2014-05-01DOI: 10.1504/IJWMC.2014.062003
Zeng-min Geng, Jianxia Du
The explosive growth of web pages currently makes the research on web page classification technology a hotspot of web mining. This paper introduces experiment data of fashion document corpus by many feature selection and classification methods, gives characterising expressions for specific documents based on core feature terms and web page categorisation algorithm is put forward based on web structure. Through the classification experiment on fashion web pages corpus, the algorithm has higher accuracy rate than other classification algorithms, and thus improves several points relative to the result before adjustment on web structure. The algorithms studied in this paper can be applied in other domains besides web pages of fashions.
{"title":"Research on web page classification-based core characteristics and web structure","authors":"Zeng-min Geng, Jianxia Du","doi":"10.1504/IJWMC.2014.062003","DOIUrl":"https://doi.org/10.1504/IJWMC.2014.062003","url":null,"abstract":"The explosive growth of web pages currently makes the research on web page classification technology a hotspot of web mining. This paper introduces experiment data of fashion document corpus by many feature selection and classification methods, gives characterising expressions for specific documents based on core feature terms and web page categorisation algorithm is put forward based on web structure. Through the classification experiment on fashion web pages corpus, the algorithm has higher accuracy rate than other classification algorithms, and thus improves several points relative to the result before adjustment on web structure. The algorithms studied in this paper can be applied in other domains besides web pages of fashions.","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"129 1","pages":"253-257"},"PeriodicalIF":0.0,"publicationDate":"2014-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/IJWMC.2014.062003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66705293","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 : 2013-08-01DOI: 10.1504/IJWMC.2013.055771
C. Xiaolong, Peng Zhiping
It is open problem for the FAST TCP to estimate the true propagation delay. Aiming at the open problem, according to application characteristic of unilateral accelerated FAST TCP system, a novel two layers algorithm of the transport layer is proposed. In down layer, the history information of the active FAST TCP flows, such as the start-up time and the running time of FAST TCP flows, are gathered. When a new FAST TCP flow arrives, the upper layer algorithm can provide the current queue delay of the bottleneck link based on the earliest FAST TCP flow. For the first time in the calculation propagation delay, the down layer FAST TCP algorithm estimate the accurate propagation delay based on the current round trip delay minus the queuing delay provided by the upper algorithm. Finally, the NS-2 simulation results validate the effectiveness of this improved two layers algorithm.
{"title":"An improved unilateral acceleration FAST TCP fairness based on history flows information","authors":"C. Xiaolong, Peng Zhiping","doi":"10.1504/IJWMC.2013.055771","DOIUrl":"https://doi.org/10.1504/IJWMC.2013.055771","url":null,"abstract":"It is open problem for the FAST TCP to estimate the true propagation delay. Aiming at the open problem, according to application characteristic of unilateral accelerated FAST TCP system, a novel two layers algorithm of the transport layer is proposed. In down layer, the history information of the active FAST TCP flows, such as the start-up time and the running time of FAST TCP flows, are gathered. When a new FAST TCP flow arrives, the upper layer algorithm can provide the current queue delay of the bottleneck link based on the earliest FAST TCP flow. For the first time in the calculation propagation delay, the down layer FAST TCP algorithm estimate the accurate propagation delay based on the current round trip delay minus the queuing delay provided by the upper algorithm. Finally, the NS-2 simulation results validate the effectiveness of this improved two layers algorithm.","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"6 1","pages":"209-214"},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/IJWMC.2013.055771","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66705285","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
扫码关注我们
求助内容：
应助结果提醒方式：