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
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben
Innovations in Systems and Software Engineering
Erschienen in: Innovations in Systems and Software Engineering 3/2016

15.04.2016 | S.I. : ICACNI 2015

Self-organized area coverage in wireless sensor networks by limited node mobility

verfasst von: Dibakar Saha, Nabanita Das

Erschienen in: Innovations in Systems and Software Engineering | Ausgabe 3/2016

Einloggen

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

search-config
loading …

Abstract

For wireless sensor networks, monitoring large inaccessible areas where deterministic node deployment is not possible, self-organized techniques are in demand to cover an area using optimal number of nodes. In this paper, given an initial random deployment of mobile sensor nodes, we propose a simple and novel technique for self-organized node movement to satisfy the coverage of the given region of interest using a least number of nodes, such that the maximum node displacement is minimized. We present a simple centralized algorithm and also a distributed version of it for node placement. Moreover, in case of a node failure, a distributed fault recovery algorithm is proposed to replace it locally utilizing the available free nodes. Analysis, simulation, and comparison studies show that the proposed algorithms with less neighborhood information result in significant improvement in terms of average and maximum displacement of a node, rounds of communication, and number of active nodes.
Vorheriger Artikel On the use of secret sharing as a secure multi-use pad
Nächster Artikel Uniform load sharing on a hierarchical content delivery network interconnection model

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 "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

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
Literatur
1.
Alt H, Blum N, Mehlhorn K, Paul M (1991) Computing a maximum cardinality matching in a bipartite graph in time. Inf Process Lett 37(4):237–240MathSciNetCrossRefMATH
2.
Bartolini N, Calamoneri T, Fusco E, Massini A, Silvestri S (2010) Push and pull: autonomous deployment of mobile sensors for a complete coverage. Wirel Netw 16(3):607–625CrossRef
3.
Brass P (2007) Bounds on coverage and target detection capabilities for models of networks of mobile sensors. ACM Trans Sens Netw (TOSN) 3(2):9CrossRef
4.
Cheng P, Chuah CN, Liu X (2004) Energy-aware node placement inwireless sensor networks. In: Global telecommunications conference, GLOBECOM, vol 5. IEEE, pp 3210–3214
5.
Han YH, hwan Kim Y, Kim W, Jeong YS (2012) An energy-efficient self-deployment with the centroid-directed virtual force in mobile sensor networks. Simulation 88(10):1152–1165CrossRef
6.
Heo N, Varshney PK (2003) An intelligent deployment and clusteringalgorithm for a distributed mobile sensor network. In: IEEE international conference on systems, man and cybernetics, vol 5, pp 4576–4581
7.
Ke W, Liu B, Tsai M (2011) The critical-square-grid coverage problem in wireless sensor networks is NP-complete. J Comput Netw 55(9):2209–2220CrossRef
8.
Kukunuru N, Thella BR, Davuluri RL (2010) Sensor deployment using particle swarm optimization. Int J Eng Sci Technol 2(10):5395–5401
9.
Li X, He S, Chen J, Liang X, Lu R, Shen S (2011) Coordinate-free distributed algorithm for boundary detection in wireless sensor networks. In: Global telecommunications conference (IEEE GLOBECOM), pp 1–5
10.
Liao WH, Kao Y, Li YS (2011) A sensor deployment approach using glowworm swarm optimization algorithm in wireless sensor networks. Expert Syst Appl 38(10):12180–12188CrossRef
11.
Luo CJ, Tang B, Zhou MT, Cao Z (2010) Analysis of the wireless sensor networks efficient coverage. In: Proc. of international conference on apperceiving computing and intelligence analysis (ICACIA), pp 194–197
12.
Poe WY, Schmitt JB (2009) Node deployment in large wireless sensor networks: coverage, energy consumption, and worst-case delay. In: Conference on Asian internet engineering. ACM, New York, pp 77–84
13.
Saha D, Das N (2013) Distributed area coverage by connected set cover partitioning in wireless sensor networks. In: Proc. of first international workshop on sustainable monitoring through cyber-physical systems (SuMo-CPS), ICDCN
14.
Saha D, Das N (2013) A fast fault tolerant partitioning algorithmfor wireless sensor networks. In: Third international conference on advances in computing and information technology (ACITY). CSIT, India, pp 227–237
15.
Saha D, Das N (2016) Self-organized node placement for area coverage in pervasive computing networks. In: Proceedings of 3rd international conference on advanced computing, networking and informatics, vol 43. Springer, New York, pp 365–376
16.
Saha D, Das N, Bhattacharya BB (2014) Fast estimation of coverage area in a pervasive computing environment. In: Advanced computing, networking and informatics—volume 2, vol 28, pp 19–27
17.
Saha D, Das N, Pal S (2014) A digital-geometric approach for computing area coverage in wireless sensor networks. In: Proc. of 10th international conference on distributed computing and internet technologies (ICDCIT), pp 134–145
18.
Sheu JP, Yu CH, Tu SC (2005) A distributed protocol for query execution in sensor networks. In: Proc. of IEEE wireless communications and networking conference, vol 3, pp 1824–1829
19.
Wang G, Cao G, Porta TL (2006) Movement-assisted sensor deployment. IEEE Trans Mob Comput 5(6):640–652CrossRef
20.
Wang X, Wang S, Ma JJ (2007) An improved co-evolutionary particle swarm optimization for wireless sensor networks with dynamic deployment. Sensors 7(3):354–370CrossRef
21.
Wang Y, Gao J, Mitchell JS (2006) Boundary recognition in sensor networks by topological methods. In: Proceedings of the 12th annual international conference on mobile computing and networking. ACM, New York, pp 122–133
22.
Yu X, Huang W, Lan J, Qian X (2012) A novel virtual force approach for node deployment in wireless sensor network. In: 8th international conference on distributed computing in sensor systems (DCOSS). IEEE, pp 359–363
23.
Yu X, Huang W, Lan J, Qian” X (2012) A van der waals force-like node deployment algorithm for wireless sensor network. In: 8th international conference on mobile ad-hoc and sensor networks (MSN). IEEE, pp 191–194
24.
Yu X, Liu N, Huang W, Qian X, Zhang T (2013) A node deployment algorithm based on van der waals force in wireless sensor networks. Int J Distrib Sens Netw 1–8
25.
Zhang C, Zhang Y, Fang Y (2009) Localized algorithms for coverage boundary detection in wireless sensor networks. Wirel Netw 15(1):3–20
26.
Zhang H, Hou JC (2005) Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc Sens Wirel Netw 1(1–2):89–124
27.
Zou Y, Chakrabarty K (2003) Sensor deployment and target localization based on virtual forces. In: 22nd annual joint conference of the ieee computer and communications (INFOCOM), vol 2, pp 1293–1303
Metadaten
Titel
Self-organized area coverage in wireless sensor networks by limited node mobility
verfasst von
Dibakar Saha
Nabanita Das
Publikationsdatum
15.04.2016
Verlag
Springer London
Erschienen in
Innovations in Systems and Software Engineering / Ausgabe 3/2016
Print ISSN: 1614-5046
Elektronische ISSN: 1614-5054
DOI
https://doi.org/10.1007/s11334-016-0277-7

Weitere Artikel der Ausgabe 3/2016

Innovations in Systems and Software Engineering 3/2016 Zur Ausgabe

S.I. : ICACNI 2015

A uniform representation of multi-variant data in intensive-query databases

Editorial

Introduction to special issue on ‘Recent Computing Paradigms, Network Protocols, and Applications’

S.I. : ICACNI 2015

On the use of secret sharing as a secure multi-use pad

S.I. : ICACNI 2015

Recommendation system based on product purchase analysis

S.I. : ICACNI 2015

Measuring semantic similarity between land-cover classes for spatial analysis: an ontology hierarchy exploration approach

S.I. : ICACNI 2015

Direction prediction for avoiding occlusion in visual surveillance

Premium Partner

    Bildnachweise