2,083 research outputs found
Information Propagation Speed in Mobile and Delay Tolerant Networks
The goal of this paper is to increase our understanding of the fundamental
performance limits of mobile and Delay Tolerant Networks (DTNs), where
end-to-end multi-hop paths may not exist and communication routes may only be
available through time and mobility. We use analytical tools to derive generic
theoretical upper bounds for the information propagation speed in large scale
mobile and intermittently connected networks. In other words, we upper-bound
the optimal performance, in terms of delay, that can be achieved using any
routing algorithm. We then show how our analysis can be applied to specific
mobility and graph models to obtain specific analytical estimates. In
particular, in two-dimensional networks, when nodes move at a maximum speed
and their density is small (the network is sparse and surely
disconnected), we prove that the information propagation speed is upper bounded
by ( in the random way-point model, while it is upper bounded by
for other mobility models (random walk, Brownian motion).
We also present simulations that confirm the validity of the bounds in these
scenarios. Finally, we generalize our results to one-dimensional and
three-dimensional networks
Underwater spray and wait routing technique for mobile ad-hoc networks
1648-1655The underwater mobile ad-hoc networks comprise sensor nodes that are source nodes for gathering underwater-related data. Relay nodes are the mobile nodes for collecting data from sensor nodes and achieving intermittent connectivity among source and destination nodes. Developing an efficient routing protocol for underwater communication is a challenging issue due to limitations of the underwater environment. Underwater mobile ad-hoc networks are intermittent networks where end-to-end path does not exist from source to destination. To overcome these problems a delay and disruption tolerant network (DTN) is a good solution. In the current paper, we consider the Spray and Wait (SaW) routing technique. In SaW, source and relay nodes represents the moving nodes, and they try to send data to destination nodes. Based on this, we propose the replica based underwater SaW (USaW) routing for underwater mobile ad-hoc networks. In USaW, source nodes are fixed to the bottom of the surface. Underwater sensor nodes replicate sensor data and provide maximum copies of data to the relay nodes that they encounter. In generally, relay nodes have high capability of transmitting data as compared to sensor nodes in an underwater environment. We analyze the performance of USaW with respect to delivery ratio, network throughput, energy consumption, end-to-end delay, and packet drop rate comparing with existing SaW and prophet routing protocols
Relieving the Wireless Infrastructure: When Opportunistic Networks Meet Guaranteed Delays
Major wireless operators are nowadays facing network capacity issues in
striving to meet the growing demands of mobile users. At the same time,
3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g.,
Wi-Fi). In this context of hybrid connectivity, we propose Push-and-track, a
content dissemination framework that harnesses ad hoc communication
opportunities to minimize the load on the wireless infrastructure while
guaranteeing tight delivery delays. It achieves this through a control loop
that collects user-sent acknowledgements to determine if new copies need to be
reinjected into the network through the 3G interface. Push-and-Track includes
multiple strategies to determine how many copies of the content should be
injected, when, and to whom. The short delay-tolerance of common content, such
as news or road traffic updates, make them suitable for such a system. Based on
a realistic large-scale vehicular dataset from the city of Bologna composed of
more than 10,000 vehicles, we demonstrate that Push-and-Track consistently
meets its delivery objectives while reducing the use of the 3G network by over
90%.Comment: Accepted at IEEE WoWMoM 2011 conferenc
INTERMITTENTLY CONNECTED DELAY-TOLERANT WIRELESS SENSOR NETWORKS
Intermittently Connected Delay-Tolerant Wireless Sensor Networks (ICDT-WSNs), a branch of Wireless Sensor Networks (WSNs), have features of WSNs and the intermittent connectivity of Opportunistic Networks. The applications of ICDT-WSNs are increasing in recent years; however, the communication protocols suitable for this category of networks often fall short. Most of the existing communication protocols are designed for either WSNs or Opportunistic Networks with sufficient resources and tend to be inadequate for direct use in ICDT-WSNs.
In this dissertation, we study ICDT-WSNs from the perspective of the characteristics, chal- lenges and possible solutions. A high-level overview of ICDT-WSNs is given, followed by a study of existing work and our solutions to address the problems of routing, flow control, error control, and storage management. The proposed solutions utilize the utility level of nodes and the connectedness of a network. In addition to the protocols for information transmissions to specific destinations, we also propose efficient mechanisms for information dissemination to arbitrary destinations. The study shows that our proposed solutions can achieve better performance than other state of the art communication protocols without sacrificing energy efficiency
- …