4 research outputs found
Using Minimum Connected Dominating Set for Mobile sink path planning in Wireless Sensor Networks
Get PDFWireless sensor networks are a motivating area of research and have a variety of applications. Given that these networks are anticipated to function without supervision for extended periods, there is a need to propose techniques to enhance the performance of these networks without consuming the essential resource sensor nodes have, which is their battery energy. In this paper, we propose a new sink node mobility model based on calculating the minimum connected dominating set of a network. As a result, instead of visiting all of the static sensor nodes in the network, the mobile sink will visit a small number or fraction of static sensor nodes to gather data and report it to the base station. The proposed model's performance was examined through simulation using the NS-2 simulator with various network sizes and mobile sink speeds. Finally, the proposed model's performance was evaluated using a variety of performance metrics, including End-To-End delay, packet delivery ratio, throughput, and overall energy consumption as a percentage
Data Aggregation Scheme for a Multi-Application WSN
No full textInternational audienceWireless Sensor Networks (WSNs) are still designed and deployed for one specific application, while it is vital to deploy several applications over the same WSN in order to reduce the deployment and the administrative costs. One of the remaining problems, in this domain, resides in the data aggregation solutions, which are proposed generally for one application and may drain the WSN power in a multi-application context. Therefore, we propose a data aggregation scheme based on a multi-agent system to aggregate the WSN information in an energy-efficient manner even if we are deploying several applications over this network. This proposal has proved its performance in the context of one and several applications through successive simulations in different network scales
