Knowledge

Talk:Associativity-based routing

Source 📝

364:. As both the suggested uppercase and current lowercase are used in parallel and since the otherwise grammatically correct "Associativity-based Routing" is not commonly used, I prefer the current lower case. See some examples for lower case usage below. I suspect that scientific and other professionals that use "Associativity-Based Routing" (at times without hyphen) like the fact that the caps correspond with the abbreviation. We should prefer the solution that is both commonly used and grammatically correct. 108: 81: 50: 176: 21: 487:
This issue was brought up in the AFD discussion linked above. I think we've noticed that this article is pretty promotional and isn't quite up to Knowledge's standards at the moment. It doesn't help that this is a topic that requires a lot of technical knowledge. It would be helpful if editors who
324:. General English grammar rules are that the second word in a hyphenated word is not capitalized unless it is a proper noun on its own (e.g. "Anglo-Saxon"), which "based" is not. If this is in fact a proper noun, then it should be "Associativity-based Routing". 530: 342:
I'm OK with Associativity-based Routing if that's what grammar dictates. It doesn't sound like you're contesting proper noun status of the subject itself which is what I'm trying to straighten out here.
31: 185: 91: 525: 190: 520: 241: 515: 166: 156: 535: 510: 391:
In an ad-hoc mobile network where mobile hosts (MHs) are acting as routers and where routes are made inconsistent by MHs' movement, we employ an
132: 225:
Subsequent comments should be made in a new section on the talk page. Editors desiring to contest the closing decision should consider a
540: 304: 115: 86: 453:(commonly known as ABR) is a mobile routing protocol invented for wireless ad hoc networks or also known as mobile ad ... 61: 261: 432:
Jul 9, 2014 - Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over
403: 461: 216: 27: 49: 395:
scheme where a route is selected based on nodes having associativity states that imply periods of stability.
308: 128: 473: 469: 226: 67: 329: 20: 131:
on Knowledge. If you would like to participate, please visit the project page, where you can join
444: 489: 488:
are knowledgeable about the topic area could rewrite this article to be more encyclopedic. –
383: 369: 286: 246: 325: 496: 373: 352: 333: 313: 295: 255: 348: 275: 504: 424: 365: 404:
https://www.ietf.org/archive/id/draft-ietf-manet-longlived-adhoc-routing-00.txt
107: 80: 344: 271: 124: 400:
Long-lived ad-hoc routing based on the concept of Associativity, IETF ...
120: 234:
The result of the move request was: Consensus to not move, therefore,
380:
Associativity-Based Routing for Ad Hoc Mobile Networks | SpringerLink
175: 421:
Self-Adaptive Trust Based ABR Protocol for MANETs Using Q-Learning
43: 15: 468:
Subsequent comments should be made in a new section on this
445:
https://www.revolvy.com/page/Associativity%252Dbased-routing
174: 429:
by A Vijaya Kumar - ‎2014 - ‎Cited by 6 - ‎Related articles
531:
Start-Class Computer networking articles of Low-importance
384:
https://link.springer.com/article/10.1023/A:1008812928561
266: 388:
by CK Toh - ‎1997 - ‎Cited by 1245 - ‎Related articles
270:– Specific patented protocol and so is a proper noun ~ 460:
The above discussion is preserved as an archive of a
119:, a collaborative effort to improve the coverage of 229:. No further edits should be made to this section. 476:. No further edits should be made to this section. 425:https://www.hindawi.com/journals/tswj/2014/452362/ 8: 526:Low-importance Computer networking articles 47: 483:The content of this article is problematic 416:(ABR) protocol for ad hoc mobile networks. 215:The following is a closed discussion of a 75: 521:Start-Class Computer networking articles 303:This is a contested technical request ( 77: 441:Associativity-based routing | Revolvy 408:Abstract This document describes the 7: 113:This article is within the scope of 66:It is of interest to the following 30:on 7 September 2018. The result of 14: 516:Low-importance Computing articles 536:All Computer networking articles 278:) 13:29, 7 September 2018 (UTC) 106: 79: 48: 19: 208:Requested move 7 September 2018 161:This article has been rated as 141:Knowledge:WikiProject Computing 26:This article was nominated for 511:Start-Class Computing articles 497:23:18, 21 September 2018 (UTC) 374:06:41, 26 September 2018 (UTC) 296:22:28, 17 September 2018 (UTC) 256:21:10, 26 September 2018 (UTC) 242:closed by non-admin page mover 144:Template:WikiProject Computing 1: 353:16:03, 8 September 2018 (UTC) 334:17:19, 7 September 2018 (UTC) 314:13:34, 7 September 2018 (UTC) 183:This article is supported by 135:and see a list of open tasks. 451:Associativity-based routing 434:associativity based routing 393:associativity-based routing 267:Associativity-Based Routing 262:Associativity-based routing 557: 167:project's importance scale 182: 160: 101: 74: 466:Please do not modify it. 222:Please do not modify it. 541:All Computing articles 179: 129:information technology 56:This article is rated 186:Networking task force 178: 116:WikiProject Computing 310:SarekOfVulcan (talk) 410:associativity-based 180: 147:Computing articles 62:content assessment 316: 298: 245: 205: 204: 201: 200: 197: 196: 42: 41: 548: 311: 302: 279: 269: 239: 224: 149: 148: 145: 142: 139: 110: 103: 102: 97: 94: 83: 76: 59: 53: 52: 44: 23: 16: 556: 555: 551: 550: 549: 547: 546: 545: 501: 500: 485: 480: 436:(ABR) protocol. 309: 265: 220: 210: 146: 143: 140: 137: 136: 95: 89: 60:on Knowledge's 57: 12: 11: 5: 554: 552: 544: 543: 538: 533: 528: 523: 518: 513: 503: 502: 484: 481: 479: 478: 462:requested move 456: 455: 454: 448: 442: 438: 437: 430: 427: 422: 418: 417: 406: 401: 397: 396: 389: 386: 381: 377: 376: 358: 357: 356: 355: 337: 336: 318: 317: 259: 232: 231: 217:requested move 211: 209: 206: 203: 202: 199: 198: 195: 194: 191:Low-importance 181: 171: 170: 163:Low-importance 159: 153: 152: 150: 133:the discussion 111: 99: 98: 96:Low‑importance 84: 72: 71: 65: 54: 40: 39: 32:the discussion 24: 13: 10: 9: 6: 4: 3: 2: 553: 542: 539: 537: 534: 532: 529: 527: 524: 522: 519: 517: 514: 512: 509: 508: 506: 499: 498: 495: 494: 493: 482: 477: 475: 471: 467: 463: 458: 457: 452: 449: 446: 443: 440: 439: 435: 431: 428: 426: 423: 420: 419: 415: 411: 407: 405: 402: 399: 398: 394: 390: 387: 385: 382: 379: 378: 375: 371: 367: 363: 360: 359: 354: 350: 346: 341: 340: 339: 338: 335: 331: 327: 323: 320: 319: 315: 312: 306: 301: 300: 299: 297: 293: 292: 291: 285: 284: 277: 273: 268: 263: 258: 257: 253: 252: 251: 243: 237: 230: 228: 223: 218: 213: 212: 207: 192: 189:(assessed as 188: 187: 177: 173: 172: 168: 164: 158: 155: 154: 151: 134: 130: 126: 122: 118: 117: 112: 109: 105: 104: 100: 93: 88: 85: 82: 78: 73: 69: 63: 55: 51: 46: 45: 37: 33: 29: 25: 22: 18: 17: 492:FenixFeather 491: 490: 486: 465: 459: 450: 433: 413: 409: 392: 361: 321: 289: 288: 282: 281: 260: 249: 248: 235: 233: 221: 214: 184: 162: 114: 68:WikiProjects 35: 474:move review 412:long-lived 227:move review 58:Start-class 505:Categories 326:Rreagan007 283:Relisting. 92:Networking 470:talk page 305:permalink 236:not moved 138:Computing 125:computing 121:computers 87:Computing 472:or in a 28:deletion 414:routing 287:Dreamy 247:Dreamy 165:on the 366:gidonb 362:Oppose 322:Oppose 127:, and 64:scale. 370:talk 349:talk 345:Kvng 330:talk 294:🎷 290:Jazz 276:talk 272:Kvng 254:🎷 250:Jazz 36:keep 34:was 307:). 157:Low 507:: 464:. 372:) 351:) 332:) 280:-- 264:→ 238:. 219:. 193:). 123:, 90:: 447:? 368:( 347:( 343:~ 328:( 274:( 244:) 240:( 169:. 70:: 38:.

Index

Articles for deletion
deletion
the discussion

content assessment
WikiProjects
WikiProject icon
Computing
Networking
WikiProject icon
WikiProject Computing
computers
computing
information technology
the discussion
Low
project's importance scale
Taskforce icon
Networking task force
Low-importance
requested move
move review
closed by non-admin page mover
Dreamy Jazz
21:10, 26 September 2018 (UTC)
Associativity-based routing
Associativity-Based Routing
Kvng
talk
Dreamy Jazz

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.