CarNet Scalable Ad-Hoc wireless network MIT –http://citeseer.nj.nec.com/cache/papers/cs/13 849/http:zSzzSzwww.pdos.lcs.mit.eduzSz~rt mzSzpaperszSzcarnet00.pdf/morris00carnet. pdfhttp://citeseer.nj.nec.com/cache/papers/cs/13 849/http:zSzzSzwww.pdos.lcs.mit.eduzSz~rt mzSzpaperszSzcarnet00.pdf/morris00carnet. pdf
Motivation Low touch deployment of nodes to the network –Adding a new node place new node within radio range of existing node, no human intervention –No relying on fixed infrastructure. –Mobile nodes –Applications to be able to interact with changing set of nodes –Underlying protocols to provide APIs and algorithms for applications to make use of of the changing network topologies. Solution –Grid (Not GRID as in GGF).
Architecture Most mobile ad-hoc routing based on flooding and multicast. Grid based on annotating packet with destination geographic (Lat/Long) location. Node does a look up –Distributed lookup f(i) provides list of locations (lat/long) of lookup service for i. Nodes in the vicinity of f(i) will know location of i. i publishes its location to nodes at f(i) Geographic forwarding.
Summary Interesting distributed routing protocol. No direct relationship to collaboration. Building block for ad-hoc mobile collaboration networks. For all collaborative ad-hoc networks the use of scalable ad-hoc routing networks is a requirement. This one in particular talks of one without the use of fixed infrastructure. Must list this as an approach and as an issue.