An energy efficiency semi-static routing algorithm for WSNs based on HAC clustering method

Du, Tao; Qu, Shouning; Fang-ai, Liu; Wang, Qin

doi:10.1016/j.inffus.2013.05.001

Cited by 58 publications

(24 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In every list, flag is a variable which means the frequency of message in current item of List , and lifetime is a variable means that the time interval from now to last time that received International Journal of Distributed Sensor Networks 7 (1) a filter node ID receives an information ; (2) browse List (3) List = List .head (4) if List .content == ; (5) Throw up this message (6) List .flag = List .flag + 1; //Prolong this message's storing time; (7) end if (8) List = List .next; (9) if not exist any List .content == ; (10) For all item of List (11) flag = flag − lifetime; //Reduce the threshold to help update list; (12) all content lifetime + 1; (13) change info to info //Relay this message (14) browse List (15) find the info with minimum flag (16) List .content = //Update list corresponding item (17) List .flag = List .length (18) List .lifetime = 1; (19) end if in line (9) (20) same message, and these two variables are used to control the dynamical adjustment of current list. When cluster head has been rotated, the list will be also transmitted to new cluster head.…”

Section: The Design Of Filtering Methodmentioning

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

Section: The Design Of Filtering Methodmentioning

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

show abstract

“…This has an obvious advantage in energy conservation than dynamic clustering schemes. However, residual node energy is also not taken into account and cluster structure can be too rigid to cope with changing conditions, such as node failures or radio transmission disruptions used by Du et al (2015).…”

Section: Related Workmentioning

confidence: 99%

Hierarchical Agglomerative Clustering Schemes for Energy-Efficiency in Wireless Sensor Networks

Tariq

Kaddour

2017

Transport and Telecommunication Journal

View full text Add to dashboard Cite

Extending the lifetime of wireless sensor networks (WSNs) while delivering the expected level of service remains a hot research topic. Clustering has been identified in the literature as one of the primary means to save communication energy. In this paper, we argue that hierarchical agglomerative clustering (HAC) provides a suitable foundation for designing highly energy efficient communication protocols for WSNs. To this end, we study a new mechanism for selecting cluster heads (CHs) based both on the physical location of the sensors and their residual energy. Furthermore, we study different patterns of communications between the CHs and the base station depending on the possible transmission ranges and the ability of the sensors to act as traffic relays. Simulation results show that our proposed clustering and communication schemes outperform well-knows existing approaches by comfortable margins. In particular, networks lifetime is increased by more than 60% compared to LEACH and HEED, and by more than 30% compared to K-means clustering.

show abstract

“…Actually, there are usually more than one type of Hamilton Path in a single-hop fully connected network. In the case of Figure 3, it includes two types of different Hamilton Paths, as shown in Figure 4 (1) , (2). Both of them can be used as the route for traversing the CMs (includes CH) and gathering data.…”

Section: Definition Of Hamilton Path and Hamilton Circuitmentioning

confidence: 99%

“…Assuming that the density of SNs is uniform throughout the cluster area then will be a constant, which should have a value of 2 (1 / ( / )) M NP . Hence, the expected squared distance between CMs and CH can be presented as:…”

Section: Part I: Energy Consumption For Cluster Formationmentioning

confidence: 99%

HEER – A delay-aware and energy-efficient routing protocol for wireless sensor networks

Yang

2016

Computer Networks

View full text Add to dashboard Cite

Abstract-Minimizing energy consumption to maximize network lifetime is one of the crucial concerns in designing wireless sensor network routing protocols. Cluster-based protocols have shown promising energy-efficiency performance, where sensor nodes take turns to act as cluster heads (CHs), which carry out higher-level data routing and relaying. In such case the energy consumption is more evenly distributed for all the nodes. However, most cluster-based protocols improve energy-efficiency at the cost of transmission delay. In this paper, we propose an improved delay-aware and energy-efficient clustered protocol called Hamilton Energy-Efficient Routing Protocol (HEER). HEER forms clusters in the network initialization phase and links members in each cluster on a Hamilton Path, constructed using a greedy algorithm, for data transmission purpose. No cluster reformation is required and the members on the path will take turns to become cluster head. The design allows HEER to save on network administration energy and also balance the load comparing to traditional cluster-based protocols. The algorithms designed in HEER also means that it does not suffer long delay and does not require each node to have global location information comparing with classic chain-based protocols such as PEGASIS and its variations. We implemented the HEER protocol in MATLAB simulation and compared it with several cluster-based and chain-based protocols. We found that HEER is able to achieve an improved network lifetime over the current protocols while maintaining the average data transmission delay. In the simulation, HEER achieved 66.5% and 40.6% more rounds than LEACH and LEACH-EE, which are cluster-based protocols. When compared with chain-based protocols (PEGASIS and Intra-grid-PEGSIS), HEER managed 21.2 times and 16.7 times more rounds than PEGASIS and Intra-grid-PEGASIS respectively. In addition, HEER can eliminated 90% of transmission delay comparing to LEACH and LEACH-EE and 99% comparing with PEGASIS and Intra-grid-PEGASIS. Wireless communication is one of the major power consuming activities on SNs and its usage is controlled mainly by the routing protocol in action. An appropriate protocol design is therefore crucial for minimizing the energy consumption. There are three main types of routing protocols in WSNs, namely flat, hierarchical and location based protocols. KeywordsIn Flat routing protocol, all nodes communicate in a peer-to-peer manner without any hierarchy in the structure. The advantage is having a simple, expandable and low maintenance structure. However, it lacks local and central management of communication resource and usually suffers from long and varied delay.Location-based routing protocols, on the other hand, take in consideration of the location of SNs. Relative coordinates of neighbouring nodes can be extracted from the RF communication between them or, in some cases, by incorporating on-board GPS [3]. However, location tracking devices are huge energy consumers and their performance drops in harsh environme...

show abstract

An energy efficiency semi-static routing algorithm for WSNs based on HAC clustering method

Cited by 58 publications

References 17 publications

A High Efficient and Real Time Data Aggregation Scheme for WSNs

A High Efficient and Real Time Data Aggregation Scheme for WSNs

Hierarchical Agglomerative Clustering Schemes for Energy-Efficiency in Wireless Sensor Networks

HEER – A delay-aware and energy-efficient routing protocol for wireless sensor networks

Contact Info

Product

Resources

About