In wireless sensor networks (WSNs), the appearance of coverage holes over a large target field is mostly possible. Those holes reduce network performance and may affect the network efficiency. Several approaches were proposed to heal coverage holes in WSNs, but they still suffer from some weaknesses. In this paper we suggest a distributed algorithm, named hybrid hole healing algorithm (3HA), to find the minimum effective patching positions to deploy additional nodes to cover the holes. A hole manager node of each hole is responsible for operating the 3HA algorithm which requires two phases. The first phase finds all candidate patching positions using a Voronoi diagram. It takes all Voronoi vertices within the hole as the initial patching positions list. The second phase reduces as much as possible this list based on integer linear programming and on a probabilistic sensor model. The 3HA algorithm repeats the above phases in rounds, until all Voronoi vertices are covered. Simulation results show that our solution offers a high coverage ratio for various forms and sizes of holes and reduces the number of additional sensors when compared to some algorithms like the Perimeter-based, the Delaunay triangulation-based, the Voronoi-based, and the Trees-based coverage hole healing methods.
The computer-aided design software package DMET (Digital Microwave Engineering Tool), which has been developed to meet the needs of the telecommunication engineering community involved in the design of line-of-sight digital microwave communication routes, is described. DMET can be used either by professionals or engineering students in such a way that efforts can be concentrated on the design objectives of the link rather than on cumbersome and tedious computations. This software package is particularly useful as a tool in teaching communication engineering students the basic practical steps involved in the design of line-of-sight radio communication links. Examples of antenna height computation and radio link budget computation using DMET are presented 相似文献
The problem of computing structure and motion from the observation of points in two distinct images of a scene is considered. The proposed method explicitly utilizes the principle of conservation of distance during rigid-body motion. The formulation is such that it separates the problem of estimating object position from that of determining motion parameters. The equations of invariance of distance for a rigid body are solved for the points' position in space. When these coordinates in space are known, motion parameters are computed in a simple and straightforward manner. Examples are given to illustrate the efficiency of the algorithm 相似文献
Neural Computing and Applications - Induction machines have extensive demand in industries as they are used for large-scale production and, therefore, vulnerable to both electrical and mechanical... 相似文献
This correspondence deals with the computation of structure and motion of rigid objects in space from image positions and optical flow. A test for rigid motion of objects in space is introduced which yields a new formulation of the problem. Assuming a central projection model for the viewing system, it is shown that image positions and optical flow at four points can achieve this perception. 相似文献
In this correspondence, algorithms are introduced to infer surface orientation and structure of visible object surfaces using grid coding. We adopt the active lighting technique to spatially ``encode' the scene for analysis. The observed objects, which can have surfaces of arbitrary shape, are assumed to rest on a plane (base plane) in a scene which is ``encoded' with light cast through a grid plane. Two orthogonal grid patterns are used, where each pattern is obtained with a set of equally spaced stripes marked on a glass pane. The scene is observed through a camera and the object surface orientation is determined using the projected patterns on the object surface. If the surfaces under consideration obey certain smoothness constraints, a dense orientation map can be obtained through proper interpolation. The surface structure can then be recovered given this dense orientation map. Both planar and curved surfaces can be handled in a uniform manner. The algorithms we propose yield reasonably accurate results and are relatively tolerant to noise, especially when compared to shape-from-shading techniques. In contrast to other grid coding techniques reported which match the grid junctions for depth reconstruction under the stereopsis principle, our techniques use the direction of the projected stripes to infer local surface orientation and do not require any correspondence relationship between either the grid lines or the grid junctions to be specified. The algorithm has the ability to register images and can therefore be embedded in a system which integrates knowledge from multiple views. 相似文献
Graft copolymerization of acrylonitrile (AN) onto acetylated chemically modified jute was carried out in the temperature range 40–60°C using V5+-cyclohexanone redox initiator system. The effects of temperature, time, concentrations of metal ion (V5+), monomer (AN), cyclohexanone, some inorganic salts, and organic solvents on percent grafting have been studied. IR spectra of acetylated chemically modified jute and grafted jute have been taken, and their characteristic bands have been identified. Grafting has improved the thermal stability and also the lightfastness rating of jute fibers dyed with basic dyes. 相似文献