scholarly journals A Proposed IoT-Enabled Smart Waste Bin Management System and Efficient Route Selection

2019 ◽  
Vol 2019 ◽  
pp. 1-9 ◽  
Author(s):  
Asim Zeb ◽  
Qurban Ali ◽  
Muhammad Qaiser Saleem ◽  
Khalid Mahmood Awan ◽  
Ali Saeed Alowayr ◽  
...  
Keyword(s):  
Waste Management ◽  
Promising Result ◽  
Smart Cities ◽  
Data Communication ◽  
Destination Node ◽  
Interference Level ◽  
End To End Delay ◽  
Efficient Route ◽  
Important Quality ◽  
End To End

Internet of Things (IoT) is an emerging technology that offers promising solutions to modernize the traditional systems. It accords promising result in crystallizing smart cities, smart homes, smart industries, and smart environment. This article presents the smart waste management architecture for smart cities and efficient routing technique considering least delay for the architecture. In wireless sensor networks, end-to-end delay is one of the important Quality of Services (QoS) parameter to overcome delay in data communication. In this article, we consider end-to-end delay minimization in smart waste management application. The term “end-to-end delay” is defined as the total time taken by a single packet to reach the destination node. The proposed scheme considers the interference level, the length of the routing path, and the number of hops along the path. The simulation results show that the proposed scheme outperforms current schemes.

scholarly journals Analisis Optimasi Kinerja Protokol Routing AODV dan AOMDV dengan Menggunakan Metode RFAP untuk Mencegah RREQ Flooding Attacks pada Jaringan MANET

2019 ◽  
Vol 1 (1) ◽  
pp. 9-18
Author(s):  
Andy Hidayat Jatmika ◽  
I Made Windra Yudistiana ◽  
Ariyan Zubaidi
Keyword(s):  
Destination Node ◽  
Malicious Nodes ◽  
End To End Delay ◽  
Flooding Attacks ◽  
End To End ◽  
Prevention Method ◽  
Prevention Methods ◽  
Bandwidth Capacity ◽  
Route Request ◽  
Better Than

One sector that greatly influences it is in terms of network security. This is due to the characteristics of the MANET network that are dynamic so that the MANET network is very easily disturbed by irresponsible parties. One of the attacks that can occur in MANET network is Route Request (RREQ) Flooding Attacks. In RREQ flooding attacks in the form of fake nodes that are outside the area of the network and broadcast RREQ to the destination node in the network, so that it meets the bandwidth capacity which results in a decrease in quality in determining the route of sending data or information to the destination node. To prevent the occurrence of RREQ flooding attacks, a prevention method for these attacks is required, namely the RREQ Flooding Attacks Prevention (RFAP). This method works by finding nodes that are likely to be malicious nodes then isolated from the network to be restored to normal nodes. This research will optimize the AODV and AOMDV routing protocols by adding RFAP prevention methods and knowing the performance of the two protocols in terms of throughput, average end-to-end delay and normalized routing load. Based on the results of the simulation, that the application of the method RFAP on AODV routing protocol can produce network quality is better than AOMDV protocol, both in terms of throughput, average end-to-end delay and normalized routing load.

scholarly journals Delay Tolerant Cluster Based Routing For Wireless Sensor Networks

2011 ◽  
pp. 47-50
Author(s):  
N Saranya ◽  
Mr. S.V. Manisekaran
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Dynamic Network ◽  
Wireless Sensor ◽  
Destination Node ◽  
End To End Delay ◽  
End To End ◽  
Cluster Based Routing ◽  
Transmission Overhead

In a dynamic Wireless Sensor Network (WSN) the movement of each sensor node affects the structure of network which may result in inefficient routing. Various difficulties in a dynamic network may include lack of communication between the nodes, end to end delay and transmission overhead. Transmitting data in a dynamic network to the destination node with less delay is the major problem to be addressed. Sensed data can be transmitted using flooding scheme, where the end to end delay can be minimized but results in transmission overhead. In this scheme sensed data is broadcasted to all the nearby nodes until it reaches the sink node. The proposed system make use of cluster based routing protocol, where the sensor nodes with similar mobility pattern are grouped into cluster. Exponentially weighted moving average (EWMA) scheme is used for updating the nodal contact probability of each cluster node. Two Gateway nodes are selected for routing which performs data transmission. The simulation result shows that cluster based routing protocol implemented for a dynamic wireless sensor network result in less end to end delay.

scholarly journals Void Hole Avoidance for Reliable Data Delivery in IoT Enabled Underwater Wireless Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3271 ◽  
Author(s):  
Arshad Sher ◽  
Aasma Khan ◽  
Nadeem Javaid ◽  
Syed Ahmed ◽  
Mohammed Aalsalem ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Destination Node ◽  
Transmission Range ◽  
Delivery Ratio ◽  
Underwater Wireless Sensor Networks ◽  
End To End Delay ◽  
End To End

Due to the limited availability of battery power of the acoustic node, an efficient utilization is desired. Additionally, the aquatic environment is harsh; therefore, the battery cannot be replaced, which leaves the network prone to sudden failures. Thus, an efficient node battery dissipation is required to prolong the network lifespan and optimize the available resources. In this paper, we propose four schemes: Adaptive transmission range in WDFAD-Depth-Based Routing (DBR) (A-DBR), Cluster-based WDFAD-DBR (C-DBR), Backward transmission-based WDFAD-DBR (B-DBR) and Collision Avoidance-based WDFAD-DBR (CA-DBR) for Internet of Things-enabled Underwater Wireless Sensor Networks (IoT, UWSNs). A-DBR adaptively adjusts its transmission range to avoid the void node for forwarding data packets at the sink, while C-DBR minimizes end-to-end delay along with energy consumption by making small clusters of nodes gather data. In continuous transmission range adjustment, energy consumption increases exponentially; thus, in B-DBR, a fall back recovery mechanism is used to find an alternative route to deliver the data packet at the destination node with minimal energy dissipation; whereas, CA-DBR uses a fall back mechanism along with the selection of the potential node that has the minimum number of neighbors to minimize collision on the acoustic channel. Simulation results show that our schemes outperform the baseline solution in terms of average packet delivery ratio, energy tax, end-to-end delay and accumulated propagation distance.

scholarly journals Efficient QoS Routing in Manet using Quantum

2019 ◽  
Vol 8 (4) ◽  
pp. 5803-5807
Keyword(s):  
Real Time ◽  
Ad Hoc ◽  
Qos Routing ◽  
Destination Node ◽  
Hop Count ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
End To End ◽  
Hoc Networks ◽  
Feasible Path

In mobile ad hoc networks, there is always a requirement of transferring real time multimedia information between a source-destination pair through a communication network. To support these communications and emergence of real-time applications, the basic requirement is to determine a feasible path which can join the source node and the destination node with a minimal cost .The paths are subjected to some constraints such as bandwidth, end-to-end delay, jitter and hop count. So, in order to assure an efficient performance, these QoS routing constraints must be properly handled. Therefore, complication of the problem is considered and accessible solution is provided using meta-heuristic algorithm rather than any other methods. To resolve the multi-constrained QoS routing problem in Mobile Ad-hoc Networks (MANETs), an intelligent algorithm has been proposed here to find the feasible path. This paper proposes a QPSO algorithm for solving multimedia routing which is capable of finding the low-cost route with bandwidth, delay and hop count as the constraints. In the proposed algorithm, the feasible path from the source node to the destination node is selected for communication which satisfies the minimum required bandwidth, less end-to-end delay and minimum hop count. The simulation results illustrate that the proposed QPSO algorithm with a novel node selection technique is able to find a better optimal path with multiple QoS constrains such as Bandwidth, hop count and network delay (end-to-end delay). It can meet the real-time requirements in multimedia communication networks.

PRODUCTION AND USE OF SOLID RECOVERED FUEL FOR A RESILIENT SOLID WASTE MANAGEMENT IN SMART CITIES-EU APPROACH

2019 ◽  
Vol 7 (3) ◽  
pp. 1
Author(s):  
FULLER AARON ◽  
MILLER EVA ◽  
MAIER JÖRG ◽  
GLORIUS THOMAS ◽  
SCHEFFKNECHT GÜNTER ◽  
...  
Keyword(s):  
Waste Management ◽  
Solid Waste ◽  
Solid Waste Management ◽  
Smart Cities

Catechize Global Optimization through Leading Edge Firefly Based Zone Routing Protocol

2020 ◽  
Vol 13 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Neha Sharma ◽  
Sherin Zafar ◽  
Usha Batra
Keyword(s):  
Global Optimization ◽  
Routing Protocol ◽  
Firefly Algorithm ◽  
Leading Edge ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Zone Routing Protocol ◽  
End To End Delay ◽  
End To End

Background: Zone Routing Protocol is evolving as an efficient hybrid routing protocol with an extremely high potentiality owing to the integration of two radically different schemes, proactive and reactive in such a way that a balance between control overhead and latency is achieved. Its performance is impacted by various network conditions such as zone radius, network size, mobility, etc. Objective: The research work described in this paper focuses on improving the performance of zone routing protocol by reducing the amount of reactive traffic which is primarily responsible for degraded network performance in case of large networks. The usage of route aggregation approach helps in reducing the routing overhead and also help achieve performance optimization. Methods: The performance of proposed protocol is assessed under varying node size and mobility. Further applied is the firefly algorithm which aims to achieve global optimization that is quite difficult to achieve due to non-linearity of functions and multimodality of algorithms. For performance evaluation a set of benchmark functions are being adopted like, packet delivery ratio and end-to-end delay to validate the proposed approach. Results: Simulation results depict better performance of leading edge firefly algorithm when compared to zone routing protocol and route aggregation based zone routing protocol. The proposed leading edge FRA-ZRP approach shows major improvement between ZRP and FRA-ZRP in Packet Delivery Ratio. FRA-ZRP outperforms traditional ZRP and RA-ZRP even in terms of End to End Delay by reducing the delay and gaining a substantial QOS improvement. Conclusion: The achievement of proposed approach can be credited to the formation on zone head and attainment of route from the head hence reduced queuing of data packets due to control packets, by adopting FRA-ZRP approach. The routing optimized zone routing protocol using Route aggregation approach and FRA augments the QoS, which is the most crucial parameter for routing performance enhancement of MANET.

Security based on Received Signal Strength in Localization for Underwater Sensor Networks

2016 ◽  
Vol 1 (2) ◽  
pp. 1-7
Author(s):  
Karamjeet Kaur ◽  
Gianetan Singh Sekhon
Keyword(s):  
Sensor Networks ◽  
Threshold Value ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Underwater Sensor Networks ◽  
Research Subjects ◽  
Malicious Nodes ◽  
Intermediate Node ◽  
End To End Delay ◽  
End To End

Underwater sensor networks are envisioned to enable a broad category of underwater applications such as pollution tracking, offshore exploration, and oil spilling. Such applications require precise location information as otherwise the sensed data might be meaningless. On the other hand, security critical issue as underwater sensor networks are typically deployed in harsh environments. Localization is one of the latest research subjects in UWSNs since many useful applying UWSNs, e.g., event detecting. Now day’s large number of localization methods arrived for UWSNs. However, few of them take place stability or security criteria. In purposed work taking up localization in underwater such that various wireless sensor nodes get localize to each other. RSS based localization technique used remove malicious nodes from the communication intermediate node list based on RSS threshold value. Purposed algorithm improves more throughput and less end to end delay without degrading energy dissipation at each node. The simulation is conducted in MATLAB and it suggests optimal result as comparison of end to end delay with and without malicious node.

Sign in / Sign up

Export Citation Format

Share Document