Performance Analysis of Dijkstra-Based Weighted Sum Minimization Routing Algorithm for Wireless Mesh Networks

Alwan, Nuha A. S.

doi:10.1155/2014/658408

Cited by 10 publications

(5 citation statements)

References 12 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our proposed scheme takes both the node’s residual energy and communication cost within the cluster into account for selecting a node to be a CH. During this phase, a standard weight function: Cstd_w is calculated for each cluster using Equation (11) [17]:Cs td_w=α·Estd+β·avgfalse(dn−Cfalse)bold where Estd is the standard energy of a node that can participate in the CH selection process described in Section 3.2, avgfalse(dn−Cfalse) represents the average distance of all the CMs to the selected cluster center in the previous round, and α and β are algorithmic parameters ranging from (0,1), and these parameters should be balanced such that α+β=1.…”

Section: Proposed Fuzzy Logic Dijkstra-based Routing Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Fuzzy-Logic Dijkstra-Based Energy-Efficient Algorithm for Data Transmission in WSNs

Razzaq

Shin

2019

Sensors

View full text Add to dashboard Cite

In wireless sensor networks, clustering routing algorithms have been widely used owing to their high energy-efficiency and scalability. In clustering schemes, the nodes are organized in the form of clusters, and each cluster is governed by a cluster head. Once the cluster heads are selected, they form a backbone network to periodically collect, aggregate, and forward data to the base station using minimum energy (cost) routing. This approach significantly improves the network lifetime. Therefore, a new cluster head selection method that uses a weighted sum method to calculate the weight of each node in the cluster and compare it with the standard weight of that particular cluster is proposed in this paper. The node with a weight closest to the standard cluster weight becomes the cluster head. This technique balances the load distribution and selects the nodes with highest residual energy in the network. Additionally, a data routing scheme is proposed to determine an energy-efficient path from the source to the destination node. This algorithm assigns a weight function to each link on the basis of a fuzzy membership function and intra-cluster communication cost within a cluster. As a result, a minimum weight path is selected using Dijkstra’s algorithm that improves the energy efficiency of the overall system. The experimental results show that the proposed algorithm shows better performance than some existing representative methods in the aspects of energy consumption, network lifetime, and system throughput.

show abstract

Section: Proposed Fuzzy Logic Dijkstra-based Routing Algorithmmentioning

confidence: 99%

“…Furthermore, a Dijkstra-based weighted sum minimization (DWSM) algorithm is proposed in Ref. [ 17 ] for wireless mesh networks (WMNs). It introduces a multi-objective function as the link cost between the nodes, which is influenced by the network parameters such as end-to-end delay and path capacity.…”

Section: Related Workmentioning

confidence: 99%

Fuzzy-Logic Dijkstra-Based Energy-Efficient Algorithm for Data Transmission in WSNs

Razzaq

Shin

2019

Sensors

View full text Add to dashboard Cite

show abstract

“…Alwan and Nuha [27] conducted an analysis and employed a multi-objective optimization method to perform the WMN routing using Dijkstra's algorithm and the weighted sum of the objectives (delay and link capacity) to determine the WMN routes. The demonstrated method only applies to objectives with linear behavior, and restricts the use of other metrics to determine the routes.…”

Section: Related Workmentioning

confidence: 99%

Multi-objective routing aware of mixed IoT traffic for low-cost wireless Backhauls

Medeiros¹,

Silvestre²,

Borges³

2019

J Internet Serv Appl

View full text Add to dashboard Cite

The futuristic wireless networks expects to provide adequate support for distinct kind of applications, their diverse requirements, and scenarios for future Internet systems, such as Internet of Things based on multimedia and sensor data, while figuring out low cost solutions to offload the mobile communication core. In this context, Low-cost Wireless Backhauls (LWBs) can be useful, since they are based on cheap WLAN technologies, such as Wireless Mesh Networks that provide capacity for future IoT applications based on mixed traffic. The routing is a fundamental process to provide communication in these multi-hop networks and multi-objective routing optimization algorithms based on Integer Linear Programming (ILP) models have been studied in the literature to address this problem, but there is a lack of solutions for mixed traffic. For this reason, we propose a novel ILP multi-objective approach, called Multi-objective routing Aware of miXed traffIc (MAXI), which employs three weighted objectives to guide the routing in WMNs with different applications and requirements. In addition, we provide a comparative analysis with other relevant approaches of routing using NS-3 to evaluation based on simulation, that takes into account different types and levels of interference (e.g. co-channel interference and external interference) focused on mixed IoT traffic for elderly healthcare scenario. Finally, we demonstrate the effectiveness of the proposed approach to support the requirements of each application through the appropriate combination of objective functions, mainly in dense scenarios with high level of interference.

show abstract

Section: Assessment Of Congestion Possibility Using Ahp-gis Weighted ...mentioning

confidence: 99%

“…Weighted Sum Method (Zhao et al, 2007;Alwan, 2014) is the most common approach exists for multiobjective optimization. It is generally used for finding solutions on the entire Pareto-Optimal set (Alwan, 2014) for convex problems (Alwan, 2014). The present investigation consists of a traffic data set which is convex and satisfies Pareto-Optimality criteria and therefore, makes it a suitable test data set for application of Weighted Sum Method (Alwan, 2014):…”

Section: Assessment Of Congestion Possibility Using Ahp-gis Weighted ...mentioning

confidence: 99%

Application of AHP-GIS Technology to Assess Congestion Vulnerability, a Case Study of Ranchi City, India

Mukherjee

Krishna

Patel

2017

International Journal of Applied Geospatial Research

View full text Add to dashboard Cite

Urban traffic congestion is a multi-dimensional phenomenon and therefore, is sensitive to certain influencing factors behaving in a random manner. Consequently, the possibility of a route characterized by smooth flow of traffic becoming congested cannot be ruled out. The present research investigation attempts to categorize different routes of the study area in terms of their degree of congestion vulnerability. Average Speed (AS), Delay Ratio of Average Speed (DRAS), Stopped Time (ST), Stopped Time Gradient (STG), and Absolute Deviation in Congestion Index Value (ADCIV) were identified as the potential influencing factors. The AHP was employed to rank the importance of the aforementioned influencing factors in triggering congestion that can sometimes lead to traffic deadlock. On the other hand, the GIS Weighted Sum Overlay technique was employed to determine the integrated impact of the influencing factors on the behavior of traffic flow. The results showed close agreement with the real scenario of the traffic congestion observed in the field.

show abstract

Performance Analysis of Dijkstra-Based Weighted Sum Minimization Routing Algorithm for Wireless Mesh Networks

Cited by 10 publications

References 12 publications

Fuzzy-Logic Dijkstra-Based Energy-Efficient Algorithm for Data Transmission in WSNs

Fuzzy-Logic Dijkstra-Based Energy-Efficient Algorithm for Data Transmission in WSNs

Multi-objective routing aware of mixed IoT traffic for low-cost wireless Backhauls

Application of AHP-GIS Technology to Assess Congestion Vulnerability, a Case Study of Ranchi City, India

Contact Info

Product

Resources

About