Melola Discovery

← Melola Discovery

Jurnal SINTA 2

MODELING HIDDEN NODES COLLISIONS IN WIRELESS SENSOR NETWORKS: ANALYSIS APPROACH

JUTI: Jurnal Ilmiah Teknologi Informasi · Vol. 8 No. 1 (2010) · pp. 1–8

DOI
10.12962/j24068535.v8i1.a69
ISSN
2406-8535, 1412-6389
Published
2010-01-01
Publisher
Institut Teknologi Sepuluh Nopember
Language
eng

Abstract

This paper studied both types of collisions. In this paper, we show that advocated solutions for coping with hidden node collisions are unsuitable for sensor networks. We model both types of collisions and derive closed-form formula giving the probability of hidden and visible node collisions. To reduce these collisions, we propose two solutions. The first one based on tuning the carrier sense threshold saves a substantial amount of collisions by reducing the number of hidden nodes. The second one based on adjusting the contention window size is complementary to the first one. It reduces the probability of overlapping transmissions, which reduces both collisions due to hidden and visible nodes. We validate and evaluate the performance of these solutions through simulations.

Collaboration network of the authors

14 authors · 22 co-authorship links · 3 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Institut Teknologi Sepuluh Nopember
  • University of Nusa Cendana
  • University of Indonesia
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Prima KristalinaInstitut Teknologi Sepuluh Nopember2
Amin SuharjonoInstitut Teknologi Sepuluh Nopember2
Achmad MauludiyantoAffiliation unknown1
Mauridhi Hery PAffiliation unknown1
Suhartono SuhartonoInstitut Teknologi Sepuluh Nopember1
Kalamullah RamliUniversity of Indonesia1
Kalvein RanteloboUniversity of Nusa Cendana1
Yoyon Kusnendar SupraptoInstitut Teknologi Sepuluh Nopember1
Solekhan SolekhanInstitut Teknologi Sepuluh Nopember1
Alexander Victor BukitInstitut Teknologi Sepuluh Nopember1
Suwadi SuwadiInstitut Teknologi Sepuluh Nopember1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://juti.if.its.ac.id/index.php/juti/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en">MODELING HIDDEN NODES COLLISIONS IN WIRELESS SENSOR NETWORKS: ANALYSIS APPROACH</dc:title>
	<dc:creator xml:lang="en">Rachman, A. Sjamsjiar</dc:creator>
	<dc:creator xml:lang="en">Wirawan, Wirawan</dc:creator>
	<dc:creator xml:lang="en">Hendrantoro, Gamantyo</dc:creator>
	<dc:description xml:lang="en">This paper studied both types of collisions. In this paper, we show that advocated solutions for coping with hidden node collisions are unsuitable for sensor networks. We model both types of collisions and derive closed-form formula giving the probability of hidden and visible node collisions. To reduce these collisions, we propose two solutions. The first one based on tuning the carrier sense threshold saves a substantial amount of collisions by reducing the number of hidden nodes. The second one based on adjusting the contention window size is complementary to the first one. It reduces the probability of overlapping transmissions, which reduces both collisions due to hidden and visible nodes. We validate and evaluate the performance of these solutions through simulations.</dc:description>
	<dc:publisher xml:lang="en">Institut Teknologi Sepuluh Nopember</dc:publisher>
	<dc:date>2010-01-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://juti.if.its.ac.id/index.php/juti/article/view/69</dc:identifier>
	<dc:identifier>10.12962/j24068535.v8i1.a69</dc:identifier>
	<dc:source xml:lang="en">JUTI: Jurnal Ilmiah Teknologi Informasi; Vol 8, No 1, Januari 2010; 1-8</dc:source>
	<dc:source>2406-8535</dc:source>
	<dc:source>1412-6389</dc:source>
	<dc:source>10.12962/j24068535.v8i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://juti.if.its.ac.id/index.php/juti/article/view/69/65</dc:relation>
</oai_dc:dc>