Aiming at the defects of the nodes in the low energy adaptive clustering hierarchy (LEACH) protocol, such as high energy consumption and uneven energy consumption, a two-level linear clustering protocol is built. Th...Aiming at the defects of the nodes in the low energy adaptive clustering hierarchy (LEACH) protocol, such as high energy consumption and uneven energy consumption, a two-level linear clustering protocol is built. The protocol improves the way of the nodes distribution at random. The terminal nodes which have not been a two-level cluster head in the cluster can compete with the principle of equivalent possibility, and on the basis of the rest energy of nodes the two-level cluster head is selected at last. The single hop within the cluster and single hop or multiple hops between clusters are used. Simulation experiment results show that the performance of the two-level linear clustering protocol applied to the Hexi corridor agricultural field is superior to that of the LEACH protocol in the survival time of network nodes, the ratio of success, and the remaining energy of network nodes.展开更多
Knowing the locations of nodes in wireless sensor networks (WSN) is essential for many applications. Nodes in a WSN can have multiple capabilities and exploiting one or more of the capabilities can help to solve the l...Knowing the locations of nodes in wireless sensor networks (WSN) is essential for many applications. Nodes in a WSN can have multiple capabilities and exploiting one or more of the capabilities can help to solve the localization problem. In this paper, we assume that each node in a WSN has the capability of distance measurement and present a location computation technique called linear intersection for node localization. We also propose an applied localization model using linear intersection and do some concerned experiments to estimate the location computation algorithm.展开更多
In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such ...In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such highly partitioned scenario,a message ferry needs to travel a long route to access all the sensors and carry the data collected from the sensors to the sink.Typically,practical constraints(e.g.,the energy)preclude a ferry from visiting all sensors in a single tour.In such case,the ferry can only access part of the sensors in each tour and move back to the sink to get the energy refilled.So,the energy-constrained ferry route design(ECFRD)problem is discussed,which leads to the optimization problem of minimizing the total route length of the ferry,while keeping the route length of each tour below a given constraint.The ECFRD problem is proved to be NP-hard problem,and the integer linear programming(ILP)formulation is given.After that,efficient heuristic algorithms are proposed to solve this problem.The experimental results show that the performances of the proposed algorithms are effective in practice compared to the optimal solution.展开更多
In rechargeable wireless sensor networks, a sensor cannot be always benefi cial to conserve energy when a network can harvest excessive energy from the environment due to its energy replenished continually and limited...In rechargeable wireless sensor networks, a sensor cannot be always benefi cial to conserve energy when a network can harvest excessive energy from the environment due to its energy replenished continually and limited energy storage capacity. Therefore, surplus energy of a node can be utilized for strengthening packet delivery efficiency and improving data collection rate. In this work, we propose an algorithm to compute an upper data generation rate that maximizes it as an optimization problem for a network with multiple sinks, which is formulated as a linear programming problem. Subsequently, a dual problem by introducing Lagrange multipliers is constructed, and subgradient algorithms are used to solve it in a distributed manner. The resulting algorithms are guaranteed to converge to an optimal data generation rate, which are illustrated by an example in which an optimum data generation rate is computed for a network of randomly distributed nodes. Through extensive simulation and experiments, we demonstrate our algorithm is efficient to maximize data collection rate in rechargeable wireless sensor networks.展开更多
Approaches based on integer linear programming have been recently proposed for topology optimization in wireless sensor networks. They are, however, based on over-theoretical, unrealistic models. Our aim is to show th...Approaches based on integer linear programming have been recently proposed for topology optimization in wireless sensor networks. They are, however, based on over-theoretical, unrealistic models. Our aim is to show that it is possible to accommodate realistic models for energy consumption and communication protocols into integer linear programming. We analyze the maximum lifetime broadcasting topology problem and we present realistic models that are also shown to provide efficient and practical solving tools. We present a strategy to substantially speed up the convergence of the solving process of our algorithm. This strategy introduces a practical drawback, however, in the characteristics of the optimal solutions retrieved. A method to overcome this drawback is discussed. Computational experiments are reported.展开更多
In this paper,an Adaptive-Weighted Time-Dimensional and Space-Dimensional(AWTDSD) data aggregation algorithm for a clustered sensor network is proposed for prolonging the lifetime of the network as well as improving t...In this paper,an Adaptive-Weighted Time-Dimensional and Space-Dimensional(AWTDSD) data aggregation algorithm for a clustered sensor network is proposed for prolonging the lifetime of the network as well as improving the accuracy of the data gathered in the network.AWTDSD contains three phases:(1) the time-dimensional aggregation phase for eliminating the data redundancy;(2) the adaptive-weighted aggregation phase for further aggregating the data as well as improving the accuracy of the aggregated data; and(3) the space-dimensional aggregation phase for reducing the size and the amount of the data transmission to the base station.AWTDSD utilizes the correlations between the sensed data for reducing the data transmission and increasing the data accuracy as well.Experimental result shows that AWTDSD can not only save almost a half of the total energy consumption but also greatly increase the accuracy of the data monitored by the sensors in the clustered network.展开更多
Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied af...Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied after random deployment.In this paper,we study how mobile sensors can be efficiently relocated to achieve k-barrier coverage.In particular,two problems are studied:relocation of sensors with minimum number of mobile sensors and formation of k-barrier coverage with minimum energy cost.These two problems were formulated as 0–1 integer linear programming(ILP).The formulation is computationally intractable because of integrality and complicated constraints.Therefore,we relax the integrality and complicated constraints of the formulation and construct a special model known as RELAX-RSMN with a totally unimodular constraint coefficient matrix to solve the relaxed 0–1 ILP rapidly through linear programming.Theoretical analysis and simulation were performed to verify the effectiveness of our approach.展开更多
Linear topology is useful in several pervasive application scenarios. Even though a linear topology can be handled by unspecific routing algorithms over general purpose MAC protocols, better performance can be obtaine...Linear topology is useful in several pervasive application scenarios. Even though a linear topology can be handled by unspecific routing algorithms over general purpose MAC protocols, better performance can be obtained by specialized techniques. This paper describes a new communication scheme called Wireless Wire (WiWi), which builds up a bidirectional wireless communication channel with deterministic properties in terms of throughput and latency over a strip of pervasive devices with short-range transmission capabilities. The system is synchronous and fault tolerant. With low cost and extremely simple devices, WiWi builds up a “wire-like” dielectric link, but its applications are not limited to end-to-end communications. For example, WiWi can be used to collect data from sensors along the path, thus acting as a virtual conveyor belt.展开更多
针对轮胎路面接触三向力传感器维间耦合解耦困难的问题,提出基于线性整流函数(rectified linear unit, ReLU)神经网络的解耦算法。以三向力传感器作为研究对象,首先进行单轴加载的静态标定试验,并分析3个方向下单轴加载的耦合力,然后应...针对轮胎路面接触三向力传感器维间耦合解耦困难的问题,提出基于线性整流函数(rectified linear unit, ReLU)神经网络的解耦算法。以三向力传感器作为研究对象,首先进行单轴加载的静态标定试验,并分析3个方向下单轴加载的耦合力,然后应用基于线性整流函数神经网络解耦算法以及传统的解耦算法对试验数据进行数值解耦。分析比较试验数据,所提算法得到的最大Ⅰ类误差、Ⅱ类误差分别为0.91%、0.87%,而传统算法最大Ⅰ类误差、Ⅱ类误差分别为3.08%、11.95%,进一步提高了三向力传感器的测量精度。展开更多
The Wireless Sensor Networks(WSNs)used for the monitoring applications like pipelines carrying oil,water,and gas;perimeter surveillance;border monitoring;and subway tunnel monitoring form linearWSNs.Here,the infrastru...The Wireless Sensor Networks(WSNs)used for the monitoring applications like pipelines carrying oil,water,and gas;perimeter surveillance;border monitoring;and subway tunnel monitoring form linearWSNs.Here,the infrastructure being monitored inherently forms linearity(straight line through the placement of sensor nodes).Therefore,suchWSNs are called linear WSNs.These applications are security critical because the data being communicated can be used for malicious purposes.The contemporary research of WSNs data security cannot fit in directly to linear WSN as only by capturing few nodes,the adversary can disrupt the entire service of linear WSN.Therefore,we propose a data aggregation scheme that takes care of privacy,confidentiality,and integrity of data.In addition,the scheme is resilient against node capture attack and collusion attacks.There are several schemes detecting the malicious nodes.However,the proposed scheme also provides an identification of malicious nodes with lesser key storage requirements.Moreover,we provide an analysis of communication cost regarding the number of messages being communicated.To the best of our knowledge,the proposed data aggregation scheme is the first lightweight scheme that achieves privacy and verification of data,resistance against node capture and collusion attacks,and malicious node identification in linear WSNs.展开更多
基于TSMC 0.13μm CMOS工艺设计了一款适用于无线传感网络、工作频率为300~400 MHz的两级功率放大器。功率放大器驱动级采用共源共栅结构,输出级采用了3-stack FET结构,采用线性化技术改进传统偏置电路,提高了功率放大器线性度。电源电...基于TSMC 0.13μm CMOS工艺设计了一款适用于无线传感网络、工作频率为300~400 MHz的两级功率放大器。功率放大器驱动级采用共源共栅结构,输出级采用了3-stack FET结构,采用线性化技术改进传统偏置电路,提高了功率放大器线性度。电源电压为3.6 V,芯片面积为0.31 mm×0.35 mm。利用Cadence Spectre RF软件工具对所设计的功率放大器电路进行仿真,结果表明,工作频率为350 MHz时,功率放大器的饱和输出功率为24.2 d Bm,最大功率附加效率为52.5%,小信号增益达到38.15 d B。在300~400 MHz频带内功率放大器的饱和输出功率大于23.9 d Bm,1 d B压缩点输出功率大于22.9 d Bm,最大功率附加效率大于47%,小信号增益大于37 d B,增益平坦度小于±0.7 d B。展开更多
基金supported by the Foundation Projects in Gansu Province Department of Education under Grant No.2015A-163
文摘Aiming at the defects of the nodes in the low energy adaptive clustering hierarchy (LEACH) protocol, such as high energy consumption and uneven energy consumption, a two-level linear clustering protocol is built. The protocol improves the way of the nodes distribution at random. The terminal nodes which have not been a two-level cluster head in the cluster can compete with the principle of equivalent possibility, and on the basis of the rest energy of nodes the two-level cluster head is selected at last. The single hop within the cluster and single hop or multiple hops between clusters are used. Simulation experiment results show that the performance of the two-level linear clustering protocol applied to the Hexi corridor agricultural field is superior to that of the LEACH protocol in the survival time of network nodes, the ratio of success, and the remaining energy of network nodes.
基金Supported in part by the project of Science & Technology Department of Shanghai (05dz15004)
文摘Knowing the locations of nodes in wireless sensor networks (WSN) is essential for many applications. Nodes in a WSN can have multiple capabilities and exploiting one or more of the capabilities can help to solve the localization problem. In this paper, we assume that each node in a WSN has the capability of distance measurement and present a location computation technique called linear intersection for node localization. We also propose an applied localization model using linear intersection and do some concerned experiments to estimate the location computation algorithm.
基金Projects(61272139,61070199,61103182)supported by the National Natural Science Foundation of ChinaProject(2013ZX01028001-002)supported by the National Science and Technology Major Projects of China+1 种基金Project(2011AA01A103)supported by theNational High-Tech Research and Development Plan of ChinaProject(11JJ7003)supported by Hunan Provincial Natural ScienceFoundation of China
文摘In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such highly partitioned scenario,a message ferry needs to travel a long route to access all the sensors and carry the data collected from the sensors to the sink.Typically,practical constraints(e.g.,the energy)preclude a ferry from visiting all sensors in a single tour.In such case,the ferry can only access part of the sensors in each tour and move back to the sink to get the energy refilled.So,the energy-constrained ferry route design(ECFRD)problem is discussed,which leads to the optimization problem of minimizing the total route length of the ferry,while keeping the route length of each tour below a given constraint.The ECFRD problem is proved to be NP-hard problem,and the integer linear programming(ILP)formulation is given.After that,efficient heuristic algorithms are proposed to solve this problem.The experimental results show that the performances of the proposed algorithms are effective in practice compared to the optimal solution.
基金supported by The Natural Science Foundation of Jiangsu Province of China(Grant No.BK20141474)funded by China Postdoctoral Science Foundation(Grant No.2015M571639)+3 种基金three Projects Funded by The Jiangsu Planned Projects for Postdoctoral Research Funds(Grant No.1402018C)The Key Laboratory of Computer Network and Information Integration(Southeast University)Ministry of Education(Grant No.K93-9-2015-09C)The Priority Academic Program Development(PAPD)of Jiangsu Higher Education Institutions
文摘In rechargeable wireless sensor networks, a sensor cannot be always benefi cial to conserve energy when a network can harvest excessive energy from the environment due to its energy replenished continually and limited energy storage capacity. Therefore, surplus energy of a node can be utilized for strengthening packet delivery efficiency and improving data collection rate. In this work, we propose an algorithm to compute an upper data generation rate that maximizes it as an optimization problem for a network with multiple sinks, which is formulated as a linear programming problem. Subsequently, a dual problem by introducing Lagrange multipliers is constructed, and subgradient algorithms are used to solve it in a distributed manner. The resulting algorithms are guaranteed to converge to an optimal data generation rate, which are illustrated by an example in which an optimum data generation rate is computed for a network of randomly distributed nodes. Through extensive simulation and experiments, we demonstrate our algorithm is efficient to maximize data collection rate in rechargeable wireless sensor networks.
文摘Approaches based on integer linear programming have been recently proposed for topology optimization in wireless sensor networks. They are, however, based on over-theoretical, unrealistic models. Our aim is to show that it is possible to accommodate realistic models for energy consumption and communication protocols into integer linear programming. We analyze the maximum lifetime broadcasting topology problem and we present realistic models that are also shown to provide efficient and practical solving tools. We present a strategy to substantially speed up the convergence of the solving process of our algorithm. This strategy introduces a practical drawback, however, in the characteristics of the optimal solutions retrieved. A method to overcome this drawback is discussed. Computational experiments are reported.
基金Supported by the Promotive Research Fund for Excellent Young and Middle-aged Scientists of Shandong Province(No.BS2010DX010)the Project of Higher Educational Science and Technology Program of Shandong Province(No.J12LN36)
文摘In this paper,an Adaptive-Weighted Time-Dimensional and Space-Dimensional(AWTDSD) data aggregation algorithm for a clustered sensor network is proposed for prolonging the lifetime of the network as well as improving the accuracy of the data gathered in the network.AWTDSD contains three phases:(1) the time-dimensional aggregation phase for eliminating the data redundancy;(2) the adaptive-weighted aggregation phase for further aggregating the data as well as improving the accuracy of the aggregated data; and(3) the space-dimensional aggregation phase for reducing the size and the amount of the data transmission to the base station.AWTDSD utilizes the correlations between the sensed data for reducing the data transmission and increasing the data accuracy as well.Experimental result shows that AWTDSD can not only save almost a half of the total energy consumption but also greatly increase the accuracy of the data monitored by the sensors in the clustered network.
基金supported by the NSFC(U1536206,61232016,U1405254,61373133,61502242,71401176)BK20150925the PAPD fund
文摘Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied after random deployment.In this paper,we study how mobile sensors can be efficiently relocated to achieve k-barrier coverage.In particular,two problems are studied:relocation of sensors with minimum number of mobile sensors and formation of k-barrier coverage with minimum energy cost.These two problems were formulated as 0–1 integer linear programming(ILP).The formulation is computationally intractable because of integrality and complicated constraints.Therefore,we relax the integrality and complicated constraints of the formulation and construct a special model known as RELAX-RSMN with a totally unimodular constraint coefficient matrix to solve the relaxed 0–1 ILP rapidly through linear programming.Theoretical analysis and simulation were performed to verify the effectiveness of our approach.
文摘Linear topology is useful in several pervasive application scenarios. Even though a linear topology can be handled by unspecific routing algorithms over general purpose MAC protocols, better performance can be obtained by specialized techniques. This paper describes a new communication scheme called Wireless Wire (WiWi), which builds up a bidirectional wireless communication channel with deterministic properties in terms of throughput and latency over a strip of pervasive devices with short-range transmission capabilities. The system is synchronous and fault tolerant. With low cost and extremely simple devices, WiWi builds up a “wire-like” dielectric link, but its applications are not limited to end-to-end communications. For example, WiWi can be used to collect data from sensors along the path, thus acting as a virtual conveyor belt.
文摘针对轮胎路面接触三向力传感器维间耦合解耦困难的问题,提出基于线性整流函数(rectified linear unit, ReLU)神经网络的解耦算法。以三向力传感器作为研究对象,首先进行单轴加载的静态标定试验,并分析3个方向下单轴加载的耦合力,然后应用基于线性整流函数神经网络解耦算法以及传统的解耦算法对试验数据进行数值解耦。分析比较试验数据,所提算法得到的最大Ⅰ类误差、Ⅱ类误差分别为0.91%、0.87%,而传统算法最大Ⅰ类误差、Ⅱ类误差分别为3.08%、11.95%,进一步提高了三向力传感器的测量精度。
文摘The Wireless Sensor Networks(WSNs)used for the monitoring applications like pipelines carrying oil,water,and gas;perimeter surveillance;border monitoring;and subway tunnel monitoring form linearWSNs.Here,the infrastructure being monitored inherently forms linearity(straight line through the placement of sensor nodes).Therefore,suchWSNs are called linear WSNs.These applications are security critical because the data being communicated can be used for malicious purposes.The contemporary research of WSNs data security cannot fit in directly to linear WSN as only by capturing few nodes,the adversary can disrupt the entire service of linear WSN.Therefore,we propose a data aggregation scheme that takes care of privacy,confidentiality,and integrity of data.In addition,the scheme is resilient against node capture attack and collusion attacks.There are several schemes detecting the malicious nodes.However,the proposed scheme also provides an identification of malicious nodes with lesser key storage requirements.Moreover,we provide an analysis of communication cost regarding the number of messages being communicated.To the best of our knowledge,the proposed data aggregation scheme is the first lightweight scheme that achieves privacy and verification of data,resistance against node capture and collusion attacks,and malicious node identification in linear WSNs.
文摘基于TSMC 0.13μm CMOS工艺设计了一款适用于无线传感网络、工作频率为300~400 MHz的两级功率放大器。功率放大器驱动级采用共源共栅结构,输出级采用了3-stack FET结构,采用线性化技术改进传统偏置电路,提高了功率放大器线性度。电源电压为3.6 V,芯片面积为0.31 mm×0.35 mm。利用Cadence Spectre RF软件工具对所设计的功率放大器电路进行仿真,结果表明,工作频率为350 MHz时,功率放大器的饱和输出功率为24.2 d Bm,最大功率附加效率为52.5%,小信号增益达到38.15 d B。在300~400 MHz频带内功率放大器的饱和输出功率大于23.9 d Bm,1 d B压缩点输出功率大于22.9 d Bm,最大功率附加效率大于47%,小信号增益大于37 d B,增益平坦度小于±0.7 d B。