期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Ultra Reliable Load-Aware Connection Management(LACM)Algorithm in WIA-FA Systems
1
作者 Liu Gang Jiang Chunhao +3 位作者 Ren Xiaochun Fan Pingzhi Liang Chengchao Ma Zheng 《China Communications》 SCIE CSCD 2024年第8期142-161,共20页
The increasing demand for industrial automation and intelligence has put forward higher requirements for the reliability of industrial wireless communication technology.As an international standard based on 802.11,Wir... The increasing demand for industrial automation and intelligence has put forward higher requirements for the reliability of industrial wireless communication technology.As an international standard based on 802.11,Wireless networks for Industrial Automation-Factory Automation(WIA-FA)greatly improves the reliability in factory automation scenarios by Time Division Multiple Access(TDMA).However,in ultra-dense WIA-FA networks with mobile users,the basic connection management mechanism is inefficient.Most of the handover and resource management algorithms are all based on frequency division multiplexing,not suitable for the TDMA in the WIA-FA network.Therefore,we propose Load-aware Connection Management(LACM)algorithm to adjust the linkage and balance the load of access devices to avoid blocking and improve the reliability of the system.And then we simulate the algorithm to find the optimal settings of the parameters.After comparing with other existing algorithms,the result of the simulation proves that LACM is more efficient in reliability and maintains high reliability of more than 99.8%even in the ultra-dense moving scenario with 1500 field devices.Besides,this algorithm ensures that only a few signaling exchanges are required to ensure load bal-ancing,which is no more than 5 times,and less than half of the best state-of-the-art algorithm. 展开更多
关键词 connection management load-aware multi-connectivity reliability RETRANSMISSION WIAFA
在线阅读 下载PDF
Load-Aware Offloading Strategy in Two-Tier Heterogeneous Network 被引量:5
2
作者 Jianyuan Feng Zhiyong Feng Zhiqing Wei 《China Communications》 SCIE CSCD 2016年第8期148-158,共11页
Although small cell offloading technology can alleviate the congestion in macrocell, aggressively offloading data traffic from macrocell to small cell can also degrade the performance of small cell due to the heavy lo... Although small cell offloading technology can alleviate the congestion in macrocell, aggressively offloading data traffic from macrocell to small cell can also degrade the performance of small cell due to the heavy load. Because of collision and backoff, the degradation is significant especially in network with contention-based channel access, and finally decreases throughput of the whole network. To find an optimal fraction of traffic to be offloaded in heterogeneous network, we combine Markov chain with the Poisson point process model to analyze contention-based throughput in irregularly deployment networks. Then we derive the close-form solution of the throughput and find that it is a function of the transmit power and density of base stations.Based on this, we propose the load-aware offloading strategies via power control and base station density adjustment. The numerical results verify our analysis and show a great performance gain compared with non-load-aware offloading. 展开更多
关键词 heterogeneous networks offloading strategies load-aware Poisson point process Markov chain throughput maximization CSMA
在线阅读 下载PDF
Partially Overlapped Channels- and Flow-Based End-to-End Channel Assignment for Multi-Radio Multi-Channel Wireless Mesh Networks 被引量:3
3
作者 WANG Jihong SHI Wenxiao 《China Communications》 SCIE CSCD 2016年第4期1-13,共13页
Capacity reduction is a major problem faced by wireless mesh networks. An efficient way to alleviate this problem is proper channel assignment. Current end-toend channel assignment schemes usually focus on the case wh... Capacity reduction is a major problem faced by wireless mesh networks. An efficient way to alleviate this problem is proper channel assignment. Current end-toend channel assignment schemes usually focus on the case where channels in distinct frequency bands are assigned to mesh access and backbone, but actually backbone network and access network can use the same IEEE 802.11 technology. Besides, these channel assignment schemes only utilize orthogonal channels to perform channel assignment, and the resulting network interference dramatically degrades network performance. Moreover, Internet-oriented traffic is considered only, and peerto-peer traffic is omitted, or vice versa. The traffic type does not match the practical network. In this paper, we explore how to exploit partially overlapped channels to perform endto-end channel assignment in order to achieve effective end-to-end flow transmissions. The proposed flow-based end-to-end channel assignment schemes can conquer the limitations aforementioned. Simulations reveal that loadaware channel assignment can be applied to networks with stable traffic load, and it can achieve near-optimal performance; Traffic-irrelevant channel assignment is suitable for networks with frequent change of traffic load,and it can achieve good balance between performance and overhead. Also, partially overlapped channels' capability of improving network performance is situation-dependent, they should be used carefully. 展开更多
关键词 channel assignment: end-to-end partially overlapped channels load-aware traffic-irrelevant
在线阅读 下载PDF
Opportunistic Routing with Multi-Channel Cooperative Neighbour Discovery
4
作者 S.Sathish Kumar G.Ravi 《Intelligent Automation & Soft Computing》 SCIE 2023年第2期2367-2382,共16页
Due to the scattered nature of the network,data transmission in a dis-tributed Mobile Ad-hoc Network(MANET)consumes more energy resources(ER)than in a centralized network,resulting in a shorter network lifespan(NL).As... Due to the scattered nature of the network,data transmission in a dis-tributed Mobile Ad-hoc Network(MANET)consumes more energy resources(ER)than in a centralized network,resulting in a shorter network lifespan(NL).As a result,we build an Enhanced Opportunistic Routing(EORP)protocol architecture in order to address the issues raised before.This proposed routing protocol goal is to manage the routing cost by employing power,load,and delay to manage the routing energy consumption based on theflooding of control pack-ets from the target node.According to the goal of the proposed protocol techni-que,it is possible to manage the routing cost by applying power,load,and delay.The proposed technique also manage the routing energy consumption based on theflooding of control packets from the destination node in order to reduce the routing cost.Control packet exchange between the target and all the nodes,on the other hand,is capable of having an influence on the overall efficiency of the system.The EORP protocol and the Multi-channel Cooperative Neighbour Discovery(MCCND)protocol have been designed to detect the cooperative adja-cent nodes for each node in the routing route as part of the routing path discovery process,which occurs during control packet transmission.While control packet transmission is taking place during the routing path discovery process,the EORP protocol and the Multi-channel Cooperative Neighbour Discovery(MCCND)protocol have been designed to detect the cooperative adjacent nodes for each node in the routing.Also included is a simulation of these protocols in order to evaluate their performance across a wide range of packet speeds using Constant Bit Rate(CBR).When the packet rate of the CBR is 20 packets per second,the results reveal that the EORP-MCCND is 0.6 s quicker than the state-of-the-art protocols,according to thefindings.Assuming that the CBR packet rate is 20 packets per second,the EORP-MCCND achieves 0.6 s of End 2 End Delay,0.05 s of Routing Overhead Delay,120 s of Network Lifetime,and 20 J of Energy Consumption efficiency,which is much better than that of the state-of-the-art protocols. 展开更多
关键词 Macro-addressable network power-and load-aware routing deterministic and opportunistic routing gradient routing multi-channel cooperative neighbor discovery
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部