NODIC: a novel distributed clustering routing protocol in WSNs by using a time-sharing approach for CH election
| Autor: | Orhan Gazi Hafif, İpek Abasıkeleş-Turgut |
|---|---|
| Přispěvatelé: | Mühendislik ve Doğa Bilimleri Fakültesi -- Bilgisayar Mühendisliği Bölümü, Turgut, İpek Abasıkeleş, Hafif, Orhan Gazi |
| Jazyk: | angličtina |
| Rok vydání: | 2016 |
| Předmět: |
Routing protocol
Energy efficient routing Energy-efficient Computer Networks and Communications Computer science Iterative methods Distributed computing Routing Protocols | Vehicular Ad Hoc Networks | End-To-End Delay Wireless Routing Protocol 02 engineering and technology Sensor nodes Distributed clustering Engineering Routing protocols Effective parameters Total energy 0202 electrical engineering electronic engineering information engineering Destination-Sequenced Distance Vector routing Electrical and Electronic Engineering Cluster head Cluster analysis Routing Taxonomy Power management (telecommunication) Zone Routing Protocol business.industry Probabilistic logic 020206 networking & telecommunications Traffic distributions Wireless sensor networks 020202 computer hardware & architecture Algorithm Iterative schemes Energy efficiency Computer Science Telecommunications Electrical & Electronic Routing (electronic design automation) business Wireless sensor network Computer network Information Systems |
| Popis: | WOS: 000372921300021 Due to the battery limitations, energy-efficient routing is one of the most important issues in WSNs. In this paper, a novel distributed clustering routing protocol (NODIC) is proposed. The algorithm makes three main contributions to literature. Firstly, a time-sharing approach for CH election is suggested differently from the studies in literature. The most effective parameters are combined in a time-sharing approach on the purpose of gaining the highest performance. Secondly, easy implementation and self-reliant decision of probabilistic schemes and the guarantee that iterative schemes issue about selecting the desired CHs are pieced together without using any of them. Finally, since CH decision is performed locally and dynamically, the clusters can make their decisions independently from the others. NODIC is compared with three common corresponding approaches in literature for various values of the number of nodes and under different traffic distributions. The algorithms are evaluated by using the number of living nodes and total energy consumptions per round. The results show that NODIC performs considerably better than the other approaches for all number of nodes and under all distributions up to 79 %. Scientific and Technological Research Council of Turkey [TUBITAK-EEEAG-115E211] We would like to thank the Scientific and Technological Research Council of Turkey (TUBITAK-EEEAG-115E211) for supporting this work. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|