Skip to main content

2019 | OriginalPaper | Buchkapitel

Construction of Minimum Power 3-Connected Subgraph with k Backbone Nodes in Wireless Sensor Networks

verfasst von : D. Pushparaj Shetty, M. Prasanna Lakshmi

Erschienen in: Applied Mathematics and Scientific Computing

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

Minimizing the total power in a wireless sensor network (WSN) has great significance, since the nodes are powered by a small battery of limited capacity. By using an appropriate topology, the energy utilization of the network can be minimized which results in an increased lifetime of a WSN. In reality, WSN is modeled as an undirected graph in which each vertex represents a sensor node and an edge represents the link between the two sensor nodes. We define a distance function that maps a pair of vertices to a positive real number, i.e., Euclidean distance between the two vertices. On this initial topology, we construct a reduced topology satisfying special connectivity constraints like bi-connectivity, k-connectivity, bounded diameter, degree restricted, etc. We assign power to each node as the maximum distance of all its adjacent edges, and total power of the network is the sum of the powers of all the vertices. Fault tolerance addresses the issue of a node or link failure in a WSN. Fault-tolerant network aims at k-connectivity in the network so that there exist at least k vertex disjoint paths between any two sensor nodes of the network. Minimum power 2-connected subgraph (MP2CS) problem is to contrive a 2-connected network with minimum total power. It is proved that MP2CS problem is NP-hard. Minimum power k backbone node 2-connected subgraph (MPkB2CS) problem is a special case of MP2CS problem, which seeks a power assignment satisfying 2-connectivity with k backbone nodes. In this paper, the problem of finding a 3-connected network for a given set of nodes, which minimizes the total power with k backbone nodes, is addressed which is termed as MPkB3CS problem. We propose an algorithm for MPkB3CS problem and establish that the proposed algorithm has an approximation ratio of 4k + 1, for k ≥ 3.

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!

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!

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!

Literatur
3.
Zurück zum Zitat Călinescu, G., Wan, P.: Range assignment for high connectivity in wireless ad hoc networks. In: Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, ADHOC-NOW 2003 Montreal, Canada, October 8-10, 2003, Proceedings. pp. 235–246 (2003), http://doi.org/10.1007/978-3-540-39611-6-21 Călinescu, G., Wan, P.: Range assignment for high connectivity in wireless ad hoc networks. In: Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, ADHOC-NOW 2003 Montreal, Canada, October 8-10, 2003, Proceedings. pp. 235–246 (2003), http://​doi.​org/​10.​1007/​978-3-540-39611-6-21
11.
Zurück zum Zitat Panda, B.S., Shetty, D.P.: Minimum range assignment problem for two connectivity in wireless sensor networks. In: Distributed Computing and Internet Technology - 10th International Conference, ICDCIT 2014, Bhubaneswar, India, February 6-9, 2014. Proceedings. pp. 122–133 (2014), http://doi.org/10.1007/978-3-319-04483-5-14 Panda, B.S., Shetty, D.P.: Minimum range assignment problem for two connectivity in wireless sensor networks. In: Distributed Computing and Internet Technology - 10th International Conference, ICDCIT 2014, Bhubaneswar, India, February 6-9, 2014. Proceedings. pp. 122–133 (2014), http://​doi.​org/​10.​1007/​978-3-319-04483-5-14
12.
Zurück zum Zitat Ramanathan, R., Hain, R.: Topology control of multihop wireless networks using transmit power adjustment. In: Proceedings IEEE INFOCOM 2000, The Conference on Computer Communications, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Reaching the Promised Land of Communications, Tel Aviv, Israel, March 26-30, 2000. pp. 404–413 (2000), https://doi.org/10.1109/INFCOM.2000.832213 Ramanathan, R., Hain, R.: Topology control of multihop wireless networks using transmit power adjustment. In: Proceedings IEEE INFOCOM 2000, The Conference on Computer Communications, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Reaching the Promised Land of Communications, Tel Aviv, Israel, March 26-30, 2000. pp. 404–413 (2000), https://​doi.​org/​10.​1109/​INFCOM.​2000.​832213
13.
Zurück zum Zitat Santi, P.: Topology control in wireless ad hoc and sensor networks. Wiley (2005) Santi, P.: Topology control in wireless ad hoc and sensor networks. Wiley (2005)
15.
Zurück zum Zitat West, D.B., et al.: Introduction to graph theory, vol. 2. Prentice hall Upper Saddle River (2001) West, D.B., et al.: Introduction to graph theory, vol. 2. Prentice hall Upper Saddle River (2001)
16.
Zurück zum Zitat Zheng, C., Yin, L., Zhang, Y.: Constructing r-hop 2-connected dominating sets for fault-tolerant backbone in wireless sensor networks. In: 2012 8th International Conference on Wireless Communications, Networking and Mobile Computing. pp. 1–4 (Sept 2012) Zheng, C., Yin, L., Zhang, Y.: Constructing r-hop 2-connected dominating sets for fault-tolerant backbone in wireless sensor networks. In: 2012 8th International Conference on Wireless Communications, Networking and Mobile Computing. pp. 1–4 (Sept 2012)
Metadaten
Titel
Construction of Minimum Power 3-Connected Subgraph with k Backbone Nodes in Wireless Sensor Networks
verfasst von
D. Pushparaj Shetty
M. Prasanna Lakshmi
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-030-01123-9_52