Optimal deployment in randomly deployed heterogeneous WSNs: A connected coverage approach

Date

2014-11-01

Author

SEVGİ, CÜNEYT
Koçyiğit, Altan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

376
views

0
downloads

Wireless sensor networks (WSNs) are resource-scarce networks and the optimization of the resources is challenging. As far as random deployment is concerned, the optimization of these resources becomes even more difficult In this paper, a novel framework is proposed for solving optimal deployment problems for randomly deployed and clustered WSNs. In several existing approaches to solve these problems, either only partial-coverage is considered or only connectivity is analyzed when full-coverage is assured. Through this study, we aim to contribute to the better understanding of partial connected coverage. For this purpose, we introduce cluster size formulations which provide network designers with estimating partial-coverage easily. While the proposed framework facilitates our cluster size formulations for coverage estimations, it also adopts the percolation theory to analyze the degree of connectivity when the targeted degree of partial-coverage is achieved. As the partial connected coverage approach reflects real-life deployment scenarios, the use of percolation theory results in generic solutions of optimal deployment problems, which indeed makes the solution independent from any routing algorithms. Moreover, a practical optimal deployment problem is formulated to find the cheapest WSN application that satisfies the targeted degree of partial connected coverage. Further, in this paper, the cost effectiveness of the node heterogeneity is investigated through comparing the heterogeneous WSNs with their homogeneous counterparts.

Subject Keywords

Connected Coverage, Clustering, Optimal Deployment, Cost Effectiveness, Node Heterogeneity

URI

https://hdl.handle.net/11511/32554

Journal

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS

DOI

https://doi.org/10.1016/j.jnca.2014.09.004

Collections

Graduate School of Informatics, Article

Suggestions

OpenMETU
Core

Immune system-based energy efficient and reliable communication in wireless sensor networks Atakan, Baris; Akan, Oezguer B. (2006-12-01) Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of densely deployed sensor nodes. Due to the dense deployment, since sensor observations are spatially correlated with respect to location of sensor nodes, it may not be necessary for every sensor node to transmit its data. Therefore, due to the resource constraints of sensor nodes, it is imperative to select the minimum number of sensor nodes to transmit the data to the sink. Furthermore, to achieve the application-s...
An energy aware fuzzy approach to unequal clustering in wireless sensor networks Bagci, Hakan; Yazıcı, Adnan (2013-04-01) In order to gather information more efficiently in terms of energy consumption, wireless sensor networks (WSNs) are partitioned into clusters. In clustered WSNs, each sensor node sends its collected data to the head of the cluster that it belongs to. The cluster-heads are responsible for aggregating the collected data and forwarding it to the base station through other cluster-heads in the network. This leads to a situation known as the hot spots problem where cluster-heads that are closer to the base stati...
Information-centric sensor networks for cognitive IoT: an overview Al-Turjman, Fadi M. (2017-02-01) Information-centric sensor networks (ICSNs) are a paradigm of wireless sensor networks that focus on delivering information from the network based on user requirements, rather than serving as a point-to-point data communication network. Introducing learning in such networks can help to dynamically identify good data delivery paths by correlating past actions and results, make intelligent adaptations to improve the network lifetime, and also improve the quality of information delivered by the network to the ...
Path planning and localization for mobile anchor based wireless sensor networks Erdemir, Ecenaz; Tuncer, Temel Engin; Department of Electrical and Electronics Engineering (2017) In wireless sensor networks, sensors with limited resources are distributed in a wide area. Localizing the sensors is an important problem. Anchor nodes with known positions are used for sensor localization. A simple and efficient way of generating anchor nodes is to use mobile anchors which have built-in GPS units. In this thesis, a single mobile anchor is used to traverse the region of interest to communicate with the sensor nodes and identify their positions. Therefore planning the best trajectory for th...
Immune system based distributed node and rate selection in wireless sensor networks Atakan, Baris; Akan, Ozguer B. (2006-12-13) Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of dense deployed sensor nodes. Due to the dense deployment, since sensor observations are spatially correlated with respect to spatial location of sensor nodes, it may not be necessary for every sensor node to transmit its data. Therefore, due to the resource constraints of sensor nodes it is needed to select the minimum number of sensor nodes to transmit the data to the sink. Furthermore, to achieve the application-...

Citation Formats

C. SEVGİ and A. Koçyiğit, “Optimal deployment in randomly deployed heterogeneous WSNs: A connected coverage approach,” JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, pp. 182–197, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/32554.