—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
In this paper, we proposed a MAC protocol, which can dynamically adjust Listening/Sleeping time rate of wireless sensor nodes according to data traffic load. In sensor networks, se...
It is well known that given a network that can become constrained on voltage or real power flows, reserves must also be spatially located in order to handle all credible contingen...
Jie Chen, James S. Thorp, Robert J. Thomas, Timoth...
Train Routing is a problem that arises in the early phase of the passenger railway planning process, usually several months before operating the trains. The main goal is to assign...
Alberto Caprara, Laura Galli, Leo G. Kroon, G&aacu...
—1 In ISM bands, many wireless protocols proliferate such as 802.11, Bluetooth, and ZigBee. However, these incompatible protocols create complex coexistence and connectivity prob...
Jiwoong Lee, Jeonghoon Mo, Tran Minh Trung, Jean C...