Bounded Length Least-Cost Path Estimation in Wireless Sensor Networks Using Petri Nets
|
| Title | Bounded Length Least-Cost Path Estimation in Wireless Sensor Networks Using Petri Nets |
| Authors | |
| Abstract | This paper proposes an iterative algorithm for estimating theleast-cost paths in a wireless sensor network (WSN) that is modeled by a Petri net. We assume that each link between two sensor 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 lessthan or equal to a given bound L) that could lead us from theinitial state to the final state while having the least totalcost. We develop an iterative algorithm that obtains the least-cost paths with complexity that is polynomial in the length L. |
| Publisher | ACADEMY PUBLISHER |
| Date | 2012-01-01 |
| Source | Journal of Networks Vol 7, No 1 (2012): Special Issue: Performance Modeling and Evaluation of Computer and Telecommunic |
| Rights | Copyright © ACADEMY PUBLISHER - All Rights Reserved.To request permission, please check out URL: http://www.academypublisher.com/copyrightpermission.html. |