Competitive time and traffic analysis of position-based routing using a cell structure

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages

  Rührup, Stefan ^a,b   Schindelhauer, Christian ^a,c  

^a UNIVERSITY OF PADERBORN   (Germany)

^b DFG Graduiertenkolleg 776 ^*  (Germany)

^c Inst of Computer Science   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION FLOW; PLANAR SUBGRAPH; POSITION-BASED ROUTING; WIRELESS AD HOC NETWORKS;

ALGORITHMS; CARRIER COMMUNICATION; GRAPH THEORY; LINEAR CONTROL SYSTEMS; MATHEMATICAL MODELS; ROUTERS; STRATEGIC PLANNING; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33746303894     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.147     Document Type: Conference Paper

References (17)

1. K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, and O. Frieder. Geometric spanners for wireless ad hoc net works. IEEE Transactions on Parallel and Distributed Systems, 14(4):408-421, 2003.
2. R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences, 45(1):104-126, Aug. 1992.
3. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
4. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks, 7(6):609-616, 2001.
5. Q. Fang, J. Gao, and L. J. Guibas. Locating and bypassing routing holes in sensor networks. In Proc. of the 23rd Conference of the IEEE Communications Society (INFOCOM'04), Mar. 2004.
6. J. Gao, L. J. Guibas, J. E. Hershberger, L. Zhang, and A. Zhu. Geometric spanner for routing in mobile networks. In Proc. of the. 2nd Symposium on Mobile. Ad Hoc Networking and Computing (MobiHoc'01), pages 45-55. ACM, Oct 2001.
7. S. Giordano and I. Stojmenovic. Position based routing algorithms for ad hoc networks: A taxonomy. In X. Cheng, X. Huang, and D. Du, editors, Ad Hoc Wireless Networking, pages 103-136. Kluwer, 2004.
8. M. Heissenbüttel and T. Braun. A novel position-based and beacon-less routing algorithm for mobile ad-hoc networks. In Proc. of the 3rd IEEE Workshop on Applications and Services in Wireless Networks (ASWN' 03), pages 197-209, Bern, Switzerland, July 2003.
9. T.-C. Hou and V. Li. Transmission range control in multihop packet radio networks. IEEE Transactions on Communications, 34(1):38-44, January 1986.
10. J. W. Jaromczyk and G. T. Toussaint. Relative neighborhood graphs and their relatives. Proceedings of the IEEE, 80:1502-1517, 1992.
11. B. Karp and H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In Mobile Computing and Networking, pages 243-254, 2000.
12. E. Koutsoupias and C. H. Papadimitriou. Beyond competitive analysis. SIAM Journal on Computing, 30(1):300-317, 2000.
13. E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In Proc. of the 11th Canadian Conference on Computational Geometry, pages 51-54, Vancouver, August 1999.
14. F. Kuhn, R. Wattenhofer, and A. Zollinger. Asymptotically optimal geometric mobile ad-hoc routing. In Proc. of the 6th Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pages 24-33, 2002.
15. M. Mauve, J. Widmer, and H. Hartenstein. A survey on position-based routing in mobile ad hoc networks. IEEE Network Magazine, 15(6):30-39, November 2001.
16. H. Takagi and L. Kleinrock. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Transactions on Communications, 32(3):246-257, March 1984.
17. Y. Wang and X.-Y. Li. Distributed spanner with bounded degree for wireless ad hoc networks. In Proc. of the 16th Int. Parallel and Distributed Processing Symposium (IPDPS'02), page 120. IEEE Computer Society, 2002.