Skip to main content

Research on the k-Coverage Local Wireless Network and Its Communication Coordination Mechanism Design

  • Conference paper

Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT,volume 368)

Abstract

Based on the analysis of the present situation and features of local wireless network, combined the networking technologies, we constructing the wireless network layout algorithm and sensor nodes model. Through delaminating iterative optimization algorithm, optimal layout of sensor data collection and satisfy recognition, quasi-geoids orientation, signal coverage optimization have been realized. Compared the triangular, square and hexagon scheme, and get a general scheme of multiple complete coverage by calculate the length of sides on the polygon. Monte Carlo algorithm is used in choosing the optimum proposal comparing among the regular triangle, square and the hexagon in different conditions. For locating network, analyze the advantages and disadvantages of triangle, square and hexagon schemes in deferent positioning accuracy of double coverage, we set different layout schemes to different situations. Application manual is provided for the constructor to refer to these table lookup to attain the right numerical value.

Keywords

  • k-coverage
  • local wireless network
  • communication coordination
  • Monte Carlo

References

  • Yuan, R.: Wireless Network Organize Algorithm and the Application in Cotton Warehouse Management, China Agricultural University, Master Dissertation, Beijing (2011)

    Google Scholar 

  • Yu, H., Li, O., Zhang, X.: Wireless sensor network theory, technology and implementation, Beijing, pp. 100–300 (2008)

    Google Scholar 

  • Tran, D.A., Nguyen, T.: Localizatio in Wireless Sensor Networks based on Support Vector Machines

    Google Scholar 

  • Usman, K.: Localization in Sensor Networks using Message Passing Algorithm

    Google Scholar 

  • Zhang, H., Hou Jennifer, C.: Maintaining Sensing coverage and connectivity in large sensor networks. Jounral of Ad Hoc and Sensor Wireless Networks 1(1-2), 89–124 (2005)

    Google Scholar 

  • Yang, B., Yu, H., Li, L., Li, H.: An Energy Efficient Coopenrative Density Control Algorithm in Large Wireless Sensor Networks. In: WCNC 2007 Proceedings (2007)

    Google Scholar 

  • Klaus, F.: RFID Handbook, 2nd edn. John Wiley & Sons Ltd, England (2003)

    Google Scholar 

  • Wang, R.: Treatment of sensor network covering localization method research (2009)

    Google Scholar 

  • Qi, W.: Wireless sensor network node localization and covering technology research (2008)

    Google Scholar 

  • Fan, Z.: Wireless sensor network covered with nodes deployment issues research (2008)

    Google Scholar 

  • Zhang, C.: Hexagon node coverage model research (2010)

    Google Scholar 

  • Gao, X.: The regional telecommunication covers node localization launch algorithm (2010)

    Google Scholar 

  • Yang, Z.: Wireless sensor networks positioning problem solving linear programming algorithm (2008)

    Google Scholar 

  • Yang, C.: Buildings fire monitoring wireless sensor node cover algorithms (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Yuan, R. et al. (2012). Research on the k-Coverage Local Wireless Network and Its Communication Coordination Mechanism Design. In: Li, D., Chen, Y. (eds) Computer and Computing Technologies in Agriculture V. CCTA 2011. IFIP Advances in Information and Communication Technology, vol 368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27281-3_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27281-3_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27280-6

  • Online ISBN: 978-3-642-27281-3

  • eBook Packages: Computer ScienceComputer Science (R0)