Pub Date : 2020-05-05DOI: 10.1504/ijes.2020.10029269
Katarzyna Koptyra, M. Ogiela
This paper compares an efficiency of two approaches of multi-secret steganography in lightweight systems: interlacing and multi-level. The study was conducted for two and three secrets with use of F5 algorithm for both approaches. The embedding times were measured with and without I/O operations. At the end the application of these techniques in lightweight solutions is discussed.
{"title":"Lightweight and efficient approach for multi-secret steganography","authors":"Katarzyna Koptyra, M. Ogiela","doi":"10.1504/ijes.2020.10029269","DOIUrl":"https://doi.org/10.1504/ijes.2020.10029269","url":null,"abstract":"This paper compares an efficiency of two approaches of multi-secret steganography in lightweight systems: interlacing and multi-level. The study was conducted for two and three secrets with use of F5 algorithm for both approaches. The embedding times were measured with and without I/O operations. At the end the application of these techniques in lightweight solutions is discussed.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"138 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":"134459011","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-05-05DOI: 10.1504/ijes.2020.10029266
Andrea Bruno, G. Cattaneo
The resolution of video cameras has increased considerably in recent years leading to a new generation of codecs with higher compression rates, such as H.265, VP9 and AV1. However, compression can heavily affect the noise present in each frame. Other encoder specific features, like the intra-frame prediction for H.265 and AV1, can flatten the pixel non-uniformity (PNU) noise. We implemented a test-bed to establish whether source camera identification can still be achieved using the PNU when videos are encoded in those formats. The experiments proved that the results are less accurate than those obtained from videos encoded with traditional codecs. Nevertheless, the most original result achieved was the methodology we designed. In order to avoid hidden artifacts the source videos were initially acquired as a raw data stream from a dedicated embedded system and then recorded with an open-source YUV encoder.
{"title":"An experimental estimate of the impact produced on PNU by new generation video codecs","authors":"Andrea Bruno, G. Cattaneo","doi":"10.1504/ijes.2020.10029266","DOIUrl":"https://doi.org/10.1504/ijes.2020.10029266","url":null,"abstract":"The resolution of video cameras has increased considerably in recent years leading to a new generation of codecs with higher compression rates, such as H.265, VP9 and AV1. However, compression can heavily affect the noise present in each frame. Other encoder specific features, like the intra-frame prediction for H.265 and AV1, can flatten the pixel non-uniformity (PNU) noise. We implemented a test-bed to establish whether source camera identification can still be achieved using the PNU when videos are encoded in those formats. The experiments proved that the results are less accurate than those obtained from videos encoded with traditional codecs. Nevertheless, the most original result achieved was the methodology we designed. In order to avoid hidden artifacts the source videos were initially acquired as a raw data stream from a dedicated embedded system and then recorded with an open-source YUV encoder.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"719 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":"125268343","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}
At present, the cross-chain technology works on becoming a bridge to build trust and transmit the information among chains. However, most of the existing schemes have poor universality, and they also have insufficient protection for the process of information cross-chain transmission. Contraposing the deficiencies above, we propose a channel matching scheme for cross-chain (CMSCC), CMSCC combines the ideas of the relay chain scheme and the channel in Fabric. The relay chain named chain-anchor and relay-chain (CARC) can be connected to other blockchains by multi-blockchain communication and consociation protocol (MBCCP). In CARC, the order peers will match the peers which on different chains and will create the peer matching channel (PMC) among matched peers. So, the information can be transmitted among matched peers. Finally, the experiment verifies that CMSCC enables information to be transmitted among chains through PMC, and CMSCC can also protect the process of information cross-chain transmission by PMC simultaneously.
目前，跨链技术致力于成为链之间建立信任和传递信息的桥梁。但是，现有的方案大多通用性差，对信息跨链传播过程的保护不足。针对上述不足，我们提出了一种跨链的信道匹配方案(CMSCC)，该方案结合了中继链方案和Fabric中的信道的思想。名为chain-anchor and relay-chain (CARC)的中继链可以通过多区块链通信和关联协议(MBCCP)与其他区块链连接。在CARC中，顺序对等体将匹配不同链上的对等体，并在匹配的对等体之间创建对等体匹配通道(PMC)。因此，信息可以在匹配的对等体之间传输。最后，通过实验验证了CMSCC可以通过PMC实现信息在链间的传输，并且CMSCC还可以同时保护PMC跨链传输信息的过程。
{"title":"A channel matching scheme for cross-chain","authors":"Wei She, Zhihao Gu, Wei Liu, Jian-Sen Chen, Bo Wang, Zhao Tian","doi":"10.1504/ijes.2020.10027914","DOIUrl":"https://doi.org/10.1504/ijes.2020.10027914","url":null,"abstract":"At present, the cross-chain technology works on becoming a bridge to build trust and transmit the information among chains. However, most of the existing schemes have poor universality, and they also have insufficient protection for the process of information cross-chain transmission. Contraposing the deficiencies above, we propose a channel matching scheme for cross-chain (CMSCC), CMSCC combines the ideas of the relay chain scheme and the channel in Fabric. The relay chain named chain-anchor and relay-chain (CARC) can be connected to other blockchains by multi-blockchain communication and consociation protocol (MBCCP). In CARC, the order peers will match the peers which on different chains and will create the peer matching channel (PMC) among matched peers. So, the information can be transmitted among matched peers. Finally, the experiment verifies that CMSCC enables information to be transmitted among chains through PMC, and CMSCC can also protect the process of information cross-chain transmission by PMC simultaneously.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"1 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":"114132755","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-05-05DOI: 10.1504/IJHPCN.2019.10018473
Zuoting Ning, Lan He, Dafang Zhang, Kun Xie
Network coding is a very effective approach to improve network throughput and reduce end-to-end delay. However, the existing approaches cannot thoroughly solve the problem of how to deal with newly overheard packets when the buffer is full, meanwhile, coding node does not schedule the packets in coding queue according to the packets' information in overhearing buffer. As a result, these methodologies lack flexibility and require quite a few assumptions. To address these limitations, we propose a new network coding overhearing strategy which is based on data packet switching and scheduling (DPSS) algorithm. First, when overhearing buffer is full and the sink nodes have overheard new packets, sink nodes will drop the recently overheard packets but record their IDs; second, sink nodes report the packets' information to the coding node that schedules the packets in coding queue for ease of encoding. Finally, sink nodes delete the packets which have been used for decoding, and call for the ever dropped packets when decoding ratio reaches the threshold. Theoretical analysis and simulation demonstrate that, compared with traditional overhearing policies, our scheme gets higher coding ratio and less delay.
{"title":"A novel localised network coding-based overhearing strategy","authors":"Zuoting Ning, Lan He, Dafang Zhang, Kun Xie","doi":"10.1504/IJHPCN.2019.10018473","DOIUrl":"https://doi.org/10.1504/IJHPCN.2019.10018473","url":null,"abstract":"Network coding is a very effective approach to improve network throughput and reduce end-to-end delay. However, the existing approaches cannot thoroughly solve the problem of how to deal with newly overheard packets when the buffer is full, meanwhile, coding node does not schedule the packets in coding queue according to the packets' information in overhearing buffer. As a result, these methodologies lack flexibility and require quite a few assumptions. To address these limitations, we propose a new network coding overhearing strategy which is based on data packet switching and scheduling (DPSS) algorithm. First, when overhearing buffer is full and the sink nodes have overheard new packets, sink nodes will drop the recently overheard packets but record their IDs; second, sink nodes report the packets' information to the coding node that schedules the packets in coding queue for ease of encoding. Finally, sink nodes delete the packets which have been used for decoding, and call for the ever dropped packets when decoding ratio reaches the threshold. Theoretical analysis and simulation demonstrate that, compared with traditional overhearing policies, our scheme gets higher coding ratio and less delay.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"1 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":"130110861","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-05-05DOI: 10.1504/ijes.2020.10029263
R. Prisco, A. D. Santis, Pompeo Faruolo, M. Mannetta
We present the design of an outdoor position certification authority. Such an authority aims at certifying the geolocalisation of a mobile device equipped with a global navigation satellite system receiver. Such a receiver is capable of acquiring radio signals (low-level data) and navigation messages (high-level data) in outdoor environments coming from different constellations of global/regional satellite navigation systems and satellite-based augmentation systems. To date, this information is unreliable from a security point of view because it can be easily forged by malicious attackers through specialised spoofing techniques. An outdoor position certification authority defines a client/server architecture through which a user can certify his position by sending the geolocalisation information needed to verify it to one or more remote servers. There are several scenarios for which this service can be very useful and, with the advent of the internet of things age, devices that might require such a service will grow in number.
{"title":"Design of an outdoor position certification authority","authors":"R. Prisco, A. D. Santis, Pompeo Faruolo, M. Mannetta","doi":"10.1504/ijes.2020.10029263","DOIUrl":"https://doi.org/10.1504/ijes.2020.10029263","url":null,"abstract":"We present the design of an outdoor position certification authority. Such an authority aims at certifying the geolocalisation of a mobile device equipped with a global navigation satellite system receiver. Such a receiver is capable of acquiring radio signals (low-level data) and navigation messages (high-level data) in outdoor environments coming from different constellations of global/regional satellite navigation systems and satellite-based augmentation systems. To date, this information is unreliable from a security point of view because it can be easily forged by malicious attackers through specialised spoofing techniques. An outdoor position certification authority defines a client/server architecture through which a user can certify his position by sending the geolocalisation information needed to verify it to one or more remote servers. There are several scenarios for which this service can be very useful and, with the advent of the internet of things age, devices that might require such a service will grow in number.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"1 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":"122620488","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-05-05DOI: 10.1504/ijes.2020.10029245
Kehong Zhang, Keqiu Li
In the rapidly-changing information world, the various users and personalised requirements lead to an urgent need for complex multiple attribute decision-making. In addition, the TOP-K path of single attribute decision cannot meet the actual needs. The TOP-K mainly has non-repeatable vertex, repeatable vertex, index and other algorithms. But these techniques are mainly based on the single attribute. There are few documents introducing the complex multiple attribute decision-making problem so for. Therefore, a Tdp algorithm is presented in this paper. Firstly, it uses the technology of interval number and extreme value to solve the uncertain attribute value. Then, TOPSIS technique solves the complex multiple attribute decision-making problems. By this way, the comprehensive score is achieved. Secondly, the paper proposes blocking and bidirectional shortest path algorithm for TOP-K optimal path. Finally, comparison and analysis between Tdp and the Yen were made. Result confirms that Tdp algorithm improves the TOP-K optimal technology.
{"title":"A novel algorithm for TOP-K optimal path on complex multiple attribute graph","authors":"Kehong Zhang, Keqiu Li","doi":"10.1504/ijes.2020.10029245","DOIUrl":"https://doi.org/10.1504/ijes.2020.10029245","url":null,"abstract":"In the rapidly-changing information world, the various users and personalised requirements lead to an urgent need for complex multiple attribute decision-making. In addition, the TOP-K path of single attribute decision cannot meet the actual needs. The TOP-K mainly has non-repeatable vertex, repeatable vertex, index and other algorithms. But these techniques are mainly based on the single attribute. There are few documents introducing the complex multiple attribute decision-making problem so for. Therefore, a Tdp algorithm is presented in this paper. Firstly, it uses the technology of interval number and extreme value to solve the uncertain attribute value. Then, TOPSIS technique solves the complex multiple attribute decision-making problems. By this way, the comprehensive score is achieved. Secondly, the paper proposes blocking and bidirectional shortest path algorithm for TOP-K optimal path. Finally, comparison and analysis between Tdp and the Yen were made. Result confirms that Tdp algorithm improves the TOP-K optimal technology.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"38 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":"133641116","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}
Systems built on top of blockchain are often inefficient. One reason for the inefficiency is that these systems include too many hash operations. To address this problem, we conduct an empirical study on the transaction history of a real-world blockchain-based system (i.e., Ethereum), which contains 300,821 accounts and 14,240,095 transactions. We found that the account usage frequency is highly heterogeneous. Based on this finding, this paper presents hierarchy bucket tree (HBT), an efficient account structure with user transaction behaviour information embedded, to reduce the number of hash operations and thus enhance the efficiency of blockchain-based systems. Extensive experiments have been conducted and the experimental results show that HBT reduces hash operations by nearly 80% compared with the existing account structure.
{"title":"Hierarchical bucket tree: an efficient account structure for blockchain-based system","authors":"Weili Chen, Zibin Zheng, Mingjie Ma, Pinjia He, Yuren Zhou, Jing Bian","doi":"10.1504/ijes.2020.10029262","DOIUrl":"https://doi.org/10.1504/ijes.2020.10029262","url":null,"abstract":"Systems built on top of blockchain are often inefficient. One reason for the inefficiency is that these systems include too many hash operations. To address this problem, we conduct an empirical study on the transaction history of a real-world blockchain-based system (i.e., Ethereum), which contains 300,821 accounts and 14,240,095 transactions. We found that the account usage frequency is highly heterogeneous. Based on this finding, this paper presents hierarchy bucket tree (HBT), an efficient account structure with user transaction behaviour information embedded, to reduce the number of hash operations and thus enhance the efficiency of blockchain-based systems. Extensive experiments have been conducted and the experimental results show that HBT reduces hash operations by nearly 80% compared with the existing account structure.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"1 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":"124078169","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-05-05DOI: 10.1504/ijes.2020.10029260
Jianbo Xu, Shu Feng, W. Liang, Jian Ke, Xiangwei Meng, Ruili Zhang, Danping Shou
In mobile ad hoc networks (MANET) with selfish nodes and malicious nodes, the network performance is seriously affected. We propose an algorithm based on the recommended trust value, i.e., collaborative computing trust model (CCTM) algorithm, to decide the data forwarding strategy. In the algorithm, the carrier node carrying the message collects recommended data of neighbour nodes adopts K-nearest neighbour (KNN) algorithm principle to filter the false recommended data and select K neighbour nodes as collaborative computing nodes to calculate the recommended trust value of neighbour nodes respectively, and then selects the neighbour node with the highest recommended trust value as the next hop node. The simulation experiments show that when the selfish and malicious nodes number is 10, CCTM is higher than Epidemic algorithm and MDT about 3% and 8% respectively in terms of transmission success rate; CCTM is higher than Epidemic about 14% and lower than MDT about 15% in terms of average transmission delay; CCTM is lower than MDT about 3% in terms of routing overhead. Overall, CCTM algorithm not only has better performance in terms of transmission success rate, delay and routing overhead, but also improves the security of data transmission.
{"title":"An algorithm for determining data forwarding strategy based on recommended trust value in MANET","authors":"Jianbo Xu, Shu Feng, W. Liang, Jian Ke, Xiangwei Meng, Ruili Zhang, Danping Shou","doi":"10.1504/ijes.2020.10029260","DOIUrl":"https://doi.org/10.1504/ijes.2020.10029260","url":null,"abstract":"In mobile ad hoc networks (MANET) with selfish nodes and malicious nodes, the network performance is seriously affected. We propose an algorithm based on the recommended trust value, i.e., collaborative computing trust model (CCTM) algorithm, to decide the data forwarding strategy. In the algorithm, the carrier node carrying the message collects recommended data of neighbour nodes adopts K-nearest neighbour (KNN) algorithm principle to filter the false recommended data and select K neighbour nodes as collaborative computing nodes to calculate the recommended trust value of neighbour nodes respectively, and then selects the neighbour node with the highest recommended trust value as the next hop node. The simulation experiments show that when the selfish and malicious nodes number is 10, CCTM is higher than Epidemic algorithm and MDT about 3% and 8% respectively in terms of transmission success rate; CCTM is higher than Epidemic about 14% and lower than MDT about 15% in terms of average transmission delay; CCTM is lower than MDT about 3% in terms of routing overhead. Overall, CCTM algorithm not only has better performance in terms of transmission success rate, delay and routing overhead, but also improves the security of data transmission.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"23 23-24 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":"128973898","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-05-05DOI: 10.1504/IJES.2020.10029271
Hugo Sbai, J. Happa, M. Goldsmith, S. Meftali
Keyloggers and screenloggers are one of the active growing threats to user's confidentiality as they can run in user-space, easily be distributed and upload information to remote servers. They use a wide number of different technologies and may be implemented in many ways. Keyloggers and screenloggers are very largely diverted from their primary and legitimate function to be exploited for malicious purposes compromising the privacy of users, and bank customers notably. Due to the recent multiplication of mobile devices with a touchscreen, the screenlogger threat has become even more dangerous. This threat is even harder to fight given the limited resources of the affected devices. This paper is the first step of a project aiming at proposing efficient countermeasures against screenloggers. It provides a complete overview of the different techniques used by this malware and discusses an extensive set of plausible counter measures.
{"title":"A survey on screenlogger attacks as well as countermeasures","authors":"Hugo Sbai, J. Happa, M. Goldsmith, S. Meftali","doi":"10.1504/IJES.2020.10029271","DOIUrl":"https://doi.org/10.1504/IJES.2020.10029271","url":null,"abstract":"Keyloggers and screenloggers are one of the active growing threats to user's confidentiality as they can run in user-space, easily be distributed and upload information to remote servers. They use a wide number of different technologies and may be implemented in many ways. Keyloggers and screenloggers are very largely diverted from their primary and legitimate function to be exploited for malicious purposes compromising the privacy of users, and bank customers notably. Due to the recent multiplication of mobile devices with a touchscreen, the screenlogger threat has become even more dangerous. This threat is even harder to fight given the limited resources of the affected devices. This paper is the first step of a project aiming at proposing efficient countermeasures against screenloggers. It provides a complete overview of the different techniques used by this malware and discusses an extensive set of plausible counter measures.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"45 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":"124462216","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-05-05DOI: 10.1504/ijes.2020.10029259
P. Kumaresan, P. Manoharan, S. Subha
The wireless sensor networks are single user centric and end users who do not own sensors are unable to have access to any wireless network specific application. This sensor cloud is a new paradigm to manage the physical sensors which are deployed in any WSN application. Existing research work on sensor cloud is limited to guaranteeing minimal energy consumption. In this paper, a novel mathematical model based on virtual sensor grouping is proposed to minimise the cumulative energy consumption of sensors in cloud environment. Energy consumption of non-virtual sensor with virtual sensor group for two different applications is compared and the results are shown. Further the proposed sensor cloud infrastructure with power model is compared with traditional WSN with respect to energy efficiency, throughput and performance with quick synchronisation time for random run trials and results were found to be better than the conventional WSN.
{"title":"Heuristic approach to minimise the energy consumption of sensors in cloud environment for wireless body area network applications","authors":"P. Kumaresan, P. Manoharan, S. Subha","doi":"10.1504/ijes.2020.10029259","DOIUrl":"https://doi.org/10.1504/ijes.2020.10029259","url":null,"abstract":"The wireless sensor networks are single user centric and end users who do not own sensors are unable to have access to any wireless network specific application. This sensor cloud is a new paradigm to manage the physical sensors which are deployed in any WSN application. Existing research work on sensor cloud is limited to guaranteeing minimal energy consumption. In this paper, a novel mathematical model based on virtual sensor grouping is proposed to minimise the cumulative energy consumption of sensors in cloud environment. Energy consumption of non-virtual sensor with virtual sensor group for two different applications is compared and the results are shown. Further the proposed sensor cloud infrastructure with power model is compared with traditional WSN with respect to energy efficiency, throughput and performance with quick synchronisation time for random run trials and results were found to be better than the conventional WSN.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"6 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":"127740785","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
扫码关注我们
求助内容：
应助结果提醒方式：