Crosstalk-aware Routing, Spectrum and Mode Assignment in Few Mode Fiber with MIMO Equalization

Author(s):  
Shijia Guo ◽  
Weiguo Ju ◽  
Shan Yin ◽  
Bao Wang ◽  
Yuan Yuan ◽  
...  
Keyword(s):  
1998 ◽  
Vol 58 (11) ◽  
pp. 7181-7187 ◽  
Author(s):  
Susumu Noda ◽  
Tomoki Abe ◽  
Masatoshi Tamura

2007 ◽  
Vol 111 (1) ◽  
pp. 173-177 ◽  
Author(s):  
E. Siranidi ◽  
D. Lampakis ◽  
D. Palles ◽  
E. Liarokapis ◽  
K. Conder

2016 ◽  
Vol 120 (17) ◽  
pp. 2684-2690 ◽  
Author(s):  
Mary Alice Upshur ◽  
Hilary M. Chase ◽  
Benjamin F. Strick ◽  
Carlena J. Ebben ◽  
Li Fu ◽  
...  

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1601
Author(s):  
Asfandyar Awan ◽  
Zhao Qi ◽  
Shan Hu ◽  
Lijiang Chen

Cooperative communication supported by device to device (D2D)-LEO earthed satellite increases the performance of the resilient network and offloads base station. Additionally, network coding in a packet-based cooperative framework provides diversity and speedy recovery of lost packets. Cooperative communication advantages are subject to effective joint admission control strengthened by network coding for multiple interfaces. Joint admission control with network coding involves multiple constraints in terms of user selection, mode assignment, power allocation, and interface-based network codewords, which is challenging to solve collectively. Sub-problematization and its heuristic solution lead to a less complex solution. First, the adaptive terrestrial satellite power sentient network (ATSPSN) algorithm is proposed based on low complex convex linearization of mix integer non-linear problem (MINLP), NP-hard. ATSPSN provides optimum power allocation, mode assignment, and user selection based on joint channel conditions. Second, a multiple access network coding algorithm (MANC) is developed underlying the D2D-satellite network, which provides novel multiple interface random linear network codewords. At the end, the bi-directional matching algorithm aiming for joint admission control with network coding, named JAMANC-stream and JAMANC-batch communication, is proposed. JAMANC algorithm leads to a less complex solution and provides improved results in terms of capacity, power efficiency, and packet completion time. The theoretical lower and upper bounds are also derived for comparative study.


2007 ◽  
Vol 71 (3) ◽  
pp. 273-283
Author(s):  
P. M. Nikolić ◽  
S. Đurić ◽  
K. M. Paraskevopoulos ◽  
T. T. Zorba ◽  
D. Luković ◽  
...  

AbstractPolarized far- and mid-infrared reflectance spectra were measured at room temperature for the new mineral species jarandolite, CaB3O4(OH)3, for the two principal directions. Thirty three vibration modes for and 32 for were observed and analysed numerically. Symmetry analysis predicts 41 and 40 vibration modes that include lattice and O–H modes. Mode assignment was made based on the structure of jarandolite. The values of the mode frequencies (ωTO), the damping factors (γ) and the oscillator strength (S) of each oscillator were obtained by fitting to a Lorentz model.


2001 ◽  
Vol 40 (Part 1, No. 9A) ◽  
pp. 5206-5210 ◽  
Author(s):  
Yoshikazu Tsukidate ◽  
Maki Suemitsu

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Ruey-Maw Chen ◽  
Frode Eika Sandnes

The multimode resource-constrained project scheduling problem (MRCPSP) has been confirmed to be an NP-hard problem. Particle swarm optimization (PSO) has been efficiently applied to the search for near optimal solutions to various NP-hard problems. MRCPSP involves solving two subproblems: mode assignment and activity priority determination. Hence, two PSOs are applied to each subproblem. A constriction PSO is proposed for the activity priority determination while a discrete PSO is employed for mode assignment. A least total resource usage (LTRU) heuristic and minimum slack (MSLK) heuristic ensure better initial solutions. To ensure a diverse initial collection of solutions and thereby enhancing the PSO efficiency, a best heuristic rate (HR) is suggested. Moreover, a new communication topology with random links is also introduced to prevent slow and premature convergence. To verify the performance of the approach, the MRCPSP benchmarks in PSPLIB were evaluated and the results compared to other state-of-the-art algorithms. The results demonstrate that the proposed algorithm outperforms other algorithms for the MRCPSP problems. Finally, a real-world man-day project scheduling problem (MDPSP)—a MRCPSP problem—was evaluated and the results demonstrate that MDPSP can be solved successfully.


Sign in / Sign up

Export Citation Format

Share Document