Dealing with Non-Convexity in Geographic Routing in Smart Dust Networks

• Autorzy: Kłopotek M. A. , Ruciński D. , Tchórzewski J.
• Języki publikacji: EN

Abstrakty

EN

The paper proposes a new approach to greedy geographic routing for sensor networks with non-convex covering structure.

Słowa kluczowe

EN

smart dust; geographic routing; nonconvexity; sensor-covered areas

• Wydawca: Wydawnictwo Uniwersytetu Przyrodniczo-Humanistycznego w Siedlcach
• Czasopismo: Studia Informatica : systems and information technology
• Rocznik: 2006
• Tom: Vol. 1(7)
• Strony: 57--64
• Opis fizyczny: Bibliogr. 9 poz., rys.

Twórcy

autor

Kłopotek M. A.

• Institute of Computer Science, Polish Academy of Sciences ul. Ordona 21, 01-237 Warsaw, Poland
• Institute of Computer Science, University of Podlasie, ul. Sienkiewicza 51, 08-110 Siedlce, Poland

autor

Ruciński D.

• Institute of Computer Science, University of Podlasie, ul. Sienkiewicza 51, 08-110 Siedlce, Poland

autor

Tchórzewski J.

• Institute of Computer Science, University of Podlasie, ul. Sienkiewicza 51, 08-110 Siedlce, Poland

Bibliografia

• 1. [Braginsky] D. Braginsky, D. Estrin: Rumor routing algorithm for sensor networks. In Proceedings of the First ACM Workshop on Sensor Networks and Applications, pages 22-31, Atlanta, GA, USA, October 2002. ACM.
• 2. [Chakrabarty] K. Chakrabarty, S.S. Iyengar, H. Qi and E. Cho: "Grid coverage for surveillance and target location in distributed sensor networks", IEEE Transactions on Computers, vol. 51, pp. 1448-1453, December 2002.
• 3. [Dan] Y.H.H. Dan Li, Kerry Wong and A. Sayeed: Detection, classification and tracking of targets in distributed sensor networks. IEEE Signal Processing Magazine, 19(2), Mar 2002.
• 4. [Karp] B. Karp and H.T. Kung, GPSR: Greedy Perimeter Stateless Routing for wireless networks, in: Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000.
• 5. [Kuhn] F. Kuhn, R. Wattenhofer, and A. Zollinger: Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing. In MobiHoc, 2003
• 6. [Machando] M. Machado, et al.: Data dissemination using the energy map. URL doi.ieeecomputersociety.org/10.1109/WONS.2005.11
• 7. [Tian] D. Tian and N. Georganas: A coverage-preserved node scheduling scheme for large wireless sensor networks. In Proceedings of First International Workshop on Wireless Sensor Networks and Applications (WSNA'02), Atlanta, USA, Sep 2002.
• 8. [Varshney] P.K. Varshney: Distributed Detection and Data Fusion. Springer-Verlag, New York, NY, 1997
• 9. [Xing] G. Xing, C. Liu, R. Pless: On greedy geographic routing algorithms in sensing covered networks. InternationalSymposium on Mobile Ad Hoc Networking & Computing archive Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing Roppongi Hills, Tokyo, Japan SESSION: Routing and content distribution table of contents Pages: 31-42URL: www2.parc.com/spl/projects/ecca/pubs/greedy.pdf