On the stability of the travelling salesman problem algorithm of Hopfield and Tank
Biological Cybernetics
Computer networks
Introduction to the theory of neural computation
Introduction to the theory of neural computation
Wireless digital communications: modulation & spread spectrum applications
Wireless digital communications: modulation & spread spectrum applications
Computer networks: a systems approach
Computer networks: a systems approach
Routing in the Internet (2nd ed.)
Routing in the Internet (2nd ed.)
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Ad Hoc Wireless Networks: Protocols and Systems
Ad Hoc Wireless Networks: Protocols and Systems
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
GPS-free Positioning in Mobile Ad Hoc Networks
Cluster Computing
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
A survey of dynamic routing methods for circuit-switched traffic
IEEE Communications Magazine
Neural networks for routing of communication networks with unreliable components
IEEE Transactions on Neural Networks
RAI: A High Throughput Routing Protocol for Multi-hop Multi-rate Ad hoc Networks
Wireless Personal Communications: An International Journal
A multi-rate routing protocol with connection entropy for mobile ad hoc networks
Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
| Hi-index | 0.24 |
This paper introduces an entropy-constrained algorithm for routing of communication networks. The proposed formulation of the routing problem allows multiple nodes to compete for each position in the route, with the associated uncertainty measured by the connection entropy. The problem of determining the best route is subsequently formulated as the constrained minimization of an objective function formed as a linear combination of the routing cost and the corresponding connection entropy. The routing algorithm derived using the method of Lagrange multipliers is implemented by a deterministic annealing optimization process, with the number of accessible system states decreasing gradually with the system temperature. For comparison purposes, routing is also performed by an optimization approach similar with that proposed by Hopfield and Tank and by the routron, which was developed using elements of the Hopfield-Tank approach to optimization but relies on a different treatment of the optimization problem. This experimental study reveals the superiority of the entropy-constrained routing algorithm, which produces consistently the best routes in a small fraction of the time required for convergence by the neural optimization approaches.