43:
algorithm at each round to determine whether it will become a cluster head in this round. LEACH assumes that each node has a radio powerful enough to directly reach the base station or the nearest cluster head, but that using this radio at full power all the time would waste energy.
63:
All nodes that are not cluster heads only communicate with the cluster head in a TDMA fashion, according to the schedule created by the cluster head. They do so using the minimum energy needed to reach the cluster head, and only need to keep their radios on during their time slot.
59:
probability of becoming a cluster head again. At the end of each round, each node that is not a cluster head selects the closest cluster head and joins that cluster. The cluster head then creates a schedule for each node in its cluster to transmit its data.
157:, Chandrakasan, A., and Balakrishnan, H., "Energy-Efficient Communication Protocols for Wireless Microsensor Networks", Proceedings of the 33rd Hawaaian International Conference on Systems Science (HICSS), January 2000.
39:
LEACH is a hierarchical protocol in which most nodes transmit to cluster heads, and the cluster heads aggregate and compress the data and forward it to the base station (sink). Each node uses a
31:(WSNs). The goal of LEACH is to lower the energy consumption required to create and maintain clusters in order to improve the life time of a wireless sensor network.
137:
Multi-clustering might not be required at some point and, at some point, number of optimum clusters could be as high as N (number of live nodes in the network)
271:
187:
266:
68:
20:
86:
Random cluster head selection each round with rotation. Or cluster head selection based on sensor having highest energy
154:
170:
Varshney, Shweta; Kuma, Rakesh (2018). "Variants of LEACH Routing
Protocol in WSN: A Comparative Analysis".
28:
134:
Single hop communication in situations where energy use is less efficient from cluster head to base station
24:
71:
so that each cluster uses a different set of CDMA codes, to minimize interference between clusters.
242:
193:
172:
2018 8th
International Conference on Cloud Computing, Data Science & Engineering (Confluence)
234:
183:
224:
175:
158:
260:
246:
197:
179:
229:
212:
125:
Remaining energy among the nodes isn't considered when selecting
Cluster Heads
40:
27:
protocol which is integrated with clustering and a simple routing protocol in
238:
55:
is the desired percentage of cluster heads. Thereafter, each node has a 1/
47:
Nodes that have been cluster heads cannot become cluster heads again for
213:"A Note on Optimum Cluster Estimation in LEACH Protocol"
95:
Cluster head communicate directly with sink or user
17:Low-energy adaptive clustering hierarchy ("LEACH")
131:Random and uneven distribution of cluster heads
98:Communication done with cluster head via TDMA
8:
211:Roy, Nihar Ranjan; Chandra, Pravin (2018).
128:Random and variable size cluster formations
228:
147:
79:Properties of this algorithm include:
7:
14:
92:Data aggregation at cluster head
180:10.1109/confluence.2018.8442643
121:Shortcomings of LEACH include:
1:
272:Cluster analysis algorithms
230:10.1109/ACCESS.2018.2877704
89:Cluster membership adaptive
288:
174:. IEEE. pp. 199–204.
29:wireless sensor networks
267:Wireless sensor network
106:Shortcomings of LEACH
279:
251:
250:
232:
208:
202:
201:
167:
161:
152:
118:
117:
113:
67:LEACH also uses
287:
286:
282:
281:
280:
278:
277:
276:
257:
256:
255:
254:
223:: 65690–65696.
210:
209:
205:
190:
169:
168:
164:
153:
149:
144:
119:
115:
111:
109:
108:
101:Threshold value
77:
37:
12:
11:
5:
285:
283:
275:
274:
269:
259:
258:
253:
252:
203:
188:
162:
155:Heinzelman, W.
146:
145:
143:
140:
139:
138:
135:
132:
129:
126:
107:
104:
103:
102:
99:
96:
93:
90:
87:
84:
76:
73:
51:rounds, where
36:
33:
13:
10:
9:
6:
4:
3:
2:
284:
273:
270:
268:
265:
264:
262:
248:
244:
240:
236:
231:
226:
222:
218:
214:
207:
204:
199:
195:
191:
189:9781538617199
185:
181:
177:
173:
166:
163:
160:
156:
151:
148:
141:
136:
133:
130:
127:
124:
123:
122:
114:
105:
100:
97:
94:
91:
88:
85:
83:Cluster based
82:
81:
80:
74:
72:
70:
65:
61:
58:
54:
50:
45:
42:
34:
32:
30:
26:
22:
18:
220:
216:
206:
171:
165:
150:
120:
78:
66:
62:
56:
52:
48:
46:
38:
16:
15:
217:IEEE Access
261:Categories
142:References
75:Properties
41:stochastic
239:2169-3536
247:53779139
198:52125657
35:Protocol
23:-based
245:
237:
196:
186:
110:": -->
243:S2CID
194:S2CID
159:Paper
19:is a
235:ISSN
184:ISBN
112:edit
69:CDMA
21:TDMA
225:doi
176:doi
25:MAC
263::
241:.
233:.
219:.
215:.
192:.
182:.
249:.
227::
221:6
200:.
178::
116:]
57:P
53:P
49:P
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.