An Energy Aware Ladder Diffusion Routing Algorithm for WSNs

Du, Tao; Qu, Shouning; Wang, Qin

doi:10.12720/lnit.2.1.1-6

Cited by 3 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Du et al [ 27 ] modified Ho’s method as an energy aware ladder diffusion (EALD) routing algorithm. The EALD adopts the ladder diffusion process similar to [ 26 ] in the first step.…”

Section: Related Workmentioning

confidence: 99%

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization

Jiang

Zheng

2018

Sensors

View full text Add to dashboard Cite

Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs). This paper investigates the existing ant colony optimization (ACO)-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime.

show abstract

“…Du et al [ 27 ] modified Ho’s method as an energy aware ladder diffusion (EALD) routing algorithm. The EALD adopts the ladder diffusion process similar to [ 26 ] in the first step.…”

Section: Related Workmentioning

confidence: 99%

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization

Jiang

Zheng

2018

Sensors

View full text Add to dashboard Cite

show abstract

“…Finding optimal routing path with least HOP count in a large-scale cognitive network such as smart grid is no less than a challenge in today's distributed computing environment. There are several schemes and routing protocols that focus to address this issue by effective gradient data transmission schemes [10], adaptive HOP routing protocols [11], robust diffusion algorithms using ant colony optimization [12] and energy-efficient diffusion routing algorithms [13], however, no of them resolves this problem through knowledge-based analytics. To the best of our knowledge, RORP is first of its kind that addresses optimal routing path issue through calculating load onto cognitive network nodes and append load value as pheromone on its RDF-enabled data payload.…”

Section: Motivationmentioning

confidence: 99%

A Knowledge-Based Path Optimization Technique for Cognitive Nodes in Smart Grid

Qureshi

Siddiqui

Abbas

et al. 2018

2018 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

The cognitive network uses cognitive processes to record data transmission rate among nodes and applies selflearning methods to trace data load points for finding optimal transmission path in the distributed computing environment. Several industrial systems, e.g., data-centers, smart grids, etc., have adopted this cognitive paradigm and retrieved the least HOP count paths for processing huge datasets with minimum resource consumption. Therefore, this technique works well in transmitting structured data such as 'XML', however, if the data is in unstructured format i.e. 'RDF', the transmission technique wraps it with the same layout of payload and eventually returns inaccuracy in calculating traces of data load points due to the abnormal payload layout. In this paper, we propose a knowledgebased optimal routing path analyzer (RORP) that resolves the transmission wrapping issue of the payload by introducing a novel RDF-aware payload-layout. The proposed analyzer uses the enhanced payload layout to transmit unstructured RDF triples with an append pheromone (footsteps) value through cognitive nodes towards the semantic reservoir. The grid performs analytics and returns least HOP count path for processing huge RDF datasets in the cognitive network. The simulation results show that the proposed approach effectively returns the least HOP count path, enhances network performance by minimizing the resource consumption at each of the cognitive nodes and reduces traffic congestion through knowledge-based HOP count analytics technique in the cognitive environment of the smart grid.

show abstract

“…There exist many data aggregation algorithms, but these algorithms have many disadvantages: real time is poor; the efficiency of filtering is not high; the burden of extra hardware is too large, and so forth. In this paper, a new high efficient and real time data aggregation scheme is proposed to resolve existing problems, and this scheme includes three main steps: activating all sensor nodes by ladder diffusion, which is proposed in our previous research in [7]; clustering all nodes based on semistatic HAC method, which is proposed in our previous research in [8]; and filtering reduplicated messages using dynamical list, which is the key of this paper. The rest of this paper is organized as follows: in Section 2, we analyze the performance standards and introduce some of the main existing research works; in Section 3, we introduce the design of three steps of DMLDA in detail; in Section 4, we prove and analyze the performance of DMLDA in theory and by simulated experiments; in Section 5, the innovations and advantages of this paper are concluded.…”

Section: Introductionmentioning

confidence: 99%

A High Efficient and Real Time Data Aggregation Scheme for WSNs

Guo

et al. 2015

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

Data aggregation is an important method of improving transmitting efficiency of WSNs, but existing researches have some disadvantages as follows: several periods delay will be generated when filtering messages; the reduplicated messages filtering ratio is low; complex calculations need to be executed; and extra hardware should be added to obtain high performance. To resolve these problems, this paper proposes a real time and high efficient data aggregation scheme (dynamical message list based data aggregation, DMLDA) based on clustering routing algorithm. DMLDA includes three procedures: activating nodes, clustering nodes, and filtering messages. In filtering procedure, a special data structure named dynamic list will be established in every filtering node; it is designed to store messages transmitted by filtering node, and, comparing current message with list's items, the message's redundancy can be judged without any delay. To improve the filtering efficiency, the message list can be adjusted dynamically. The three procedures of data aggregation are all introduced, and the filtering method is designed in detail in this paper. At last, a series of experiments are simulated to prove our scheme's performance, and the advantages are analyzed in theory.

show abstract

An Energy Aware Ladder Diffusion Routing Algorithm for WSNs

Cited by 3 publications

References 15 publications

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization

A Knowledge-Based Path Optimization Technique for Cognitive Nodes in Smart Grid

A High Efficient and Real Time Data Aggregation Scheme for WSNs

Contact Info

Product

Resources

About