Delay Tolerant Networks (DTNs) are a class of emerging networks where disconnections may occur frequently due to propagation phenomena, node mobility, and power outages. Delay is inevitable in DTNs, thus, making better use of buffer space to maximize the packet delivery rate is more important than concentrating on how to decrease the delay. In this paper, we improve the buffer scheme of Epidemi...

Delay Tolerant Networks (DTNs) are sparse mobile networks, which experiences frequent disruptions in connectivity among nodes. Usually, DTN follows store-carry-and forward mechanism for message forwarding, in which a node store and carry the message until it finds an appropriate relay node to forward further in the network. So, The efficiency of DTN routing protocol relies on the intelligent se...

Broadcasting is one of the fundamental data dissemination mechanisms in mobile ad hoc network (MANET), which is, for instance, extensively used in many routing protocols for route discovery process. The dynamic topology and limited communication bandwidth of such networks pose a number of challenges in designing an efficient broadcasting scheme for MANETs. The simplest approach is flooding, whe...

Epidemic protocols have demonstrated remarkable scalability and robustness in disseminating information on internet-scale, dynamic P2P systems. However, popular instances of such protocols suffer from a number of significant drawbacks, such as increased message overhead in push-based systems, or low dissemination speed in pull-based ones. In this paper we study push-based epidemic dissemination...

Mobile sensing accelerates the integration of physical world and virtual space by using the pervasive portable devices with sensing and communication abilities. Since the smart devices are often battery powered, prolonging the network lifetime in mobile sensing becomes very important. Previous works forward packets individually, resulting in a large amount of redundant copies. They therefore co...

This paper studies the design and performance of the Probabilistic Priority (PP) [9] packet scheduling algorithm to schedule packets. Unlike an earlier design that uses fractional arithmetic and prohibits large number of classes, we present an integer PP algorithm and show that PP turns out to be a special scheme of applying lottery scheduling [16] to bandwidth allocation in a strict priority s...

In intermittent-connected mobile sensor networks, generally nodes have a small number of neighbors and connections between the nodes rarely exist. This paper presents a new networking system for this type of network, aimed at maximizing resource utilization to achieve better system performance in terms of delay time and reliability. The system is motivated by the observation that a large number...