Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks

2010 ◽  
Vol 33 (17) ◽  
pp. 2048-2056
Author(s):  
Jia-Ming Liang ◽  
Ho-Cheng Wu ◽  
Jen-Jee Chen ◽  
Yu-Chee Tseng
Keyword(s):  
Mesh Networks ◽  
Slot Scheduling ◽  
Grid Mesh

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

2016 ◽  
Vol 7 (1) ◽  
pp. 85-112 ◽  
Author(s):  
S.P. Shiva Prakash ◽  
T.N. Nagabhushan ◽  
Kirill Krinkin
Keyword(s):  
Mesh Networks ◽  
Cluster Head ◽  
High Energy ◽  
Base Station ◽  
Base Stations ◽  
Cluster Head Selection ◽  
Slot Allocation ◽  
Proposed Model ◽  
Slot Scheduling ◽  
Link Duration

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.

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
Keyword(s):  
Mesh Networks ◽  
Cluster Head ◽  
Base Stations ◽  
Cluster Head Selection ◽  
Slot Allocation ◽  
Energy Aware ◽  
Available Energy ◽  
Proposed Model ◽  
Slot Scheduling ◽  
Link Duration

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.

Proxy-Based IPv6 Neighbor Discovery Scheme for Wireless LAN Based Mesh Networks

2010 ◽  
Vol E93-B (5) ◽  
pp. 1151-1154
Author(s):  
Jihoon LEE ◽  
Seungwoo JEON ◽  
Jaehoon KIM
Keyword(s):  
Wireless Lan ◽  
Mesh Networks ◽  
Neighbor Discovery
Sign in / Sign up

Export Citation Format

Share Document