Delay aware reliable transport in wireless sensor networks

Date

2007-10-01

Author

Gungor, Vehbi C.
Akan, Oezguer B.

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

164
views

0
downloads

Wireless sensor networks (WSN) are event-based systems that rely on the collective effort of several sensor nodes. Reliable event detection at the sink is based on collective information provided by the sensor nodes and not on any individual sensor data. Hence, conventional end-to-end reliability definitions and solutions are inapplicable in the WSN regime and would only lead to a waste of scarce sensor resources. Moreover, the reliability objective of WSN must be achieved within a certain real-time delay bound posed by the application. Therefore, the WSN paradigm necessitates a collective delay-constrained event-to-sink reliability notion rather than the traditional end-to-end reliability approaches. To the best of our knowledge, there is no transport protocol solution which addresses both reliability and real-time delay bound requirements of WSN simultaneously.

Subject Keywords

Computer Networks and Communications, Electrical and Electronic Engineering

URI

https://hdl.handle.net/11511/64589

Journal

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS

DOI

https://doi.org/10.1002/dac.869

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Path planning for mobile-anchor based wireless sensor network localization: Static and dynamic schemes Erdemir, Ecenaz; Tuncer, Temel Engin (Elsevier BV, 2018-08-01) In wireless sensor networks, node locations are required for many applications. Usually, anchors with known positions are employed for localization. Sensor positions can be estimated more efficiently by using mobile anchors (MAs). Finding the best MA trajectory is an important problem in this context. Various path planning algorithms are proposed to localize as many sensors as possible by following the shortest path with minimum number of anchors. In this paper, path planning algorithms for MA assisted loca...
Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours Onur, Ertan; Delic, Hakan; Akarun, Lale (Elsevier BV, 2010-02-01) For surveillance applications of wireless sensor networks, analysis of sensing coverage and quality of sensing is crucial. For rough terrains where obstacles block the sensing capability, region-based approaches must be employed to determine the sensing quality. In this paper, we present a method to determine the breach paths and the deployment quality defined as the minimum of the maximum detection probabilities on the breach paths in the presence of obstacles. We propose the utilization of watershed segme...
Duty cycle control in wireless sensor networks Yılmaz, Mine; Bilgen, Semih; Department of Electrical and Electronics Engineering (2007) Recent advances in wireless communication and micro-electro-mechanical systems (MEMS) have led to the development of implementation of low-cost, low power, multifunctional sensor nodes. These sensor node are small in size and communicate untethered in short distances. The nodes in sensor networks have limited battery power and it is not feasible or possible to recharge or replace the batteries, therefore power consumption should be minimized so that overall network lifetime will be increased. In order to mi...
Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies Vazifehdan, Javad; Prasad, R. Venkatesha; Onur, Ertan; Niemegeers, Ignas (Elsevier BV, 2011-10-27) Although many energy-aware routing schemes have been proposed for wireless ad hoc networks, they are not optimized for networks with heterogeneous power supplies, where nodes may run on battery or be connected to the mains (grid network). In this paper, we propose several energy-aware routing algorithms for such ad hoc networks. The proposed algorithms feature directing the traffic load dynamically towards mains-powered devices keeping the hop count of selected routes minimal. We unify these algorithms into...
How many sensors for an acceptable breach detection probability? Onur, Ertan; Delic, H (Elsevier BV, 2006-01-10) Determining the required number of sensors to be deployed is a critical decision for surveillance wireless sensor networks. In this paper, we discuss the trade-off between the number of sensors and the breach detection probability considering the effects of sensor parameters. We present the weakest breach path problem formulation and provide a solution by utilizing the Dijkstra's shortest path algorithm. We propose a method to determine the required number of sensors to be deployed and to gain insight about...

Citation Formats

V. C. Gungor and O. B. Akan, “Delay aware reliable transport in wireless sensor networks,” INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, pp. 1155–1177, 2007, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64589.