Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Congestion bottleneck avoid routing in wireless sensor networks

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 9 No. 6 (2019)

DOI
10.11591/ijece.v9i6.pp4804-4814
ISSN
2088-8708, 2088-8708
Terbit
2019-12-01
Penerbit
Institute of Advanced Engineering and Science
Lisensi
creativecommons.org/licenses/by-nc/4.0

Abstrak

A new efficient method for detecting congested bottleneck nodes and avoiding them in the route formation in a wireless sensor network is described. Sensor nodes with a higher degree of congestion are excluded while determining the best routing path from a given source to destination in a multi-hop transmission. In a scenario where different communication paths have different maximum congestion levels, selecting that path which has least maximum congestion, is a challenging task. A modified Bellman-Ford algorithm is proposed to solve this problem efficiently. The proposed technique is very much useful for the optimal route selection for vehicles in metropolitan cities that avoids high traffic density junctions. Once the desired destination is specified, the traffic control system can use this algorithm to provide the least congested routes to the intra-city vehicles.

Jaringan kolaborasi para penulis

9 penulis · 13 tautan kepenulisan bersama · 4 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • GITAM University
  • Mahatma Gandhi University
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Manju BhaskarMahatma Gandhi University3
V. G. AjayMahatma Gandhi University2
Ambalath Raveendranath ParvathyAfiliasi tidak diketahui1
K. M. SmithaAfiliasi tidak diketahui1
Aju John Kunju KunjuAfiliasi tidak diketahui1
N.V Krishna PrasadGITAM University1
M.S.S.R.K.N. SarmaGITAM University1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Data ini berasal dari Crossref (yang disetorkan penerbit), karena endpoint OAI-PMH milik jurnal tidak dapat di-harvest.

Sumber metadata: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, pertama di-harvest 27 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata sebagai oai_dc, dikonversi dari Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Congestion bottleneck avoid routing in wireless sensor networks</dc:title><dc:creator>Thomas, Sanu</dc:creator><dc:creator>Mathew, Thomaskutty</dc:creator><dc:description>&lt;jats:p&gt;A new efficient method for detecting congested bottleneck nodes and avoiding them in the route formation in a wireless sensor network is described. Sensor nodes with a higher degree of congestion are excluded while determining the best routing path from a given source to destination in a multi-hop transmission. In a scenario where different communication paths have different maximum congestion levels, selecting that path which has least maximum congestion, is a challenging task. A modified Bellman-Ford algorithm is proposed to solve this problem efficiently. The proposed technique is very much useful for the optimal route selection for vehicles in metropolitan cities that avoids high traffic density junctions. Once the desired destination is specified, the traffic control system can use this algorithm to provide the least congested routes to the intra-city vehicles.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2019-12-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v9i6.pp4804-4814</dc:identifier><dc:identifier>10.11591/ijece.v9i6.pp4804-4814</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 9 No 6 (2019); 4804</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/14558/13185</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>