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 2/2017

02.06.2017

Dynamic Node Deployment and Cross Layer Opportunistic Robust Routing for PoI Coverage Using WSNs

verfasst von: Mandar Subhash Karyakarte, Anil Srinivas Tavildar, Rajesh Khanna

Erschienen in: Wireless Personal Communications | Ausgabe 2/2017

Einloggen

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

search-config
loading …

Abstract

Point of interest (PoI) coverage is a potential application of mobile wireless sensor networks. The paper presents planar localised Delaunay triangulation (PLDT) based algorithm for self-deployment of sensor nodes for PoI coverage and optimise the data forwarding from PoI to sink. The deployment algorithm used to cover a PoI maintains connectivity all along the deployment. PLDT provides connectivity as well as path robustness compared to relative neighbourhood graphs (RNG) based straight line deployment strategy. But PLDT based path from PoI to sink has more number of hops as against RNG based path. To minimize the number of hops a cross-layer opportunistic robust routing protocol (CORRP) is designed and been used. CORRP uses request-to-send–clear-to-send (RTS–CTS) handshaking mechanism to select a forwarder amongst the contending nodes with minimal overheads. Performance of scheme is evaluated for PoI coverage with respect to time and distance.It is observed that the scheme adequately covers the PoI in finite time. The upper and lower bound on number of hops under zero loss and network failure conditions are estimated. Compared to RNG-based straight line deployment, simulation results show that PLDT deployment with CORRP exhibits better performance in the range of 40–10% for energy consumption and 12% for packet reception approximately for increasing value of node sleeping probability. Also the energy consumption under lossy links is less by 40% compared to RNG-based straight line deployment. Thus PLDT based deployment and forwarding with CORRP exhibits improvement for energy consumption, packet reception and ensures robustness.
Vorheriger Artikel Radio Access Network Sharing in 5G: Strategies and Benefits
Nächster Artikel An Approach to Defend Global Eavesdropper in Sensor Networks

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., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002). Wireless sensor networks: A survey. Computer Networks, 38(2), 393–422.CrossRef
2.
Batalin, M. A., & Sukhatme, G. S. (2002). Spreading out: A local approach to multi-robot coverage In Proceedings of sixth international symposium on distributed autonomous robotic systems (pp. 373–382).
3.
Bose, P., Devroye, L., Evans, W., & Kirkpatrick, D. (2002). On the spanning ratio of gabriel graphs and beta-skeletons. In Proceedings of Latin American theoretical informatics conference.
4.
Busse, M., Haenselmann, T., & Effelsberg, W. (2006). Energy-efficient forwarding schemes for wireless sensor networks. In: Mobile and multimedia networks (WoWMoM): Proceedings of international symposium on a world of wireless (pp. 125–133).
5.
Chakrabarty, K., Iyengar, S. S., Qi, H., & Cho, E. (2002). Grid coverage for surveillance and target address in distributed sensor networks. IEEE Transactions on Computers, 51(12), 1448–1453.MathSciNetCrossRef
6.
Cheng, W., Li, M., Liu, K., Liu, Y., Li, X., & Liao, X. (2008). Sweep coverage with mobile sensors. In Proceedings of IEEE international parallel and distributed processing symposium (IPDPS) (pp. 1–9).
7.
Chew, P. L. (1986). There is a planar graph as good as the complete graph. In Proceedings of second symposium on computational geometry (pp. 169–177).
8.
9.
Dhilon, S. S., Chakrabarty, K., & Iyengar, S. S. (2002). Sensor placement for grid coverage under imprecise detections. In Proceedings of 5th international conference information fusion (FUSION02) (pp. 1–10), Annapolis, MD, July 2002.
10.
Dobkin, D. P., Friedman, S. J., & Supowit, K. J. (1990). Delaunay graphs are almost as good as complete graphs. Discrete and Computational Geometry, 5(1), 399–407.MathSciNetCrossRefMATH
11.
Erdelj, M., Razafindralambo, T., & Simplot-Ryl, D. (2013). Covering points of interest with mobile sensors. IEEE Transactions on Parallel and Distributed Systems, 24(1), 32–43.CrossRef
12.
Gage, D. W. (1992). Command control for many-robot systems. In Proceedings of 19th annual AUVS technical symposium. Reprinted in unmanned systems magazine (Vol. 10, No. 4, pp. 28–34).
13.
Ghosh, A., & Das, S. K. (2006). Coverage and connectivity issues in wireless sensor networks. In R. Shorey, A. L. Ananda, M. C. Chan, & W. T. Ooi (Eds.), Mobile, Wireless and Sensor Networks: Technology, Applications and Future Directions (chap. 9, pp. 221–255). Wiley. doi:10.​1002/​0471755591.
14.
Heinzelman, W. R., Chandrakasan, A., & Balakrishnan, H. (2000). Energy-efficient communication protocol for wireless microsensor networks. In Proceedings of 33rd Hawaii international conference system sciences (pp. 4–7).
15.
Heissenbuttel, M., Braun, T., Bernoulli, T., & Walchli, M. (2004). BLR: Beacon-less routing algorithm for mobile ad hoc networks. Journal on Computer Communications, 27(11), 1076–1086.CrossRef
16.
Heo, N., & Varshney, P. K. (2003). A distributed self-spreading algorithm for mobile wireless sensor networks. In Proceedings of IEEE Wireless Communications and Networking Conference (WCNC03) (pp. 1597–1602). New Orleans, LA.
17.
Howard, A., & Mataric, M. J. (2002). Cover me! A self-deployment algorithm for mobile sensor networks. In Proceedings of IEEE international conference robotics and automation (ICRA02) (pp. 80–91). Washington, DC.
18.
Howard, A., Mataric, M. J., & Sukhatme, G. S. (2002). An incremental self-deployment algorithm for mobile sensor networks. Autonomous Robots, 13(2), 113–126.CrossRefMATH
19.
20.
Keil, J. M., & Gutwin, C. A. (1989). The delaunay triangulation closely approximates the complete euclidean graph. In Proceedings of first workshop algorithms data structure.
21.
Keil, J. M., & Gutwin, C. A. (1992). Classes of graphs which approximate the complete euclidean graph. Discrete and Computational Geometry, 7, 13–28.MathSciNetCrossRefMATH
22.
Khatib, O. (1986). Real-time obstacle avoidance for manipulators and mobile robots. The International Journal of Robotics Research, 5(1), 90–98.CrossRef
23.
Li, X., Calinescu, G., Wan, P., & Wang, Y. (2003). Localized delaunay triangulation with application in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems, 14(10), 1035–1047.CrossRef
24.
Li, X., Nayak, A., Simplot-Ryl, D., & Stojmenovic, I. (2010). Sensor placement in sensor and actuator networks. New York: Wiley.CrossRef
25.
Li, M., Cheng, W., Liu, K., He, Y., Li, X., & Liao, X. (2011). Sweep coverage with mobile sensors. IEEE Transactions on Mobile Computing, 10(11), 1534–1545.CrossRef
26.
Liu, C., & Wu, J. (2012). On multicopy opportunistic forwarding protocols in nondeterministic delay tolerant networks. IEEE Transactions on Parallel and Distributed Systems, 23(6), 1121–1128.CrossRef
27.
Mainwaring, A., Polastre, J., Szewczyk, R., Culler, D., & Anderson, J. (2002). Wireless sensor networks for habitat monitoring. In Proceedings of 1st ACM international workshop on wireless sensor networks and applications (WSNA02) (pp. 88–97). Atlanta, GA.
28.
Meguerdichian, S., Koushanfar, F., Qu, G., & Potkonjak, M. (2001). Exposure in wire less ad-hoc sensor networks. In Proceedings of 7th annual international conference mobile computing and networking (pp. 139–150). Rome, Italy.
29.
Meguerdifor, S. (2001). Improving network coverage in wireless sensor networks, chian, F. Koushanfar, M. Potkonjak, M. Srivastava, Coverage problems in wireless ad-hoc sensor networks. In Proceedings of IEEE InfoCom (InfoCom01) (pp. 115–121). Anchorage, AK.
30.
Poduri, S., & Sukhatme, G. S. (2004). Constrained coverage in mobile sensor networks. In Proceedings IEEE International Conference Robotics and Automation (ICRA04) (pp. 40–50). New Orleans, LA.
31.
Satyanarayana, D., & Rao, S. V. (2008). Constrained delaunay triangulation for ad hoc networks. Journal of Computer Systems, Networks, and Communications, 2008, Article ID 160453. doi:10.​1155/​2008/​160453.
32.
Stemm, M., & Katz, R. H. (1997). Measuring and reducing energy consumption of network interfaces in hand-held devices. IEICE Transactions on Communications, E80-B(8), 1125–1131.
33.
Veltri, G., Huang, Q., Qu, G., & Potkonjak, M. (2003). Minimal and maximal exposure path algorithms for wireless embedded sensor networks. In: Proceedings of 1st international conference embedded networked sensor systems (SenSys03) (pp. 40–50). Los Angeles.
34.
Wang, G., Cao, G., & LaPorta, T. (2003). A bidding protocol for deploying mobile sensors. In Proceedings of 11th IEEE international conference network protocols (ICNP03) (pp. 80–91). Atlanta, GA.
35.
Wang, G., Cao, G., & LaPorta, T. (2004). Movement-assisted sensor deployment. In Proceedings of IEEE InfoCom (InfoCom04) (pp. 80–91). Hong Kong.
36.
Wang, B., Lim, H. B., & Ma, D. (2009). A survey of movement strategies for improving network coverage in wireless sensor networks. Computer Communications, 32(13/14), 1427–1436.CrossRef
37.
Wieselthier, J. E., Nguyen, G. D., & Ephremides, A. (2001). Algorithms for energy-efficient multicasting in ad hoc wireless networks. Mobile Networks and Applications, 6(3), 251–263.CrossRefMATH
38.
Xi, M., Qi, Y., Wu, K., Zhao, J., & Li, M. (2011). Using potential to guide mobile nodes in wireless sensor networks. Ad Hoc and Sensor Wireless Networks, 12(3/4), 229–251.
39.
Xing, G., & Mii, V. B. (2010). Wireless ad hoc and sensor networks. International Journal of Parallel, Emergent and Distributed Systems, 25(6), 437–438.MathSciNetCrossRef
40.
Xufei, M., Shaojie, T., Xiahua, X., Xiang-Yang, L., & Huadong, M. (2011). Energy-efficient opportunistic routing in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 22(11), 1934–1942.CrossRef
41.
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
42.
Zou, Y. & Chakrabarty, K. (2003). Sensor deployment and target localization based on virtual forces. In Proceedings of IEEE InfoCom (InfoCom03) (pp. 1293–1303). San Francisco, CA.
43.
Zou, Y., & Chakrabarty, K. (2003) Uncertainty-aware sensor deployment algorithms for surveillance applications. In Proceedings of IEEE global communications conference (GLOBECOM03).
44.
Zou, Y., & Chakrabarty, K. (2004). Sensor deployment and target localization in distributed sensor networks. ACM Transactions on Embedded Computing Systems, 3(1), 61–91.CrossRef
Metadaten
Titel
Dynamic Node Deployment and Cross Layer Opportunistic Robust Routing for PoI Coverage Using WSNs
verfasst von
Mandar Subhash Karyakarte
Anil Srinivas Tavildar
Rajesh Khanna
Publikationsdatum
02.06.2017
Verlag
Springer US
Erschienen in
Wireless Personal Communications / Ausgabe 2/2017
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI
https://doi.org/10.1007/s11277-017-4322-0

Weitere Artikel der Ausgabe 2/2017

Wireless Personal Communications 2/2017 Zur Ausgabe

OriginalPaper

Exact Outage Probability Analysis of a Dual-Hop Cognitive Relaying Network Under the Overhearing of an Active Eavesdropper

OriginalPaper

Two-Stage Preamble Detection Scheme for IR-UWB Coexistence

OriginalPaper

Energy Detection Performance Enhancement Using RLS and Wavelet De-noising Filters

OriginalPaper

Domain Decomposition Based PIC Detectors for Massive MIMO

OriginalPaper

Maximum Transmission Capacity in Cognitive Radio Networks

OriginalPaper

User Association-Based Joint Admission and Power Control for Heterogeneous Wireless Networks

Neuer Inhalt

    Bildnachweise