On ad hoc routing with guaranteed delivery

Computer Science – Distributed – Parallel – and Cluster Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We point out a simple poly-time log-space routing algorithm in ad hoc
networks with guaranteed delivery using universal exploration sequences.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On ad hoc routing with guaranteed delivery does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On ad hoc routing with guaranteed delivery, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On ad hoc routing with guaranteed delivery will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-270522

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.