Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Fair queuing for aggregated multiple links
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks
FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
Opportunistic scheduling for wireless systems with multiple interfaces and multiple constraints
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
IEEE Transactions on Parallel and Distributed Systems
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
On Recent Advances in Time/Utility Function Real-Time Scheduling and Resource Management
ISORC '05 Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
IEEE Transactions on Computers
Low-cost communication for rural internet kiosks using mechanical backhaul
Proceedings of the 12th annual international conference on Mobile computing and networking
Vehicular opportunistic communication under the microscope
Proceedings of the 5th international conference on Mobile systems, applications and services
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Very low-cost internet access using KioskNet
ACM SIGCOMM Computer Communication Review
On multiprocessor utility accrual real-time scheduling with statistical timing assurances
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Design principles for opportunistic communication in constrained computing environments
Proceedings of the 2008 ACM workshop on Wireless networks and systems for developing regions
Deliberate interactions: characterizing technology use in Nairobi, Kenya
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Distributed caching over heterogeneous mobile networks
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Design and implementation of the KioskNet system
Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient renewable energy management and sharing system for sustainable embedded devices
Journal of Electrical and Computer Engineering
Fair content dissemination in participatory DTNs
Ad Hoc Networks
Distributed caching over heterogeneous mobile networks
Queueing Systems: Theory and Applications
On the exploration of time-varying networks
Theoretical Computer Science
Fairness-related challenges in mobile opportunistic networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Data-ferrying disconnection-tolerant networks allow remote rural areas to access the Internet at very low cost, making them viable alternatives to more expensive access technologies such as DSL, CDMA, and dial-up. In such a network, an Internet-based proxy gathers data from the Internet and sends it to a set of edge nodes called "gateways", from which data ferries, such as buses and cars, opportunistically pick up the data using short-range WiFi as they drive past, and deliver it wirelessly to kiosks in remote villages. In this context, we pose the following question: assuming knowledge of ferry schedules, when and to which gateway should the proxy send each data bundle so that the overall delay is minimized and the bandwidth is shared fairly among competing kiosks? We show that a well-known schedule-aware routing scheme proposed in the literature, i.e., EDLQ [11] is far from optimal. Moreover, EDLQ does not provide means to enforce bandwidth allocations. To remedy these problems, we employ a token bucket mechanism to decouple fairness and delay minimization concerns. We also describe a utility-maximizing scheduler based on the classical minimum-cost network flow problem, that finds optimal schedules. Through simulations, we show that our scheme performs at least as well as EDLQ in scenarios that favour EDLQ, yet achieves up to 40% reduction in delay in those that do not.