Data networks
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Bounds on the greedy routing algorithm for array networks
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Performance of hypercube routing schemes with or without buffering
IEEE/ACM Transactions on Networking (TON)
Efficient algorithms for performing packet broadcasts in a mesh network
IEEE/ACM Transactions on Networking (TON)
Packet routing in fixed-connection networks: a survey
Journal of Parallel and Distributed Computing
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Queueing analysis of oblivious packet-routing networks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Wireless integrated network sensors
Communications of the ACM
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Improved Algorithms for Routing on Two-Dimensional Grids
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
Proceedings of the 3rd international symposium on Information processing in sensor networks
The capacity of wireless networks
IEEE Transactions on Information Theory
Routing strategies for maximizing throughput in LEO satellite networks
IEEE Journal on Selected Areas in Communications
Efficient routing with small buffers in dense networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Correction to "Lattice networks: Capacity limits, optimal routing, and queueing behavior"
IEEE/ACM Transactions on Networking (TON)
Symptotics: a framework for analyzing the scalability of real-world wireless networks
Proceedings of the 9th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Optimal and resilient routing for many-to-one topologies in event triggered wireless sensor networks
Proceedings of the 7th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
| Hi-index | 0.00 |
Lattice networks are widely used in regular settings like grid computing, distributed control, satellite constellations, and sensor networks. Thus, limits on capacity, optimal routing policies, and performance with finite buffers are key issues and are addressed in this paper. In particular, we study the routing algorithms that achieve the maximum rate per node for infinite and finite buffers in the nodes and different communication models, namely uniform communications, central data gathering and border data gathering. In the case of nodes with infinite buffers, we determine the capacity of the network and we characterize the set of optimal routing algorithms that achieve capacity. In the case of nodes with finite buffers, we approximate the queue network problem and obtain the distribution on the queue size at the nodes. This distribution allows us to study the effect of routing on the queue distribution and derive the algorithms that achieve the maximum rate.