ACM Home Page
Please provide us with feedback. Feedback
Trajectory based forwarding and its applications
Full text PdfPdf (469 KB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 9th annual international conference on Mobile computing and networking table of contents
San Diego, CA, USA
SESSION: Routing and forwarding table of contents
Pages: 260 - 272  
Year of Publication: 2003
ISBN:1-58113-753-2
Authors
Dragos Niculescu  Rutgers University, NJ
Badri Nath  Rutgers University, NJ
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 110,   Citation Count: 36
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/938985.939012
What is a DOI?

ABSTRACT

Trajectory based forwarding (TBF) is a novel methodto forward packets in a dense ad hoc network that makes it possible to route a packet along a predefined curve. It is a hybrid between source based routing and Cartesian forwarding in that the trajectory is set by the source, but the forwarding decision is based on the relationship to the trajectory rather than names of intermediate nodes. The fundamental aspects of TBF are: it decouples path naming from the actual path; it provides cheap path diversity; it trades off communication for computation. These aspects address the double scalability issue with respect to mobility rate and network size. In addition, TBF provides a common framework for many services such as: broadcasting, discovery, unicast, multicast and multipath routing in ad hoc networks. TBF requires that nodes know their position relative to a coordinate system. While a global coordinate system afforded by a system such as GPS would be ideal, approximate positioning methods provided by other algorithms are also usable.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Tomasz Imielinski and Samir Goel. Dataspace - querying and monitoring deeply networked collections in physical space. IEEE Personal Communications Magazine, October 2000.
 
3
Tomasz Imielinski and Badri Nath. Wireless graffiti: data data everywhere. In VLDB, Invited paper, 10 year VLDB-award, Hong Kong, August 2002.
 
4
Vladimir Lumelsky, Michael Shur, and Sigurd Wagner. Sensitive skin. IEEE Sensors Journal, 1(1):41--51, June 2001.
5
 
6
G. Finn. Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISI Research Report ISI/RR-87-180, University of Southern California, March 1987.
7
 
8
Dragos Niculescu and Badri Nath. Ad hoc positioning system (APS). In GLOBECOM, San Antonio, November 2001.
9
 
10
Dragos Niculescu and Badri Nath. Ad hoc positioning system (APS) using AoA. In INFOCOM, San Francisco, CA, April 2003.
 
11
Dragos Niculescu and Badri Nath. Localized positioning in ad hoc networks. In Sensor Network Protocols and Applications, Anchorage, Alaska, April 2003.
12
13
14
15
16
 
17
David B. Johnson and David A. Maltz. Dynamic source routing in ad hoc wireless networks. Mobile Computing, Kluwer Academic Publishers, 353, 1996.
 
18
Charles E. Perkins. Ad Hoc Networking. Addison Wesley Professional, 2001.
 
19
20
21
22
23
 
24
B.W. Parkinson and J.J. Spilker. Global Positioning System: Theory and Application. American Institute of Astronautics and Aeronautics, 1996.
 
25
Chris Savarese, Jan Rabaey, and Koen Langendoen. Robust positioning algorithms for distributed ad-hoc wireless sensor networks. Technical report, Delft University of Technology, 2001.
 
26
Leonard Kleinrock and John Silvester. Optimum transmission radii for packet radio networks or why six is a magic number. In IEEE National Telecommunications Conference, pages 4.3.1--4.3.5, Birmingham, Alabama, 1978.
 
27
Ivan Stojmenovic. A scalable quorum based location update scheme for routing in ad hoc wireless networks. Technical Report TR-99-09, SITE, University of Ottawa, September 1999.
28
29
 
30
Zygmunt Haas, Joseph Halpern, and Li Li. Gossip based ad hoc routing. In INFOCOM, New York, USA, June 2002.
 
31
Vamsi S. Paruchuri, Arjan Durresi, Durga S. Dash, and Raj Jain. Optimal flooding protocol for routing in ad-hoc networks. Technical report, Ohio State University, CS Department, 2002.
 
32
33
 
34
Paramvir Bahl and Venkata N. Padmanabhan. RADAR: An in-building RF-based user location and tracking system. In INFOCOM, Tel Aviv, Israel, March 2000.
 
35
Nirupama Bulusu, John Heidemann, and Deborah Estrin. GPS-less low cost outdoor localization for very small devices. In IEEE Personal Communications Magazine, Special Issue on Smart Spaces and Environments. October 2000.

CITED BY  37

Collaborative Colleagues:
Dragos Niculescu: colleagues
Badri Nath: colleagues