Evaluating the performance of reactive I-LEACH

Kehar, Vinay; Singh, Rajdeep

doi:10.1109/icacci.2014.6968338

Cited by 6 publications

(6 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kehar and Singh proposed a study of Reactive I‐LEACH in which the battery life of the nodes, efficient data transfer are found to be a main constraints in Wireless networks . Hence forth, for minimizing, the energy consumption is achieved by applying integrated decision tree methods.…”

Section: Related Workmentioning

confidence: 99%

“…Kehar and Singh proposed a study of Reactive I-LEACH in which the battery life of the nodes, efficient data transfer are found to be a main constraints in Wireless networks. 12 Hence forth, for minimizing, the energy consumption is achieved by applying integrated decision tree methods. The combat measures has been compassed to augment the network stability period and life time by taking the residual energy as the main parameter for building the decision tree.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Improving performance in mobile ad hoc networks by reliable path selection routing using RPS‐LEACH

Anbarasan¹,

Prakash²,

Anand³

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary Vitality reliant and mobility are the two factors that deplete some measure of energy during the radio communication often occur in Mobile Ad hoc Network (MANET) among and between the nodes. Since MANET is a decentralized system, it poses to the exploitation of energy during the reliable path selection during routing. Hence, selection of protocol plays a major aspect in MANET for combatting against the energy depletion of nodes, Instable link, mobility character, and load balancing. The RPS‐LEACH protocol is proposed in this paper for the efficient path selection by organizing the nodes into clusters. For each cluster, Cluster Head (CH) is elected based on its strong transmission power and battery life. The Cluster Members (CM) is organized, respectively, based on its ability to respond to its cluster head REQs. Mainly, RPS values are calculated by the two parameters such as (i) successful interactions and (ii) unsuccessful interactions. In the proposed system, RPS (Reliable Path Selection) values are exchanged among the nodes for the reliable path selection by choosing the highest RPS value node for its communication. Hence, by adopting the RPS scheme, the nodes are able to choose the most reliable path for the efficient data transfer by exchanging the RPS values by ignoring the paths that consuming long time to transfer the data. In this procedure, correspondence convention, which comprises imperative impact of vitality liberality of such networks, is addressed. In cases of applications with no predefined or intended infrastructure, this scheme paves way for the versatile hubs to perform as the energy efficient routing nodes. Simulation carried out in NS2 and results shown improved performance when compared with LDTS and RPS‐LEACH.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Improving performance in mobile ad hoc networks by reliable path selection routing using RPS‐LEACH

Anbarasan¹,

Prakash²,

Anand³

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Just like other hierarchical clustering protocols there are three phases in every routing algorithm. In addition to that, this algorithm is also placing a mini-BS router in the sensor deployed area with one more phase named network initialization [4]. Since this algorithm is working for both homogeneous and heterogeneous WSN in terms of energy it will describe all these phases in both references.…”

Section: Ultra Stable Threshold Sensitive Election Protocol For Mobilmentioning

confidence: 99%

“…Main Base Station divides the whole area into four quadrants and calculates that which quadrant is densest, after this Main BS places the mini-BS at the center of the densest quadrant [4]. Now Main BS broadcast the coordinates of mini BS router and all further communication of nodes is handled by mini BS router which has no battery limitations and can work for longer period than the network lifetime.…”

Section: Network Initialization Phasementioning

confidence: 99%

See 1 more Smart Citation

U-REACH: Ultra Reactive Energy Efficient Adaptive Clustering Hierarchical Protocol for Homogeneous and Heterogeneous Wireless Sensor Networks

Sharma¹,

Khanna²

2016

IJCA

View full text Add to dashboard Cite

A wireless sensor network is a group of sensors heavily distributed in the desired area. There are constraints of energy, distance, mobility etc while dealing in WSN. As we know that randomized algorithms are the best average case providing algorithms so there come the concept of LEACH which is a very well known algorithm in WSN. Wireless sensor networks can be of two kinds: homogeneous sensor network and heterogeneous sensor network. The proposed algorithm provides a better approach for CH election by increasing network lifetime. It uses 3-level decision tree at different levels of heterogeneity and works in reactive way. Energy balancing is handled by taking average energy of the network as a parameter.

show abstract