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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Space-Time Rout<strong>in</strong>g <strong>in</strong> Ad Hoc Networks 11spatial and temporal distance <strong>in</strong>formation to determ<strong>in</strong>e which rout<strong>in</strong>g entries canbe used to advance a packet towards its dest<strong>in</strong>ation; it can be contrasted withexist<strong>in</strong>g protocols, which are grounded <strong>in</strong> the classic Dijkstra or Bellman-Fordalgorithms and use only spatial <strong>in</strong>formation. We have given a general formulationand discussed possible <strong>in</strong>stances of STR, <strong>in</strong>clud<strong>in</strong>g FRESH [3] and GREP [4],and discussed STR properties and loop-freedom.We believe that STR offers many opportunities for future research. One directionof future <strong>in</strong>vestigation consists <strong>in</strong> explor<strong>in</strong>g other STR <strong>in</strong>stances, such asthose outl<strong>in</strong>ed <strong>in</strong> Sect. 3.3. Another concerns the design of schemes to allow progressiveoptimization of routes computed <strong>by</strong> STR, s<strong>in</strong>ce STR may provide routesof suboptimal length. F<strong>in</strong>ally, we will consider STR <strong>in</strong> context where topologychange occurs as a result of dynamics other than node mobility. For example,nodes <strong>in</strong> a sensor network usually have static positions, but topology may bedynamic as a result of duty cycl<strong>in</strong>g.References1. Perk<strong>in</strong>s, C.E., Beld<strong>in</strong>g-Royer, E.M., Das, S.R.: Ad hoc on demand distance vector(aodv) rout<strong>in</strong>g. IETF, Internet-Draft (2003)2. Johnson, D.B., Maltz, D.A., Hu, Y.C., Jetcheva, J.G.: The dynamic source rout<strong>in</strong>gprotocol for mobile ad hoc networks (dsr). IETF, Internet-Draft (2003)3. Dubois-Ferriere, H., Grossglauser, M., Vetterli, M.: Age matters: Efficient routediscovery <strong>in</strong> mobile ad hoc networks us<strong>in</strong>g last encounter ages. In: Proceed<strong>in</strong>gsof The Fourth ACM International Symposium on Mobile Ad Hoc Network<strong>in</strong>g andComput<strong>in</strong>g, Annapolis, MD (2003)4. Dubois-Ferriere, H., Grossglauser, M., Vetterli, M.: Generalized route establishmentprotocol (grep): Proof of loop-free operation. In: EPFL Technical ReportIC/2003/40. (2003)5. Boppana, R.V., Konduru, S.: An adaptive distance vector rout<strong>in</strong>g algorithm formobile, ad hoc networks. In: Proceed<strong>in</strong>gs of the Twentieth Annual Jo<strong>in</strong>t Conferenceof the IEEE <strong>Computer</strong> and communications Societies. (2001) 1753–17626. Lamport, L.: Time, clocks and the order<strong>in</strong>g of events <strong>in</strong> a distributed system. In:Communications of the ACM. (1978)

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

Saved successfully!

Ooh no, something went wrong!