Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
| Hi-index | 0.00 |
This paper develops an iterative algorithm for estimating the least-cost paths that can lead from a given initial state to a given final state in a wireless ad hoc sensor network (WASN) that is modeled by a Petri net. In particular, a WASN can be assumed as a multi-hop network and its topology can be modeled as a Petri net. We assume that each link between two nodes (each transition in the net) is associated with a positive cost to capture its likelihood (e.g., in terms of the transmission time, distance between nodes, or the link capacity). Given the structure of the Petri net and its initial/final state, we aim at finding the paths (with length less than or equal to a given bound L) that could lead us from the initial state to the final state while having the least total cost. We develop an iterative algorithm that finds the least-cost paths with complexity that is polynomial in the length L.