Congestion Avoidance and Delay Minimization in Energy Aware Routing of Dynamic ieee 802.11s WMN

2020 ◽  
pp. 164-193
Author(s):  
S.P. Shiva Prakash ◽  
T.N. Nagabhushan ◽  
Kirill Krinkin

Minimization of delay in collecting the data at any base stations is one of the major concerns in cluster based Wireless Mesh Networks. several researches have proposed algorithms to control congestion considering static nature of a node. Mobility of a node results in high congestion due to frequent link breakages and high energy consumption due to re-establishment of route during routing process. Hence, the authors consider dynamic nodes with single hop inside the static cluster. The proposed model includes four modules namely, Cluster head selection, slot allocation, slot scheduling and data collection process. the cluster head selection is based on the maximum energy, number of links and link duration. Slot allocation is based on the available energy () and the required energy (). Slot scheduling is carried out based on the link duration. Data at the base station will be collected as they are scheduled. Model is tested using Network Simulator-3 (NS3) and results indicate that the proposed model achieves least delay besides reducing the congestion compared to the existing methods.

Author(s):  
S.P. Shiva Prakash ◽  
T.N. Nagabhushan ◽  
Kirill Krinkin

Minimization of delay in collecting the data at any base stations is one of the major concerns in cluster based Wireless Mesh Networks. several researches have proposed algorithms to control congestion considering static nature of a node. Mobility of a node results in high congestion due to frequent link breakages and high energy consumption due to re-establishment of route during routing process. Hence, the authors consider dynamic nodes with single hop inside the static cluster. The proposed model includes four modules namely, Cluster head selection, slot allocation, slot scheduling and data collection process. the cluster head selection is based on the maximum energy, number of links and link duration. Slot allocation is based on the available energy () and the required energy (). Slot scheduling is carried out based on the link duration. Data at the base station will be collected as they are scheduled. Model is tested using Network Simulator-3 (NS3) and results indicate that the proposed model achieves least delay besides reducing the congestion compared to the existing methods.


2013 ◽  
Vol 392 ◽  
pp. 872-875 ◽  
Author(s):  
Gu Jia ◽  
Yu Wen Wang ◽  
Fan Ji Meng ◽  
Guo Hua Ye ◽  
Guo Lin Wang

The media access control (MAC) protocol based on fixed slot allocation has low throughput and high delay in high load wireless mesh network. In order to improve the performance of wireless mesh network, we propose a scalable adaptive time division multiple access (TDMA) slot allocation algorithm based on the existing fixed TDMA. The algorithm uses the network structure of clustering and builds a more optimized frame structure, cluster head dynamically allocates time slot according to the packet number of the cluster member sent and the priority level, at the same time taking into account the situation of nodes joining and leaving to improve the scalability of the network The simulation results on OPNET network simulation platform show that the algorithm is superior to fixed TDMA algorithm in both throughput and delay.


Sign in / Sign up

Export Citation Format

Share Document