Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Wireless Networks
Erschienen in: Wireless Networks 5/2013

01.07.2013

Deployment of a mobile wireless sensor network with k-coverage constraint: a cellular learning automata approach

verfasst von: M. Esnaashari, M. R. Meybodi

Erschienen in: Wireless Networks | Ausgabe 5/2013

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Deployment of a wireless sensor network is a challenging problem, especially when the environment of the network does not allow either of the random deployment or the exact placement of sensor nodes. If sensor nodes are mobile, then one approach to overcome this problem is to first deploy sensor nodes randomly in some initial region within the area of the network, and then let the sensor nodes to move around and cooperatively and gradually increase the covered section of the area. Recently, a cellular learning automata-based deployment strategy, called CLA-DS, is introduced in literature which follows this approach and is robust against inaccuracies which may occur in the measurements of sensor positions or in the movements of sensor nodes. Despite its advantages, this deployment strategy covers every point within the area of the network with only one sensor node, which is not enough for applications with k-coverage requirement. In this paper, we extend CLA-DS so that it can address the k-coverage requirement. This extension, referred to as CLA-EDS, is also able to address k-coverage requirement with different values of k in different regions of the network area. Experimental results have shown that the proposed deployment strategy, in addition to the advantages it inherits from CLA-DS, outperforms existing algorithms such as DSSA, IDCA, and DSLE in covering the network area, especially when required degree of coverage differs in different regions of the network.
Vorheriger Artikel Neighbor initiated approach for avoiding deaf and hidden node problems in directional MAC protocol for ad-hoc networks
Nächster Artikel Construction and maintenance of virtual backbone in wireless networks

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Literatur
1.
Ilyas, M., & Mahgoub, I. (2005). Handbook of sensor networks: Compact wireless and wired sensing systems. London, Washington, DC: CRC Press.
2.
Dhillon, S. S., Chakrabarty, K., & Iyengar, S. S. (2002). Sensor placement for grid coverage under imprecise detections. International conference on information fusion (FUSION) 2002, Annapolis, 2002, pp. 1581–1587.
3.
Tilak, S., Abu-Ghazaleh, N. B., & Heinzelman, W. (2002, September). Infrastructure trade-offs for sensor networks. ACM WSNA’02, pp. 49–58.
4.
Musman, S., Lehner, P. E., & Elsaesser, C. (1997). Sensor planning for elusive targets. Journal of Computer Mathematical Modeling, 25(3), 103–115.MATHCrossRef
5.
Salhieh, A., Weinmann, J., Kochhal, M., & Schwiebert, L. (2001). Power efficient topologies for wireless sensor network (pp. 156–163). Spain: International Conference on Parallel Processing.
6.
Schwiebert, L., Gupta, S. K. S., & Weinamann, J. (2001, July). Research challenges in wireless networks of biomedical sensors. ACM SIGMOBILE 2001, Rome, pp. 151–165.
7.
Petriu, E. M., Georganas, N. D., Petriu, D., Makrakis, D., & Groza, V. Z. (2000, December). Sensor-based information appliances. IEEE Instrumentation Measurement Magazine, pp. 31–35.
8.
Chakrabarty, K., Iyengar, S. S., Qi, H., & Cho, E. (2002). Grid coverage for surveillance and target location in distributed sensor networks. IEEE Transactions on Computers, 51, 1448–1453.MathSciNetCrossRef
9.
Heinzelman, W., Chandrakasan, A., & Balakrishnan, H. (2000, January). Energy-efficient communication protocol for wireless microsensor networks. HICSS 2000, Maui, pp. 8020–8029.
10.
Heinzelman, W. (2000, June). Application-specific protocol architecture for wireless networks. Ph.D. dissertation, Massachusetts Institute of Technology.
11.
Heinzelman, W. B., Chandrakasan, A. P., & Balakrishnan, H. (2002). An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications, 1(4), 660–670.CrossRef
12.
Lindsey, S., & Raghavendra, C. S. (2002, March). PEGASIS: Power-efficient gathering in sensor information systems. IEEE aerospace conference, pp. 1125–1130.
13.
Lindsey, S., Raghavendra, C., & Sivalingam, K. M. (2002). Data gathering algorithms in sensor networks using energy metrics. IEEE Transactions on Parallel Distributed Systems, 13(9), 924–935.CrossRef
14.
Willig, A., Shah, R., Rabaey, J., & Wolisz, A. (2002, August) Altruists in the PicoRadio sensor network. 4th IEEE International Workshop on Factory Communications Systems, Sweden, pp. 175–184.
15.
Howard, A., Mataric, M. J., & Sukhatme, G. S. (2002, June), Mobile sensor network deployment using potential fields: A distributed scalable solution to the area coverage problem. International symposium on distributed autonomous robotics systems, Fukuoka, Japan, pp. 299–308.
16.
Zou, Y., & Chakrabarty, K. (2003). Sensor deployment and target localization based on virtual forces. In Proceedings of IEEE infocom conference, pp. 1293–1303.
17.
Poduri, S., & Sukhatme, G. (2004). Constrained coverage for mobile sensor networks. In Proceedings of IEEE international conference on robotics and automation (ICRA’04).
18.
Zou, Y., & Chakrabarty, K. (2004, February). Sensor deployment and target localization in distributed sensor networks. ACM Transactions on Embedded Computing Systems, Special Issue on Networked Embedded Computing: Tools, Architectures and Applications, 3(1), 61–91.
19.
Heo, N., & Varshney, P. K. (2005). Energy-efficient deployment of intelligent mobile sensor networks. IEEE Transactions on Systems, Man, and Cybernetics (Part A), 35(1), 78–92.
20.
Wang, G., Cao, G. & La Porta, T. (2006, June). Movement-assisted sensor deployment. IEEE Transactions on Mobile Computing, 5(6), 640–652.
21.
Wang, P. C., Hou, T. W., & Yan, R. H. (2006). Maintaining coverage by progressive crystallattice permutation in mobile wireless sensor networks. IEEE international conference on systems and networks communication (ICSNC), pp. 1–6.
22.
Chellappan, S., Bai, X., Ma, B., Xuan, D., & Xu, C. (2007). Mobility limited flip-based sensor networks deployment. IEEE Transactions on Parallel and Distributed Systems, 18(2), 199–211.
23.
Chellappan, S., Gu, W., Bai, X., Xuan, D., Ma, B., & Zhang, K. (2007). Deploying wireless sensor networks under limited mobility constraints. IEEE Transactions on Mobile Computing, 6(10), 1142–1157.CrossRef
24.
Jiang, Z., Wu, J., Kline, R., & Krantz, J. (2008). Mobility control for complete coverage in wireless sensor networks. In Proceedings of the 28th international conference on distributed computing systems workshops (ICDCS), pp. 291–296.
25.
Wang, G., Cao, G., Porta, T. L., & Zhang, W. (2005). Sensor relocation in mobile sensor networks. IEEE INFOCOM, pp. 2302–2312.
26.
Yang, S., Li, M., & Wu, J. (2007). Scan-based movement-assisted sensor deployment methods in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 18(8), 1108–1121.
27.
Wu, J., & Yang, S. (2007). Optimal movement-assisted sensor deployment and its extensions in wireless sensor networks. Simulation Modeling Practice and Theory, 15(4), 383–399.CrossRef
28.
Yang, S., Wu, J., & Dai, F. (2006). Localized movement-assisted sensor deployment in wireless sensor networks. IEEE workshops in the international conference on mobile adhoc and sensor systems (MASS), pp. 753–758.
29.
Esnaashari, M., & Meybodi, M. R. (2011). A cellular learning automata-based deployment strategy for mobile wireless sensor networks. Journal of Parallel and Distributed Computing, 71(7), 988–1001.
30.
Arora, A., Dutta, P., Bapat, S., Kulathumani, V., Zhang, H., Naik, V., et al. (2004, December). A line in the sand: A wireless sensor network for target detection, classification, and tracking. Computer Networks, 46(5), 605–634.
31.
Mehta, D., Lopez, M., & Lin, L. (2003, May). Optimal coverage paths in ad hoc sensor networks. IEEE international conference on communications, pp. 507–511.
32.
Kumar, S., Lai, T. H., & Balogh, J. (2004). On k-Coverage in a Mostly Sleeping Sensor Network (pp. 144–158). Philadelphia, Pennsylvania, USA: 10th Annual International Conference on Mobile Computing and Networking.
33.
Zhao, Z., & Govindan, R. (2003, November). Understanding packet delivery performance in dense wireless sensor networks. In 3th ACM conference on embedded networked sensor systems, Los Angeles, CA, pp. 1–13.
34.
Hall, D., & Llinas, J. (2001). Handbook of multisensor data fusion. New York: CRC Press.
35.
Wang, B., Lim, H. B., & Ma, D. (2009). A survey of movements strategies for improving network coverage in wireless sensor networks. Computer Communications, 32, 1427–1436.CrossRef
36.
Wang, Y. C., Hu, C. C., & Tseng, Y. C. (2008). Efficient placement and dispatch of sensors in a wireless sensor network. IEEE Transactions on Mobile Computing, 7(2), 262–274.CrossRef
37.
Wang, Y. C., & Tseng, Y. C. (2008, September). Distributed deployment schemes for mobile wireless sensor networks to ensure multi-level coverage. IEEE Transactions on Parallel and Distributed Systems, 19(9), 1280–1294.
38.
Katsuma, R., Murata, Y., Shibata, N., Yasumoto, K., & Ito, M. (2010, April). Extending k-coverage lifetime of wireless sensor networks with surplus nodes. In Proceedings of the 5th international conference on mobile computing and ubiquitous networking (ICMU2010), pp. 9–16.
39.
Mo, W., Qiao, D., & Wang, Z. (2006). Lifetime maximization of sensor networks under connectivity and k-coverage constraints. Lecture Notes in Computer Science, 4026, 422–442. Berlin/Heidelberg: Springer.
40.
Mo, W., Qiao, D., & Wang, Z. (2005, September). Mostly-sleeping wireless sensor networks: connectivity, k-coverage, and α-lifetime. Allerton Conference, UIUC.
41.
Kalayci, T. E., Yildirim, K. S., & Ugur, A. (2007, October). Maximizing coverage in a connected and k-covered wireless sensor network using genetic algorithms. International Journal of Applied Mathematics and Informatics, 1(3), 123–130.
42.
Abeyweera, I. S. (2007, February). A coverage control mechanism satisfying application requirements in a wireless sensor network. Master’s Thesis, Department of Information Networking, Osaka University.
43.
Ye, M., Chan, E., Chen, G., & Wu, J. (2006, July). Energy efficient fractional coverage schemes for low cost wireless sensor networks. In 26th IEEE International Conference on Distributed Computing Systems Workshop, pp. 74–79.
44.
Slijepcevic, S., & Potkonjak, M. (2001, June). Power efficient organization of wireless sensor networks. In IEEE international conference on communications, pp. 472–476.
45.
Makhoul, A., Saadi, R., & Pham, C. (2009, October). Coverage and adaptive scheduling algorithms for criticality management on video wireless sensor networks. In International conference on ultra modern telecommunications & workshops, pp. 1–8.
46.
Gao, S., Vu, C. T., Li, Y. (2006). Sensor scheduling for k-coverage in wireless sensor networks. Lecture Notes in Computer Science, 4325, 268–280. Berlin/Heidelberg: Springer.
47.
Huang, C. F., & Tseng, Y. C. (2005). The coverage problem in a wireless sensor network. Mobile Networks and Applications, 10(4), 519–528.MathSciNetCrossRef
48.
Liu, Y., Pu, J., Zhang, S., Liu, Y., & Xiong, Z. (2009). A localized coverage preserving protocol for wireless sensor networks. Sensors, 9, 281–302.CrossRef
49.
Simon, G., Molnar, M., Gonczy, L., & Cousin, B. (2007). Dependable k-Coverage Algorithms for Sensor Networks (pp. 1–6). Warsaw, Poland: Instrumentation and Measurement Technology Conference.
50.
Pocquet, A., Cousin, B., Molnar, M., & Parraud, P. (2008, August). Performance analysis of CGS, a k-coverage algorithm based on one-hop neighboring knowledge. In 2nd international conference on sensor technologies and applications, pp. 115–122.
51.
Zhou, Z., Das, S., & Gupta, H. (2004, October). Connected k-coverage problem in sensor networks. In 13th international conference on computer communications and networks, Chicago, IL, pp. 373–378.
52.
Kasbekar, G. S., Bejerano, Y., & Sarkar, S. (2009, September). Lifetime and coverage guarantees through distributed coordinate-free sensor activation. In 15th annual international conference on mobile computing and networking. Beijing, China, pp. 169–180.
53.
Zhang, H., & Hou, J. C. (2005, Marach). Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc & Sensor Wireless Networks, 1, 89–124.
54.
Huang, C. F., Lo, L. C., & Tseng, Y. C. (2006, May). Decentralized energy-conserving and coverage-preserving protocols for wireless sensor networks. ACM Transactions on Sensor Networks, 2(2), 182–187.
55.
Fusco, G., & Gupta, H. (2009, June) Selection and orientation of directional sensors for coverage maximization. In 6th Annual IEEE communications society conference on sensor, Mesh, and ad hoc communications and networks. Rome, pp. 1–9.
56.
Bagheri, M. (2007). Efficient k-coverage algorithms for wireless sensor networks and their applications to early detection of forest fires. PhD thesis, Simon Fraser University.
57.
Hefeeda, M., & Bagheri, M. (2007, May). Randomized k-coverage algorithms for dense sensor networks. IEEE INFOCOM 2007, Anchorage, AK, pp. 2376–2380.
58.
Fusco, G., & Gupta, H. (2009). ε-Net approach to sensor k-coverage, In 4th International conference on wireless algorithms, systems, and applications, pp. 104–114.
59.
Ammari, H. M., & Das, S. K. (2008, June). Joint k-coverage and hybrid forwarding in duty-cycled three-dimensional wireless sensor networks. In 5th annual IEEE communications society conference on sensor, mesh, and ad hoc communications and networks. San Francisco, CA, pp. 170–178.
60.
Ammari, H. M. (2008, May). Energy efficient connected k-coverage, duty-cycling, and geographic forwarding in wireless sensor networks. In PhD thesis, University of Texas at Arlington.
61.
Noy, A. B., Brown, T., Johnson, M. P., Porta, T. L., Sarioz, D., Verma, D., et al. (2007, October). Robust and efficient coverage in dense sensor deployment. ITA technical paper.
62.
Yu, H., Iyer, J., Kim, H., Kim, E. J., Yum, K. H., & Mah, P. S. (2006). Assuring k-coverage in the presence of mobility in wireless sensor networks. San Francisco, CA: IEEE GLOBECOM.
63.
Leibnitz, K., Abeyweera, I. S., Wakamiya, N., & Murata, M. (2008). A heuristic approach for k-coverage extension with energy-efficient sleep scheduling in sensor networks. In 3rd international conference on bio-inspired models of network, information, and computing systems.
64.
Tang, S., Mao, X., & Li, X. Y. (2009, March). Optimal k-support coverage paths in wireless sensor networks. In IEEE international conference on pervasive computing and communications. Galveston, TX, pp. 1–6.
65.
Kumar, S. (2006). Foundations of coverage in wireless sensor networks. PhD thesis, Ohio State University.
66.
Ssu, K. F., Wang, W. T., Wu, F. K., & Wu, T. T. (2009, March). k-barrier coverage with a directional sensing model. International Journal on Smart Sensing and Intelligent Systems, 2(1), 75–93.
67.
Wang, J. (2008, November). Communication protocols and sensing coverage in mobile ad hoc and wireless sensor networks. PhD thesis. Washington State University.
68.
Zaidi, S. A. R., Hafeez, M., McLernon, D. C., & Ghogho, M. (2008). A probabilistic model of k-coverage in minimum cost wireless sensor networks. Madrid, Spain: ACM CoNEXT Conference.
69.
Wang, Y., Wang, X., Agrawal, D. P., & Minai, A. A. (2006). Impact of heterogeneity on coverage and broadcast reachability in wireless sensor networks (pp. 63–67). Arlington, VA: 15th International Conference on Computer Communications and Networks.
70.
Yen, L. H., Yu, C. W., & Cheng, Y. M. (2006). Expected k-coverage in wireless sensor networks. Ad Hoc Networks, 4, 636–650.CrossRef
71.
Wan, P. J., & Yi, C. W. (2006, June). Coverage by randomly deployed wireless sensor networks. IEEE Transactions on Information Theory, 52(6), 2658–2669.
72.
Lazos, L., & Poovendran, R. (2006, August). Stochastic coverage in heterogeneous sensor networks. ACM Transactions on Sensor Networks, 2(3), 325–358.
73.
Lazos, L., & Poovendran, R. (2006, April). Coverage in heterogeneous sensor networks. In 4th international symposium on modeling and optimization in mobile, ad hoc, and wireless networks, pp. 1–10.
74.
Bejerano, Y. (2008, April). Simple and efficient k-coverage verification without location information. In 27th IEEE conference on computer communications. Phoenix, AZ, pp. 291–295.
75.
Bai, X., Li, S., & Xu, J. (2010, March, April). Mobile sensor deployment optimization for k-coverage n wireless sensor networks with a limited mobility model. IETE Technical Review, 27(2), 124–137.
76.
Li, J. S., & Kao, H. C. (2010). Distributed k-coverage self-location estimation scheme based on voronoi diagram. IET Communications, 4(2), 167–177.MathSciNetCrossRef
77.
Thathachar, M. A. L., & Sastry, P. S. (2002). Varieties of learning automata: An overview. IEEE Transaction on Systems, Man, and Cybernetics-Part B: Cybernetics, 32(6), 711–722.CrossRef
78.
Narendra, K. S., & Thathachar, M. A. L. (1989). Learning automata: An introduction. Upper Saddle River, NJ: Prentice-Hall Inc.
79.
Thathachar, M. A. L., & Sastry, P. S. (2004). Networks of learning automata. Boston: Kluwer Academic Publishers.
80.
Wolfram, S. (2002). A new kind of science. Champaign, IL: Wolfram Media Inc.
81.
Meybodi, M. R., Beygi, H., & Taherkhani, M. (2004). Cellular learning automata and its applications. Journal of Science Technology, Sharif (Sharif University of Technology, Tehran, Iran), pp. 54–77.
82.
Meybodi, M. R., & Taherkhani, M. (2001, May). Application of cellular learning automata in modeling of rumor diffusion. In Proceedings of 9th conference on electrical engineering. Power and Water Institute of Technology, Tehran, Iran, pp. 102–110.
83.
Beigy, H., & Meybodi, M. R. (2003). A self-organizing channel assignment algorithm: A cellular learning automata approach. Springer-Verlag Lecture Notes in Computer Science, 2690, 119–126.CrossRef
84.
Meybodi, M. R., & Mehdipour, F. (2004, Summer). Application of cellular learning automata with input to VLSI placement. Journal of Modarres, University of Tarbeit Modarres, Vol. 16, pp. 81–95.
85.
Beigy, H., & Meybodi, M. R. (2004, September, December). A mathematical framework for cellular learning automata. Advances in Complex Systems, 7(3, 4), 295–319.
86.
Beigy, H., & Meybodi, M. R. (2010). Cellular learning automata with multiple learning automata in each cell and its applications. IEEE Transactions on Systems, Man, and Cybernetics, Part B, Cybernetics, 40(1), 54–66.CrossRef
87.
Beigy, H., & Meybodi, M. R. (2007). Open synchronous cellular learning automata. Advances in Complex Systems, 10(4), 1–30.MathSciNetCrossRef
88.
Beigy, H., & Meybodi, M. R. (2008, May) Asynchronous cellular learning automata. Automatica, Journal of International Federation of Automatic Control, 44(5), 1350-1357.
89.
Esnaashari, M., & Meybodi, M. R. (2008). A cellular learning automata based clustering algorithm for wireless sensor networks. Sensor Letters, 6(5), 723–735.CrossRef
90.
Esnaashari, M., & Meybodi, M. R. (2010). Dynamic point coverage problem in wireless sensor networks: A cellular learning automata approach. Journal of Ad hoc and Sensors Wireless Networks, 10(2–3), 193–234.
91.
Ghaderi, R., Esnaashari, M., & Meybodi, M. R. (2010, February 20–22). Maintaining coverage and connectivity in sensor networks: A cellular learning automata approach. In Proceedings of the 15th annual CSI computer conference (CSICC’10), Tehran, Iran.
92.
Shannon, C. E. (1948, July, October). A mathematical theory of communication. Bell System Technical Journal, 27, 379–423, 623–656.
93.
Bettstetter, C., & Krause, O. (2001, August). On border effects in modeling and simulation of wireless ad hoc networks. In IEEE international conference on mobile and wireless communication networks. Recife, Brazil, pp. 20–27.
94.
Sobeih, A., Chen, W. P., Hou, J. C., Kung, L. C., Li, N., Lim, H., et al. (2006). J-Sim: A simulation and emulation environment for wireless sensor networks. IEEE Wireless Communications, 13(4), 104–119.CrossRef
95.
Zhou, Y., Schembri, J., Lamont, L., & Bird, J. (2009). Analysis of Stand-Alone GPS for relative location discovery in wireless sensor network (pp. 437–441). Newfoundland, Canada: Canadian Conference on Electrical and Computer Engineering.
96.
Lee, H., Dong, H., & Aghajan, H. (2006, September). Robot-assisted localization techniques for wireless image sensor networks. In IEEE international conference on sensor, mesh, and ad hoc communications and networks (SECON), pp. 383–392.
97.
Ramadurai, V., & Sichitiu, M. L. (2003). Localization in wireless sensor networks: A probabilistic approach. International conference on wireless networks, pp. 275–281.
98.
Yap, T. N., & Shelton, Ch. R. (2008). Simultaneous learning of motion and sensor model parameters for mobile robots. In Proceedings of IEEE international conference on robotics and automation, pp. 2091–2097.
Metadaten
Titel
Deployment of a mobile wireless sensor network with k-coverage constraint: a cellular learning automata approach
verfasst von
M. Esnaashari
M. R. Meybodi
Publikationsdatum
01.07.2013
Verlag
Springer US
Erschienen in
Wireless Networks / Ausgabe 5/2013
Print ISSN: 1022-0038
Elektronische ISSN: 1572-8196
DOI
https://doi.org/10.1007/s11276-012-0511-7

Weitere Artikel der Ausgabe 5/2013

Wireless Networks 5/2013 Zur Ausgabe

OriginalPaper

Base station association schemes to reduce unnecessary handovers using location awareness in femtocell networks

OriginalPaper

A collaborative node management scheme for energy-efficient monitoring in wireless multimedia sensor networks

OriginalPaper

Modeling the IEEE 802.11e HCCA mode

OriginalPaper

Distributed resource management in wireless sensor networks using reinforcement learning

OriginalPaper

Network coding-aware flow control in wireless ad-hoc networks with multi-path routing

OriginalPaper

Compressive spectrum sensing in the cognitive radio networks by exploiting the sparsity of active radios

Neuer Inhalt

    Bildnachweise