• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.96-116
• /
• 2016

Sensing coverage is a fundamental issue for Wireless Sensor Networks (WSNs). Several coverage configuration protocols have been developed; most of them presume the availability of precise knowledge about each node location via GPS receivers. However, equipping each sensor node with a GPS is very expensive in terms of both energy and cost. On the other hand, several GPS-less localization algorithms that aim at obtaining nodes locations with a low cost have been proposed. Although their deep correlation, sensing coverage and localization have long been treated separately. In this paper, we analyze, design and evaluate a novel integrated framework providing both localization and coverage guarantees for WSNs. We integrate the well-known Coverage Configuration Protocol CCP with an improved version of the localization algorithm AT-Dist. We enhanced the original specification of AT-Dist in order to guarantee the necessary localization accuracy required by CCP. In our proposed framework, a few number of nodes are assumed to know their exact positions and dynamically vary their transmission ranges. The remaining sensors positions are derived, as accurately as possible, using this little initial location information. All nodes positions (exact and derived) are then used as an input for the coverage module. Extensive simulation results show that, even with a very low anchor density, our proposal reaches the same performance and efficiency as the ideal CCP based on complete and precise knowledge of sensors coordinates.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.41-49
• /
• 2009

A crucial issue in deploying wireless sensor networks is to perform a sensing task in an area of interest in an energy-efficient manner since sensor nodes have limited energy Power. The most practical solution to solve this problem is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy In this paper, we present a simple wake-up scheduling protocol, which can maintain sensing coverage required by applications and yet increase network lifetime by turning off some redundant nodes. In order to do this, we use the concept of a weighted average distance. A node decides whether it is active or inactive based on the weighted average distance. The proposed protocol allows sensor nodes to sleep dynamically while satisfying the required sensing coverage.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.56-58
• /
• 2006

Sensing and coverage are the two relevant tasks for a sensor network. Quality of sensor network totally depends upon the sensing ability of sensors. In a certain monitored region success of detecting or sensing an object with the help of sensor network tells that how efficiently the network coverage perform. Here in this paper we have proposed a clustering algorithm for the deployment of sensors and thus calculated the object detection probability. Actually by this work we can easily identify the present network coverage status and accordingly can take action for its improvement.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.5
• /
• pp.1084-1090
• /
• 2015

In this paper, we propose a Tabu search algorithm to efficiently deploy the sensor nodes for maximizing the network sensing coverage in wireless sensor networks. As the number of the sensor nodes in wireless sensor networks increases, the amount of calculation for searching the solution would be too much increased. To obtain the best solution within a reasonable execution time in a high-density network, we propose a Tabu search algorithm to maximize the network sensing coverage. In order to search effectively, we propose some efficient neighborhood generating operations of the Tabu search algorithm. We evaluate those performances through some experiments in terms of the maximum network sensing coverage and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.

• Current Optics and Photonics
• /
• v.5 no.6
• /
• pp.606-616
• /
• 2021

A photonic integrated interferometric imaging system possesses the characteristics of small-scale, low weight, low power consumption, and better image quality. It has potential application for replacing conventional large space telescopes. In this paper, the principle of photonic integrated interferometric imaging is investigated. A novel lenslet array arrangement and lenslet pairing approach are proposed, which are helpful in improving spatial frequency coverage. For the novel lenslet array arrangement, two short interference arms were evenly distributed between two adjacent long interference arms. Each lenslet in the array would be paired twice through the novel lenslet pairing approach. Moreover, the image reconstruction model for optical interferometric imaging based on compressed sensing was established. Image simulation results show that the peak signal to noise ratio (PSNR) of the reconstructed image based on compressive sensing is about 10 dB higher than that of the direct restored image. Meanwhile, the normalized mean square error (NMSE) of the direct restored image is approximately 0.38 higher than that of the reconstructed image. Structural similarity index measure (SSIM) of the reconstructed image based on compressed sensing is about 0.33 higher than that of the direct restored image. The increased spatial frequency coverage and image reconstruction approach jointly contribute to better image quality of the photonic integrated interferometric imaging system.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.339-350
• /
• 2009

In wireless sensor networks, the limited battery resources of sensor nodes have a direct impact on network lifetime. To reduce unnecessary power consumption, it is often the case that only a minimum number of sensor nodes operate in active mode while the others are kept in sleep mode. In such a case, however, the network service can be easily unreliable if any active node is unable to perform its sensing or communication function because of an unexpected failure. Thus, for achieving reliable sensing, it is important to maintain the sensing level even when some sensor nodes fail. In this paper, we propose a new fault-tolerance scheme, called FCP(Fault-tolerant Coverage Preserving), that gives an efficient way to handle the degradation of the sensing level caused by sensor node failures. In the proposed FCP scheme, a set of backup nodes are pre-designated for each active node to be used to replace the active node in case of its failure. Experimental results show that the FCP scheme provides enhanced performance with reduced overhead in terms of sensing coverage preserving, the number of backup nodes and the amount of control messages. On the average, the percentage of coverage preserving is improved by 87.2% while the additional number of backup nodes and the additional amount of control messages are reduced by 57.6% and 99.5%, respectively, compared with previous fault-tolerance schemes.

• Journal of the Korea Convergence Society
• /
• v.9 no.8
• /
• pp.33-39
• /
• 2018

In the Internet of Things (IoT) era, objects are connected to each other by wired and wireless networks, and information is exchanged whenever necessary. Channel and network environments change over time; thus, a carrier sensing function that identifies whether signals containing information are present in the channel is essential. The carrier sensing circuit of a wireless communication system determines the receiver sensitivity, and the receiver sensitivity is closely related to the service coverage and service quality of the system. As the receiver sensitivity decreases, the service coverage increases but it becomes sensitive to noise. However, as the receiver sensitivity increases, the service coverage decreases but it becomes insensitive to the noise. Therefore, carrier sensing design and optimization are very important from the viewpoint of the receiver sensitivity and noise sensitivity. This paper proposes an effective carrier sensing technique from the viewpoint of the receiver sensitivity for the long range IoT.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.147-155
• /
• 2015

In this paper, we consider a mobile sensor network for monitoring a polluted area where human beings cannot access. Due to the limited sensing range of individual unmanned vehicles, they need to cooperate to achieve an effective sensing coverage and move to a more polluted region. In order to address the limitations of sensing and communication ranges, we propose a hazardous substance monitoring network based on virtual force algorithms, and develop a testbed. In the considered monitoring network, each unmanned vehicle achieves an optimal coverage and move to the highest interest area based on neighboring nodes sensing values and locations. By using experiments based on the developed testbed, we show that the proposed monitoring network can autonomously move toward a more polluted area and obtain a high weighted coverage.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.70-73
• /
• 2002

This paper describes the way to embody the grid coverage and the grid coverage processor which can construct pipelines. The pipeline constructed by the developed grid coverages has internal pipelines that have different resolution and it provides the way of access to very large datasets efficiently. Several operations, such as filtering, image enhancement and band operation, are embedded in the developed grid coverage and grid coverage processor COM components. The practical usefulness of the developed grid coverage and grid coverage processor has been proven by applying them in developing an image processing software for very large images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.338-348
• /
• 2009

The Wireless Sensor Network (WSN) has recently attracted considerable attention due to the low price and ease to deploy it. In particular, in a hostile or harsh regions where sensors cannot be deployed manually, WSNs can be established just by dropping sensors from the air. In this case, however, most likely sensors are not placed at optimal positions, although the location of sensors does have a drastic impact on the WSN performance. Moreover, randomized deployment algorithm can leave holes in terms of coverage in the sensing area. This paper proposes a sensor relocation scheme where mobile sensors move to patch up the holes by appropriate coverage. Simulation results show that the proposed algorithm outperforms prior existing schemes in terms of coverage and lifespan of WSNs.