Collision-free time slot reuse in multi-hop wireless sensor networks

L.F.W. van Hoesel, Paul J.M. Havinga

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

17 Citations (Scopus)
52 Downloads (Pure)

Abstract

To ensure a long-lived network of wireless communicating sensors, we are in need of a medium access control protocol that is able to prevent energy-wasting effects like idle listening, hidden terminal problem or collision of packets. Schedule-based medium access protocols are in general robust against these effects, but require a mechanism to establish a non-conflicting schedule. In this paper, we present such a mechanism which allows wireless sensors to choose a time interval for transmission, which is not interfering or causing collisions with other transmissions. In our solution, we do not assume any hierarchical organization in the network and all operation is localized. We empirically show that our localized algorithm is successful within a factor 2 of the minimum necessary time slots in random networks; well in range of the expected (worst case) factor 3-approximation of known first-fit algorithms. Our algorithm assures similar minimum distance between simultaneous transmissions as CSMA(/CD)-based approaches.
Original languageUndefined
Title of host publication2005 Intelligent sensors, Sensor Networks & Information Processing Conference
Place of PublicationLos Alamitos, California
PublisherIEEE Computer Society
Pages101-107
Number of pages7
ISBN (Print)0-7803-9400-3
DOIs
Publication statusPublished - 6 Dec 2005
Event2nd International Conference on Intelligent sensors, Sensor Networks & Information Processing, ISSNIP 2005 - Melbourne, Australia
Duration: 5 Dec 20058 Dec 2005
Conference number: 2

Conference

Conference2nd International Conference on Intelligent sensors, Sensor Networks & Information Processing, ISSNIP 2005
Abbreviated titleISSNIP
CountryAustralia
CityMelbourne
Period5/12/058/12/05

Keywords

  • CAES-PS: Pervasive Systems
  • IR-54749
  • METIS-229215
  • EWI-1548

Cite this

van Hoesel, L. F. W., & Havinga, P. J. M. (2005). Collision-free time slot reuse in multi-hop wireless sensor networks. In 2005 Intelligent sensors, Sensor Networks & Information Processing Conference (pp. 101-107). Los Alamitos, California: IEEE Computer Society. https://doi.org/10.1109/ISSNIP.2005.1595563
van Hoesel, L.F.W. ; Havinga, Paul J.M. / Collision-free time slot reuse in multi-hop wireless sensor networks. 2005 Intelligent sensors, Sensor Networks & Information Processing Conference. Los Alamitos, California : IEEE Computer Society, 2005. pp. 101-107
@inproceedings{d938daa04afe44db827e948a193fae95,
title = "Collision-free time slot reuse in multi-hop wireless sensor networks",
abstract = "To ensure a long-lived network of wireless communicating sensors, we are in need of a medium access control protocol that is able to prevent energy-wasting effects like idle listening, hidden terminal problem or collision of packets. Schedule-based medium access protocols are in general robust against these effects, but require a mechanism to establish a non-conflicting schedule. In this paper, we present such a mechanism which allows wireless sensors to choose a time interval for transmission, which is not interfering or causing collisions with other transmissions. In our solution, we do not assume any hierarchical organization in the network and all operation is localized. We empirically show that our localized algorithm is successful within a factor 2 of the minimum necessary time slots in random networks; well in range of the expected (worst case) factor 3-approximation of known first-fit algorithms. Our algorithm assures similar minimum distance between simultaneous transmissions as CSMA(/CD)-based approaches.",
keywords = "CAES-PS: Pervasive Systems, IR-54749, METIS-229215, EWI-1548",
author = "{van Hoesel}, L.F.W. and Havinga, {Paul J.M.}",
note = "Imported from havinga.xml",
year = "2005",
month = "12",
day = "6",
doi = "10.1109/ISSNIP.2005.1595563",
language = "Undefined",
isbn = "0-7803-9400-3",
pages = "101--107",
booktitle = "2005 Intelligent sensors, Sensor Networks & Information Processing Conference",
publisher = "IEEE Computer Society",
address = "United States",

}

van Hoesel, LFW & Havinga, PJM 2005, Collision-free time slot reuse in multi-hop wireless sensor networks. in 2005 Intelligent sensors, Sensor Networks & Information Processing Conference. IEEE Computer Society, Los Alamitos, California, pp. 101-107, 2nd International Conference on Intelligent sensors, Sensor Networks & Information Processing, ISSNIP 2005, Melbourne, Australia, 5/12/05. https://doi.org/10.1109/ISSNIP.2005.1595563

Collision-free time slot reuse in multi-hop wireless sensor networks. / van Hoesel, L.F.W.; Havinga, Paul J.M.

2005 Intelligent sensors, Sensor Networks & Information Processing Conference. Los Alamitos, California : IEEE Computer Society, 2005. p. 101-107.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Collision-free time slot reuse in multi-hop wireless sensor networks

AU - van Hoesel, L.F.W.

AU - Havinga, Paul J.M.

N1 - Imported from havinga.xml

PY - 2005/12/6

Y1 - 2005/12/6

N2 - To ensure a long-lived network of wireless communicating sensors, we are in need of a medium access control protocol that is able to prevent energy-wasting effects like idle listening, hidden terminal problem or collision of packets. Schedule-based medium access protocols are in general robust against these effects, but require a mechanism to establish a non-conflicting schedule. In this paper, we present such a mechanism which allows wireless sensors to choose a time interval for transmission, which is not interfering or causing collisions with other transmissions. In our solution, we do not assume any hierarchical organization in the network and all operation is localized. We empirically show that our localized algorithm is successful within a factor 2 of the minimum necessary time slots in random networks; well in range of the expected (worst case) factor 3-approximation of known first-fit algorithms. Our algorithm assures similar minimum distance between simultaneous transmissions as CSMA(/CD)-based approaches.

AB - To ensure a long-lived network of wireless communicating sensors, we are in need of a medium access control protocol that is able to prevent energy-wasting effects like idle listening, hidden terminal problem or collision of packets. Schedule-based medium access protocols are in general robust against these effects, but require a mechanism to establish a non-conflicting schedule. In this paper, we present such a mechanism which allows wireless sensors to choose a time interval for transmission, which is not interfering or causing collisions with other transmissions. In our solution, we do not assume any hierarchical organization in the network and all operation is localized. We empirically show that our localized algorithm is successful within a factor 2 of the minimum necessary time slots in random networks; well in range of the expected (worst case) factor 3-approximation of known first-fit algorithms. Our algorithm assures similar minimum distance between simultaneous transmissions as CSMA(/CD)-based approaches.

KW - CAES-PS: Pervasive Systems

KW - IR-54749

KW - METIS-229215

KW - EWI-1548

U2 - 10.1109/ISSNIP.2005.1595563

DO - 10.1109/ISSNIP.2005.1595563

M3 - Conference contribution

SN - 0-7803-9400-3

SP - 101

EP - 107

BT - 2005 Intelligent sensors, Sensor Networks & Information Processing Conference

PB - IEEE Computer Society

CY - Los Alamitos, California

ER -

van Hoesel LFW, Havinga PJM. Collision-free time slot reuse in multi-hop wireless sensor networks. In 2005 Intelligent sensors, Sensor Networks & Information Processing Conference. Los Alamitos, California: IEEE Computer Society. 2005. p. 101-107 https://doi.org/10.1109/ISSNIP.2005.1595563