A new dominating tree routing algorithm for efficient leader election in IoT networks

Ahcene Bounceur; Madani Bezoui; Massinissa Lounis; Reinhardt Euler; Ciprian Teodorov

doi:10.1109/CCNC.2018.8319292

A new dominating tree routing algorithm for efficient leader election in IoT networks

Ahcene Bounceur, Madani Bezoui, Massinissa Lounis, Reinhardt Euler, Ciprian Teodorov

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

18 Scopus citations

Abstract

A leader node in Ad hoc networks and especially in WSNs and IoT networks is needed in many cases, for example to find a node with minimum energy or situated on the extreme left of the network. For this kind of applications, algorithms must be robust and fault-tolerant since it is difficult and even impossible to intervene if a node fails. Such a situation can be catastrophic in case that this node is the leader. In this paper, we present a new algorithm, which is based on a tree routing protocol. It starts from local leaders which will start the process of flooding to determine a spanning tree. During this process their value will be routed. If two spanning trees meet each other then the tree routing the best value will continue its process while the other tree will stop it. The remaining tree is the dominating one and its root will be the leader. This algorithm turns out to be low energy consuming with reduction rates that can exceed 85%. It is efficient and fault-tolerant since it works in the case where any node can fail and in the case where the network is disconnected.

Original language	English
Title of host publication	CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1-2
Number of pages	2
ISBN (Electronic)	9781538647905
DOIs	https://doi.org/10.1109/CCNC.2018.8319292
State	Published - 16 Mar 2018
Externally published	Yes
Event	15th IEEE Annual Consumer Communications and Networking Conference, CCNC 2018 - Las Vegas, United States Duration: 12 Jan 2018 → 15 Jan 2018

Publication series

Name	CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference
Volume	2018-January

Conference

Conference	15th IEEE Annual Consumer Communications and Networking Conference, CCNC 2018
Country/Territory	United States
City	Las Vegas
Period	12/01/18 → 15/01/18

Bibliographical note

Publisher Copyright:
© 2018 IEEE.

Keywords

Distributed algorithms
Dominating Tree Routing
IoT
Leader Election
Wireless Sensor Network

ASJC Scopus subject areas

Computer Networks and Communications
Signal Processing
Media Technology

Access to Document

10.1109/CCNC.2018.8319292

Cite this

Bounceur, A., Bezoui, M., Lounis, M., Euler, R., & Teodorov, C. (2018). A new dominating tree routing algorithm for efficient leader election in IoT networks. In CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference (pp. 1-2). (CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference; Vol. 2018-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CCNC.2018.8319292

Bounceur, Ahcene ; Bezoui, Madani ; Lounis, Massinissa et al. / A new dominating tree routing algorithm for efficient leader election in IoT networks. CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 1-2 (CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference).

@inproceedings{39a150a991b9449bbdcb45f5ed88d3c2,

title = "A new dominating tree routing algorithm for efficient leader election in IoT networks",

abstract = "A leader node in Ad hoc networks and especially in WSNs and IoT networks is needed in many cases, for example to find a node with minimum energy or situated on the extreme left of the network. For this kind of applications, algorithms must be robust and fault-tolerant since it is difficult and even impossible to intervene if a node fails. Such a situation can be catastrophic in case that this node is the leader. In this paper, we present a new algorithm, which is based on a tree routing protocol. It starts from local leaders which will start the process of flooding to determine a spanning tree. During this process their value will be routed. If two spanning trees meet each other then the tree routing the best value will continue its process while the other tree will stop it. The remaining tree is the dominating one and its root will be the leader. This algorithm turns out to be low energy consuming with reduction rates that can exceed 85\%. It is efficient and fault-tolerant since it works in the case where any node can fail and in the case where the network is disconnected.",

keywords = "Distributed algorithms, Dominating Tree Routing, IoT, Leader Election, Wireless Sensor Network",

author = "Ahcene Bounceur and Madani Bezoui and Massinissa Lounis and Reinhardt Euler and Ciprian Teodorov",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 15th IEEE Annual Consumer Communications and Networking Conference, CCNC 2018 ; Conference date: 12-01-2018 Through 15-01-2018",

year = "2018",

month = mar,

day = "16",

doi = "10.1109/CCNC.2018.8319292",

language = "English",

series = "CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1--2",

booktitle = "CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference",

address = "United States",

}

Bounceur, A, Bezoui, M, Lounis, M, Euler, R & Teodorov, C 2018, A new dominating tree routing algorithm for efficient leader election in IoT networks. in CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference. CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference, vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 1-2, 15th IEEE Annual Consumer Communications and Networking Conference, CCNC 2018, Las Vegas, United States, 12/01/18. https://doi.org/10.1109/CCNC.2018.8319292

A new dominating tree routing algorithm for efficient leader election in IoT networks. / Bounceur, Ahcene; Bezoui, Madani; Lounis, Massinissa et al.
CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference. Institute of Electrical and Electronics Engineers Inc., 2018. p. 1-2 (CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference; Vol. 2018-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A new dominating tree routing algorithm for efficient leader election in IoT networks

AU - Bounceur, Ahcene

AU - Bezoui, Madani

AU - Lounis, Massinissa

AU - Euler, Reinhardt

AU - Teodorov, Ciprian

PY - 2018/3/16

Y1 - 2018/3/16

N2 - A leader node in Ad hoc networks and especially in WSNs and IoT networks is needed in many cases, for example to find a node with minimum energy or situated on the extreme left of the network. For this kind of applications, algorithms must be robust and fault-tolerant since it is difficult and even impossible to intervene if a node fails. Such a situation can be catastrophic in case that this node is the leader. In this paper, we present a new algorithm, which is based on a tree routing protocol. It starts from local leaders which will start the process of flooding to determine a spanning tree. During this process their value will be routed. If two spanning trees meet each other then the tree routing the best value will continue its process while the other tree will stop it. The remaining tree is the dominating one and its root will be the leader. This algorithm turns out to be low energy consuming with reduction rates that can exceed 85%. It is efficient and fault-tolerant since it works in the case where any node can fail and in the case where the network is disconnected.

AB - A leader node in Ad hoc networks and especially in WSNs and IoT networks is needed in many cases, for example to find a node with minimum energy or situated on the extreme left of the network. For this kind of applications, algorithms must be robust and fault-tolerant since it is difficult and even impossible to intervene if a node fails. Such a situation can be catastrophic in case that this node is the leader. In this paper, we present a new algorithm, which is based on a tree routing protocol. It starts from local leaders which will start the process of flooding to determine a spanning tree. During this process their value will be routed. If two spanning trees meet each other then the tree routing the best value will continue its process while the other tree will stop it. The remaining tree is the dominating one and its root will be the leader. This algorithm turns out to be low energy consuming with reduction rates that can exceed 85%. It is efficient and fault-tolerant since it works in the case where any node can fail and in the case where the network is disconnected.

KW - Distributed algorithms

KW - Dominating Tree Routing

KW - IoT

KW - Leader Election

KW - Wireless Sensor Network

UR - https://www.scopus.com/pages/publications/85046941610

U2 - 10.1109/CCNC.2018.8319292

DO - 10.1109/CCNC.2018.8319292

M3 - Conference contribution

AN - SCOPUS:85046941610

T3 - CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference

SP - 1

EP - 2

BT - CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 15th IEEE Annual Consumer Communications and Networking Conference, CCNC 2018

Y2 - 12 January 2018 through 15 January 2018

ER -

Bounceur A, Bezoui M, Lounis M, Euler R, Teodorov C. A new dominating tree routing algorithm for efficient leader election in IoT networks. In CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference. Institute of Electrical and Electronics Engineers Inc. 2018. p. 1-2. (CCNC 2018 - 2018 15th IEEE Annual Consumer Communications and Networking Conference). doi: 10.1109/CCNC.2018.8319292

A new dominating tree routing algorithm for efficient leader election in IoT networks

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this