Delay-Tolerant Networks for emergency response

Natural or man-made disasters can partition networks while threatening human lives. Because conventional Mobile Ad-Hoc Networks (MANETs) cannot route messages across partitions, they may not adequately support relief efforts. To forward messages across partitions, delay-tolerant networks (DTNs) exploit in-network storage and mobility. Many previous DTN routing protocols either opportunistically use, but do not modify, nodes' mobility, or require dedicated mobile gateways. We contribute a cross-layer DTN routing approach based on the observation that application-layer orders from a MANET's leader also control workers' mobility and ability to forward messages. Our approach attempts to minimize deadline misses and energy consumption by scheduling worker tasks considering both application- and network-layer needs:

• Integrated Scheduling of Application- and Network-Layer Tasks in Delay-Tolerant MANETs (with S. Khattab, C. Santamaria, B. Smyth and D. Mossé), in Proceedings of the 49th Annual Global Telecommunications Conference (GLOBECOM'2006), IEEE, San Francisco, CA, Nov. 2006.

Data aggregation in sensor networks

In wireless sensor networks, the user's objective is to extract useful global information by collecting individual sensor readings. Conventionally, this is done using in-network aggregation on a spanning tree from sensors to data sink. However, the spanning tree structure is not robust against communication errors; when a packet is lost, so is a complete subtree of values. We present and analyze two new fault tolerant schemes for duplicate-sensitive aggregation, Cascaded RideSharing and Diffused RideSharing:

• RideSharing: Fault-Tolerant Aggregation in Sensor Networks with Corrective Actions (with S. Gobriel, S. Khattab, D. Mossé and R. Melhem), in Proceedings of 3rd Annual Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON'2006), IEEE, Reston, VA, pp. 595-604, Sept. 2006.

Back to José Brustoloni's home page.