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 Personal Communications
Erschienen in: Wireless Personal Communications 1/2018

04.09.2017

Relay Node Placement with Assured Coverage and Connectivity: A Jarvis March Approach

verfasst von: Kumar Nitesh, Prasanta K. Jana

Erschienen in: Wireless Personal Communications | Ausgabe 1/2018

Einloggen

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

search-config
loading …

Abstract

Relay node placement preserving coverage and connectivity is an important problem for the deployment of a fault tolerant two tier wireless sensor network (WSN). In this paper, we propose an algorithm for relay node placement that ensures k-coverage of the sensor nodes and s-connectivity of the relay nodes within the network. The basic goal of the algorithm is to optimize the network cost by using least number of relay nodes. This is carried out by reducing the overlapped coverage area of the relay nodes. The algorithm is based on the spiral traversal of sensor nodes, which is generated by using Jarvis March approach. The proposed algorithm runs in \(O(n^{2})\) time for n sensor nodes and is shown to be a 1.5-approximation algorithm. It is equally efficient for different and unequal degree of coverage and connectivity in the target area. The algorithm is experimented through the simulation run for different scenarios of WSN. The experimental results are then compared with some existing algorithms to demonstrate its effectiveness.
Vorheriger Artikel Novel Algorithms for Reliability Evaluation of Remotely Deployed Wireless Sensor Networks
Nächster Artikel Secure Vehicular Communication Using ID Based Signature Scheme

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

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+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
Literatur
1.
Akyildiz, I. F., et al. (2002). Wireless sensor networks: A survey. Computer Networks, 38(4), 393–422.CrossRef
2.
Abbasi, A. A., & Younis, M. (2007). A survey on clustering algorithms for wireless sensor networks. Computer Communications, 30(14), 2826–2841.CrossRef
3.
Azharuddin, M., Kuila, P., Jana, P. K. (2013). A distributed fault-tolerant clustering algorithm for wireless sensor networks. In 2013 International conference on advances in computing, communications and informatics (ICACCI). IEEE.
4.
Kuila, P., & Jana, P. K. (2014). Approximation schemes for load balanced clustering in wireless sensor networks. The Journal of Supercomputing, 68(1), 87–105.CrossRef
5.
Ma, C., et al. (2016). A connectivity-aware approximation algorithm for relay node placement in wireless sensor networks. IEEE Sensors Journal, 16(2), 515–528.CrossRef
6.
Tang, J., Hao, B., & Sen, A. (2006). Relay node placement in large scale wireless sensor networks. Computer Communications, 29(4), 490–501.CrossRef
7.
Hao, B., Tang, H., Xue, G. (2004). Fault-tolerant relay node placement in wireless sensor networks: Formulation and approximation. In 2004 Workshop on high performance switching and routing, 2004. HPSR. IEEE
8.
Pan, R., et al. (2015). An opportunistic relay protocol with dynamic scheduling in wireless body area sensor network. IEEE Sensors Journal, 15(7), 3743–3750.CrossRef
9.
Nitesh, K., & Jana, P. K. (2016). Distributed fault detection and recovery algorithms in two-tier wireless sensor networks. International Journal of Communication Networks and Distributed Systems, 16(3), 281–296.CrossRef
10.
Nitesh, K., Azharuddin, M., & Jana, P. K. (2015). Energy efficient fault-tolerant clustering algorithm for wireless sensor networks. In 2015 International conference on green computing and internet of things (ICGCIoT) (pp. 234–239). IEEE.
11.
Gupta, G., & Younis, M. (2003). Load-balanced clustering of wireless sensor networks. In IEEE international conference on communications, 2003. ICC’03 (Vol. 3). IEEE.
12.
Nitesh, K., & Jana, P. K. (2014). Relay node placement algorithm in wireless sensor network. In 2014 IEEE international advance computing conference (IACC). IEEE.
13.
Preparata, F. P., & Shamos, M. (2012). Computational geometry: An introduction. Berlin: Springer.MATH
14.
15.
Bari, A., et al. (2012). Design of fault tolerant wireless sensor networks satisfying survivability and lifetime requirements. Computer Communications, 35(3), 320–333.CrossRef
16.
Gupta, H. P., Tyagi, P. K., & Singh, M. P. (2015). Regular node deployment for-coverage in-connected wireless networks. IEEE Sensors Journal, 15(12), 7126–7134.CrossRef
17.
Liu, H., Wan, P.-J., Jia, X. (2005). Fault-tolerant relay node placement in wireless sensor networks. In International computing and combinatorics conference. Springer, Berlin Heidelberg (pp. 230–239).
18.
Zhang, R., et al. (2008). Testbed experimentation of a meshed tree routing with local link state for wireless PAN mesh. In 2008 IEEE international conference on communications. IEEE (pp. 3060–3065).
19.
Lloyd, E. L., & Xue, G. (2007). Relay node placement in wireless sensor networks. IEEE Transactions on Computers, 56(1), 134–138.MathSciNetCrossRef
20.
Sun, G., et al. (2015). Effective link interference model in topology control of wireless Ad hoc and sensor networks. Journal of Network and Computer Applications, 52, 69–78.CrossRef
21.
Hao, X.-C., Xin, M.-J., & Ru, X.-Y. (2015). EAPOR: A distributed, energy-aware topology control algorithm based path obstacle remove model for WSN. Wireless Personal Communications, 80(2), 671–692.CrossRef
22.
Al Islam, A. B. M. A., et al. (2014). Backpacking: Energy-efficient deployment of heterogeneous radios in multi-radio high-data-rate wireless sensor networks. IEEE Access, 2, 1281–1306.CrossRef
23.
Guo, J., et al. (2015). Distributed fault-tolerant topology control in cooperative wireless Ad Hoc networks. IEEE Transactions on Parallel and Distributed Systems, 26(10), 2699–2710.CrossRef
24.
Halder, S., & Bit, S. D. (2014). Enhancement of wireless sensor network lifetime by deploying heterogeneous nodes. Journal of Network and Computer Applications, 38, 106–124.CrossRef
25.
Srinivas, A., Zussman, G., & Modiano, E. (2009). Construction and maintenance of wireless mobile backbone networks. IEEE/ACM Transactions on Networking (TON), 17(1), 239–252.CrossRef
26.
Ali, K., Alsalih, W., Hassanein, H. (2011). Set-Cover approximation algorithms for load-aware readers placement in RFID networks. In 2011 IEEE international conference on communications (ICC), IEEE (pp. 1–6).
27.
Xu, K., et al. (2005). Optimal wireless sensor networks (WSNs) deployment: minimum cost with lifetime constraint. WiMob’2005). In IEEE international conference on wireless and mobile computing, networking and communications, 2005 (Vol. 3, pp. 454–461) IEEE.
28.
Hou, Y. T., et al. (2005). On energy provisioning and relay node placement for wireless sensor networks. IEEE Transactions on Wireless Communications, 4(5), 2579–2590.CrossRef
29.
Azharuddin, M., Kuila, P., & Jana, P. K. (2015). Energy efficient fault tolerant clustering and routing algorithms for wireless sensor networks. Computers & Electrical Engineering, 41, 177–190.CrossRef
30.
Azharuddin, M., & Jana, P. K. (2015). A distributed algorithm for energy efficient and fault tolerant routing in wireless sensor networks. Wireless Networks, 21(1), 251–267.CrossRef
31.
Azharuddin, M., Kuila, P., & Jana, P. K. (2013). A distributed fault-tolerant clustering algorithm for wireless sensor networks. In 2013 International conference on advances in computing, communications and informatics (ICACCI) (pp. 997–1002). IEEE.
32.
Younis, M., & Akkaya, K. (2008). Strategies and techniques for node placement in wireless sensor networks: A survey. Ad Hoc Networks, 6(4), 621–655.CrossRef
33.
Zhu, C., et al. (2012). A survey on coverage and connectivity issues in wireless sensor networks. Journal of Network and Computer Applications, 35(2), 619–632.CrossRef
34.
Akkaya, K., & Younis, M. (2008). Coverage and latency aware actor placement mechanisms in WSANs. International Journal of Sensor Networks, 3(3), 152–164.CrossRef
35.
Bari, A., Jaekel, A., Bandyopadhyay, S. (2007). Optimal placement of relay nodes in two-tiered, fault tolerant sensor networks. In 12th IEEE symposium on computers and communications, ISCC 2007. IEEE, 2007 (pp. 159–164).
36.
Feeney, L. M., Nilsson, M. (2001). Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In INFOCOM, twentieth annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE. (Vol. 3, pp. 1548–1557). IEEE 2001.
37.
Ok, C.-S., et al. (2009). Distributed energy balanced routing for wireless sensor networks. Computers & Industrial Engineering, 57(1), 125–135.CrossRef
38.
ILOG, S. Ilog cplex 11.1 reference manual, Mountain View, California: ILOG SA.
Metadaten
Titel
Relay Node Placement with Assured Coverage and Connectivity: A Jarvis March Approach
verfasst von
Kumar Nitesh
Prasanta K. Jana
Publikationsdatum
04.09.2017
Verlag
Springer US
Erschienen in
Wireless Personal Communications / Ausgabe 1/2018
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI
https://doi.org/10.1007/s11277-017-4922-8

Weitere Artikel der Ausgabe 1/2018

Wireless Personal Communications 1/2018 Zur Ausgabe

OriginalPaper

Optimal Guard Distance for Maximizing Spatial-Temporal Spectrum Access Opportunity in Mobile CRNs

OriginalPaper

Cross Layer Optimization for ZigBee-Based Transmission Line Monitoring and Data Collection

OriginalPaper

Security Issues in Ultralightweight RFID Authentication Protocols

OriginalPaper

Multi-channel Tracking with Different Fading Rates in an OFDM-PLNC Network

OriginalPaper

Design of Compact Quad-Band Notched UWB-MIMO Antenna

OriginalPaper

Organizing XML Data in a Wireless Broadcast System by Exploiting Structural Similarity

Neuer Inhalt

    Bildnachweise