October 22, 2013
Comments Off on Max-Flow Min-Cost Routing in a Future-Internet with Improved QoS Guarantees
Posted in: Final year projects
Abstract A Constrained Multicommodity Maximum-Flow-Minimum-Cost routing algorithm is presented. The algorithm computes maximum-flow routings for all smooth unicast traffic demands within the Capacity Region of a network subject to routing cost constraints. The edge cost can be a distance, reliability, congestion or an energy metric. It is shown that every network has a finite Bandwidth-Cost […]
October 22, 2013
Comments Off on Localization of Wireless Sensor Networks in the Wild: Pursuit of Ranging QualityÂ
Posted in: Final year projects
Abstract Localization is a fundamental issue of wireless sensor networks that has been extensively studied in the literature. Our real-world experience from GreenOrbs, a sensor network system deployed in a forest, shows that localization in the wild remains very challenging due to various interfering factors. In this paper, we propose CDL, a Combined and Differentiated […]