Research Article
A Proposed IoT-Enabled Smart Waste Bin Management System and Efficient Route Selection
Algorithm 1
Efficient Route Election procedure (EREP).
| | IDDest = Destination ID | | | LOCdest = Co-ordinates of the NOD | | | IDn,J = ID of the Neighbor Node nj | | | L-QUALi,j = Link Quality between nodes ni and nj | | | PRi,j = Path Reliability from node ni to destination through node nj | | | PDi,j = Path Delay from node ni to destination through node nj | | | LOCn,j = Co-ordinates of the neighbor node nj | | Inputs: Rt and Data Packet P | | (1) | for each data packet DP do | | (2) | for each node ni ∈ RT do | | (3) | if L-QUALi,j > = L-QUAL then | | (4) | store node ni into NNL-QUAL | | (5) | if NNL-QUAL = = NULL then | | (6) | discard DP immediately | | (7) | else if DP ∈ CD | | (8) | call Delay Aware Procedure | | (9) | else DH = nj ∈ NNL-QUAL | | Delay Aware Procedure | | (10) | for each node ni ∈ NNL-QUAL do | | (11) | if PDi,j > = PDreq then | | (12) | store node ni into NNPD | | (13) | if NNPD = = NULL then | | (14) | discard DP immediately | | (15) | else if NNPD = = 1 then | | (16) | DH = nj ∈ NHPD | | (17) | else call Reliability Aware Procedure | | Reliability Aware Procedure | | (18) | for each node ni ∈ NNPD do | | (19) | if PRi,j > = PRreq then | | (20) | store node ni into NNPR | | (21) | if NNPR = = NULL then | | (22) | DH = nj ∈ NNPD with highest PRi,j | | (23) | else if NNPR = = 1 then | | (24) | DH = nj ∈ NHPR | | (25) | else DH = nj ∈ NNPR |
|