3,052 research outputs found
Wireless Power Transfer and Data Collection in Wireless Sensor Networks
In a rechargeable wireless sensor network, the data packets are generated by
sensor nodes at a specific data rate, and transmitted to a base station.
Moreover, the base station transfers power to the nodes by using Wireless Power
Transfer (WPT) to extend their battery life. However, inadequately scheduling
WPT and data collection causes some of the nodes to drain their battery and
have their data buffer overflow, while the other nodes waste their harvested
energy, which is more than they need to transmit their packets. In this paper,
we investigate a novel optimal scheduling strategy, called EHMDP, aiming to
minimize data packet loss from a network of sensor nodes in terms of the nodes'
energy consumption and data queue state information. The scheduling problem is
first formulated by a centralized MDP model, assuming that the complete states
of each node are well known by the base station. This presents the upper bound
of the data that can be collected in a rechargeable wireless sensor network.
Next, we relax the assumption of the availability of full state information so
that the data transmission and WPT can be semi-decentralized. The simulation
results show that, in terms of network throughput and packet loss rate, the
proposed algorithm significantly improves the network performance.Comment: 30 pages, 8 figures, accepted to IEEE Transactions on Vehicular
Technolog
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
A critical analysis of research potential, challenges and future directives in industrial wireless sensor networks
In recent years, Industrial Wireless Sensor Networks (IWSNs) have emerged as an important research theme with applications spanning a wide range of industries including automation, monitoring, process control, feedback systems and automotive. Wide scope of IWSNs applications ranging from small production units, large oil and gas industries to nuclear fission control, enables a fast-paced research in this field. Though IWSNs offer advantages of low cost, flexibility, scalability, self-healing, easy deployment and reformation, yet they pose certain limitations on available potential and introduce challenges on multiple fronts due to their susceptibility to highly complex and uncertain industrial environments. In this paper a detailed discussion on design objectives, challenges and solutions, for IWSNs, are presented. A careful evaluation of industrial systems, deadlines and possible hazards in industrial atmosphere are discussed. The paper also presents a thorough review of the existing standards and industrial protocols and gives a critical evaluation of potential of these standards and protocols along with a detailed discussion on available hardware platforms, specific industrial energy harvesting techniques and their capabilities. The paper lists main service providers for IWSNs solutions and gives insight of future trends and research gaps in the field of IWSNs
Fast-Convergent Learning-aided Control in Energy Harvesting Networks
In this paper, we present a novel learning-aided energy management scheme
() for multihop energy harvesting networks. Different from prior
works on this problem, our algorithm explicitly incorporates information
learning into system control via a step called \emph{perturbed dual learning}.
does not require any statistical information of the system
dynamics for implementation, and efficiently resolves the challenging energy
outage problem. We show that achieves the near-optimal
utility-delay tradeoff with an
energy buffers (). More interestingly,
possesses a \emph{convergence time} of , which is much faster than the time of
pure queue-based techniques or the time of approaches
that rely purely on learning the system statistics. This fast convergence
property makes more adaptive and efficient in resource
allocation in dynamic environments. The design and analysis of
demonstrate how system control algorithms can be augmented by learning and what
the benefits are. The methodology and algorithm can also be applied to similar
problems, e.g., processing networks, where nodes require nonzero amount of
contents to support their actions
Scheduling for Cooperative Energy Harvesting Sensor Networks
In cooperative communication networks, the source node transmits its data to the destination either directly or cooperatively with a cooperating node. When using energy harvesting technology, where nodes collect their energy from the environment, the energy availability at the nodes becomes unpredictable due to the stochastic nature of energy harvesting processes. As a result, when the source has a transmission, it cannot immediately transmit its data cooperatively with the cooperating node. It first needs to determine whether the cooperating node has sufficient energy to forward its transmission or not. Otherwise, its transmitted data may get lost. Therefore, when using energy harvesting, the challenge is for the source to schedule its transmissions whether directly or cooperatively, such that the fraction of its events (sensed data) that are successfully reported to the destination is maximized.
Hence, in this dissertation, we address the problem of cooperating node scheduling in energy harvesting sensor networks. We consider the problem for the case of a single cooperating node and the case of multiple cooperating nodes, as well as the scenarios of one-way and two-way cooperative communications. We propose a simple scheduling scheme, called feedback scheme, which enables the source to optimally schedule its transmissions whether directly or cooperatively. We show that the feedback scheme maximizes the system performance, but does not require auxiliary parameter optimization as does the-state-of-the-art scheme, i.e., the threshold-based scheme. However, the feedback scheme has the problem of overhead caused by transmitting the energy status of the cooperating node to the source. To overcome this burden, we introduce a statistical model that enables the source to estimate the energy status of the cooperating node. Because cooperation may result in the cooperating node performing worse than the source, we address this problem through fairness in the performance between the nodes in the network. In addition, we address the problem of scheduling for throughput maximization in a wireless energy harvesting uplink. We propose centralized and distributed algorithms that find the optimal solution, and we address complexity issues. Our algorithms are shown to have a linear or quadratic complexity compared to the exponential complexity of the brute force approach. Compared with cooperative transmission, our approach maximizes the network throughput such that no node\u27s throughput is adversely affected
Improving Maximum Data Collection Based On Pre-Specified Path Using a Mobile Sink for WSN
Data aggregation is one of the challenging issues which are faced in the wireless sensor network by using Energy Harvesting Sensors. Data collection in a fixed pre-defined path with time varying characteristic forms a major problem in Energy Harvesting Sensor Networks. In the proposed work the Adjustment based allocation method is used to allocate fixed time slots to each sensor nodes in which the network throughput can be increased with less energy consumption. The mobile sink transmits the polling message to all the nodes within the transmission range and makes decision based on the profits gained by the sensor nodes in each timeslot. The NP-Hard problem is defined with the form of reducing the complexity of the sensor nodes where larger number of data can be collected from the environment. The data collection throughput is maximized with the use of optimized path for the mobile sink in the network. This record was migrated from the OpenDepot repository service in June, 2017 before shutting down
- …