IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, VOL. 64, NO. 8, AUGUSTReliability and Temporality Optimization for Multiple Coexisting WirelessHART Networks

First Page		Document Content
Date: 2017-12-01 00:35:35 Graph theory Mathematics Computational complexity theory Network theory NP-complete problems Graph coloring Connectivity Shortest path problem Routing algorithms		IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, VOL. 64, NO. 8, AUGUSTReliability and Temporality Optimization for Multiple Coexisting WirelessHART Networks Add to Reading List Source URL: wirelesslab.sjtu.edu.cn Download Document from Source Website File Size: 1,44 MB Share Document on Facebook

	VEHICLE ROUTING ALGORITHMS FOR RADIALLY ESCAPING TARGETS PUSHKARINI AGHARKAR †, DocID: 1vkvr - View Document
	T HEORY OF C OMPUTING, Volume), pp. 179–199 www.theoryofcomputing.org Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing DocID: 1uOB1 - View Document
	Improving Non-Minimal and Adaptive Routing Algorithms in Slim Fly Networks Pedro Y´ebenes∗ , Jesus Escudero-Sahuquillo∗ , Pedro J. Garc´ıa∗ , Francisco J. Quiles∗ , and Torsten Hoefler† ∗ Department of Co DocID: 1tVFZ - View Document
	Trust-based Anonymous Communication: Adversary Models and Routing Algorithms ∗ Aaron Johnson DocID: 1tMc3 - View Document
	1 Distributed routing algorithms to manage power flow in agent-based active distribution network Phuong H. Nguyen, Wil L. Kling, Member, IEEE, Giorgos Georgiadis, Marina Papatriantafilou, Le Anh Tuan, Member IEEE, Lina DocID: 1sdUe - View Document