Arranging cluster sizes and transmission ranges for wireless sensor networks

Lai, Wei Kuang; Fan, Chung Shuo; Lin, Lin Yan

doi:10.1016/j.ins.2011.08.029

Cited by 96 publications

(46 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The percentage of energy loss for the proposed LECSA is compared with the existing protocols, namely LEACH, the multi-hop variant of LEACH called as MR-LEACH [25], a cluster-based routing protocol called ACT [26], an Energy Efficient Clustering Algorithm (EECA) [27] and a Separating Cluster-based Algorithm-SCA [28]. The results are shown in the Table 10.…”

Section: Resultsmentioning

confidence: 99%

Simple Clustering for Wireless Sensor Networks

Rathna

2016

Cybernetics and Information Technologies

View full text Add to dashboard Cite

Section: Resultsmentioning

confidence: 99%

Simple Clustering for Wireless Sensor Networks

Rathna

2016

Cybernetics and Information Technologies

View full text Add to dashboard Cite

“…'Arranging clusters' sizes and transmission ranges for wireless sensor network (ACT)' [20] argues that the size of different clusters should be different. The parameter that affects the size of each cluster is the distance between its CH and the BS.…”

Section: 22mentioning

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

“…Output: Cluster structure and connectivity Initialization (1) if it is the first time to initialize network then (2) The sink node broadcasts "Init" message (3) while (any SN has not broadcasted this message) (4) if SNs receive "Init" message from the sink node then (5) Broadcast "Init" message added their coordinate values with the neighbor power just once (6) else if SNs receive "Init" message from other SNs then (7) Record them as neighbor nodes, and then broadcast "Init" message in the same way (8) Build their respective tables of neighbor nodes as Table 1 The Stage of candidate CHs (9) Calculate the proportion of residual energy ( RE ) using (4) to decide which SN should be replaced (10) The percentage of SNs to be replaced batteries(RB) changes over time based on RE (11) Calculate the percentage of candidate CHs (CCH) using (5) (12) for ( = 1; ≤ ; ++) //Here, is the ID of SN. (13) Calculate CH prop ( ) using (6) (14) for ( = 1; ≤ ; ++) (15) if CH prop ( ) belong to the CCH × biggest CH prop then (16) ∈ TCH The stage of CHs (17) for ( = 1; ≤ ; ++) (18) if ∈ S TCH then (19) Calculate using (7) (20) while (exist candidate CHs and number of CHs is less than a setting value) (21) for ( = 1; ≤ ; ++) (22) if ∈ TCH then (23) Caculate DT in existing candidate CHs using (8) (24) if DT is the smallest then (25) ∈ CH = {CHs}, ∉ TCH , {ordinary SNs in its cluster radius} ⊂ S CCM = {candidate CMs}, {ordinary SNs in its cluster radius} ̸ ⊂ OSN = {ordinary SNs} The stage of clusters (26) for ( = 1; ≤ ; ++) (27) if ∈ CH then (28) CHs broadcast an ADV type package in the cluster radius (29) SNs join in the CH with the minimum distance (30) if still has SN which is not a CM of any CH then (31) this SN become a CH, and jump to the stage of clusters (32) (5).…”

Section: International Journal Of Distributed Sensor Networkmentioning

confidence: 99%

PUAR: Performance and Usage Aware Routing Algorithm for Long and Linear Wireless Sensor Networks

2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Aiming at requirements of performance and usage in the monitoring of tunnels with the long and linear structure, this work demonstrates a low-energy and quality of service-(QoS-) supported uneven clustering routing algorithm based on the labor cost called PUAR. PUAR realizes uneven clusters by a designed cluster radius related to the distance and the labor cost, with consideration of the residual energy and spatial layout of sensor nodes in the cluster head selection. With QoS support, PUAR uses the quality of link to reduce the packet loss and shortens the total transmitting distance to reduce the average delivery delay in multihop transmission. For the usage requirements of tunnel monitoring, PUAR utilizes the labor cost of replacing batteries to realize local or global energy balance. According to the analysis and simulation results, PUAR is found to achieve low-power consumption and reliable QoS support, and it can also reduce the operating cost of tunnel monitoring.

show abstract

Arranging cluster sizes and transmission ranges for wireless sensor networks

Cited by 96 publications

References 35 publications

Simple Clustering for Wireless Sensor Networks

Simple Clustering for Wireless Sensor Networks

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

PUAR: Performance and Usage Aware Routing Algorithm for Long and Linear Wireless Sensor Networks

Contact Info

Product

Resources

About