Optimized Replication Strategy for Intermittently Connected Mobile Networks

Optimized Replication Strategy for Intermittently Connected Mobile Networks

C. Poongodi (Kongu Engineering College, Perundurai, India) and A. M. Natarajan (Bannari Amman Institute of Technology, India)
DOI: 10.4018/jbdcn.2012010101
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Intermittently Connected Mobile Networks (ICMNs) are wireless networks where due to mobility of nodes and lack of connectivity, there may be disconnection among the nodes. Hence, the routing path from source to destination is not always available. In this case, Mobile Ad-hoc Network (MANET) protocols will not be utilized. In these networks, messages are to be flooded or multiple replications are needed to withstand the maximum delay and achieve the high delivery ratio. But multiple replication based protocols result in increased network overhead and high resource consumption because of uncontrolled replication. In this paper, the authors introduce a new simple scheme which applies knapsack policy based replication strategy in replicating the messages. The number of replication is reduced by appropriately selecting only limited messages based on the number of duplications of its own and its size. The messages are selected for forwarding to relay node based on the goodness of the relay node in contacting the destination and the buffer size of the relay node. Therefore, only limited messages will be replicated in the network and it will reduce the network overhead, resource consumption, delivery delay and increases the delivery ratio.
Article Preview

1. Introduction

A Mobile Ad-hoc Network (MANET) is an autonomous collection of mobile users where the network topology may change rapidly and unpredictably over time. Mobile ad-hoc networks may well complement infrastructure-based wireless networks and allow mobile users to obtain access to interact directly with one another even when they are outside the coverage area of cellular networks or wireless LAN. Similarly, MANETs may enable communication between vehicles, sensors, laptops and other mobile equipment without the need to deploy a fixed infrastructure network. Numerous dedicated routing protocols have been proposed to establish and maintain reachability between communicating nodes in such dynamic environments.

Challenged networks or Intermittently Connected Networks arise from MANETs primarily as a result of node mobility but may also come into being as a result of disconnection due to power management or interference. As a result the network becomes partitioned. Unfortunately, with current ad hoc routing protocols, packets are not delivered if a network partition exists between the source and the destination when a message is originated. Certain applications, such as real-time, constant bit rate communication may require a connected path for meaningful communication. However, a number of other application classes benefit from the eventual and timely delivery of messages, especially in the case where frequent and numerous network partitions would prevent messages from ever being delivered end to end (Vahdat &

Becker, 2000). Examples of such networks include terrestrial mobile networks, exotic media networks, military ad-hoc networks and sensor networks. These challenged networks are characterized by high latency, bandwidth limitations, high error probability, node longevity, or path stability that are substantially worse than is typical of today’s TCP/IP based networks. (Burleigh, Hooke, Torgerson, Fall, Cerf, Durst et al., 2003; Cerf, Burleigh, Hooke, Torgerson, Durst, Scott et al., 2007; Fall, 2003).

Existing TCP/IP based network protocols could not be utilized for these challenged networks since they operate on a principle of providing end-to-end inter-process communication through a concatenation of dissimilar link-layer technologies. A number of key assumptions are made regarding the overall performance of the underlying links in order to achieve smooth operation: an end-to-end path exists between a data source and its peer, the maximum round-trip time between any node pairs in the network is not excessive, and the end-to-end path loss probability is small. Unfortunately, challenged networks which may violate one or more of these assumptions, are becoming important and may not be well served by the current end-to-end TCP/IP model.

When a direct contact routing approach is applied to this type of network, the message delivery delay will be very high (Wang & Wu, 2006) and then they will get dropped by the network if delay increases further. Since many nodes are mobile nodes they will increase the delivery ratio in wireless environment (Grossglauser & Tse, 2002). Hence by using the mobility property of the nodes, there were numbers of routing protocols proposed for these partially connected networks and they are divided into replication based and knowledge based (Jain, Fall, & Patra, 2004). Replication based protocols create multiple copies of a message. A common technique used to maximize the probability of a message successfully transferred is to replicate many copies of the message in hopes that one will succeed in reaching its destination as said in Vahdat and Becker (2000). In this kind of flooding protocol, each node tries to forward every message to every one of its neighbors except the source node. This results in every message eventually being delivered to all reachable parts of the network.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 13: 2 Issues (2017)
Volume 12: 2 Issues (2016)
Volume 11: 2 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing