Search

Copyright of Journal of South-Central Minzu University (Natural Science Edition) is the property of Journal of South-Central Minzu University (Natural Science Edition) Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Henan University of Science & Technology, Natural Science is the property of Editorial Office of Journal of Henan University of Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order Lo improve Lhe lifeLime of K - barrier coverage, Lhis study combines energy harvesling Lechnology with mobile sensor network to constmct K - barrier coverage, and proposes BCAS algorithm. K + 1 barriers are constructed by dividing sub - areas to divide the entire time into multiple time slots. Before the start of each time slot, K barriers are selected with the largest average remaining energy for activation. After each time slot, redundant sensors are scheduled, and the sensors whose remaining energy in the fence is less than the threshold are moved and replaced, and Lhe life of Lhe nelwork is prolonged Lhrough mulliple rounds of scheduling. Simulalion experimenls show Lhal compared wilh the MobiBar algorilhm and the Single Sensor algorithm, BCAS algorilhm extends Lhe life cycle of the barrier network by an average of 183 % . In tem1s of the average moving distance of the barrier constmction, the BCAS algorithm reduces by 20. 6% and 12 % respectively when compared with the MobiBar algorithm and the Single Sensor algorithm. [ABSTRACT FROM AUTHOR]

The coverage of traditional wireless sensor networks (WSNs) is limited by node energy and data redundancy, forcing WSNs to be interrupted abnormally. To this end, a novel optimization cooperative coverage algorithm with controllable threshold-parameters (OCC-CT) is proposed. The algorithm first determines the location information of the focus target nodes (FTNs), and uses the genetic algorithm (GA) to give the node path planning. Second, the controllable threshold parameters and mutation parameters are used to control event domain nodes. Clustering is optimized to make the clustering of the nodes more uniform, so as to reduce the energy consumption of the nodes and improve the search ability of the global target nodes. Third, the adaptation function is used to cover the continuity of the covered target locations and the monitoring range of the nodes. Optimization is performed to achieve the goals of increasing network coverage and extending the network lifetime. Finally, simulation results show that the OCC-CT algorithm, compared with other three algorithms in this paper, improves 0.11 and 0.16 on average in terms of network coverage, network lifetime, and 0.14 in terms of network energy overhead, thereby further verifying OCC-CT algorithm has strong stability and effectiveness.

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Heilongjiang University of Science & Technology is the property of Journal of Heilongjiang University of Science & Technology Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

We propose a multi-hop image transmission (MHIT) mechanism for the heterogeneous wireless multimedia sensor network (WMSN) composed of common nodes and image nodes ; where the images are compressed by the nodes in the nodes? neighborhood. According to the hop count and distance, the image node determines whether or not the image should be compressed before transmission. If it costs more energy to compress the image, the image will be sent directly. Otherwise, the task of image compression is distributed to the nodes in the neighborhood, which can balance the network energy consumption and help ease the energy burden on the image nodes. Experimental results show that the proposed mechanism can effectively solve the problem of energy hole caused by the image compression in the WMSN ? and significantly prolong the network lifetime. So it is well suited for remote image transmission in large-scale WMSN. [ABSTRACT FROM AUTHOR]

The wireless sensor network routing algorithm based on geographical position only focuses on the geographic information. We propose a multi-path routing algorithm based on energy of nodes. We use geographic location and energy to establish a 3D coordinate system and calculate the probability of the next hop according to the effective forward distance and the energy of neighbor nodes. The energy consumption is scattered in the neighbor nodes which are effective to move forward so the network survival time is prolonged. Routing holes are reduced and delayed. Experimental results show that the number of dead nodes, surviving nodes and routing holes are significantly improved in comparison with the two-phase geographic greedy forwarding (TPGF) algorithm. The validity of the algorithm is verified. [ABSTRACT FROM AUTHOR]

Focusing on the hot spot problem in many to one wireless sensor networks， an unequal clustering data gathering algorithm based on multiple criteria decision (UCDGAMCD) was proposed. The intuitionistic fuzzy analytic hierarchy process and multiple criteria decision making of hierarchical fuzzy integral were used to select cluster heads (CHs)， and a new cluster head competition radius was proposed to make it fit for the network scenarios with energy heterogeneous and nodes non-uniform distribution. To balance energy consumption， a routing algorithm with data ratio distribution was proposed based on residual energy of CHs and transmission energy consumption. The simulation results demonstrated that UCDGAMCD can obtain higher network lifetime in two scenarios—node uniform and non-uniform deployment. [ABSTRACT FROM AUTHOR]

To solve the problems of high energy consumption, large number of iterations and unrealistic assumption of ideal link in the existing lifetime maximization algorithms in wireless sensor networks(WSNs), the efficient distributed link quality-aware algorithms wrere proposed, which took the link quality into account when calculated the load of a node. Two methods wrere proposed for a switching node to choose a new parent. One considered the hop count, and the other ignored the hop count. Furthermore, a prediction strategy wras developed to predict the path load of the new parent assuming the switching node had switched to the new parent. If the predicted path load wras greater than the path load of the current parent before switching, then the switching node would not switch to the new parent. This prediction strategy made sure that each switching of node made the network more load-balanced, which results in faster convergence of the algorithm. Hie simulation results demonstrate that our algorithms outperform the existing algorithms in terms of network lifetime, energy consumption, and rate of convergence. [ABSTRACT FROM AUTHOR]

According to the nodes deployed randomly in the large scale wireless sensor networks, this paper proposed a new clustering algorithm to prolong the network lifetime and improve the location accuracy. Hie algorithm selected the optimal node set based on the discrete particle swarm optimization algorithm by trading off the networks energy consumption, the energy load balance and the location accuracy. Furthermore, the selected node sets were grouped into cluster for further location. The simulation analysis was carried out under the RSS1/TD0A two rounds cooperative location scheme. Simulation results show that this algorithm guarantees the member nodes multi-hop communication in the cluster, improves the location accuracy and prolongs the network lifetime. [ABSTRACT FROM AUTHOR]

To prolong WSN lifetime. this paper proposed residual energy and distance based clustering protocol for heteroge­neous WSN. The protocol considered three varieties of nodes i. e. , normal, intermediate and advanced nodes. Nodes with higher battery energy were designated as advanced and intermediate nodes, and the remaining nodes were conventional normal nodes. The CH (cluster head) was selected based on residual energy and distance between nodes and base station, so that nodes with more residual energy had more election probability in the process of cluster head election. It also avoided reducing network lifetime caused by making the nodes with less residual energy act as CH. It balanced the energy consumption of network and prolonged the network survival time. Simulation results show that the proposed RDEC protocol has a longer lifetime and more good capacity of data transmission than LEACH.DDEEC and SEP protocol. [ABSTRACT FROM AUTHOR]

In order to solve the uneven distribution of energy consumption in the traditional random deployment wireless sensor network (WSNs) signal transmission algorithm, which influenced the network lifetime, this paper proposed multi ring Poisson index load distribution for WSNs signal transmission mechanism. Firstly, the sink node sended “HELLO” packet to construct the multi ring data transmission partition mechanism. Secondly, it proposed the waiting time form for data packet sending, meanwhile, through theoretical analysis and numerical analysis, it designed the multi ring poisson exponential distribution form of node energy consumption. The simulation test in the network simulator NS-2 shows that, this algorithm has more uniform energy distribution than the two existing algorithms, and also the longer network lifetime. [ABSTRACT FROM AUTHOR]

To solve the poor performance of presented algorithm in solving the connected target coverage problem in directional sensor networks (DSN), this paper used distributed learning automata (DLA) to design a new scheduling algorithm. It employed the DLA to determine the sensors that should be activated at each stage for monitoring all the targets and transmitting the sensing data to the sink. It devised several pruning rules in order to maximize network lifetime. The proposed algorithm selected sensing nodes with as few overlapped targets as possible and avoided the selection of critical sensors as relay nodes so as to prolong the total network lifetime. Experimental results show that proposed algorithm can effectively resolve the connected target coverage problem, it is better than advanced algorithm in extending network lifetime. [ABSTRACT FROM AUTHOR]

The node energy in wireless video sensor networks is limited by many factors. How to take advantage of the limited energy is one of key research issues recently. The focus of this paper was on investigating a video correlation communication (VCCP) protocol based on content related sensing. It optimized topical WSN routing protocol through mathematical model. The purpose was to save network bandwidth and energy, as a result to prolong network lifecycle. It compressed the redundant data while satisfying the requirement in video transmission quality. In addition, this paper introduced angular adjustment and pseudo cluster head protocols to improve overall coverage rate of monitoring region, therefore avoiding coverage rate reduction in specific region. The simulation result shows that the proposed VCCP can prolong network lifecycle and enhance coverage rate of monitoring region to some extent. [ABSTRACT FROM AUTHOR]

Wireless sensor networks comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. However, the energy harvested has brought great challenges to the existing energy management strategy. In particular, both energy harvested and data packets are modeled to arrive at the source node randomly. Aiming to maximize the number of bits delivered by a deadline, this paper introduced interior penalty function method to optimize transmission scheduling on energy harvesting wireless sensor node. Theoretical analysis and simulation results show that optimal data transmission will be done with the equal transmission power. In an optimal energy harvested wireless sensor networks, the node's transmission power always increases gradually with time to maximizing the delivered data. [ABSTRACT FROM AUTHOR]

The problem of unbalanced energy consumption and transmission delay in Wireless Sensor Network(WSN)is studied, and a novel routing algorithm is proposed. By establishing the minimum hop count and protecting the remaining energy of the nodes, the algorithm makes packets traverse to Sink nodes through the paths with optimized energy. Simulation is carried out in MATLAB and it proves that the algorithm can balance energy consumption and increase the network lifetime. [ABSTRACT FROM AUTHOR]

In this paper, we study the optimal network lifetime problem in the amplification-forward (AF) relay cooperative communication network and propose an optimal energy equilibrium (OEE) relay node selection scheme to maximize the lifetime of cooperation multi-relay communication network. First, we get the destination terminals bit error rate (BER) expression of two-hop AF relay by calculating the each hops receiving SNR of AF relay. And then, we introduce the optimal factor to effectively select the forward relay for further extending network lifetime by combining the nodes residual energy information and channel state information (CSI) and exploiting the thought of energy equilibrium. The theoretical analysis and simulation results show that the proposed relay selection scheme can effectively enhance the network lifetime and obviously improve the bite error rate (BER) performance compared with CSI relay selection scheme and fuzzy comprehensive e-valuation (FCE) relay selection scheme. [ABSTRACT FROM AUTHOR]

To realize the long-distance wireless communication, relay nodes were added in wireless sensor network (WSN), and multi-hop routing was adopted to transmit the data. For the problem of relay node placement, this paper presented a relay node greedy placement algorithm on the basis of the characteristic of linear structure, which could make overall energy consumption of the network minimal. The algorithm used constraints methods, such as greedy strategy, relay node communication capacity and data forwarding hop count of sensor nodes, to astrict the locations of relay nodes. The theory and experiment verify the greedy algorithm can effectively reduce the energy consumption and extend the network lifetime. [ABSTRACT FROM AUTHOR]

In this paper, we describe the network lifetime as a function of energy consumption of communication and data aggregation and analyze the lifetime of different communication modes in the homogeneous sensor networks. The analysis carried out in this paper provides guidelines for network deployment and protocol design in future applications. [ABSTRACT FROM AUTHOR]