CRP Solver for Scheduling-based Forwarding in Intermittent Networks

Abstract

In this technical report, we first present a formal model of Intermittent Networks (INTNET). Constraint Resource Planning (CRP) algorithm has been applied to obtain efficient approximate solutions to NPcomplete problems in operations research. CRP is a subclass of Constraint Satisfaction Problem CSP. The choice of CRP is due to its appeal of being generic execution shell. Moreover, CRP provides polynomial time bounded execution shell called CRP-engine, which employs both heuristics to achieve near optimum solutions. In this report we also present a CRP-based algorithm for data flow forwarding scheduling in INTNET. The performance studies to be included in different reports.

3 Figures and Tables

Cite this paper

@inproceedings{Tahboub2009CRPSF, title={CRP Solver for Scheduling-based Forwarding in Intermittent Networks}, author={Omar Y. Tahboub and Javed I. Khan}, year={2009} }