13.07.2015 Views

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

SHOW MORE
SHOW LESS

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

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

SAFAR: An Adaptive Bandwidth-Efficient Rout<strong>in</strong>g Protocol 236 Optimization of PowerAs mentioned earlier, our protocol can switch over from the bandwidth to thepower doma<strong>in</strong> dur<strong>in</strong>g its operation. In this section, we show that bandwidth andpower are <strong>in</strong>terchangeable.To make SAFAR power centric, the bandwidth field of a node is replacedwith a power field(<strong>in</strong> battery time rema<strong>in</strong><strong>in</strong>g). Us<strong>in</strong>g this, it aga<strong>in</strong> selects nodeswhich will be ‘alive’ for a longer time.Table build-up phase: This is <strong>in</strong> direct correspondence with a high bandwidthnode, s<strong>in</strong>ce a node with higher battery power would be able to susta<strong>in</strong> moredata and rout<strong>in</strong>g traffic. This would also provide relief to nodes with low power,as they would not have to handle requests other than their own traffic. A nodewith low power would not be concerned with route efficiency and latency. S<strong>in</strong>ceit has low power, it would have few nodes <strong>in</strong> the proactive list and hence wouldnot spend too much time with Type-1 query<strong>in</strong>g. Instead, it proceeds directly toType-2 query<strong>in</strong>g which is more likely to yield a route, and also consumes lesspower <strong>in</strong> that node, than a comb<strong>in</strong>ed Type-1 Type-2 mechanism, as it has totransmit more packets which corresponds to more transmission power. Aga<strong>in</strong> ithas to be noted that this is achieved completely dynamically. In case of multipleresponses <strong>in</strong> the power doma<strong>in</strong>, the path hav<strong>in</strong>g the maximum least battery timeis chosen.7 ConclusionIn this paper, we have presented and evaluated a bandwidth adaptive hybrid protocolthat is well suited for operation <strong>in</strong> mobile ad hoc networks. The protocoluses a table build-up procedure whose little overhead is well used <strong>in</strong> the dynamicma<strong>in</strong>tenance of neighbor<strong>in</strong>g nodes on the basis of bandwidth fitness. This alsoleads to reduc<strong>in</strong>g the route acquisition latency and hence reduces rout<strong>in</strong>g overhead.It was also seen that the protocol adapts to vary<strong>in</strong>g high traffic conditions,where<strong>in</strong> a node is given the option of reduc<strong>in</strong>g its traffic <strong>by</strong> prevent<strong>in</strong>g othersfrom us<strong>in</strong>g it. An improvement to the protocol will be <strong>in</strong> us<strong>in</strong>g a hybrid costfactor, which <strong>in</strong>cludes both power and bandwidth <strong>in</strong>stead of one of them purely,mak<strong>in</strong>g it a better estimate of the network’s performance constra<strong>in</strong>t.References1. J Macker, S Corson: “Mobile Ad hoc Network<strong>in</strong>g (MANET): Rout<strong>in</strong>g ProtocolPerformance Issues and Evaluation Considerations”, Internet draft, January ’99.2. Charles E. Perk<strong>in</strong>s and Prav<strong>in</strong> Bhagwat: “Highly dynamic Dest<strong>in</strong>ation-SequencedDistance-Vector rout<strong>in</strong>g (DSDV) for mobile computers”,pages 234-244, In Proceed<strong>in</strong>gsof the SIGCOMM ’94 Conference on Communications Architectures, Protocolsand Applications, August ’94.3. Charles E. Perk<strong>in</strong>s and Elizabeth M. Royer: “Ad Hoc On Demand Distance Vector(AODV) algorithm”, In Proceed<strong>in</strong>gs of WMCSA’99, New Orleans, LA, February’99.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!