Local solutions for global problems in wireless networks

Journal of Discrete Algorithms

Volumn 5, Issue 3, 2007, Pages 395-407

  Urrutia, J ^a  

^a UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

Ad hoc and wireless networks; Dominating sets; Local algorithms; Local vertex coloring; Routing

Indexed keywords

ALGORITHMS; CHANNEL ESTIMATION; INFORMATION RETRIEVAL; SET THEORY; WIRELESS NETWORKS;

AD HOC AND WIRELESS NETWORKS; DOMINATING SETS; LOCAL ALGORITHMS; LOCAL VERTEX COLORING;

PROBLEM SOLVING;

EID: 34248667625     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2006.05.004     Document Type: Article

References (65)

1. Agarwal A., and Das S.R. Dead reckoning in mobile ad hoc networks. Wireless Communications and Networking, 2003. March 6-20, 2003. WCNC vol. 3 (2003), IEEE 1838-1843
2. Alzoubi K.M., Li X.Y., Wang Y., and Wan P.J. Geometric spanners for wireless ad hoc networks. IEEE TPDS 14 (2003) 408-421
3. Alzoubi K.M., Wan P.J., and Frieder O. Maximal independent set, weakly-connected dominating set, and induced spanners in wireless ad hoc networks. International Journal of Foundations of Computer Science 14 (2003) 287-304
4. S. Ansari, L. Narayanan, J. Opatrny, A generalization of the face routing algorithm to a class of non-planar networks, in: Proceedings of Mobiquitous 2005, pp. 213-225
5. Barbeau M., Kranakis E., Krizanc D., and Morin P. Improving distance-based geographic location techniques in sensor networks. Ad-hoc, Mobile, and Wireless Networks: Third International Conference, ADHOC-NOW 2004. Vancouver, Canada, July 22-24, 2004. Lecture Notes in Computer Science vol. 3158 (2004), Springer 197-210
6. Barriere L., Fraigniaud P., Narajanan L., and Opatrny J. Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. Wireless Communications and Mobile Computing 3 (2003) 141-153
7. Blazevic L., Giordano S., and Le Boudec J.-Y. Self-organized terminode routing. Cluster Computing 5 2 (2002) 205-218
8. Bondy A., and Murty U.S.R. Graph Theory with Applications (1976), Macmillan Press
9. Boone P.E., Chavez E., Gleitzky L., Kranakis E., Opatrny J., Salazar G., and Urrutia J. Morelia test: Improving the efficiency of the Gabriel test and Face Routing in ad-hoc networks. In: Kralovic R., and Sykora O. (Eds). Proceedings of SIROCCO 2004. Smolenice Castle, Slovakia, June 2004. Lecture Notes in Computer Science vol. 3104 (2004), Springer
10. P. Bose, P. Morin, I. Stojmenovic, J. Urrutia, Routing with guaranteed delivery in ad hoc wireless networks, in: Proc. of 3rd ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications DIAL M99, Seattle, August 20, 1999, pp. 48-55
11. Cartigny J., Ingelrest F., Simplot-Ryl D., and Stojmenovic I. Localized LMST and RNG based minimum energy broadcast protocols in ad hoc networks. Proc. IEEE INFOCOM. San Francisco, CA, USA, April 1-3, 2003. Ad Hoc Networks 3 1 (2005) 1-16
12. Chavez E., Dobrev S., Kranakis E., Opatrny J., Stacho L., and Urrutia J. Local construction of planar spanners in unit disk graphs with irregular transmission ranges. LATIN 2006, 7th Latin American Symposium. Valdivia, Chile, March 2006. Lecture Notes in Computer Science vol. 3887 (2006), Springer 286-297
13. E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, J. Urrutia, Local coloring of the vertices of planar spanners in unit disk graphs, in preparation
14. E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, H. Tejeda, J. Urrutia, Half-space proximal: A new local test for extracting a bounded dilation spanner of a unit disk graph, in: OPIDIS, 9th International Conference on Principles of Distributed Systems, Pisa, Italy, December 2005
15. S.M. Das, H. Pucha, Y.C. Hu, Performance comparison of scalable location services for geographic ad hoc routing, in: Proceedings of IEEE INFOCOM 2005, Miami, FL, March 13-17, 2005
16. Devroye L. On the expected size of some graphs in computational geometry. Computers and Mathematics with Applications 15 (1988) 53-64
17. Dijkstra E.W. A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959) 269-271
18. E. Erwan, A. Fladenmuller, P. Guy, Geographical routing for heterogeneous wireless systems, in: IFIP Med-Hoc-Net Sardaigna, Italy, September 2002
19. F. Fan, E.S. Biagioni, An approach to data visualization and interpretation for sensor networks, in: Proceedings of the 37th Annual Hawaii International Conference on System Sciences 2004, January 5-8, 2004, pp. 63-71
20. Fang Q., Gao J., and Guibas L.J. Locating and bypassing routing holes in sensor networks. INFOCOM'04. March 2004. Proceedings of IEEE 23 1 (2004) 2458-2468
21. M. Fayed, H.T. Mouftah, Characterizing the impact of routing holes on geographic routing, in: ICW, 2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05), 2005, pp. 401-406
22. Fevens T., Eddien A., and Naciri Bennai B. Randomized AB-Face-AB routing algorithms in mobile ad-hoc networks. 4th Ad-hoc, Mobile and Wireless Networks. Cancun, Mexico, October 2005. Lecture Notes in Computer Science vol. 3738 (2005), Springer 43-56
23. T. Fevens, G. Kao, J. Opatrny, Position-based routing on 3-d geometric graphs in mobile ad hoc networks, in: Proceedings of CCCG 2005, pp. 88-91
24. S. Funke, A. Kesselman, U. Meyer, M. Segal, A simple improved distributed algorithm for minimum CDS in unit disk graphs, in: 1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), Montreal, 2005
25. H. Fußler, M. Mauve, H. Hartenstein, M. Kasemann, A comparison of routing strategies for vehicular ad hoc networks, TR-02-003, Dept. Comp. Sci., Univ. of Mannheim, July 2002
26. H. Fußler, J. Widmer, M. Kasemann, M. Mauve, H. Hartenstein, Beaconless position based routing for mobile ad hoc networks, TR-03-001, Dept. Comp. Sci., Univ. of Mannheim, February 2003
27. Gabriel K.R., and Sokal R.R. A new statistical approach to geographic variation analysis. Systemic Zoology 18 (1972) 259-278
28. J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, A. Zhu, Geometric spanner for routing in mobile networks, in: ACM Symposium on Mobile Ad Hoc Networking and Computing MobiHoc, Long Beach, California, USA, October 4-5, 2001, pp. 45-55
29. C. Georgiou, E. Kranakis, R. Marcelin-Jimenez, S. Rajsbaum, J. Urrutia, Distributed dynamic storage in wireless networks, International Journal of Distributed Sensor Networks, submitted for publication
30. Giordano S., and Stojmenovic I. Position-based routing algorithms for ad hoc networks: A taxonomy. In: Cheng X., Huang X., and Du D.Z. (Eds). Ad Hoc Wireless Networking (2004), Kluwer 103-136
31. X. Guan, Face traversal routing on edge dynamic graphs, in: 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05)-Workshop 12, 2005, p. 244b
32. M. Heissenbuttel, T. Braun, Optimizing neighbor table accuracy of position-based routing algorithms, in: IEEE INFOCOM 2005
33. Jaromczyk J.W., and Toussaint G.T. Relative neighborhood graphs and their relatives. Proceedings of IEEE 80 9 (1992) 1502-1517
34. Kim Y., Lee J.-J., and Helmy A. Modeling and analyzing the impact of location inconsistencies on geographic routing in wireless networks. Special Issue on Wireless PAN and Sensor Networks. ACM SIGMOBILE MC2R 8 1 (2004) 48-60
35. Y.B. Ko, N.H. Vaidya, Location-aided routing in mobile ad hoc networks, in: Proc. MOBICOM, 1998, pp. 66-75
36. E. Kranakis, H. Singh, J. Urrutia, Compass routing on geometric networks, in: Proc. 11th Canadian Conference on Computational Geometry, Vancouver, August 15-18, 1999, pp. 51-54
37. F. Kuhn, R. Wattenhofer, Y. Zhang, A. Zollinger, Geometric ad-hoc routing: of theory and practice, in: Proc. PODC 2003
38. F. Kuhn, R. Wattenhofer, A. Zollinger, Ad-hoc networks beyond unit disk graphs, in: ACM DIALM-POMC, San Diego, September 2003, pp. 69-78
39. F. Kuhn, R. Wattenhofer, A. Zollinger, Asymptotically optimal geometric mobile ad-hoc routing, in: Proc. of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M), 2002, pp. 24-33
40. F. Kuhn, T. Moscibroda, R. Wattenhofer, Unit disk graph approximation, in: ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), Philadelphia, PA, October 2004
41. Li X.Y. Applications of computational geometry in wireless ad hoc networks. In: Cheng X.Z., Huang X., and Du D.-Z. (Eds). Ad Hoc Wireless Networking (2003), Kluwer
42. X.Y. Li, Localized Delaunay triangulation is as good as unit disk graph, in: Workshop on Ad Hoc Networks, IEEE Local Area Network Conference, Tampa, November 2001
43. X.Y. Li, Approximate MST for UDG locally, in: Computing and Combinatorics: 9th Annual International Conference, Proceedings, COCOON 2003 Big Sky, MT, USA, July 25-28, 2003, pp. 364-373
44. Li X.Y., Calinescu G., Wan P.J., and Wang Y. Localized Delaunay triangulation with application in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems 14 (2003) 1035-1047
45. X.Y. Li, Y. Wang, O. Frieder, Localized routing for wireless ad hoc networks, in: Proc. IEEE ICC 2003
46. Lin X., and Stojmenovic I. Location based localized alternate, disjoint and multi-path routing algorithms for wireless networks. Journal of Parallel and Distributed Computing 63 1 (2003) 22-32
47. Matula D.W., and Sokal R.R. Properties of Gabriel graphs relevant to geographical variation research and the clustering of points on the plane. Geographical Analysis 12 (1984) 205-222
48. J. Newsome, D. Song, GEM: Graph embedding for routing and data-centric storage in sensor networks without geographic information, in: Proc. First ACM Conf. on Embedded Networked Sensor Systems, SenSys, Redwood, CA, November 2003
49. O'Dell R., and Wattenhofer R. Theoretical aspects of connectivity-based multi-hop positioning systems. Theoretical Computer Science 344 (2005) 47-68
50. K. Seada, A. Helmy, R. Govindan, On the effect of localization errors on geographic face routing in sensor networks, in: Proc. ACM SenSys, Los Angeles, November 2003
51. K. Seada, A. Helmy, Efficient geocasting with perfect delivery in wireless networks, in: IEEE Wireless Communications and Networking Conference (WCNC), March 2004
52. J. Shaikh, J. Solano, I. Stojmenovic, J. Wu, New metrics for dominating set based energy efficient activity scheduling in ad hoc networks, in: Proc. WLN Workshop at IEEE Conf. on Local Computer Networks, Bonn, Germany, October 20-24, 2003
53. Stojmenovic I. Position-based routing in ad hoc networks. IEEE Communications Magazine 40 7 (2002) 128-134
54. Stojmenovic I., Seddigh M., and Zunic J. Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems 13 1 (2002) 14-25
55. Sun M.T., Huang L., Arora A., and Lai T.H. Reliable MAC layer multicast in IEEE 802.11 wireless networks. Wireless Communications and Mobile Computing 3 (2003) 439-453
56. Stojmenovic I. Localized network layer protocols in sensor networks based on optimizing cost over progress ratio. IEEE Network 20 1 (2006) 21-27
57. Stojmenovic I., and Zaguia N. Bluetooth scatternet formation in ad hoc wireless networks. In: Misic J., and Misic V. (Eds). Performance Modeling and Analysis of Bluetooth Networks: Network Formation, Polling, Scheduling, and Traffic Control (2006), Auerbach Publications (Taylor and Francis Group) 147-171 Chapter 9
58. Supowit K.J. The relative neighbourhood graph, with application to minimum weight spanning trees. Journal of the Association Computing Machinery 30 3 (1983) 428-448
59. Toussaint G.T. The relative neighbourhood graph of a finite planar set. Pattern Recognition 12 (1980) 261-268
60. Y.C. Tseng, T.Y. Hsieh, Fully power-aware and location-aware protocols for wireless multi-hop ad hoc networks, in: IEEE ICCCN 2002
61. Y. Wang, X.Y. Li, Localized construction of bounded degree planar spanner, in: ACM DialM, 2003
62. Widmer J., Mauve M., Hartenstein H., and Füßler H. Position based routing in ad hoc wireless networks. In: Ilyas M. (Ed). Handbook of Ad Hoc Wireless Networks (2003), CRC Press 219-232
63. Wu J., and Li H. A dominating set-based routing scheme in ad hoc wireless networks. Telecommunication Systems 18 1/3 (2001) 13-36
64. Wu J., Dai F., Gao M., and Stojmenovic I. On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. IEEE/KICS Journal of Communication Networks 4 1 (2002) 59-70
65. Yuksel M., Pradhan R., and Kalyanaraman S. An implementation framework for trajectory-based routing in ad hoc networks. Ad Hoc Networks 4 1 (2006) 125-137