Wireless Ad Hoc and Sensor Networks

More documents

Recommendations

Info

Optimized Energy and Delay-Based Routing 383Sensor nodes play the dual role of data collection and routing and thereforeneed energy to perform. Malfunctioning of a few nodes, due tohardware or lack of energy, in the network will cause significant topologychanges, leading to greater consumption of energy and rerouting of packets.Therefore, energy efficient schemes and communication protocols arebeing designed for WSNs.One of the requirements for a protocol is scalability, meaning that theaddition of more nodes to the existing network should not affect thefunctionality of the network with the protocol. Therefore, the communicationprotocols for the WSNs should take into consideration their limitedresources such as battery power, memory, and bandwidth, and be able tofunction in the face of topology changes due to node mobility as well asguaranteeing scalability.Available routing protocols for sensor networks are classified as datacentric,location based, quality of service (QoS) aware, and hierarchicalprotocols. Data-centric protocols (Esler et al. 1999) such as SPIN (Heizelmanet al. 1999), directed diffusion (Intanagonwiwat et al. 2003), and GRAB(Ye et al. 2003, 2005) consolidate redundant data when routing from sourceto destination. Location-based routing protocols such as GPSR (Hill et al.2000), GEAR (Zhang et al. 2004), and TTDD (Luo et al. 2002) require GPSsignals to determine an optimal path so that the flooding of routingrelatedcontrol packets is not necessary. From Chapter 1, sensor nodes arenot supposed to have GPS devices and therefore such protocols havelimited use. On the other hand, QoS aware protocols such as SPEED(He et al. 2003) address various requirements such as energy efficiency,reliability, and real-time requirements. Finally, the hierarchical protocolssuch as LEACH (Heinzelman et al. 2002), TEEN (Manjeshwar et al.2001), APTEEN (Manjeshwar et al. 2002), and PEGASIS (Lindsey andRaghavendra 2002) form clusters and CHs to minimize the energy consumptionboth for processing and transmission of data.In LEACH, the CH function is rotated among the nodes to reduce theenergy consumption because only the CHs communicate to the BS eventhough the placements of CHs are not uniform. Nodes in TEEN andAPTEEN are designed to respond to sudden changes in the sensedattribute when the attribute exceeds a user-defined threshold. On the otherhand, PEGASIS is a chain-based protocol in which rather than multipleCH sending data, only one node in the chain is selected to transmit to theBS. LEACH, TEEN, APTEEN, and PEGASIS assume that the position ofthe BS is fixed and every node in the sensor network can directly communicateto it. This assumption is not always valid in larger networks,because the BS could be out of range with some of the CHs making amultihop routing protocol a necessity.AODV is an on-demand routing protocol that discovers routes on an“as-needed” basis for wireless ad hoc networks. It uses traditional routing
384 Wireless Ad Hoc and Sensor Networkstables where a single entry per destination is entered. AODV relies on therouting table entries to send a route reply (RREP) back to the source andtherefore routes data to the destination. To prevent routing loops, AODVuses sequence numbers to determine the originality of the routing information.By contrast, DSR uses the concept of source routing, wherein the senderknows the complete route to the destination because the routes are storedin a route cache. When a node attempts to send data packets to a destinationwhose route is unknown, it uses the route discovery process todynamically determine the route. The network is flooded with a routerequest (RREQ) packet. Each node that receives this RREQ packet keepsrebroadcasting it until it reaches a node that knows the route to thedestination. This node then replies with a RREP that is routed back to thesource node. Then using this route, the data is transmitted from the sourceto the destination.On the other hand, the Bellman Ford algorithm computes the shortestpaths from the source to the destination, based on the distance vector(DV) routing algorithm. The DV requires that each of the RNs informs itsneighbors to the routing table. Using the lowest cost assigned for theminimum distance, the best node is selected and added to the routingtable. This procedure is followed till the destination is reached.The OEDR scheme is a routing protocol that generates paths based ona routing metric, defined in terms of energy efficiency, delay, and the stateof the radio channel again for wireless ad hoc networks. It uses a conceptof MPRs to minimize overhead. The MPR nodes are selected, based on alink cost factor which is a product of energy and delay. Using the MPRnodes and the minimum-cost spanning tree algorithm, the optimum routeto the destination is computed. Hierarchical routing protocols such asLEACH are typically employed for wireless sensor networks.This chapter now presents an OEDSR protocol (Ratnaraj et al. 2006) forWSN, where the information from the CHs to the BS is routed in amultihop fashion by maximizing a routing metric, which in turn, ensuresthe lifetime of the network. OEDSR uses a link cost factor, which is definedusing available energy, E2E delay, and distance from a node to the BS,along with clustering, to effectively route information to the BS. Thelink_cost_ factor is defined at a given node as the ratio of energy availableover the E2E delay and shortest distance to the BS. This identifies anoptimal route by maximizing the link_cost_ factor while guaranteeing theperformance analytically.This routing protocol uses routing metrics similar to OEDR, but it is anon-demand protocol compared to the proactive OEDR protocol. Additionally,clusters are formed only in the subnetworks in the case of OEDSR,and the rest of the network outside the subnetwork is treated as an adhoc wireless network. The performance of the proposed routing protocol
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:
Page 342 and 343:
Page 344 and 345:
Page 346 and 347:
Page 348 and 349:
Page 350 and 351:
Page 352 and 353:
Page 354 and 355:
Page 356 and 357: 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 452 and 453: 9Predictive Congestion Control for
Page 454 and 455: Predictive Congestion Control for W
Page 456 and 457:
Predictive Congestion Control for W
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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?