Jointly Minimizing AoI Penalty and Network Cost Among Coexisting Source-Destination Pairs

Author(s):  
Cho-Hsin Tsai ◽  
Chih-Chun Wang
Keyword(s):  
2016 ◽  
Vol 167 (5) ◽  
pp. 294-301
Author(s):  
Leo Bont

Optimal layout of a forest road network The road network is the backbone of forest management. When creating or redesigning a forest road network, one important question is how to shape the layout, this means to fix the spatial arrangement and the dimensioning standard of the roads. We consider two kinds of layout problems. First, new forest road network in an area without any such development yet, and second, redesign of existing road network for actual requirements. For each problem situation, we will present a method that allows to detect automatically the optimal road and harvesting layout. The method aims to identify a road network that concurrently minimizes the harvesting cost, the road network cost (construction and maintenance) and the hauling cost over the entire life cycle. Ecological issues can be considered as well. The method will be presented and discussed with the help of two case studies. The main benefit of the application of optimization tools consists in an objective-based planning, which allows to check and compare different scenarios and objectives within a short time. The responses coming from the case study regions were highly positive: practitioners suggest to make those methods a standard practice and to further develop the prototype to a user-friendly expert software.


Author(s):  
George Christodoulou ◽  
Vasilis Gkatzelis ◽  
Mohamad Latifian ◽  
Alkmini Sgouritsa

2021 ◽  
Vol 17 (5) ◽  
pp. 155014772110181
Author(s):  
Yinggao Yue ◽  
Hairong You ◽  
Shuxin Wang ◽  
Li Cao

Aiming at the problems of node redundancy and network cost increase in heterogeneous wireless sensor networks, this article proposes an improved whale optimization algorithm coverage optimization method. First, establish a mathematical model that balances node utilization, coverage, and energy consumption. Second, use the sine–cosine algorithm to improve the whale optimization algorithm and change the convergence factor of the original algorithm. The linear decrease is changed to the nonlinear decrease of the cosine form, which balances the global search and local search capabilities, and adds the inertial weight of the synchronous cosine form to improve the optimization accuracy and speed up the search speed. The improved whale optimization algorithm solves the heterogeneous wireless sensor network coverage optimization model and obtains the optimal coverage scheme. Simulation experiments show that the proposed method can effectively improve the network coverage effect, as well as the utilization rate of nodes, and reduce network cost consumption.


2021 ◽  
Author(s):  
Karthik K ◽  
Sudarson Jena ◽  
Venu Gopal T

Abstract A Multiprocessor is a system with at least two processing units sharing access to memory. The principle goal of utilizing a multiprocessor is to process the undertakings all the while and support the system’s performance. An Interconnection Network interfaces the various handling units and enormously impacts the exhibition of the whole framework. Interconnection Networks, also known as Multi-stage Interconnection Networks, are node-to-node links in which each node may be a single processor or a group of processors. These links transfer information from one processor to the next or from the processor to the memory, allowing the task to be isolated and measured equally. Hypercube systems are a kind of system geography used to interconnect various processors with memory modules and precisely course the information. Hypercube systems comprise of 2n nodes. Any Hypercube can be thought of as a graph with nodes and edges, where a node represents a processing unit and an edge represents a connection between the processors to transmit. Degree, Speed, Node coverage, Connectivity, Diameter, Reliability, Packet loss, Network cost, and so on are some of the different system scales that can be used to measure the performance of Interconnection Networks. A portion of the variations of Hypercube Interconnection Networks include Hypercube Network, Folded Hypercube Network, Multiple Reduced Hypercube Network, Multiply Twisted Cube, Recursive Circulant, Exchanged Crossed Cube Network, Half Hypercube Network, and so forth. This work assesses the performing capability of different variations of Hypercube Interconnection Networks. A group of properties is recognized and a weight metric is structured utilizing the distinguished properties to assess the performance exhibition. Utilizing this weight metric, the performance of considered variations of Hypercube Interconnection Networks is evaluated and summed up to recognize the effective variant. A compact survey of a portion of the variations of Hypercube systems, geographies, execution measurements, and assessment of the presentation are examined in this paper. Degree and Diameter are considered to ascertain the Network cost. On the off chance that Network Cost is considered as the measurement to assess the exhibition, Multiple Reduced Hypercube stands ideal with its lower cost. Notwithstanding it, on the off chance that we think about some other properties/ scales/metrics to assess the performance, any variant other than MRH may show considerably more ideal execution. The considered properties probably won't be ideally adequate to assess the effective performance of Hypercube variations in all respects. On the off chance that a sensibly decent number of properties are utilized to assess the presentation, a proficient variation of Hypercube Interconnection Network can be distinguished for a wide scope of uses. This is the inspiration to do this research work.


2018 ◽  
Vol 75 (7) ◽  
pp. 3621-3639 ◽  
Author(s):  
Jong-Seok Kim ◽  
Donghyun Kim ◽  
Ke Qiu ◽  
Hyeong-Ok Lee
Keyword(s):  

2021 ◽  
Vol 17 (11) ◽  
pp. 155014772110331
Author(s):  
Jung-hyun Seo ◽  
HyeongOk Lee

One method to create a high-performance computer is to use parallel processing to connect multiple computers. The structure of the parallel processing system is represented as an interconnection network. Traditionally, the communication links that connect the nodes in the interconnection network use electricity. With the advent of optical communication, however, optical transpose interconnection system networks have emerged, which combine the advantages of electronic communication and optical communication. Optical transpose interconnection system networks use electronic communication for relatively short distances and optical communication for long distances. Regardless of whether the interconnection network uses electronic communication or optical communication, network cost is an important factor among the various measures used for the evaluation of networks. In this article, we first propose a novel optical transpose interconnection system–Petersen-star network with a small network cost and analyze its basic topological properties. Optical transpose interconnection system–Petersen-star network is an undirected graph where the factor graph is Petersen-star network. OTIS–PSN n has the number of nodes 102n, degree n+3, and diameter 6 n − 1. Second, we compare the network cost between optical transpose interconnection system–Petersen-star network and other optical transpose interconnection system networks. Finally, we propose a routing algorithm with a time complexity of 6 n − 1 and a one-to-all broadcasting algorithm with a time complexity of 2 n − 1.


Author(s):  
Shima Mohebbi ◽  
Rasoul Shafaei ◽  
Namjae Cho

The automation of negotiation among buyer-supplier-supplier triad is an important policy in e-supply network coordination (e-SNC). In addition to the buyer-supplier coordination advantages, a further coordination among suppliers is also highly important in order to maximize the network supply capacity utilization especially when the suppliers are geographically decentralized. This chapter focuses on the impact of suppliers’ coordination in a network where the coordination among buyers and suppliers is in place. The proposed agent-based model is composed of two negotiator agents, one monitor agent, and one coordinator agent. The model begins with buyer-supplier negotiation and coordination mechanism adopted from the approach developed by Mohebbi and Shafaei (2010). Then, the suppliers’ coordination mechanism is developed to investigate the interaction among suppliers and evaluate the subsequent benefit obtained in the global network. The efficiency of the proposed approach is evaluated using a simulation model. The results demonstrate that in a network where the coordination among buyers and suppliers is in place, a further coordination among suppliers leads to the reduction of total network cost.


Sign in / Sign up

Export Citation Format

Share Document