October 22, 2013
Comments Off on Least-Latency Routing over Time-Dependent Wireless Sensor Networks
Posted in: Final year projects
Abstract We consider the problem of least-latency end-to-end routing over adaptively duty-cycled wireless sensor networks. Such networks exhibit a time-dependent feature, where the link cost and transmission latency from one node to other nodes vary constantly in different discrete time moments. We model the problem as the time-dependent Bellman-Ford problem. We show that such networks […]
October 22, 2013
Comments Off on DRINA: A Lightweight and Reliable Routing Approach for In-Network Aggregation in Wireless Sensor Networks
Posted in: Final year projects
Abstract Large scale dense Wireless Sensor Networks (WSNs) will be increasingly deployed in different classes of applications for accurate monitoring. Due to the high density of nodes in these networks, it is likely that redundant data will be detected by nearby nodes when sensing an event. Since energy conservation is a key issue in WSNs, […]