A new algorithm for finding a dominating set in wireless sensor and IoT networks based on the wait-before-starting concept
01 Oct 2017-pp 1-3
TL;DR: This work proposes a new distributed algorithm for the search of the nodes forming a dominating set in a wireless sensor network, which uses a new concept called Wait-Before-Starting that allows to each dominating node to declare itself according to the number of its neighbors.
Abstract: Finding a dominating set in a Wireless Sensor Network can be used for the clustering or the routing. There is an abundant literature on methods, centralized or distributed, for detecting these sets. In this work, we propose a new distributed algorithm for the search of the nodes forming a dominating set in a wireless sensor network, which uses a new concept called Wait-Before-Starting that allows to each dominating node to declare itself according to the number of its neighbors. The proposed method guarantees the generation of a dominating set with low energy consumption.1
Citations
More filters
01 Jul 2020
TL;DR: This work proposes a new centralized approach that analyzes a network’s energy consumption to optimize node duty cycles and shows that the proposed guaranteed lifetime protocol achieves less average end-to-end delay and better packet delivery ratio when compared to its best rival protocols formulated in past research.
Abstract: Over the past two decades, the subject of extension of the lifetime of Wireless Sensor Networks (WSN) based on the Internet of Things (IoT) has been thoroughly investigated by researcher. As WSN, and its new form based on IoT, are increasingly being deployed in time-critical applications, users require certain network lifetime guarantees to satisfy application requirements. Few research efforts in the past have focused on guaranteeing the IoT-based network lifetime. Most such efforts pay little or no attention to other network performance indicators such as sensing coverage and network connectivity. To address this challenge, this work proposes a new centralized approach that analyzes a network’s energy consumption to optimize node duty cycles. In the proposed scheme, the sink node periodically assigns an active/sleep role to each node for the next network cycle by coupling the residual energy, total active time, and possible coverage area to guarantee their lifetimes. We show through extensive simulation that the proposed guaranteed lifetime protocol achieves less average end-to-end delay and better packet delivery ratio when compared to its best rival protocols formulated in past research, i.e., the CERACC, A-Mac, and Coverage Preserving protocols.
18 citations
TL;DR: In this paper, the authors proposed an intelligent data collection technique with two phases, the collector nodes selection, and the data gathering path formation and collection phases, where an energy-aware algorithm based on swarm intelligence is proposed to construct disjoint dominating sets that work as collector nodes.
Abstract: Wireless Sensor Networks (WSNs) lend themselves to a wide variety of applications in our daily lives, such as environmental monitoring, safety, health-care, animal monitoring, etc. However, one of the key issues in WSN is energy constraints. This makes energy-conservation one of the major keys to the efficient functioning and lifetime of WSN. In this paper, given a network of nodes with heterogeneous energy, our goal is to determine energy-aware disjoint dominating sets (DSs) that work as data collection nodes in each round, to improve overall WSN lifetime. In order to accomplish this goal, we propose an intelligent data collection technique with two phases, the collector nodes selection, and the data gathering path formation and collection phases. In the collector nodes selection phase, an energy-aware algorithm based on swarm intelligence is proposed to construct disjoint dominating sets that work as collector nodes in each round. In the data gathering path formation and collection phase, data gathering path is determined for achieving maximal data collection efficiency and reduced energy consumption. The efficiency of our proposed technique is proved mathematically and through simulations.
15 citations
4 citations
06 May 2022
TL;DR: In this paper , a Bees algorithm-based method is presented to identify energy-aware dominating sets (DSs) that extend the lifetime of a given network with heterogeneous energy.
Abstract: There are endless applications of Wireless Sensor Networks (WSNs) in many aspects that include safety, environmental monitoring, health care, etc. Despite this, energy is one of the main issues in WSN. Among the various methods that aim to overcome this issue is to select groups of nodes that are disjoint and are called dominating sets (DS). Each group carry out the tasks on behalf of their nearby nodes. This helps to prolong network lifespan by distributing data collection responsibilities across these groups, such that one group is responsible for handling these tasks then, after a certain period of time, another group replaces it, and so on. The goal of this paper is to identify energy-aware disjoint DSs that extend the lifetime for a given network with heterogeneous energy. A Bees algorithm-based method is presented to accomplish this goal. Simulations have demonstrated the effectiveness of the proposed algorithm.
06 May 2022
References
More filters
[...]
TL;DR: It is shown that many standard graph theoretic problems remain NP-complete on unit disks, including coloring, independent set, domination, independent domination, and connected domination; NP-completeness for the domination problem is shown to hold even for grid graphs, a subclass of unit disk graphs.
1,525 citations
17 Mar 2014
TL;DR: The first version of a Wireless Sensor Network simulator, called CupCarbon, is presented, which can help trainers to explain the basic concepts and how sensor networks work and it can help scientists to test their wireless topologies, protocols, etc.
Abstract: This paper presents the first version of a Wireless Sensor Network simulator, called CupCarbon. It is a multi-agent and discrete event Wireless Sensor Network (WSN) simulator. Networks can be designed and prototyped in an ergonomic user-friendly interface using the OpenStreetMap (OSM) framework by deploying sensors directly on the map. It can be used to study the behaviour of a network and its costs. The main objectives of CupCarbon are both educational and scientific. It can help trainers to explain the basic concepts and how sensor networks work and it can help scientists to test their wireless topologies, protocols, etc. The current version can be used only to study the power diagram of each sensor and the overall network. The power diagrams can be calculated and displayed as a function of the simulated time. Prototyping networks is more realistic compared to existing simulators.
111 citations
"A new algorithm for finding a domin..." refers methods in this paper
...For the implementation of this algorithm, we have used the simulator CupCarbon [11]....
[...]
TL;DR: The proposed method constructs the CDSs of smaller sizes with lower construction cost in comparison to existing CDS construction algorithms for both uniform and random distribution of nodes.
31 citations
"A new algorithm for finding a domin..." refers background in this paper
...The authors of [7] propose a new distributed greedy algorithm for approximating the construction of a minimal connected dominating set....
[...]
01 Oct 2017
TL;DR: A new algorithm called WBS (Wait-BeforeStarting), which is fault tolerant and where each node in the network will wait for a certain time before starting the execution of its program, is proposed.
Abstract: Many of the existing Leader Election algorithms don't deal with energy consumption and fault tolerance since they are not mainly dedicated to autonomous systems like wireless sensor and IoT networks. It is possible to use the classical Minimum Finding (MinFind) algorithm, where each node sends its value in a broadcast mode each time a better value is received. This process is very energy consuming and not realistic since it may be subject to an important number of collisions. In this paper, we propose a new algorithm called WBS (Wait-BeforeStarting), which is fault tolerant and where each node in the network will wait for a certain time before starting the execution of its program. This time lapse depends on the node's value so that the leader will be the one which will wait the least. In this case, the leader will be the first one which will start by sending a message to all the nodes of the network to inform them that it is the leader. Then, the other nodes will start the execution of their programs. Otherwise, if the leader fails, another node will do the same. The obtained results show that the proposed algorithm reduces the energy consumption with rates that can exceed 96% compared with the classical MinFind Algorithm.
12 citations
"A new algorithm for finding a domin..." refers background in this paper
...We have proposed in [10] a new concept that we call WBS (Wait-Before-Starting), where we assume that the value x of the node to elect is the minimum one....
[...]