Wireless Ad Hoc and Sensor Networks

More documents

Recommendations

Info

Optimized Energy and Delay-Based Routing 3678.3.3 MPR and Energy-Delay Information DeclarationEach node in the network that is selected as MPR, by at least one of itsneighbors, transmits a TC message periodically. The TC message containsinformation about the MPR node’s selector set, which is a subset of theone-hop neighbors that have selected the sender node as a MPR. Moreover,the TC message format is modified to include the link costs (energydelay) between the MPR node and its selectors. TC messages are forwardedthroughout the network like usual broadcast messages, exceptthat only the MPR nodes forward the message to the next hop.The proposed OEDR protocol significantly reduces the overhead intransmitting the cost information, in contrast to a normal link-state algorithm,which uses flooding to broadcast control messages with cost information.In the OEDR protocol, only the MPR nodes (which are a smallsubset of the one-hop neighbors) forward the broadcast control messages,instead of all the neighbor nodes. Moreover, only the nodes that areselected as MPRs generate the TC messages that contain cost information,instead of all the nodes in the network. Also, the size of the TC controlmessages is smaller because it contains the costs of only the links betweenthe source node and its MPR selectors.Each node in the network maintains a “topology table,” in which itrecords the information about the topology of the network obtained fromthe TC messages, along with the link costs. An entry in the topology tableconsists of the address of a destination (an MPR selector in the receivedTC message), address of the last-hop node to that destination (originatorof the TC message), and the cost of the link between the destination andits last-hop. It implies that the destination node can be reached in the lasthop through this last-hop node at the given cost.Whenever a node receives a TC message, it records the information asentries into the topology table with the addresses in the MPR selector setas the destinations, the originator as the last-hop, and the correspondinglink costs. Based on this information, the routing table is calculated.8.3.4 Routing Table CalculationEach node maintains a “routing table,” which enables it to route packetsfor other destinations in the network. The routing table entries consist ofthe destination address, next-hop address, estimated distance to destination,and cost of the path from the source to the destination ( Cost sd , ). Eachdestination has an entry in the routing table, for which a route is knownfrom the given node to the destination. The proposed OEDR protocoldetermines the routes to destinations, by using a least-cost spanning treemethod with the energy-delay product of the links as costs of the edges.By contrast, the OLSR protocol computes the routes, based on a shortest
368 Wireless Ad Hoc and Sensor Networkspath algorithm, using number of hops as the metric. OLSR’s method maynot result in optimal routes, in most cases, in terms of delay and energyconsumption for ad hoc wireless networks. The following algorithm isused by the OEDR protocol to calculate the routing table, based on theinformation contained in neighbor and topology tables (flowchart for thealgorithm is presented in Figure 8.4). Algorithm:1. Clear all entries in the routing table, RT() s , of node s .2. Record the new entries in the RT()s , starting with one-hop neighborsin Ns () as destination nodes. For each neighbor entry in theneighbor table, record a new route entry in the routing table,where destination and next-hop addresses are both set to theaddress of the neighbor; distance is set to 1, and the cost of theroute is set to the cost of the link from the neighbor table.3. Then record the new entries for destination nodes i + 1 hops awayin the routing table. The following procedure is executed for eachvalue of i , starting with i = 1 and incrementing it by 1 each time. Theexecution will be stopped if no new entry is recorded in an iteration.• For each topology entry in the topology table, if the last-hopaddress corresponds to the destination address of a route entrywith distance equal to i , then check to see if a route entryalready exists for this destination address.a. If the destination address of the topology entry does notcorrespond to the destination address of any route entryin the routing table, then a new route entry is recorded inthe routing table where:• Destination is set to destination address in topologytable.• Next-hop is set to next-hop of the route entry whosedestination is equal to previously mentioned last-hopaddress.• Distance is set to i + 1.• Cost of the route is set to the sum: Cost s, last−hop+ C last − hop, destination (cost of the route entry in the RT()swith the last-hop as its destination address + cost of thelink between the destination and its last-hop from thetopology table).b. Else, if there exists a route entry in RT()s whose destinationaddress corresponds to the destination address of the topologyentry, then compute the cost of the new route as the
Page 2 and 3:
Wireless Ad Hocand SensorNetworksPr
Page 4:
18. Chaos in Automatic Control, edi
Page 7 and 8:
CRC PressTaylor & Francis Group6000
Page 10 and 11:
Table of Contents1 Background on Ne
Page 12 and 13:
3 Congestion Control in ATM Network
Page 14 and 15:
5.4.2 Distributed Power Controller
Page 16 and 17:
7.3 Adaptive and Distributed Fair S
Page 18:
9.2.2 Overview.....................
Page 21 and 22:
the number of connections in each l
Page 23 and 24:
y Maheswaran Thiagarajan, and tirel
Page 25 and 26:
2 Wireless Ad Hoc and Sensor Networ
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
10 Wireless Ad Hoc and Sensor Netwo
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Page 47 and 48:
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 72 and 73:
2BackgroundIn this chapter, we prov
Page 74 and 75:
Background 51u(k)x n (k + 1)x n (k)
Page 76 and 77:
Background 53with x( 0)being the in
Page 78 and 79:
Background 55with tr(.) the matrix
Page 80 and 81:
Background 57nGiven a function ft (
Page 82 and 83:
Background 592.3.2 Lyapunov Stabili
Page 84 and 85:
Background 61as well as Jagannathan
Page 86 and 87:
Background 63The subsequent example
Page 88 and 89:
Background 65Evaluating this along
Page 90 and 91:
Background 67Now, select the feedba
Page 92 and 93:
Background 69is SISL if and only if
Page 94 and 95:
Background 71L 1 (x)L(x, t)L 0 (x)0
Page 96 and 97:
Background 73for some R > 0 such th
Page 98 and 99:
Background 75Evaluating the first d
Page 100:
Background 77Section 2.4Problem 2.4
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
100 Wireless Ad Hoc and Sensor Netw
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 170 and 171:
4Admission Controller Design for Hi
Page 172 and 173:
Admission Controller Design for Hig
Page 174 and 175:
Page 176 and 177:
Page 178 and 179:
Page 180 and 181:
Page 182 and 183:
Page 184 and 185:
Page 186 and 187:
Page 188 and 189:
Page 190 and 191:
Page 192 and 193:
Page 194 and 195:
Page 196 and 197:
Page 198:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Page 223 and 224:
Page 225 and 226:
Page 227 and 228:
Page 229 and 230:
Page 231 and 232:
Page 233 and 234:
Page 235 and 236:
Page 237 and 238:
Page 239 and 240:
Page 241 and 242:
Page 243 and 244:
Page 245 and 246:
Page 247 and 248:
Page 249 and 250:
Page 251 and 252:
Page 253 and 254:
Page 255 and 256:
Page 257 and 258:
Page 259 and 260:
Page 261 and 262:
Page 263 and 264:
Page 265 and 266:
Page 267 and 268:
Page 269 and 270:
Page 271 and 272:
Page 273 and 274:
Page 275 and 276:
Page 277 and 278:
Page 279 and 280:
Page 281 and 282:
Page 283 and 284:
Page 285 and 286:
Page 287 and 288:
Page 289 and 290:
Page 291 and 292:
Page 293 and 294:
Page 295 and 296:
Page 297 and 298:
Page 299 and 300:
Page 301 and 302:
Page 303 and 304:
Page 305 and 306:
Page 307 and 308:
Page 309 and 310:
Page 311 and 312:
Page 313 and 314:
Page 315 and 316:
Page 317 and 318:
Page 319 and 320:
Page 321 and 322:
Page 323 and 324:
Page 326 and 327:
7Distributed Fair Scheduling in Wir
Page 328 and 329:
Distributed Fair Scheduling in Wire
Page 330 and 331:
Page 332 and 333:
Page 334 and 335:
Page 336 and 337:
Page 338 and 339:
Page 340 and 341: Distributed Fair Scheduling in Wire
Page 380 and 381: 8Optimized Energy and Delay-Based R
Page 382 and 383: Optimized Energy and Delay-Based Ro
Page 440 and 441:
Optimized Energy and Delay-Based Ro
Page 442 and 443:
Page 444 and 445:
Page 446 and 447:
Page 448 and 449:
Page 450 and 451:
Page 452 and 453:
9Predictive Congestion Control for
Page 454 and 455:
Predictive Congestion Control for W
Page 456 and 457:
Page 458 and 459:
Page 460 and 461:
Page 462 and 463:
Page 464 and 465:
Page 466 and 467:
Page 468 and 469:
Page 470 and 471:
Page 472 and 473:
Page 474 and 475:
Page 476 and 477:
Page 478 and 479:
Page 480 and 481:
Page 482 and 483:
Page 484 and 485:
10Adaptive and Probabilistic Power
Page 486 and 487:
Adaptive and Probabilistic Power Co
Page 488 and 489:
Page 490 and 491:
Page 492 and 493:
Page 494 and 495:
Page 496 and 497:
Page 498 and 499:
Page 500 and 501:
Page 502 and 503:
Page 504 and 505:
Page 506 and 507:
Page 508:
Page 511 and 512:
Page 513 and 514:
Page 515 and 516:
Page 517 and 518:
Page 519 and 520:
Page 521 and 522:
Page 523 and 524:
Page 525 and 526:
Page 527 and 528:
Page 529 and 530:
Page 531 and 532:
Page 533 and 534:
Page 535 and 536:
Page 537:
show all

Wireless Ad Hoc and Sensor Networks

Create successful ePaper yourself

Delete template?

Save as template?