Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Event-to-sink reliable transport in wireless sensor networks
Date
2005-10-01
Author
Akan, OB
Akyildiz, IF
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
124
views
0
downloads
Cite This
Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective information provided by source nodes and not on any individual report. However, 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. Hence, the WSN paradigm necessitates a collective event-to-sink reliability notion rather than the traditional end-to-end notion. To the best of our knowledge, reliable transport in WSN has not been studied from this perspective before.
Subject Keywords
Computer Networks and Communications
,
Electrical and Electronic Engineering
,
Software
,
Computer Science Applications
URI
https://hdl.handle.net/11511/64523
Journal
IEEE-ACM TRANSACTIONS ON NETWORKING
DOI
https://doi.org/10.1109/tnet.2005.857076
Collections
Department of Electrical and Electronics Engineering, Article
Suggestions
OpenMETU
Core
Delay aware reliable transport in wireless sensor networks
Gungor, Vehbi C.; Akan, Oezguer B. (Wiley, 2007-10-01)
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 b...
The performance and efficiency of envelope elimination and restoration transmitters for future multiple-input multiple-output wireless local area networks
Nesimoglu, T.; Parker, S. C. J.; Morris, K. A.; McGeehan, J. P. (Institution of Engineering and Technology (IET), 2008-03-01)
The inefficiency of contemporary power amplifiers ( PAs), when operating in their linear region, is a major obstacle to mobile operation of wireless local area networks ( WLANs) based on IEEE 802.11n. Therefore the use of more efficient envelope elimination and restoration ( EER) transmitter architectures is considered. In addition to high efficiency it is also necessary to satisfy the spectral mask and achieve satisfactory link- level performance. Link- level simulations of a contemporary WLAN PA show that...
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...
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...
Systematic message schedule construction for time-triggered CAN
Schmidt, Klaus Verner; Schmidt, Şenan Ece (Institute of Electrical and Electronics Engineers (IEEE), 2007-11-01)
The most widely used standard for in-vehicle communication networks that interconnect electronic control units is the controller area network (CAN). However, the event-triggered architecture of CAN introduces several issues, such as predictability, signal jitter, and reliability. Different time-triggered networks. are being developed to address these issues. In this paper, we focus on time-triggered CAN (TTCAN), which achieves time-triggered behavior by implementing time-division multiple access on the exis...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. Akan and I. Akyildiz, “Event-to-sink reliable transport in wireless sensor networks,”
IEEE-ACM TRANSACTIONS ON NETWORKING
, pp. 1003–1016, 2005, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64523.