2,409 research outputs found

    Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey

    Full text link
    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 Survey on Mobile Charging Techniques in Wireless Rechargeable Sensor Networks

    Get PDF
    The recent breakthrough in wireless power transfer (WPT) technology has empowered wireless rechargeable sensor networks (WRSNs) by facilitating stable and continuous energy supply to sensors through mobile chargers (MCs). A plethora of studies have been carried out over the last decade in this regard. However, no comprehensive survey exists to compile the state-of-the-art literature and provide insight into future research directions. To fill this gap, we put forward a detailed survey on mobile charging techniques (MCTs) in WRSNs. In particular, we first describe the network model, various WPT techniques with empirical models, system design issues and performance metrics concerning the MCTs. Next, we introduce an exhaustive taxonomy of the MCTs based on various design attributes and then review the literature by categorizing it into periodic and on-demand charging techniques. In addition, we compare the state-of-the-art MCTs in terms of objectives, constraints, solution approaches, charging options, design issues, performance metrics, evaluation methods, and limitations. Finally, we highlight some potential directions for future research

    Enhancing Lifetime of Wireless Sensor Networks: A Review

    Get PDF
    Low Energy Adaptive Clustering Hierarchy (LEACH) is a network of wireless sensors made up of tiny sensor nodes that are capable of sensing, processing, and transmitting information and feedback. These sensor nodes are distributed at random in a sensing environment or sensor field to sense real-world phenomena like heat, moisture, humidity, sound, vibration, etc., and then aggregate and send to the base station (BS). The significance of energy energy-effective routing algorithm has risen, since the energy constrain is the major factor affecting sensor nodes. To control and manage the energy consumption of sensor nodes, a significant number of techniques have been proposed by various scholars. This review paper presents published works that have been proposed for increasing the lifespan of wireless networks at the very beginning of this paper, a brief overview of Wireless networks, its architecture working and the problems associated with it are discussed. After the detailed overview of the approaches that have been presented for overcoming various limitations of current wireless systems. Lastly, in the conclusion of this paper the reviewed results were compared with earlier techniques, the results thus far show a notable improvement in the node mortality rate and network lifetime

    Neuronal assembly dynamics in supervised and unsupervised learning scenarios

    Get PDF
    The dynamic formation of groups of neurons—neuronal assemblies—is believed to mediate cognitive phenomena at many levels, but their detailed operation and mechanisms of interaction are still to be uncovered. One hypothesis suggests that synchronized oscillations underpin their formation and functioning, with a focus on the temporal structure of neuronal signals. In this context, we investigate neuronal assembly dynamics in two complementary scenarios: the first, a supervised spike pattern classification task, in which noisy variations of a collection of spikes have to be correctly labeled; the second, an unsupervised, minimally cognitive evolutionary robotics tasks, in which an evolved agent has to cope with multiple, possibly conflicting, objectives. In both cases, the more traditional dynamical analysis of the system’s variables is paired with information-theoretic techniques in order to get a broader picture of the ongoing interactions with and within the network. The neural network model is inspired by the Kuramoto model of coupled phase oscillators and allows one to fine-tune the network synchronization dynamics and assembly configuration. The experiments explore the computational power, redundancy, and generalization capability of neuronal circuits, demonstrating that performance depends nonlinearly on the number of assemblies and neurons in the network and showing that the framework can be exploited to generate minimally cognitive behaviors, with dynamic assembly formation accounting for varying degrees of stimuli modulation of the sensorimotor interactions

    Designing an Energy Efficient Network Using Integration of KSOM, ANN and Data Fusion Techniques

    Get PDF
    Energy in a wireless sensor network (WSN) is rendered as the major constraint that affects the overall feasibility and performance of a network. With the dynamic and demanding requirements of diverse applications, the need for an energy efficient network persists. Therefore, this paper proposes a mechanism for optimizing the energy consumption in WSN through the integration of artificial neural networks (ANN) and Kohonen self-organizing map (KSOM) techniques. The clusters are formed and re-located after iteration for effective distribution of energy and reduction of energy depletion at individual nodes. Furthermore, back propagation algorithm is used as a supervised learning method for optimizing the approach and reducing the loss function. The simulation results show the effectiveness of the proposed energy efficient network

    An Assessment of Shortest Prioritized Path-Based Bidirectional Wireless Charging Approach Toward Smart Agriculture

    Get PDF
    The agriculture sector has witnessed a transformation with the advent of smart sensing devices, leading to improved crop yield and quality. However, the management of data collection from numerous sensors across vast agricultural areas, as well as the associated charging requirements, presents significant challenges. This paper addresses the major research problem by proposing an innovative solution for charging agricultural sensors. The introduction of an energy-constrained device (ECD) enables wireless charging and transmission of soil data to a centralized server. The proposed ECDs will enable enhanced data collection, precision agriculture, optimized resource allocation, timely decision-making, and remote monitoring and control. A bidirectional wireless charging drone is employed to efficiently charge the ECDs. To optimize energy usage, a prioritized Dijkstra algorithm determines the ECDs to be charged and plans the shortest route for the drone. The wireless charging drone landing-charging station achieves an efficiency of 91.3%, delivering 72 W of power within a 5 mm range. Furthermore, the ECD possesses a data transmission range of 100 m and incorporates deep sleep functionality, allowing for a remarkable 30-day battery life.publishedVersio

    Optimal Mission Planning of Autonomous Mobile Agents for Applications in Microgrids, Sensor Networks, and Military Reconnaissance

    Get PDF
    As technology advances, the use of collaborative autonomous mobile systems for various applications will become evermore prevalent. One interesting application of these multi-agent systems is for autonomous mobile microgrids. These systems will play an increasingly important role in applications such as military special operations for mobile ad-hoc power infrastructures and for intelligence, surveillance, and reconnaissance missions. In performing these operations with these autonomous energy assets, there is a crucial need to optimize their functionality according to their specific application and mission. Challenges arise in determining mission characteristics such as how each resource should operate, when, where, and for how long. This thesis explores solutions in determining optimal mission plans around the applications of autonomous mobile microgrids and resource scheduling with UGVs and UAVs. Optimal network connections, energy asset locations, and cabling trajectories are determined in the mobile microgrid application. The resource scheduling applications investigate the use of a UGV to recharge wireless sensors in a wireless sensor network. Optimal recharging of mobile distributed UAVs performing reconnaissance missions is also explored. With genetic algorithm solution approaches, the results show the proposed methods can provide reasonable a-priori mission plans, considering the applied constraints and objective functions in each application. The contributions of this thesis are: (1) The development and analysis of solution methodologies and mission simulators for a-priori mission plan development and testing, for applications in organizing and scheduling power delivery with mobile energy assets. Applying these methods results in (2) the development and analysis of reasonable a-priori mission plans for autonomous mobile microgrids/assets, in various scenarios. This work could be extended to include a more diverse set of heterogeneous agents and incorporate dynamic loads to provide power to

    Efficient on-demand multi-node charging techniques for wireless sensor networks

    Get PDF
    This paper deals with wireless charging in sensor networks and explores efficient policies to perform simultaneous multi-node power transfer through a mobile charger (MC).The proposed solution, called On-demand Multi-node Charging (OMC), features an original threshold-based tour launching (TTL) strategy, using request grouping, and a path planning algorithm based on minimizing the number of stopping points in the charging tour. Contrary to existing solutions, which focus on shortening the charging delays, OMC groups incoming charging requests and optimizes the charging tour and the mobile charger energy consumption. Although slightly increasing the waiting time before nodes are charged, this allows taking advantage of multiple simultaneous charges and also reduces node failures. At the tour planning level, a new modeling approach is used. It leverages simultaneous energy transfer to multiple nodes by maximizing the number of sensors that are charged at each stop. Given its NP-hardness, tour planning is approximated through a clique partitioning problem, which is solved using a lightweight heuristic approach. The proposed schemes are evaluated in offline and on-demand scenarios and compared against relevant state-of-the-art protocols. The results in the offline scenario show that the path planning strategy reduces the number of stops and the energy consumed by the mobile charger, compared to existing offline solutions. This is with further reduction in time complexity, due to the simple heuristics that are used. The results in the on-demand scenario confirm the effectiveness of the path planning strategy. More importantly, they show the impact of path planning, TTL and multi-node charging on the efficiency of handling the requests, in a way that reduces node failures and the mobile charger energy expenditure
    corecore