Multi-mode Routing Research Articles

Multi-mode vehicle scheduling and routing for surging passenger flow management: from the perspective of urban traffic brain

Multi-mode vehicle scheduling and routing for surging passenger flow management: from the perspective of urban traffic brain

Silicon Integrated Nanophotonic Devices for On-Chip Multi-Mode Interconnects

Mode-division multiplexing (MDM) technology has drawn tremendous attention for its ability to expand the link capacity within a single-wavelength carrier, paving the way for large-scale on-chip data communications. In the MDM system, the signals are carried by a series of higher-order modes in a multi-mode bus waveguide. Hence, it is essential to develop on-chip mode-handling devices. Silicon-on-insulator (SOI) has been considered as a promising platform to realize MDM since it provides an ultra-high-index contrast and mature fabrication processes. In this paper, we review the recent progresses on silicon integrated nanophotonic devices for MDM applications. We firstly discuss the working principles and device configurations of mode (de)multiplexers. In the second section, we summarize the multi-mode routing devices, including multi-mode bends, multi-mode crossings and multi-mode splitters. The inverse-designed multi-mode devices are then discussed in the third section. We also provide a discussion about the emerging reconfigurable MDM devices in the fourth section. Finally, we offer our outlook of the development prospects for on-chip multi-mode photonics.

A Charging-Aware Multi-Mode Routing Protocol for Data Collection in Wireless Rechargeable Sensor Networks.

This paper proposes a charging-aware multi-mode routing protocol (CMRP) to collect data in the wireless rechargeable sensor networks. The routing mechanism in CMRP is not steady but changes according to the energy charging status of sensors. Sensors that cannot replenish their energy efficiency use the routing protocol with less energy consumption. On the contrary, sensors that can replenish their energy use the low propagation delay routing protocol. A novel heuristic chaining mechanism based on multi-level convex hull circle (MCC) is also proposed. Simulation results show that CMRP not only has longer operation time than LEACH and PEGASIS but also has the shortest propagation delay time. The lifetime of CMRP is less than the minimum spanning tree by about 1%, but the propagation delay is shorter than MSTP about 21–28%. In addition, CMRP considers both reducing energy consumption and shortening the propagation delay at the same time. The life-delay rate of the CMRP is close to the optimal results.

Universal multimode waveguide crossing based on transformation optics

Mode-division multiplexing is a promising and cost-effective way to increase the communication capability of integrated photonic circuits, for both classical and quantum information processing. To construct large-scale on-chip multimode routing systems, the multimode waveguide crossing is one of the key components. However, there have been only a few dual-mode waveguide crossings reported, which can support merely two waveguide modes or two crossing channels. This severely limits the density and capacity of multimode routing systems. Here we demonstrate for the first time, to the best of our knowledge, a universal multimode waveguide star crossing based on transformation optics, which can handle, in principle, any number of waveguide modes and any number of crossing channels as well. The structure is transformed from a Maxwell fisheye and can realize aberration-free imaging for each waveguide mode. A gray-scale electron-beam lithography is adopted to fabricate it on a commercial silicon-on-insulator wafer. The proposed multimode waveguide star crossing has little loss and low crosstalk throughout an ultra-broad wavelength range of ∼400 nm. Our study paves the way for realizing highly integrated and large capacity on-chip multimode routing and communication systems.

Effective multi-mode routing mechanism with master-slave technique and reduction of packet droppings using 2-ACK scheme in MANETS

Effective multi-mode routing mechanism with master-slave technique and reduction of packet droppings using 2-ACK scheme in MANETS

Network condition and application‐based data adaptive intelligent message routing in vehicular network

SummaryRecent advances in intelligent transportation systems enable a broad range of potential applications that significantly improve the vehicle and road safety and facilitate the efficient dissemination of information among the vehicles. To assist the vehicle traffic, message broadcasting is a widely adopted technique for road safety. But efficient message broadcasting is a significant issue, especially in a high network density due to the broadcast storm problem. To solve this issue, several methods are proposed to eliminate the redundant transmission of safety packets. However, they lack in restricting the broadcasting region of safety messages, and the transmissions of safety packets outside the dangerous region, and force the vehicles to unnecessary detours. This paper proposes an adaptive multimode routing protocol, network condition, and application‐based data adaptive intelligent message routing in vehicular network (NetCLEVER) that supports 2 modes of operation such as message broadcasting and intelligent routing. In message broadcasting mode, the NetCLEVER decides the dangerous region of the network by considering the changes of neighbor vehicles velocity, instead of current vehicle velocity, because a vehicle decision in velocity is interdependent with the preceding vehicles. In intelligent routing mode, the NetCLEVER exploits the cuckoo search optimization in routing by taking into account multiple routing factors such as the road topology of intersections and traffic signals and their impact on link stability, which improves the reliability of routing packets significantly. The performance evaluation illustrates that the proposed NetCLEVER improves reliable wireless communication as well as road safety in vehicular ad hoc networks.

Adaptive routing for mobile ad hoc networks

Developing efficient routing protocols for mobile ad hoc networks remains a challenging task. It is well known that every protocol is capable of outperforming the others depending on the network context under which it is evaluated, since protocols only perform optimally under specific network contains due to their inability to adapt their behavior to the network context, which both varies in time and place. This article builds upon this observation to motivate and propose an adaptive multi-mode routing framework that has multiple compatible modes of operation. Based on this framework, an adaptive protocol has been implemented with the novel feature that individual nodes can adapt their mode of operation at any moment, while an overall consistent state of the routing tables is maintained. Through simulation, the correct behavior of the protocol during mode switches is demonstrated and it is shown that the protocol is capable of minimally offering the performance of either proactive or reactive routing, Its capabilities to dynamically switch, when intelligently applied, allow outperforming these protocols. This is illustrated for one specific application scenario where network conditions are dynamically monitored. Further, the article discusses some challenges encountered during the design and, since no monitoring solution has been developed, identifies existing solutions for monitoring and dissemination of network context are identified, offering directions for further research.

Design and Simulation of a Distributed Dynamic Clustering Algorithm for Multimode Routing in Wireless Ad Hoc Networks

This article presents analysis of the design and simulation of a new class of environmentally aware clustering algorithms for wireless ad hoc networks. The clustering algorithm establishes an adaptive self-organizing arrangement that enables multimode routing strategies. Multimode operation is needed to enhance scalability and robustness. In the present case, clustering is based on a criterion that enforces an upper bound on the probability of path failure within a cluster over time. The result is an adaptive hybrid routing strategy that dynamically balances routing overhead against routing optimality. The clustering algorithm unifies the routing strategies according to localized and time-varying mobility characteristics. A simulation model was developed to validate the effectiveness of the clustering algorithm and demonstrate the multimode routing behavior. Results show that the algorithm adapts effectively to node mobility and achieves relatively consistent overhead regardless of network size and mobility.