Wireless sensor networks (WSNs) are important application for safety monitoring in underground coal mines, which are difficult to monitor due to natural conditions. Based on the characteristic of limited energy for WS...Wireless sensor networks (WSNs) are important application for safety monitoring in underground coal mines, which are difficult to monitor due to natural conditions. Based on the characteristic of limited energy for WSNs in confined underground area such as coal face and laneway, we presents an energy- efficient clustering routing protocol based on weight (ECRPW) to prolong the lifetime of networks. ECRPW takes into consideration the nodes' residual energy during the election process of cluster heads. The constraint of distance threshold is used to optimize cluster scheme. Furthermore, the protocol also sets up a routing tree based on cluster heads' weight. The results show that ECRPW had better perfor- mance in energy consumption, death ratio of node and network lifetime.展开更多
Based on the deterministic secure quantum communication, we present a novel quantum dialogue protocol with- out information leakage over the collective noise channel. The logical qubits and four-qubit decoherence-free...Based on the deterministic secure quantum communication, we present a novel quantum dialogue protocol with- out information leakage over the collective noise channel. The logical qubits and four-qubit decoherence-free states are introduced for resisting against collective-dephasing noise, collective-rotation noise and all kinds of unitary collective noise, respectively. Compared with the existing similar protocols, the analyses on security and information-theoretical emciency show that the proposed protocol is more secure and emeient.展开更多
In this paper, an optimal resource allocation strategy is proposed to enhance traffic dynamics in complex networks. The network resources are the total node packet-delivering capacity and the total link bandwidth. An ...In this paper, an optimal resource allocation strategy is proposed to enhance traffic dynamics in complex networks. The network resources are the total node packet-delivering capacity and the total link bandwidth. An analytical method is developed to estimate the overall network capacity by using the concept of efficient betweenness （ratio of algorithmic betweenness and local processing capacity）. Three network structures （scale-free, small-world, and random networks） and two typical routing protocols （shortest path protocol and efficient routing protocol） are adopted to demonstrate the performance of the proposed strategy. Our results show that the network capacity is reversely proportional to the average path length for a particular routing protocol and the shortest path protocol can achieve the largest network capacity when the proposed resource allocation strategy is adopted.展开更多
The Wireless Sensor Network(WSN)is a network that is constructed in regions that are inaccessible to human beings.The widespread deployment of wireless micro sensors will make it possible to conduct accurate environme...The Wireless Sensor Network(WSN)is a network that is constructed in regions that are inaccessible to human beings.The widespread deployment of wireless micro sensors will make it possible to conduct accurate environmental monitoring for a use in both civil and military environments.They make use of these data to monitor and keep track of the physical data of the surrounding environment in order to ensure the sustainability of the area.The data have to be picked up by the sensor,and then sent to the sink node where they may be processed.The nodes of the WSNs are powered by batteries,therefore they eventually run out of power.This energy restriction has an effect on the network life span and environmental sustainability.The objective of this study is to further improve the Engroove Leach(EL)protocol’s energy efficiency so that the network can operate for a very long time while consuming the least amount of energy.The lifespan of WSNs is being extended often using clustering and routing strategies.The Meta Inspired Hawks Fragment Optimization(MIHFO)system,which is based on passive clustering,is used in this study to do clustering.The cluster head is chosen based on the nodes’residual energy,distance to neighbors,distance to base station,node degree,and node centrality.Based on distance,residual energy,and node degree,an algorithm known as Heuristic Wing Antfly Optimization(HWAFO)selects the optimum path between the cluster head and Base Station(BS).They examine the number of nodes that are active,their energy consumption,and the number of data packets that the BS receives.The overall experimentation is carried out under the MATLAB environment.From the analysis,it has been discovered that the suggested approach yields noticeably superior outcomes in terms of throughput,packet delivery and drop ratio,and average energy consumption.展开更多
We consider the extrema estimation problem in large-scale radio-frequency identification(RFID)systems,where there are thousands of tags and each tag contains a finite value.The objective is to design an extrema estima...We consider the extrema estimation problem in large-scale radio-frequency identification(RFID)systems,where there are thousands of tags and each tag contains a finite value.The objective is to design an extrema estimation protocol with the minimum execution time.Because the standard binary search protocol wastes much time due to inter-frame overhead,we propose a parameterized protocol and treat the number of slots in a frame as an unknown parameter.We formulate the problem and show how to find the best parameter to minimize the worst-case execution time.Finally,we propose two rules to further reduce the execution time.The first is to find and remove redundant frames.The second is to concatenate a frame from minimum value estimation with a frame from maximum value estimation to reduce the total number of frames.Simulations show that,in a typical scenario,the proposed protocol reduces execution time by 79%compared with the standard binary search protocol.展开更多
基金supports provided by the National Natural Science Foundation of China (No.50904070)the China Postdoctoral Science Foundation (No.20100471009)+2 种基金the National High Technology Research and Development Program of China (Nos. 2008AA062200 and2007AA01Z180)the Key Project of Jiangsu (No. BG2007012)the Science Foundation of China University of Mining and Technology (No. OC080303)
文摘Wireless sensor networks (WSNs) are important application for safety monitoring in underground coal mines, which are difficult to monitor due to natural conditions. Based on the characteristic of limited energy for WSNs in confined underground area such as coal face and laneway, we presents an energy- efficient clustering routing protocol based on weight (ECRPW) to prolong the lifetime of networks. ECRPW takes into consideration the nodes' residual energy during the election process of cluster heads. The constraint of distance threshold is used to optimize cluster scheme. Furthermore, the protocol also sets up a routing tree based on cluster heads' weight. The results show that ECRPW had better perfor- mance in energy consumption, death ratio of node and network lifetime.
基金Supported by the Foundation and Frontier Research Program of Chongqing Science and Technology Commission of China under Grant No cstc2016jcyjA0571
文摘Based on the deterministic secure quantum communication, we present a novel quantum dialogue protocol with- out information leakage over the collective noise channel. The logical qubits and four-qubit decoherence-free states are introduced for resisting against collective-dephasing noise, collective-rotation noise and all kinds of unitary collective noise, respectively. Compared with the existing similar protocols, the analyses on security and information-theoretical emciency show that the proposed protocol is more secure and emeient.
基金Project supported by the National Basic Research Program of China (Grant No. 2012CB725404)the National Natural Science Foundation of China(Grant Nos. 71071044, 71171185, 71201041, 71271075, and 11247291/A05)the Doctoral Program of the Ministry of Education of China (Grant No. 20110111120023)
文摘In this paper, an optimal resource allocation strategy is proposed to enhance traffic dynamics in complex networks. The network resources are the total node packet-delivering capacity and the total link bandwidth. An analytical method is developed to estimate the overall network capacity by using the concept of efficient betweenness （ratio of algorithmic betweenness and local processing capacity）. Three network structures （scale-free, small-world, and random networks） and two typical routing protocols （shortest path protocol and efficient routing protocol） are adopted to demonstrate the performance of the proposed strategy. Our results show that the network capacity is reversely proportional to the average path length for a particular routing protocol and the shortest path protocol can achieve the largest network capacity when the proposed resource allocation strategy is adopted.
基金supported via funding from Prince Sattam Bin Abdulaziz University(No.PSAU/2023/R/1444).
文摘The Wireless Sensor Network(WSN)is a network that is constructed in regions that are inaccessible to human beings.The widespread deployment of wireless micro sensors will make it possible to conduct accurate environmental monitoring for a use in both civil and military environments.They make use of these data to monitor and keep track of the physical data of the surrounding environment in order to ensure the sustainability of the area.The data have to be picked up by the sensor,and then sent to the sink node where they may be processed.The nodes of the WSNs are powered by batteries,therefore they eventually run out of power.This energy restriction has an effect on the network life span and environmental sustainability.The objective of this study is to further improve the Engroove Leach(EL)protocol’s energy efficiency so that the network can operate for a very long time while consuming the least amount of energy.The lifespan of WSNs is being extended often using clustering and routing strategies.The Meta Inspired Hawks Fragment Optimization(MIHFO)system,which is based on passive clustering,is used in this study to do clustering.The cluster head is chosen based on the nodes’residual energy,distance to neighbors,distance to base station,node degree,and node centrality.Based on distance,residual energy,and node degree,an algorithm known as Heuristic Wing Antfly Optimization(HWAFO)selects the optimum path between the cluster head and Base Station(BS).They examine the number of nodes that are active,their energy consumption,and the number of data packets that the BS receives.The overall experimentation is carried out under the MATLAB environment.From the analysis,it has been discovered that the suggested approach yields noticeably superior outcomes in terms of throughput,packet delivery and drop ratio,and average energy consumption.
基金supported by the National Natural Science Foundation of China under Grant Nos.61972199,61672283,61502232,and 61502251the Jiangsu Key Laboratory of Big Data Security Intelligent Processing,Nanjing University of Posts and Telecommunications under Grant No.BDSIP1907,China Postdoctoral Science Foundation under Grant No.2016M601859the Post-Doctoral Fund of Jiangsu Province of China under Grant No.1701047A.
文摘We consider the extrema estimation problem in large-scale radio-frequency identification(RFID)systems,where there are thousands of tags and each tag contains a finite value.The objective is to design an extrema estimation protocol with the minimum execution time.Because the standard binary search protocol wastes much time due to inter-frame overhead,we propose a parameterized protocol and treat the number of slots in a frame as an unknown parameter.We formulate the problem and show how to find the best parameter to minimize the worst-case execution time.Finally,we propose two rules to further reduce the execution time.The first is to find and remove redundant frames.The second is to concatenate a frame from minimum value estimation with a frame from maximum value estimation to reduce the total number of frames.Simulations show that,in a typical scenario,the proposed protocol reduces execution time by 79%compared with the standard binary search protocol.
