Pub Date : 2022-01-01DOI: 10.1504/ijsnet.2022.10045481
Parfenov Vladimir Ivanovich, Le Duy Dong
{"title":"Optimal fusion rule for distributed detection with channel errors taking into account sensors' unreliability probability when protecting coastlines","authors":"Parfenov Vladimir Ivanovich, Le Duy Dong","doi":"10.1504/ijsnet.2022.10045481","DOIUrl":"https://doi.org/10.1504/ijsnet.2022.10045481","url":null,"abstract":"","PeriodicalId":49177,"journal":{"name":"International Journal of Sensor Networks","volume":"77 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81146367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-01-01DOI: 10.1504/ijsnet.2022.10050654
Salvador Santonja Climent, V.M. Sempere Paya, J. Silvestre Blanes, Luis Miguel Bartolín Arnau, David Todoli Ferrandis
{"title":"Hybrid solution for smart rural applications in areas without Internet coverage","authors":"Salvador Santonja Climent, V.M. Sempere Paya, J. Silvestre Blanes, Luis Miguel Bartolín Arnau, David Todoli Ferrandis","doi":"10.1504/ijsnet.2022.10050654","DOIUrl":"https://doi.org/10.1504/ijsnet.2022.10050654","url":null,"abstract":"","PeriodicalId":49177,"journal":{"name":"International Journal of Sensor Networks","volume":"36 4","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72562839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.1504/ijsnet.2021.10037354
T. Sharma, Richa Sharma, Ajay K. Sharma
{"title":"TVDD: topology based vehicular data dissemination scheme for stability optimisation in IoV","authors":"T. Sharma, Richa Sharma, Ajay K. Sharma","doi":"10.1504/ijsnet.2021.10037354","DOIUrl":"https://doi.org/10.1504/ijsnet.2021.10037354","url":null,"abstract":"","PeriodicalId":49177,"journal":{"name":"International Journal of Sensor Networks","volume":"133 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76207338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-16DOI: 10.1504/ijsnet.2020.10030152
Nadhir Ben Halima, H. Boujemaa
In this paper, we analyse and optimise the total throughput and average delay in non orthogonal multiple access (NOMA) with energy harvesting. The source harvest energy from radio frequency (RF) signals received from another node A. Node A can be any node transmitting RF signals. The frame with duration T contains two time slots. The first slot has duration δT and is dedicated to energy harvesting where 0 < δ < 1 is harvesting duration percentage. The second slot has duration (1 - δ)T and is dedicated to transmission of a linear combination of symbols to N NOMA users. We optimise harvesting duration and power allocation coefficient to maximise the total throughput or minimise the average delay. Our theoretical derivation are valid for Rayleigh fading channels.
{"title":"Throughput and delay optimization for NOMA systems with energy harvesting","authors":"Nadhir Ben Halima, H. Boujemaa","doi":"10.1504/ijsnet.2020.10030152","DOIUrl":"https://doi.org/10.1504/ijsnet.2020.10030152","url":null,"abstract":"In this paper, we analyse and optimise the total throughput and average delay in non orthogonal multiple access (NOMA) with energy harvesting. The source harvest energy from radio frequency (RF) signals received from another node A. Node A can be any node transmitting RF signals. The frame with duration T contains two time slots. The first slot has duration δT and is dedicated to energy harvesting where 0 < δ < 1 is harvesting duration percentage. The second slot has duration (1 - δ)T and is dedicated to transmission of a linear combination of symbols to N NOMA users. We optimise harvesting duration and power allocation coefficient to maximise the total throughput or minimise the average delay. Our theoretical derivation are valid for Rayleigh fading channels.","PeriodicalId":49177,"journal":{"name":"International Journal of Sensor Networks","volume":"98 1","pages":"153"},"PeriodicalIF":1.1,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75659013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-03-12DOI: 10.1504/IJSNET.2019.10019721
Ye Miao, Qiu Hong-bing, Wang Mei, Wang Yong, F. Hao
The prevalent research on the path planning problem in mobile node-based data collection techniques only considers the simple situation involving a single mobile node or path endpoint located at the centre of the communication. This paper considers additional situations involving both of the above two factors and abstracts from these scenarios to formulate a hybrid optimisation problem. This optimisation problem has the characteristics of high dimensionality and a large search space. To solve this problem, the following modifications were made. First, k sub-paths based on the k-SPLITOUR algorithm were obtained. Second, a method to eliminate path intersections was designed to optimise the discrete components. Finally, a hybrid glowworm swarm optimisation (HGSO) algorithm was proposed to optimise the positions of access points along the communication circle to optimise the continuous components. The global convergence analysis of the proposed HGSO algorithm is given. Simulations and comparisons with other algorithms verified that the proposed strategy can solve the path planning problem in data collection utilising multi-mobile nodes effectively.
{"title":"A new path planning strategy of a data collection problem utilising multi-mobile nodes in wireless sensor networks","authors":"Ye Miao, Qiu Hong-bing, Wang Mei, Wang Yong, F. Hao","doi":"10.1504/IJSNET.2019.10019721","DOIUrl":"https://doi.org/10.1504/IJSNET.2019.10019721","url":null,"abstract":"The prevalent research on the path planning problem in mobile node-based data collection techniques only considers the simple situation involving a single mobile node or path endpoint located at the centre of the communication. This paper considers additional situations involving both of the above two factors and abstracts from these scenarios to formulate a hybrid optimisation problem. This optimisation problem has the characteristics of high dimensionality and a large search space. To solve this problem, the following modifications were made. First, k sub-paths based on the k-SPLITOUR algorithm were obtained. Second, a method to eliminate path intersections was designed to optimise the discrete components. Finally, a hybrid glowworm swarm optimisation (HGSO) algorithm was proposed to optimise the positions of access points along the communication circle to optimise the continuous components. The global convergence analysis of the proposed HGSO algorithm is given. Simulations and comparisons with other algorithms verified that the proposed strategy can solve the path planning problem in data collection utilising multi-mobile nodes effectively.","PeriodicalId":49177,"journal":{"name":"International Journal of Sensor Networks","volume":"34 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2019-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75558979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1007/978-3-030-30110-1
Phoebe Chen, A. Cuzzocrea, Xiaoyong Du, Orhun Kara, Ting Liu, K. Sivalingam, D. Ślęzak, T. Washio, Xiaokang Yang, Simone Diniz Junqueira Barbosa, C. Benavente-Peces, Nancy Cam-Winget, E. Fleury, A. Ahrens
{"title":"Sensor Networks: 6th International Conference, SENSORNETS 2017, Porto, Portugal, February 19-21, 2017, and 7th International Conference, SENSORNETS 2018, Funchal, Madeira, Portugal, January 22-24, 2018, Revised Selected Papers","authors":"Phoebe Chen, A. Cuzzocrea, Xiaoyong Du, Orhun Kara, Ting Liu, K. Sivalingam, D. Ślęzak, T. Washio, Xiaokang Yang, Simone Diniz Junqueira Barbosa, C. Benavente-Peces, Nancy Cam-Winget, E. Fleury, A. Ahrens","doi":"10.1007/978-3-030-30110-1","DOIUrl":"https://doi.org/10.1007/978-3-030-30110-1","url":null,"abstract":"","PeriodicalId":49177,"journal":{"name":"International Journal of Sensor Networks","volume":"25 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72670704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1504/ijsnet.2019.10018790
Rania Al Nadi, M. A. Al Zamil
{"title":"A profile based data segmentation for in-home activity recognition","authors":"Rania Al Nadi, M. A. Al Zamil","doi":"10.1504/ijsnet.2019.10018790","DOIUrl":"https://doi.org/10.1504/ijsnet.2019.10018790","url":null,"abstract":"","PeriodicalId":49177,"journal":{"name":"International Journal of Sensor Networks","volume":"59 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89739291","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-01DOI: 10.1504/IJSNET.2017.081334
Wu Yuanming
To prolong the network lifespan, the energy-balanced routing algorithm builds its routes based on a weighted sum of node's depth, residual energy and energy density. It is a pity that this algorithm introduces routing loops and redundant hops, which result in end-to-end delay and consuming more energy. More seriously, packets cannot reach the sink. In this paper, to avoid routing loop and redundancy, a novel next-hop selection method is proposed, moreover, the routing loop and redundant hops detection and elimination mechanism have been built up. Theoretical analysis and simulation experiments show that the network lifespan is stretched by 68.72% and 24.65% compared with minimum hop routing and energy-balanced routing protocol EBRP separately.
{"title":"An energy-balanced loop-free routing protocol for distributed wireless sensor networks","authors":"Wu Yuanming","doi":"10.1504/IJSNET.2017.081334","DOIUrl":"https://doi.org/10.1504/IJSNET.2017.081334","url":null,"abstract":"To prolong the network lifespan, the energy-balanced routing algorithm builds its routes based on a weighted sum of node's depth, residual energy and energy density. It is a pity that this algorithm introduces routing loops and redundant hops, which result in end-to-end delay and consuming more energy. More seriously, packets cannot reach the sink. In this paper, to avoid routing loop and redundancy, a novel next-hop selection method is proposed, moreover, the routing loop and redundant hops detection and elimination mechanism have been built up. Theoretical analysis and simulation experiments show that the network lifespan is stretched by 68.72% and 24.65% compared with minimum hop routing and energy-balanced routing protocol EBRP separately.","PeriodicalId":49177,"journal":{"name":"International Journal of Sensor Networks","volume":"92 1","pages":"123-131"},"PeriodicalIF":1.1,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77291059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"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/IJSNET.2016.079176
A. Das, R. Chaki, K. Dey
The use of sensors to sense a multitude of events forms the basis of the all-pervasive computing concepts of today. The challenge lies in transferring the information sensed over the wireless links with limited bandwidth. The sensors are normally deployed close to each other and hence end up sensing the same event and sending the information. This gives rise to considerable redundancy and energy wastage of individual nodes. Clusterisation is the common technique for reducing the load of the nodes in order to increase the overall lifetime of the network. The selection of cluster head is very important in this regard. This paper uses a multitude of different parameters such as residual energy, distance from sink node, number of neighbour nodes etc., for selecting a cluster head. A multi-level energy-aware routing framework has been proposed here. The simulation result shows that the proposed algorithm increases network lifetime more than the other existing routing protocols.
{"title":"Cluster-based energy-aware routing scheme CBEARS for wireless sensor network","authors":"A. Das, R. Chaki, K. Dey","doi":"10.1504/IJSNET.2016.079176","DOIUrl":"https://doi.org/10.1504/IJSNET.2016.079176","url":null,"abstract":"The use of sensors to sense a multitude of events forms the basis of the all-pervasive computing concepts of today. The challenge lies in transferring the information sensed over the wireless links with limited bandwidth. The sensors are normally deployed close to each other and hence end up sensing the same event and sending the information. This gives rise to considerable redundancy and energy wastage of individual nodes. Clusterisation is the common technique for reducing the load of the nodes in order to increase the overall lifetime of the network. The selection of cluster head is very important in this regard. This paper uses a multitude of different parameters such as residual energy, distance from sink node, number of neighbour nodes etc., for selecting a cluster head. A multi-level energy-aware routing framework has been proposed here. The simulation result shows that the proposed algorithm increases network lifetime more than the other existing routing protocols.","PeriodicalId":49177,"journal":{"name":"International Journal of Sensor Networks","volume":"43 1","pages":"262-272"},"PeriodicalIF":1.1,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86287544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：