Crowd Associated Network: Exploiting over a Smart Garbage Management System

Crowd Associated Network: Exploiting over a Smart Garbage Management System

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 netw...

Full description

Bibliographic Details
Main Authors: Azad, Saiful, Rahman, Md. Arafatur, Asyhari, A. Taufiq, Pathan, Al-Sakib Khan
Format: Article
Language:English
English
Published: IEEE Communications Society 2017
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://umpir.ump.edu.my/id/eprint/18246/
http://umpir.ump.edu.my/id/eprint/18246/
http://umpir.ump.edu.my/id/eprint/18246/
http://umpir.ump.edu.my/id/eprint/18246/1/07981549.pdf
http://umpir.ump.edu.my/id/eprint/18246/7/fskkp-2017-saiful-Crowd%20Associated%20Network1.pdf
id ump-18246
recordtype eprints
spelling ump-182462018-01-23T02:31:48Z http://umpir.ump.edu.my/id/eprint/18246/ Crowd Associated Network: Exploiting over a Smart Garbage Management System Azad, Saiful Rahman, Md. Arafatur Asyhari, A. Taufiq Pathan, Al-Sakib Khan QA75 Electronic computers. Computer science 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. IEEE Communications Society 2017-07-21 Article PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/18246/1/07981549.pdf application/pdf en http://umpir.ump.edu.my/id/eprint/18246/7/fskkp-2017-saiful-Crowd%20Associated%20Network1.pdf Azad, Saiful and Rahman, Md. Arafatur and Asyhari, A. Taufiq and Pathan, Al-Sakib Khan (2017) Crowd Associated Network: Exploiting over a Smart Garbage Management System. IEEE Communications Magazine, 55 (7). pp. 186-192. ISSN 0163-6804 https://doi.org/10.1109/MCOM.2017.1600379 DOI: 10.1109/MCOM.2017.1600379
repository_type Digital Repository
institution_category Local University
institution Universiti Malaysia Pahang
building UMP Institutional Repository
collection Online Access
language English
English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Azad, Saiful
Rahman, Md. Arafatur
Asyhari, A. Taufiq
Pathan, Al-Sakib Khan
Crowd Associated Network: Exploiting over a Smart Garbage Management System
description 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.
format Article
author Azad, Saiful
Rahman, Md. Arafatur
Asyhari, A. Taufiq
Pathan, Al-Sakib Khan
author_facet Azad, Saiful
Rahman, Md. Arafatur
Asyhari, A. Taufiq
Pathan, Al-Sakib Khan
author_sort Azad, Saiful
title Crowd Associated Network: Exploiting over a Smart Garbage Management System
title_short Crowd Associated Network: Exploiting over a Smart Garbage Management System
title_full Crowd Associated Network: Exploiting over a Smart Garbage Management System
title_fullStr Crowd Associated Network: Exploiting over a Smart Garbage Management System
title_full_unstemmed Crowd Associated Network: Exploiting over a Smart Garbage Management System
title_sort crowd associated network: exploiting over a smart garbage management system
publisher IEEE Communications Society
publishDate 2017
url http://umpir.ump.edu.my/id/eprint/18246/
http://umpir.ump.edu.my/id/eprint/18246/
http://umpir.ump.edu.my/id/eprint/18246/
http://umpir.ump.edu.my/id/eprint/18246/1/07981549.pdf
http://umpir.ump.edu.my/id/eprint/18246/7/fskkp-2017-saiful-Crowd%20Associated%20Network1.pdf
first_indexed 2023-09-18T22:25:44Z
last_indexed 2023-09-18T22:25:44Z
_version_ 1777415953660772352

Similar Items