Selective Iterative Multilateration for Hop Count-Based Localization in Wireless Sensor Networks

2006 ◽  
Author(s):  
J.H.S. Tay ◽  
V.R. Chandrasekhar ◽  
W.K.G. Seah
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Hop Count

scholarly journals Congestion Control and Prediction Schemes Using Fuzzy Logic System with Adaptive Membership Function in Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-19 ◽  
Author(s):  
Phet Aimtongkham ◽  
Tri Gia Nguyen ◽  
Chakchai So-In
Keyword(s):  
Wireless Sensor Networks ◽  
Fuzzy Logic ◽  
Sensor Networks ◽  
Packet Loss ◽  
Superior Performance ◽  
Wireless Sensor ◽  
Volume Data ◽  
Energy Aware ◽  
Fuzzy Logic Systems ◽  
Hop Count

Network congestion is a key challenge in resource-constrained networks, particularly those with limited bandwidth to accommodate high-volume data transmission, which causes unfavorable quality of service, including effects such as packet loss and low throughput. This challenge is crucial in wireless sensor networks (WSNs) with restrictions and constraints, including limited computing power, memory, and transmission due to self-contained batteries, which limit sensor node lifetime. Determining a path to avoid congested routes can prolong the network. Thus, we present a path determination architecture for WSNs that takes congestion into account. The architecture is divided into 3 stages, excluding the final criteria for path determination: (1) initial path construction in a top-down hierarchical structure, (2) path derivation with energy-aware assisted routing, and (3) congestion prediction using exponential smoothing. With several factors, such as hop count, remaining energy, buffer occupancy, and forwarding rate, we apply fuzzy logic systems to determine proper weights among those factors in addition to optimizing the weight over the membership functions using a bat algorithm. The simulation results indicate the superior performance of the proposed method in terms of high throughput, low packet loss, balancing the overall energy consumption, and prolonging the network lifetime compared to state-of-the-art protocols.

scholarly journals An Integrated Routing Mechanism on Homogenous Wireless Sensor Networks using Genetic Algorithm

2021 ◽  
Author(s):  
Ramin Danehchin
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Hop Count ◽  
Routing Problem ◽  
Cluster Heads

Abstract Data collection on Wireless Sensor Networks (WSNs) is a significant challenge to satisfy the requirements of various applications. Providing an energy-efficient routing technique is the primary step in data collection over WSNs. The existing data collection techniques in the WSNs field struggle with the imbalance load distribution and the short lifetime of the network. This paper proposes a novel mechanism to select cluster-heads, cluster the wireless sensor nodes, and determine the optimal route from source nodes to the sink. We employ the genetic algorithm to solve the routing problem considering the hop-count of the cluster-heads to the sink, the number of each cluster member, residual energy of cluster-heads, and the number of cluster-heads connected to the sink as the fitness criteria. Our proposed mechanism uses a greedy approach to calculate the hop-count of each cluster-head to the sink for integrating the clustering and routing process on WSNs. The simulation results demonstrate that our proposed mechanism improves the energy consumption, the number of live nodes, and the lifetime of the network compared to other data collection approaches on WSNs.

scholarly journals Performance Evaluation of Hop-Based Range-Free Localization Methods in Wireless Sensor Networks

2011 ◽  
Vol 2011 ◽  
pp. 1-6 ◽  
Author(s):  
M. Keshtgary ◽  
M. Fasihy ◽  
Z. Ronaghi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Hop Count ◽  
Localization Accuracy ◽  
Energy Consuming ◽  
Network Overhead ◽  
Entire Network ◽  
Evaluation Parameters ◽  
Range Free

Knowledge of nodes' locations is an important requirement for many applications in Wireless Sensor Networks. In the hop-based range-free localization methods, anchors broadcast the localization messages including a hop count value to the entire network. Each node receives this message and calculates its own distance with anchor in hops and then approximates its own location. In this paper, we review range-free localization methods and evaluate the performance of two methods: “DV-hop” and “amorphous” by simulation. We consider some parameters like localization accuracy, energy consumption, and network overhead. Recent papers that evaluate localization methods mostly concentrated on localization accuracy. But we have considered a group of evaluation parameters, energy consuming, and network overhead in addition to the location accuracy.

scholarly journals Developing of Bluetooth mesh flooding between source-destination linking of nodes in wireless sensor networks

2021 ◽  
Vol 6 (9 (114)) ◽  
pp. 6-14
Author(s):  
Shaymaa Kadhim Mohsin ◽  
Maysoon A. Mohammed ◽  
Helaa Mohammed Yassien
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Packet Delivery Ratio ◽  
Mesh Network ◽  
Wireless Sensor ◽  
Destination Node ◽  
Delivery Ratio ◽  
Area Network ◽  
Hop Count ◽  
Packet Delivery

Bluetooth uses 2.4 GHz in ISM (industrial, scientific, and medical) band, which it shares with other wireless operating system technologies like ZigBee and WLAN. The Bluetooth core design comprises a low-energy version of a low-rate wireless personal area network and supports point-to-point or point-to-multipoint connections. The aim of the study is to develop a Bluetooth mesh flooding and to estimate packet delivery ratio in wireless sensor networks to model asynchronous transmissions including a visual representation of a mesh network, node-related statistics, and a packet delivery ratio (PDR). This work provides a platform for Bluetooth networking by analyzing the flooding of the network layers and configuring the architecture of a multi-node Bluetooth mesh. Five simulation scenarios have been presented to evaluate the network flooding performance. These scenarios have been performed over an area of 200×200 meters including 81 randomly distributed nodes including different Relay/End node configurations and source-destination linking between nodes. The results indicate that the proposed approach can create a pathway between the source node and destination node within a mesh network of randomly distributed End and Relay nodes using MATLAB environment. The results include probability calculation of getting a linking between two nodes based on Monte Carlo method, which was 88.7428 %, while the Average-hop-count linking between these nodes was 8. Based on the conducted survey, this is the first study to examine and demonstrate Bluetooth mesh flooding and estimate packet delivery ratio in wireless sensor networks

scholarly journals Improving the Quality of Service and Privacy by Integrating Dijkstra‟s, SafeQ and Extended Watchdog Algorithm in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 5409-5414
Keyword(s):  
Wireless Sensor Networks ◽  
Quality Of Service ◽  
Sensor Networks ◽  
Shortest Path ◽  
Clustering Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Destination Node ◽  
Hop Count

The fundamental issue is framing the sensor nodes and steering the information from sender node to receiver node in wireless sensor networks (WSN). To resolve this major difficulty, clustering algorithm is one of the accessible methods employed in wireless sensor networks. Still, clustering concept also faces some hurdles while transmitting the data from source to destination node. The sensor node is used to sense the data and the source node helps to convey the information and the intended recipient receives the sensed information. The clustering proposal will choose the cluster head depending on the residual energy and the sensor utility to its cluster members. The cluster heads will have equal cluster number of nodes. The complexity is generated in computing the shortest path and this can be optimized by Dijkstra’s algorithm. The optimization is executed by Dijkstra’s shortest path algorithm that eliminates the delay in packet delivery, energy consumption, lifetime of the packet and hop count while handling the difficulties. The shortest path calculation will improve the quality of service (QoS). QoS is the crucial problem due to loss of energy and resource computation as well as the privacy in wireless sensor networks. The security can be improvised in this projected work. The preventive metrics are discussed to upgrade the QoS facility by civilizing the privacy parameter called as Safe and Efficient Query Processing (SAFEQ) and integrating the extended watchdog algorithm in wireless sensor networks.

scholarly journals A Method for Energy Balance and Data Transmission Optimal Routing in Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (13) ◽  
pp. 3017 ◽  
Author(s):  
Xuesong Liu ◽  
Jie Wu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Energy Distribution ◽  
Data Transmission ◽  
Line Length ◽  
Wireless Sensor ◽  
Hop Count ◽  
Transmission Distance

Wireless sensor networks are widely used in many fields. Nodes in the network are typically powered by batteries. Because the energy consumption of wireless communication is related to the transmission distance, the energy consumption of nodes in different locations is different, resulting in uneven energy distribution of nodes. In some special applications, all nodes are required to work at the same time, and the uneven energy distribution makes the effective working time of the system subject to the node with the largest energy consumption. The commonly used clustering protocol can play a role in balancing energy consumption, but it does not achieve optimal energy consumption. This paper proposes to use the power supply line to connect the nodes to fully balance the energy. The connection scheme with the shortest power line length is also proposed. On the basis of energy balance, the method of transmitting data with the best hop count is proposed, which fully reduces the power consumption of the data transmission. The simulation results show that the proposed method can effectively reduce the energy consumption and prolong the lifetime of wireless sensor networks.

Refining hop-count for localisation in wireless sensor networks

2012 ◽  
Vol 12 (4) ◽  
pp. 232 ◽  
Author(s):  
Xiaojun Zhu ◽  
Xiaobing Wu ◽  
Guihai Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Hop Count

Hop-Count Monitoring: Detecting Sinkhole Attacks in Wireless Sensor Networks

2007 ◽  
Author(s):  
Daniel Dallas ◽  
Christopher Leckie ◽  
Kotagiri Ramamohanarao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Hop Count
Sign in / Sign up

Export Citation Format

Share Document