Wang Qixin, Zhang Biao, Hu Yunqiang, Wen Qi, K. Wende
{"title":"Design and simulation optimisation of a new pressure sensing system","authors":"Wang Qixin, Zhang Biao, Hu Yunqiang, Wen Qi, K. Wende","doi":"10.1504/ijwmc.2019.10024348","DOIUrl":"https://doi.org/10.1504/ijwmc.2019.10024348","url":null,"abstract":"The depth simulator can simulate the depth variation of seawater in real time and is an important part of the semi-physical simulation system of underwater equipment. In order to detect the high-pressure resistance and pressure detection accuracy of underwater operation equipment, the deep sea simulator is required to restore the ocean pressure environment as much as possible. This paper proposes a pressure sensing system with a stop device. By integrating the advantages of the large-range pressure sensor, the sensing system has the characteristics of large-range and high-precision. The physical samples were made and tested, and the friction of the sealing ring was found to be too large. Based on the multi-objective optimisation program, Matlab was used to simulate and optimise, and the reasonable structural parameters of the pressure sensing system were obtained.","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47158805","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}
Hu Hui, Cai Zhaoquan, Hu Song, Cai Yingxue, Chen Jia, Huang Sibo
{"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}
{"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}
{"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}
{"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}
{"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}
{"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}
{"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}
{"title":"QoS routing protocols for mobile ad hoc networks","authors":"GulatiMandeep Kaur, KumarKrishan","doi":"10.1201/9781420013825-19","DOIUrl":"https://doi.org/10.1201/9781420013825-19","url":null,"abstract":"In mobile ad hoc networks, Quality of Service (QoS) routing is a challenging issue due to several factors like node mobility, multi-path communication and channel access. QoS guarantees are require...","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2012-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65960578","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}
{"title":"An improved ant colony optimisation and its application on multicast routing problem","authors":"Zhang Yi, Liu Yan-chun","doi":"10.1504/IJWMC.2011.044116","DOIUrl":"https://doi.org/10.1504/IJWMC.2011.044116","url":null,"abstract":"In this paper, some improvements on Ant Colony Optimisation (ACO) are presented and we use the improved algorithm to solve the multicast routing problem. The improvements are given as follows: A novel optimised implementing approach is designed to reduce the processing costs (the bandwidth, delay, mincost) involved with routing of ants in the conventional ACO. Based on the model of network routing, the set of candidates is limited to the nearest c points in order to reduce the counting of other points. And we also use the flags on the blocked points in order to prevent selecting these points. Simulations show that the speed of convergence of the improved algorithm can be enhanced greatly compared with the traditional algorithm.","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"5 1","pages":"18-23"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/IJWMC.2011.044116","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66705230","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}