Analytical modelling of the A-ANCH clustering algorithm for WSNs

Zanjireh, Morteza Mohammadi; Larijani, Hadi

doi:10.1109/icufn.2015.7182580

Cited by 3 publications

(3 citation statements)

References 26 publications

(18 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both of its time and data complexities are O(N 2 ), which is same to LEACH and better than HEED [15], [39].…”

Section: ) Bayesian Algorithmmentioning

confidence: 94%

Energy Efficient Routing Clustering Algorithms For Wireless Sensor Networks

Rajkumar¹,

Chandrakanth²

2018

IJANA

View full text Add to dashboard Cite

Wireless Sensor Networks have come to the forefront of the scientific community recently and it consists of small nodes with sensing, Communications and computing capabilities. The Wireless Sensor Network Systems can be applied to monitor different environments. In WSN, sensor nodes play the most prominent role. These sensor nodes batteries are replacing or recharging is impossible, it is essential to find energy efficient routing algorithm. In this paper, we survey the features / characteristics and different well-know energy efficient cluster routing algorithms for WSNs have been classified and presented based on their characteristics.

show abstract

“…Both of its time and data complexities are O(N 2 ), which is same to LEACH and better than HEED [15], [39].…”

Section: ) Bayesian Algorithmmentioning

confidence: 94%

Energy Efficient Routing Clustering Algorithms For Wireless Sensor Networks

Rajkumar¹,

Chandrakanth²

2018

IJANA

View full text Add to dashboard Cite

show abstract

“…The ANCH algorithm is considerably more efficient than LEACH and HEED in terms of network energy consumption and network lifetime. In addition, both of its time and message complexities are O(N 2 ), which is equal to LEACH and better than HEED [12], [26]. Also, it has an analytical model which brings up a credible theoretical basis for this algorithm [12], [26].…”

Section: ) Wireless Sensor Network Clustering With Artificialmentioning

confidence: 99%

A Survey on Centralised and Distributed Clustering Routing Algorithms for WSNs

Zanjireh

Larijani

2015

2015 IEEE 81st Vehicular Technology Conference (VTC Spring)

Self Cite

View full text Add to dashboard Cite

Wireless sensor networks have a wide range of applications because they can be adapted for various environments. They can operate independently in harsh places where a human presence is risky or even impossible. Since their life time is dependent on their batteries and replacing or recharging their batteries is impossible in rough places, it is necessary to find energy efficient routing protocols for them. In this paper, a number of well-know energy efficient routing algorithms for WSNs have been classified and presented based on their attributes.

show abstract

“…They also can be static, in which sensors are in fixed positions, or dynamic considering nodes as moving objects [13]. Additionally, WSNs can be single-hop or multi-hop [4][5] [6] [8] [15]. In multi-hop fashion, a sensor node plays a dual role, working as data originator and data router, but in a single-hop one, the sensor sends the collected data directly to the BS [1] [16] [17].…”

mentioning

confidence: 99%

Distributed multi-hop routing algorithm for wireless sensor networks

Zanjireh

Gadban

2020

FACTA U EE

View full text Add to dashboard Cite

In a Wireless Sensor Network (WSN), routing is the process of finding a cost effective route in terms of power consumption. As an evaluation criterion for the WSN performance, network lifetime is directly affected by the routing method. In a wide variety of WSNs, different techniques are used as routing methods, such as shortest distance path. In this paper, we propose a novel algorithm, optimizing power consumption in WSN nodes, based on the shortest path algorithm. In this approach, the energy level of nodes and their geographical distance from each other contribute to the weight of the connecting path. The proposed algorithm is used as a data dissemination method in WSNs with randomly scattered nodes. We also apply Dijkstra?s shortest path algorithm to the same networks. The results showed that the proposed algorithm increases the network lifetime up to 30 % by preventing nodes with low charge levels from early disconnection.

show abstract

Analytical modelling of the A-ANCH clustering algorithm for WSNs

Cited by 3 publications

References 26 publications

Energy Efficient Routing Clustering Algorithms For Wireless Sensor Networks

Energy Efficient Routing Clustering Algorithms For Wireless Sensor Networks

A Survey on Centralised and Distributed Clustering Routing Algorithms for WSNs

Distributed multi-hop routing algorithm for wireless sensor networks

Contact Info

Product

Resources

About