69:
If (A∉ActiveConn) then If (A->ConnNeighbors.getSize() == 0) A->ConnNeighbors.add(ActiveConn) Continue = TRUE else If (ActiveConn ∩ ConnNeighbors == TRUE) ActiveConn ∪ ConnNeighbors
Continue = TRUE Endif Endif Endif End For End While Endif If (A->ConnNeighbors.getSize() < A->Neighbors.getSize()) A->SetCritical() = TRUE else A->SetNonCritical() = INTERMEDIATE Endif End For End Function
78:
68:
Function LASCNN(MAHSN) For ∀ A ∈ MAHSN If (A->ConnList.getSize() == 1) then A->SetNonCritical() = LEAF Else
Continue = TRUE While (Continue == TRUE) Continue = FALSE For ∀ ActiveConn ∈ ConnList
210:
Mohammed Alnuem, Nazir Ahmad Zafar, Muhammad Imran, Sana Ullah, and
Mahmoud S. Fayed. "Formal specification and validation of a localized algorithm for segregation of critical/noncritical nodes in MAHSNs." International Journal of Distributed Sensor Networks 10, no. 6 (2014):
156:
N. Javaid, A. Ahmad, M. Imran, A. A. Alhamed and M. Guizani, "BIETX: A new quality link metric for Static
Wireless Multi-hop Networks," 2016 International Wireless Communications and Mobile Computing Conference (IWCMC), Paphos, 2016, pp. 784–789,
44:
odes The algorithm works on the principle of distinguishing between critical and non-critical nodes for network connectivity based on limited topology information. The algorithm finds the critical nodes with partial information within a few hops.
48:
This algorithm can distinguish the critical nodes of the network with high precision, indeed, accuracy can reach 100% when identifying non-critical nodes. The performance of LASCNN is scalable and quite competitive compared to other schemes.
146:
Muhammad Imran, Mohamed A. Alnuem, Mahmoud S. Fayed, and Atif Alamri. "Localized algorithm for segregation of critical/non-critical nodes in mobile ad hoc and sensor networks." Procedia
Computer Science 19 (2013):
183:
Zhang, Y.; Zhang, Z.; Zhang, B. A Novel Hybrid
Optimization Scheme on Connectivity Restoration Processes for Large Scale Industrial Wireless Sensor and Actuator Networks. Processes 2019, 7, 939.
192:
Kasali, F. A., Y. A. Adekunle, A. A. Izang, O. Ebiesuwa, and O. Otusile. "Evaluation of Formal Method Usage amongst
Babcock University Students in Nigeria." Evaluation 5, no. 1 (2016).
174:
Kim, Beom-Su, Kyong Hoon Kim, and Ki-Il Kim. "A survey on mobility support in wireless body area networks." Sensors 17, no. 4 (2017): 797.
85:
The
Critical Nodes application is a Free Open-Source implementation for the LASCNN algorithm. The application was developed in 2013 using
118:
113:
220:
Fayed, Al-Qurishi, Alamri, Aldariseh (2017) PWCT: visual language for IoT and cloud computing applications and systems, ACM
98:
257:
252:
128:
103:
108:
123:
247:
158:
77:
201:
G. Sugithaetal., International
Journal of Advanced Engineering Technology E-ISSN 0976-3945
241:
232:
81:
Critical Nodes
Application - An implementation for the LASCNN algorithm using PWCT
65:-hop information. If the neighbors stay connected then the node is non-critical.
162:
61:-hop neighbor list and a duplicate free pair wise connection list based on
86:
8:
76:
139:
87:Programming Without Coding Technology
7:
57:The LASCNN algorithm establishes a
14:
119:Critical point (network science)
114:Cheeger constant (graph theory)
1:
99:Connectivity (graph theory)
274:
233:Critical Nodes application
163:10.1109/IWCMC.2016.7577157
82:
80:
129:Breadth-first search
104:Dynamic connectivity
109:Strength of a graph
124:Depth-first search
83:
16:In graph theory,
265:
258:Graph algorithms
221:
218:
212:
208:
202:
199:
193:
190:
184:
181:
175:
172:
166:
154:
148:
144:
273:
272:
268:
267:
266:
264:
263:
262:
238:
237:
229:
224:
219:
215:
209:
205:
200:
196:
191:
187:
182:
178:
173:
169:
155:
151:
145:
141:
137:
95:
75:
70:
64:
60:
55:
12:
11:
5:
271:
269:
261:
260:
255:
253:Network theory
250:
240:
239:
236:
235:
228:
227:External links
225:
223:
222:
213:
203:
194:
185:
176:
167:
149:
138:
136:
133:
132:
131:
126:
121:
116:
111:
106:
101:
94:
91:
74:
73:Implementation
71:
67:
62:
58:
54:
51:
32:egregation of
13:
10:
9:
6:
4:
3:
2:
270:
259:
256:
254:
251:
249:
246:
245:
243:
234:
231:
230:
226:
217:
214:
207:
204:
198:
195:
189:
186:
180:
177:
171:
168:
164:
160:
153:
150:
143:
140:
134:
130:
127:
125:
122:
120:
117:
115:
112:
110:
107:
105:
102:
100:
97:
96:
92:
90:
88:
79:
72:
66:
52:
50:
46:
43:
39:
35:
31:
28:lgorithm for
27:
23:
19:
216:
206:
197:
188:
179:
170:
152:
142:
84:
56:
47:
41:
40:on-critical
37:
33:
29:
25:
21:
17:
15:
242:Categories
147:1167–1172.
135:References
89:software.
53:Pseudocode
24:ocalized
248:Networks
93:See also
36:ritical/
211:140973
18:LASCNN
20:is a
159:doi
244::
165:.
161::
63:k
59:k
42:N
38:N
34:C
30:S
26:A
22:L
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
