Advertisement

On Selecting Nodes to Improve Estimated Positions

  • Erwan Ermel
  • Anne Fladenmuller
  • Guy Pujolle
  • André Cotton
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 162)

Abstract

We consider node localization problems in ad hoc wireless networks in which two types of nodes are considered: nodes with self-locating capability like GPS and nodes with no self-locating capability. Our simple algorithm for improving the position accuracy consists of selecting and processing only the nodes that are likely to enhance the position estimation. We focus our approach on defining a hull of neighboring nodes as key of position accuracy enhancement.

Keywords

Convex Hull Neighbor Node Position Estimation Position Accuracy Fairness Index 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [vor,]
    Flight Training Handbook. Aviation Book Co.Google Scholar
  2. [Beutel, 1999]
    Beutel, J. (1999). Geolocalisation in a picoradio environment. Master’s thesis, ETH Zurich, Electronics Lab.Google Scholar
  3. [Bose et al., 2001]
    Bose, P., Morin, P., Stojmenovic, I., and Urrutia, J. (2001). Routing with guaranteed delivery in ad hoc wireless networks. volume 7, pages 609–616.zbMATHGoogle Scholar
  4. [Bulusu et al., 2000]
    Bulusu, N., Heidemann, J., and Estrin, D. (2000). Gps-less low cost outdoor localization for very small devices. IEEE Personal Communication, Special Issue on Smart Spaces and Environment, 7(5):28–34.Google Scholar
  5. [Capkun et al., 2002]
    Capkun, S., Hamdi, M., and Hubaux, J. P. (2002). Gps-free positioning in mobile ad-hoc networks. Cluster Computing, 5(2).Google Scholar
  6. [Clausen and Jacquet, 2003]
    Clausen, T. and Jacquet, P. (2003). Optimized link state routing (olsr) protocol. Internet Draft.Google Scholar
  7. [de Berg et al., 1997]
    de Berg, M., Kreveld, M., Overmars, M., and Scharzkopf, O. (1997). Computational Geometry, Algoritms and Application. Springer.Google Scholar
  8. [Doherty et al., 2001]
    Doherty, L., Pister, K. S. J., and Ghaoui, L. E. (2001). Convex optimization methods for sensor node position estimation. In Proceedings of IEEE INFOCOM’2001, Anchorage.Google Scholar
  9. [Ermel et al., 2003]
    Ermel, E., Fladenmuller, A., Pujolle, G., and Cotton, A. (2003). Estimation de positions dans des reseaux sans-fil hybrides. In CFIP 2003.Google Scholar
  10. [Ermel et al., 2004]
    Ermel, E., Fladenmuller, A., Pujolle, G., and Cotton, A. (2004). Improved position estimation in wireless heterogeneous networks. In Networking 2004.Google Scholar
  11. [Galileo,]
    Galileo. http://europa.eu.int/comm/dgs/energy_transport/galileo/.Google Scholar
  12. [Hofmann-Wellenhof et al., 1997]
    Hofmann-Wellenhof, B., Lichtenegger, H., and Collins, J. (1997). Global Positioning System: Theory and Practice. Springer-Verlag.Google Scholar
  13. [Jain, 1992]
    Jain, R. (1992). The Art of Computer Systems Performance Analysis. Wiley.Google Scholar
  14. [Johnson et al., 2001]
    Johnson, D. B., Maltz, D. A., Hu, Y.-C., and Jetcheva, J. G. (2001). The dynamic source routing protocol for mobile ad hoc networks. Internet Draft.Google Scholar
  15. [Karp and Kung, 2000]
    Karp, B. and Kung, H. T. (2000). Gpsr: Greedy perimeter stateless routing for wireless networks. In Proceedings of ACM/IEEE MOBICOM’00.Google Scholar
  16. [Lemaire, 1997]
    Lemaire, C. (1997). Triangulatation de Delaunay et arbres multidimensionnels. PhD thesis, Ecole des mines de Saint-Etienne.Google Scholar
  17. [Navas and Imelinski, 1997]
    Navas, J. and Imelinski, T. (1997). Geocast-geographic addressing and routing. In Proceedings of ACM/IEEE MOBICOM’97, volume 3, pages 66–76.Google Scholar
  18. [Niculescu and Nath, 2003]
    Niculescu, D. and Nath, B. (2003). Dv based positioning in ad hoc networks. Telecommunication Systems, 22(1):267–280.CrossRefGoogle Scholar
  19. [O’Rourke, 1998]
    O’Rourke, J. (1998). Computational Geometry in C. Cambridge University Press.Google Scholar
  20. [Perkins, 2001]
    Perkins, C. E. (2001). Ad hoc on demand distance vector (aodv) routing. Internet Draft.Google Scholar
  21. [Preparata and Shamos, 1991]
    Preparata, F. P. and Shamos, M. I. (1991). Computational Geometry: An Introduction. Springer Verlag.Google Scholar
  22. [Savarese et al., 2001]
    Savarese, C., Rabaey, J. M., and Beutel, J. (2001). Localization in distributed ad-hoc wireless sensor networks. Proceedings of the ICASSP.Google Scholar
  23. [Savvides et al., 2001]
    Savvides, A., Han, C.-C., and Strivastava, M. B. (2001). Dynamic fine-grained localization in ad-hoc networks of sensors.Google Scholar
  24. [Want et al., 2000]
    Want, R., Hopper, A., Falcao, V., and Gibbons, J. (2000). The active badge location system. ACM Transaction on Information Systems, 10(1):91–102.CrossRefGoogle Scholar
  25. [Ward et al., 1997]
    Ward, A., Jones, A., and Hopper, A. (1997). A new location technique for the active office. IEEE Personal Communications, 4(5):42–47.CrossRefGoogle Scholar
  26. [Werb and Lanzl, 1998]
    Werb, J. and Lanzl, C. (1998). A positioning system for finding things indoors. IEEE Spectrum, 35(9):71–78.CrossRefGoogle Scholar

Copyright information

© International Federation for Information Processing 2005

Authors and Affiliations

  • Erwan Ermel
    • 1
    • 2
  • Anne Fladenmuller
    • 1
  • Guy Pujolle
    • 1
  • André Cotton
    • 2
  1. 1.Laboratoire d’Informatique de Paris 6Université Pierre et Marie CurieParisFrance
  2. 2.Thales CommunicationBGCOM/TCF/SEA/TAIColombesFrance

Personalised recommendations