Crowd associated network: Exploiting over a smart garbage management system

Saiful Azad, Arafatur Rahman, A. Taufiq Asyhari, Al Sakib Khan Pathan

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Most existing non-real-time applications utilize infrastructure-based or semi-infrastructure-based network architectures. Such a network architecture demands a considerably high installment and maintenance cost. To alleviate the cost, in this article, we propose an efficient infrastructure-less network architecture named CrAN. In CrAN, a set of crowds play significant roles by completing the communication gaps among various associates in the network; hence the name. We show the usability of this proposed architecture to support non-real-time data transmission over an SGMS, where optimum solutions need to be discovered to minimize the management cost. Due to the complexity of the optimization problem, we approximate these optimum solutions using a GA. In the implementation of the GA, we apply new fitness functions to discover a feasible trade-off between distance and waste volume. We then compare the performance of the proposed fitness functions with that of an existing fitness function. The results favorably suggest the necessity of employing the proposed fitness functions to obtain near-optimum solutions.

Original languageEnglish
Article number7981549
Pages (from-to)186-192
Number of pages7
JournalIEEE Communications Magazine
Volume55
Issue number7
DOIs
Publication statusPublished - 14 Jul 2017
Externally publishedYes

Fingerprint

Network architecture
Costs
Data communication systems
Communication

Keywords

  • Network architecture
  • Maintenance engineering
  • Computer architecture
  • Real-time systems
  • Data communication
  • Genetic algorithms
  • Relays

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Crowd associated network : Exploiting over a smart garbage management system. / Azad, Saiful; Rahman, Arafatur; Taufiq Asyhari, A.; Pathan, Al Sakib Khan.

In: IEEE Communications Magazine, Vol. 55, No. 7, 7981549, 14.07.2017, p. 186-192.

Research output: Contribution to journalArticle

Azad, Saiful ; Rahman, Arafatur ; Taufiq Asyhari, A. ; Pathan, Al Sakib Khan. / Crowd associated network : Exploiting over a smart garbage management system. In: IEEE Communications Magazine. 2017 ; Vol. 55, No. 7. pp. 186-192.
@article{8a17df2eaa9649bbaadbd31b0d639acc,
title = "Crowd associated network: Exploiting over a smart garbage management system",
abstract = "Most existing non-real-time applications utilize infrastructure-based or semi-infrastructure-based network architectures. Such a network architecture demands a considerably high installment and maintenance cost. To alleviate the cost, in this article, we propose an efficient infrastructure-less network architecture named CrAN. In CrAN, a set of crowds play significant roles by completing the communication gaps among various associates in the network; hence the name. We show the usability of this proposed architecture to support non-real-time data transmission over an SGMS, where optimum solutions need to be discovered to minimize the management cost. Due to the complexity of the optimization problem, we approximate these optimum solutions using a GA. In the implementation of the GA, we apply new fitness functions to discover a feasible trade-off between distance and waste volume. We then compare the performance of the proposed fitness functions with that of an existing fitness function. The results favorably suggest the necessity of employing the proposed fitness functions to obtain near-optimum solutions.",
keywords = "Network architecture, Maintenance engineering, Computer architecture, Real-time systems, Data communication, Genetic algorithms, Relays",
author = "Saiful Azad and Arafatur Rahman and {Taufiq Asyhari}, A. and Pathan, {Al Sakib Khan}",
year = "2017",
month = "7",
day = "14",
doi = "10.1109/MCOM.2017.1600379",
language = "English",
volume = "55",
pages = "186--192",
journal = "IEEE Communications Magazine",
issn = "0163-6804",
publisher = "Institute of Electrical and Electronics Engineers",
number = "7",

}

TY - JOUR

T1 - Crowd associated network

T2 - Exploiting over a smart garbage management system

AU - Azad, Saiful

AU - Rahman, Arafatur

AU - Taufiq Asyhari, A.

AU - Pathan, Al Sakib Khan

PY - 2017/7/14

Y1 - 2017/7/14

N2 - Most existing non-real-time applications utilize infrastructure-based or semi-infrastructure-based network architectures. Such a network architecture demands a considerably high installment and maintenance cost. To alleviate the cost, in this article, we propose an efficient infrastructure-less network architecture named CrAN. In CrAN, a set of crowds play significant roles by completing the communication gaps among various associates in the network; hence the name. We show the usability of this proposed architecture to support non-real-time data transmission over an SGMS, where optimum solutions need to be discovered to minimize the management cost. Due to the complexity of the optimization problem, we approximate these optimum solutions using a GA. In the implementation of the GA, we apply new fitness functions to discover a feasible trade-off between distance and waste volume. We then compare the performance of the proposed fitness functions with that of an existing fitness function. The results favorably suggest the necessity of employing the proposed fitness functions to obtain near-optimum solutions.

AB - Most existing non-real-time applications utilize infrastructure-based or semi-infrastructure-based network architectures. Such a network architecture demands a considerably high installment and maintenance cost. To alleviate the cost, in this article, we propose an efficient infrastructure-less network architecture named CrAN. In CrAN, a set of crowds play significant roles by completing the communication gaps among various associates in the network; hence the name. We show the usability of this proposed architecture to support non-real-time data transmission over an SGMS, where optimum solutions need to be discovered to minimize the management cost. Due to the complexity of the optimization problem, we approximate these optimum solutions using a GA. In the implementation of the GA, we apply new fitness functions to discover a feasible trade-off between distance and waste volume. We then compare the performance of the proposed fitness functions with that of an existing fitness function. The results favorably suggest the necessity of employing the proposed fitness functions to obtain near-optimum solutions.

KW - Network architecture

KW - Maintenance engineering

KW - Computer architecture

KW - Real-time systems

KW - Data communication

KW - Genetic algorithms

KW - Relays

UR - http://www.scopus.com/inward/record.url?scp=85028390560&partnerID=8YFLogxK

U2 - 10.1109/MCOM.2017.1600379

DO - 10.1109/MCOM.2017.1600379

M3 - Article

VL - 55

SP - 186

EP - 192

JO - IEEE Communications Magazine

JF - IEEE Communications Magazine

SN - 0163-6804

IS - 7

M1 - 7981549

ER -