In order to optimize traffic flows and power consumption of network components, various green routing algorithms and protocols have been proposed. These algorithms and protocols apply different techniques to attain th...
详细信息
In order to optimize traffic flows and power consumption of network components, various green routing algorithms and protocols have been proposed. These algorithms and protocols apply different techniques to attain their own goals. One of the most important techniques is the sleep-scheduling technique that switches the status of the network components, nodes or links, into active/inactive modes. There are four characteristics affecting the power and performance of communication networks which distinguish green routing algorithms and protocols, namely the sleep-scheduled component, decision structure, network traffic awareness, and quality of service awareness. In this paper, a method is proposed to model, evaluate, and compare the power and performance of the green routing algorithms that use the sleep-scheduling technique. We apply stochastic activity networks to model and analyze the routing algorithms with respect to the network topology. The results obtained from the comparison of the algorithms, validated with the OMNeT++ simulator, can be used by network administrators to make the right decisions.
Since the development of the Wireless Sensor Network (WSN), the main emphasis has been on saving the energy of the sensor nodes employed for sensing and collecting the data from the remote or target areas. In this reg...
详细信息
The ever-increasing size of programmable photonic integrated circuits necessitates the development of specialised routing algorithms, capable of handling different mesh architectures and magnitudes. We develop an algo...
详细信息
Through the Wireless Sensor Network (WSN), researchers have made every effort in advancing sensing technology worldwide. However, the essence of communication is deeply affected by the limited battery operating nature...
详细信息
With the rapid development of 5G and 6G communications in recent years, there has been significant interest in space-air-ground integrated networks (SAGINs), which aim to achieve seamless all-area, all-time coverage. ...
详细信息
With the rapid development of 5G and 6G communications in recent years, there has been significant interest in space-air-ground integrated networks (SAGINs), which aim to achieve seamless all-area, all-time coverage. As a key component of SAGINs, flying ad hoc networks (FANETs) have been widely used in the agriculture and transportation sectors in recent years. Reliable communication in SAGINs requires efficient routing algorithms to support them. In this study, we analyze the unique communication architecture of FANETs in SAGINs. At the same time, existing routing protocols are presented and clustered. In addition, we review the latest research advances in routing algorithms over the last five years. Finally, we clarify the future research trends of FANET routing algorithms in SAGINs by discussing the algorithms and comparing the routing experiments with the characteristics of unmanned aerial vehicles.
Opportunistic Mobile Ad Hoc Networks (MANETs) offer a versatile solution in contexts where the Internet is unavailable. These networks facilitate transmissions between endpoints using a store-carry-forward strategy, a...
详细信息
In the LOCAL model of distributed computing, low-diameter decomposition is an extremely useful tool in designing algorithms, as it allows us to shift from the general graph setting to the low-diameter graph setting, w...
详细信息
Mobile robots are extensively used in flexible manufacturing systems and intra-logistics on a 24/7 basis to address demand fluctuations, increase productivity and promote environmental, economic and social sustainabil...
详细信息
Mobile robots are extensively used in flexible manufacturing systems and intra-logistics on a 24/7 basis to address demand fluctuations, increase productivity and promote environmental, economic and social sustainability. In this regard, routing algorithms are used to navigate mobile industrial robots for optimizing shop-floor logistics operations. However, open-source tools and software libraries implementing routing algorithms provide limited real-world relevance via indicatively neglecting the physical operating environment's characteristics and the kinematics of mobile robots. To this effect, this research designs, analyzes and develops MIROR, a middleware software tool that interfaces mobile industrial robots with route optimization algorithms to deliver a sophisticated testing environment that: (i) applies routing algorithms for the optimal logistics of mobile robots in customized industrial facility layouts;(ii) allows the comparison of the resulting algorithmic outcomes to inform about effective and efficient routing options;and (iii) creates optimal routing plans for informing the logistics operations of equivalent real-world mobile robots in industrial manufacturing settings. Specifically, MIROR integrates open-source Operations Research tools and the Robot Operating System to simulate and explore alternative logistics scenarios for mobile robots in 3D recreated industrial manufacturing facilities. To a greater extent, MIROR allows the transfer of the optimal routing code to equivalent real-world vehicles. Specifically, the implemented middleware tool handles variations of the Traveling Salesman Problem and generates feasible routes in complex facility layouts considering a variety of mobile robots. Academics and practitioners could benefit from the user-friendly interface of MIROR to generate realistic scheduling and routing options for the optimal planning of the logistics operations of mobile industrial robots in manufacturing environments. (C) 2021 The
In this paper, we compare and contrast model-based and machine learning approaches for designing caching and routing strategies to improve cache network performance (e.g., delay, hit rate). We first outline the key pr...
详细信息
In MANETs, congestion typically occurs on the interconnecting nodes between two or more groups of nodes. routing to avoid the congested nodes via alternate, perhaps longer paths, allows more throughput, e.g., 50% more...
详细信息
暂无评论