An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies
IEEE Transactions on Computers
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
Randomized algorithms
Packet routing in fixed-connection networks: a survey
Journal of Parallel and Distributed Computing
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
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Efficient and balanced adaptive routing in two-dimensional meshes
HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Energy aware multi-path routing for uniform resource utilization in sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Toward self-organized mobile ad hoc networks: the terminodes project
IEEE Communications Magazine
Determining the optimal configuration for the zone routing protocol
IEEE Journal on Selected Areas in Communications
Throughput and delay optimization in interference-limited multihop networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Lattice networks: capacity limits, optimal routing, and queueing behavior
IEEE/ACM Transactions on Networking (TON)
Sensing capacity for discrete sensor network applications
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Scalability of wireless networks
IEEE/ACM Transactions on Networking (TON)
Multilevel network characterization using regular topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance optimization of interference-limited multihop networks
IEEE/ACM Transactions on Networking (TON)
An efficient placement and routing technique for fault-tolerant distributed embedded computing
ACM Transactions on Embedded Computing Systems (TECS)
Influence of schematic network topology models over real physical networks
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
A routing scheme of mobile sink in sensor networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Stability of distributed 3-D systems implemented on grid sensor networks
IEEE Transactions on Signal Processing
Realization using the Roesser model for implementations in distributed grid sensor networks
Multidimensional Systems and Signal Processing
Hi-index | 0.00 |
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failures) and the dynamic case (node failures). For static networks, we derive upper bounds on the network capacity and then we characterize and provide optimal routing algorithms whose rate per node is equal to this upper bound, thus, obtaining the exact analytical expression for the network capacity. For dynamic networks, the unreliability of the network is modeled in two ways: a Markovian node failure and an energy based node failure. Depending on the probability of node failure that is present in the network, we propose to use a particular combination of two routing algorithms, the first one being optimal when there are no node failures at all and the second one being appropriate when the probability of node failure is high. The combination of these two routing algorithms defines a family of randomized routing algorithms, each of them being suitable for a given probability of node failure.