دانلود رایگان مقاله لاتین الگوریتم برای ساخت شبکه حسگر بی سیم از سایت الزویر
عنوان فارسی مقاله:
درخت گره اشتاینر وزین محدود شده مبتنی بر الگوریتم ها برای ساخت شبکه های حسگر بی سیم برای پوشش حداکثر شبکه مربعی بحرانی وزین
عنوان انگلیسی مقاله:
Constrained node-weighted Steiner tree based algorithms for constructing a wireless sensor network to cover maximum weighted critical square grids
سال انتشار : 2015
برای دانلود رایگان مقاله الگوریتم برای ساخت شبکه حسگر بی سیم اینجا کلیک نمایید.
مقدمه انگلیسی مقاله:
1. Introduction
Due to the growth and advances in networking and electronic hardware techniques, wireless sensor networks have developed rapidly. In a wireless sensor network, many small sensors are deployed in a field to detect the environment and collect sensing data, such as temperature, humidity, or light data. Each sensor can process, compute, and transfer data to others in wireless sensor networks. Many applications based on the wireless sensor networks have been developed [1–6], such as medical safety protection, fire and explosion monitors, and environment monitors. Because the efficiency of the wireless sensor network is often related to the sensor deployment, the coverage problem has thus become a hot research topic, and is studied in this paper. In the coverage problem, barrier coverage is a typical problem for applications for theft prevention and illegal intruder monitoring. For these applications, when an illegal intruder comes into a barrier coverage area, at least one sensor in the area will detect the event to ensure area security. In [7], methods are proposed to select and activate minimum sensors from sensors that are randomly deployed in a field to form barrier coverage. In [8], a sink-constructed barrier coverage method is proposed to construct virtual barrier coverage for optimizing the detection degree, detection quality, and transmission latency of a wireless sensor network. In [9,10], methods are proposed to schedule mobile sensors to construct barrier coverage in order to eliminate blind spots. In [11], the deployment for barrier coverage is studied when sensors are dropped from an aircraft along a given path. The study shows that the barrier coverage of line-based normal random offset distribution provides better performance than that of the Poisson model.
برای دانلود رایگان مقاله الگوریتم برای ساخت شبکه حسگر بی سیم اینجا کلیک نمایید.
کلمات کلیدی:
Ngoc Tu Nguyen - Google Scholar Citations https://scholar.google.com/citations?user=j2gQiKQAAAAJ Missouri University of Science and Technology - mst.edu A Maximum-Weight-Independent-Set-Based Algorithm for Reader-Coverage ... for constructing a wireless sensor network to cover maximum weighted critical ... Tu N. Nguyen, Ngoc Tu (Ryan) Nguyen's Homepage web.mst.edu/~nguyennt/ Jan 7, 2017 - Design and Analysis of Algorithms; Wireless sensor networks; RFID systems; Distributed .... "Constrained node-weighted steiner tree based algorithms for constructing a wireless sensor network to cover maximum weighted ... Algorithms For Wireless Sensor Networks - UF CISE - University of ... https://www.cise.ufl.edu/~sahni/papers/sensors.pdf by S Sahni - 2004 - Cited by 80 - Related articles Sep 7, 2004 - Keywords: Wireless sensor networks, algorithms, routing, coverage, fusion. .... distributed potential-field-based algorithm to self deploy mobile sensors ... that the constructed deployment covers all of the given points and is a connected network. ..... Let the length of a path be the maximum weight of its edges. Advances in Wireless Sensor Networks: 7th China Conference, CWSN ... https://books.google.com/books?isbn=364254522X Limin Sun, Huadong Ma, Feng Hong - 2014 - Computers In [5], Alzoubi et al. proposed a algorithm for constructing a connected ... based algorithm to construct a minimum connected dominating set in a WSN, where the ... a O(logΔ)-approximation for constructing a MCDS, where Δ is the maximum ... on a dynamic programming algorithm for a min-weight chromatic disk cover. Lifetime Maximization for Connected Target Coverage in Wireless ... ieeexplore.ieee.org/iel5/90/4359146/04457911.pdf?arnumber=4457911 develop a faster heuristic algorithm based on the approximation al- gorithm called Communication Weighted Greedy Cover (CWGC) algorithm and present a ... WSN cannot guarantee certain coverage and/or connectivity re- quirements. .... In Section III, we introduce the maximum cover tree (MCT) problem, prove its. A weight-based greedy algorithm for target coverage ... - IEEE Xplore ieeexplore.ieee.org/document/6914159/ by B Diop - 2014 - Cited by 5 - Related articles An important issue addressed in wireless sensor networks is the coverage ... a weight-based greedy algorithm (WGA) which organizes sensors in multiple subsets. ... of sensors into a maximum possible number of sensors set covers (SSCs), ...
