Advertisement

Single-Actor Selection Algorithms for Wireless Sensor and Actor Networks

  • ZhenYang Xu
  • GuangSheng Zhang
  • Jie Qin
  • WenHua Dou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4138)

Abstract

Wireless sensor and actor networks (WSANs) are composed of a large number of sensors and a small number of (mobile) resource-rich actors. Sensors gather information about the physical phenomenon, while actors take decisions and then perform appropriate actions upon the environment. Due to many actors, an important problem appears: which sensor(s) communicate with which actor(s). In this paper, a linear programming of single-actor selection for event-driven data model is put forward from event reliability and time constraints for WSANs. Then some approximate algorithms, such as MECT (Minimum Energy Cost Tree) and MPLCT (Minimum Path Length Cost Tree), are addressed from path length and energy aspects respectively. Since those approximate solutions need the whole state, and can’t adapt to WSANs, so a distributed approximate algorithm HBMECT (Hop-Bound and Minimum Energy Cost Tree) is proposed from both energy and delay. In the performance evaluation, those algorithms are compared from average number of hops and energy consumption.

Keywords

Wireless Sensor and Actor Networks Real-Time Communications Energy Efficiency Hop-Bound 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akyildiz, F., Kasimoglu, I.H.: Wireless sensor and actor networks: Research challenges. Ad Hoc Networks 2(4), 351–367 (2004)CrossRefGoogle Scholar
  2. 2.
    Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks Journal 38(4), 393–422 (2002)CrossRefGoogle Scholar
  3. 3.
    Melodia, T., Pompili, D., Gungor, V.C., Akyildiz, I.F.: A Distributed Coordination Framework for Wireless Sensor and Actor Networks. In: MobiHoc 2005, Urbana-Champaign, Illinois, USA, May 25–27 (2005)Google Scholar
  4. 4.
    He, T., Stankovic, J., Lu, C., Abdelzaher, T.: SPEED: A real-time routing protocol for sensor networks. In: Proceedings of IEEE ICDCS, Providence, RI, USA, May 2003, pp. 46–55 (2003)Google Scholar
  5. 5.
    Felemban, E., Lee, C.G., Ekici, E., Boder, R., Vural, S.: Probabilistic QoS Guarantee in Reliability and Timeliness Domains in Wireless Sensor Networks. In: Proceedings of IEEE INFOCOM 2005, Miami, FL, USA (March 2005)Google Scholar
  6. 6.
    Akkaya, K., Younis, M.: An Energy-Aware QoS Routing Protocol for Wireless Sensor Networks. In: Proc. of the IEEE Workshop on Mobile and Wireless Networks (MWN 2003), Providence, RI (May 2003)Google Scholar
  7. 7.
    Kim, H., Seok, Y., Choi, N., Choi, Y., Kwon, T.: Optimal Multi-sink Positioning and Energy-Efficient Routing in Wireless Sensor Networks. In: Kim, C. (ed.) ICOIN 2005. LNCS, vol. 3391, pp. 264–274. Springer, Heidelberg (2005)Google Scholar
  8. 8.
    He, T., Huang, C., Blum, B., Stankovic, J., Abdelzaher, T.: Range-Free Localization Schemes for Large Scale Sensor Networks. In: Proceedings of Mobicom (2003)Google Scholar
  9. 9.
    Savvides, A., Chih-Chieh, H., Strivastava, M.B.: Dynamic fine-grained localization in ad hoc networks of sensors. In: Proc. Of. ACM Mobicom (2001)Google Scholar
  10. 10.
    Li, J., Jannotti, J., De Couto, D.S.J., Karger, D.R., Morris, R.: A Scalable Location Service for Geographic Ad Hoc Routing. In: Proc. of. ACM MobiCom (August 2000)Google Scholar
  11. 11.
    Sundararaman, B., Buy, U., Kshemkalyani, A.: Clock synchronization for wireless sensor networks: a survey. Ad Hoc Networks 3(3), 281–323 (2005)CrossRefGoogle Scholar
  12. 12.
    Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications 1(4), 660–670 (2002)CrossRefGoogle Scholar
  13. 13.
    Chen, S.: Routing Support for providing guaranteed End-To-End Quality of Service. Ph.D. Thesis Dissertation, University of Illinois at Urbana-Champaign (1999)Google Scholar
  14. 14.
    Zhan, F.: Three Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures. Journal of Geographic Information and Decision Analysis 1(1) (1998)Google Scholar
  15. 15.
    Hung, M.H., Divoky, J.J.: A Computational Study of Efficient Shortest Path Algorithms. Computers & Operations Research 15, 567–576 (1988)CrossRefMathSciNetzbMATHGoogle Scholar
  16. 16.
  17. 17.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP completeness. W. H. Freeman and Company, New York (1979)zbMATHGoogle Scholar
  18. 18.
    Dulman, S., Havinga, P., Hurink, J.: Wave Leader Election Protocol For Wireless Sensor Networks. In: Proceedings of the 3rd International Symposium on Mobile Multimedia Systems & Applications, pp. 43–50 (2002)Google Scholar
  19. 19.
    Malpani, N., Welch, J.L., Vaidya, N.: Leader Election Algorithms for Mobile Ad Hoc Networks. In: Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 96–103 (2000)Google Scholar
  20. 20.
    Vasudevan, S., Kurose, J., Towsley, D.: Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks. In: Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP 2004) (2004)Google Scholar
  21. 21.
    Tilak, S., Abu-Ghazaleh, N., Heinzelman, W.: A taxonomy of wireless micro-sensor network communication models. ACM Mobile Computing and Communication Review (MC2R) (June 2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • ZhenYang Xu
    • 1
  • GuangSheng Zhang
    • 1
  • Jie Qin
    • 2
  • WenHua Dou
    • 1
  1. 1.Computer InstituteNational University of Defense TechnologyChangsha HunanChina
  2. 2.School of information Science and EngineeringHenan University of TechnologyZhengzhou HenanChina

Personalised recommendations