[Csci551-talk] Re: RE: Routing in Wireless

nainesh solanki nsolanki at usc.edu
Thu May 5 12:37:56 PDT 2005


Hi,

I believe there are DV algorithms specially designed for the mobile Ad-hoc environments such as the AODV which are also on-demand and compute routes on the fly. I read a research paper that compared the performance of AODV and DSR which as far as I remember showed that AODV infact performed better than DSR in more dynamically changing wireless networks. My point is that we do have optimizations with DV algorithms that do perform well in mobile ad-hoc networks(or MANETs as they are popularly called).

Nainesh

----- Original Message -----


> 
> Message: 3
> Date: Wed, 4 May 2005 22:28:16 -0700
> From: "Affan, Syed" <asyed at usc.edu>
> Subject: RE: [Csci551-talk] RE: Routing in Wireless
> To: "'S. Rubin'" <srubin at flash.net>, <csci551-talk at mailman.isi.edu>
> Message-ID: <000b01c55133$41dd95f0$0400a8c0 at A2D>
> Content-Type: text/plain; charset="us-ascii"
> 
> I would go with Sophia, DSR (esp with intelligent caching) the best
> option for highly mobile networks.
> 
> 
> 
> Best Regards,
> 
> Affan, Syed. 
> 
> 
> 
> -----Original Message-----
> From: csci551-talk-bounces at mailman.isi.edu
> [csci551-talk-bounces at mailman.isi.edu] On Behalf Of S. Rubin
> Sent: Wednesday, May 04, 2005 10:20 PM
> To: csci551-talk at mailman.isi.edu
> Subject: [Csci551-talk] RE: Routing in Wireless
> 
> 
> 
> I was just studying this area, and my understanding is that we should
> not use
> 
> Distance Vector or Link State due to too much overhead.  They have to
> constantly
> 
> advertise their routes, even if there are no changes.  Link State also
> needs a lot of
> 
> storage space.  Since DSR does not use periodic routing advertisement
> messages,
> 
> it results in reduced network bandwidth overhead, reduced power 
> usage as
> hosts can 
> 
> "sleep" or be on "standby". Routes are dynamically determined 
> based on
> cached 
> 
> information and on the results of a route discovery protocol. 
> 
> Sophia
> 
> 
> 
> In highly dynamic wireless network which routing should perform 
> the best
> Source/Distance Vector/Link State Routing ?
> 
> Energy : All should perform equally well as there will be regular
> updates
> Comm : DV = DSR > LS (hign comm cost)
> 
> However I am not too convinced about what I have said .
> 
> -Nikhil Bhatia
> 
> 
> -------------- next part --------------
> An HTML attachment was scrubbed...
> URL: http://mailman.isi.edu/pipermail/csci551-
> talk/attachments/20050504/cd558b5c/attachment-0001.html
> 
> ------------------------------
> 
> Message: 4
> Date: Wed, 04 May 2005 22:33:24 -0700
> From: nikhil bhatia <nikhilbh at usc.edu>
> Subject: [Csci551-talk] Re :Routing in Wireless
> To: csci551-talk at mailman.isi.edu
> Message-ID: <1e52b76a21a87.42794db4 at usc.edu>
> Content-Type: text/plain; charset=us-ascii
> 
> I understand what you have said, however my question was targeted 
> at dynamic wireless networks. 
> In this scenerio there have to be regular updates( even in DSR). 
> Infact I beleive is it not the same comparison
> of (BGP:Overlay Networks) justification . May be DSR switches from 
> SLEEP to ACTIVE modes is not required due 
> the inherent environment.
> I am still not not convinced :)
> -Nikhil Bhatia
> 
> 
> Reply To :-
> 
> I was just studying this area, and my understanding is that we 
> should not use
> 
> Distance Vector or Link State due to too much overhead.  They have 
> to constantly
> 
> advertise their routes, even if there are no changes.  Link State 
> also needs a lot of
> 
> storage space.  Since DSR does not use periodic routing 
> advertisement messages,
> 
> it results in reduced network bandwidth overhead, reduced power 
> usage as hosts can 
> 
> "sleep" or be on "standby". Routes are dynamically determined 
> based on cached 
> 
> information and on the results of a route discovery protocol. 
> 
> Sophia
> 
> 
> 
> 
> 
> ------------------------------
> 
> Message: 5
> Date: Wed, 4 May 2005 22:41:42 -0700 (PDT)
> From: "S. Rubin" <srubin at flash.net>
> Subject: [Csci551-talk] finger tables
> To: csci551-talk at mailman.isi.edu
> Message-ID: <20050505054142.84196.qmail at web81305.mail.yahoo.com>
> Content-Type: text/plain; charset="us-ascii"
> 
> I am fuzzy on how we get the third column in the finger table 
> (successors).I get the first column (identifiers), and the second 
> column (intervals), but
> cannot follow through for the 3rd.  I re-read sections 4.2 ane 4.3 
> of the 
> Chord paper several times, but it still escapes me.  Can someone 
> demystify it, please.
> 
> Sophia
> -------------- next part --------------
> An HTML attachment was scrubbed...
> URL: http://mailman.isi.edu/pipermail/csci551-
> talk/attachments/20050504/c6486646/attachment-0001.html
> 
> ------------------------------
> 
> _______________________________________________
> Csci551-talk mailing list
> Csci551-talk at mailman.isi.edu
> http://mailman.isi.edu/mailman/listinfo/csci551-talk
> 
> 
> End of Csci551-talk Digest, Vol 10, Issue 4
> *******************************************
> 



More information about the Csci551-talk mailing list