Energy Based Recent Trends in Delay Tolerant Networks
01 Jan 2018-pp 141-150
TL;DR: Few recent approaches which proposed different schemes to reduce the energy consumption of node and also increase the delivery probability and by using different aspects of the conservation of energy the energy efficiency has been increased.
Abstract: Energy plays very important role in any kind of network. As most of routing protocols and strategies are designed by considering the well-connected network but because of the mobility of nodes these routing protocols do not work effectively. For such kind of intermittent connectivity, Delay Tolerant Network is used. Amongst all the mobile nodes, many have a very limited amount of energy and to perform any kind of operation energy is required. So, it is necessary to reduce the consumption of energy. The effective and efficient use of energy increases the lifetime of node and network. Hence, there are some approaches which proposed different schemes to reduce the energy consumption of node and also increase the delivery probability. By using different aspects of the conservation of energy the energy efficiency has been increased. Amongst them, few recent approaches are explained in this papers which consider the energy prominently.
Citations
More filters
••
TL;DR: Numerical results prove that the proposed method drastically increases the delivery ratio and also minimizes the risk of exceeding resource consumption and packet loss, which are the main contributions of this paper.
Abstract: An opportunistic network is a wireless ad hoc network that has frequently intermittent connectivity due to nodes’ mobility. These spare, unpredictable networks aim to solve the prolonged delay paths by a store-carry-forward scheme. It is difficult to determine the appropriate nodes to forward the messages since there are few opportunistic contacts. The nodes might decide based on the obtained data of the network as a guide to reach a destination. The aforementioned technique is not helpful in case the rate of change in the network topology is higher than the rate of data gathering due to usage restrictions and uncertain available information/knowledge of the future contacts. In this paper, to cope with the challenges imposed by the un-deterministic environment, a risk assessment strategy is considered to evaluate the short and long-term impact of each decision to find the optimal node/paths. This routing scheme can take advantage of the unanticipated connection to make the routing more flexible in short time and with less buffer usage. Our proposed risk assessment algorithms that are based on MALP are mixed with the knowledge about buffer management and network capacity. The prioritized messages to be disseminated as well as better decision to take a risk are the main contributions of this paper. Moreover, the self-adaptive threshold, distributed PID controller, is considered to tackle different threshold levels for each node individually. Numerical results prove that the proposed method drastically increases the delivery ratio and also minimizes the risk of exceeding resource consumption and packet loss.
2 citations
Cites background from "Energy Based Recent Trends in Delay..."
...Some prominent examples include PROPHET [6], Energy-Aware [7], TB-SnW [8]....
[...]
••
TL;DR: An improvised version of PRP is suggested that not only considers factors such as encountered node available buffer space, energy level of battery and delivery predictability of encountered node to destination node, which results in the increase in MDR and reduced message overhead in the network.
Abstract: Delay tolerant networks(DTN) belong to a category of SHIP (Sparse,Hybrid, Intermittent,Partitioned) networks where aim is to deliver a message with acceptable delay. In the literature of DTN, many ...
••
01 Apr 2017TL;DR: A new energy efficient algorithm is proposed which forwards the packet to the nearest neighbor node which also uses the probability distribution function to forward the bundle to the next best hop which requires the least energy for the transmission.
Abstract: Delay Tolerant Networks is an emerging technique which supports for the intermittent connectivity. Previously, for transmission of bundles the end-to-end connection was required to carry out the transmission successfully. But now, using the store-carry-forward mechanism and the node mobility it is possible to transmit the data from the source to the destination even if there is no end to end connection between them. There are different routing strategies which are formed in a DTN environment to reduce the message overhead and for increasing the message delivery probability, but very few take the energy into a consideration while designing. DTN nodes have a very limited amount of energy resources which holds a great significance. To perform any kind of operation between various nodes, i.e. sending bundle, searching for the neighbor node, storing bundle, etc the energy is used. Hence, in this paper, we proposed a new energy efficient algorithm to improve the energy efficiency. This algorithm forwards the packet to the nearest neighbor node which also uses the probability distribution function to forward the bundle to the next best hop which requires the least energy for the transmission. It also narrows down the specific region for the transmission of data by using the angle based transmission. The freshly energized node is redeployed in the network. With the help of Opportunistic Network Simulator results, it is proven that the designed algorithm is more energy efficient than the previous distance based algorithm.
Cites background from "Energy Based Recent Trends in Delay..."
...The range of this mechanism [2] is increased by 300 to 1800 to find the optimal range of nodes....
[...]
••
24 Apr 2020
TL;DR: An outline to improve the delivery ratio, transmission delay and access delay of a packet in a network using SERPO and compared it with Epidemic variants using the network performance metrics message transmission (packet delivery), message relaying time (transferring time) and accessdelay ratio respectively.
Abstract: Opportunistic networks are an extension of Adhoc networks and subclass of MANET wherein network possess intermittent connectivity and store – carry – forward mechanism. During routing, if a packet transmission has been initiated by a node through Epidemic to all its neighboring nodes by producing a multiple copy resulting in the network resource consumption early. In Epidemic routing mechanism a multiple copy of a message packet has been created in the direction of inflate the message packet delivery ratio contrary it also enhances additional buffer capacity of a network. By proposing a SERPO approach the packet transmission happens only on a selected route which find out with the help of Dijkstra’s algorithm and for minimizing the packet congestion using Weighted Fair Queuing. In this paper we propose an outline to improve the delivery ratio, transmission delay and access delay of a packet in a network using SERPO. We broadly simulate the proposed scheme in ONE simulator and compared it with Epidemic variants using the network performance metrics message transmission (packet delivery), message relaying time (transferring time) and access delay ratio respectively.
References
More filters
••
25 Aug 2003TL;DR: This work proposes a network architecture and application interface structured around optionally-reliable asynchronous message forwarding, with limited expectations of end-to-end connectivity and node resources.
Abstract: The highly successful architecture and protocols of today's Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme environments lacking continuous connectivity, many such networks have their own specialized protocols, and do not utilize IP. To achieve interoperability between them, we propose a network architecture and application interface structured around optionally-reliable asynchronous message forwarding, with limited expectations of end-to-end connectivity and node resources. The architecture operates as an overlay above the transport layers of the networks it interconnects, and provides key services such as in-network data storage and retransmission, interoperable naming, authenticated forwarding and a coarse-grained class of service.
3,511 citations
••
22 Aug 2005TL;DR: A new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination, which outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered.
Abstract: Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks fall into the general category of Delay Tolerant Networks. There are many real networks that follow this paradigm, for example, wildlife tracking sensor networks, military networks, inter-planetary networks, etc. In this context, conventional routing schemes would fail.To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention, which can significantly degrade their performance. Furthermore, proposed efforts to significantly reduce the overhead of flooding-based schemes have often be plagued by large delays. With this in mind, we introduce a new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination.Using theory and simulations we show that Spray and Wait outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered; its overall performance is close to the optimal scheme. Furthermore, it is highly scalable retaining good performance under a large range of scenarios, unlike other schemes. Finally, it is simple to implement and to optimize in order to achieve given performance goals in practice.
2,712 citations
••
TL;DR: A probabilistic routing protocol for intermittently connected networks where there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts.
Abstract: We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts. We propose a probabilistic routing protocol for such networks.
2,530 citations
••
30 Aug 2004TL;DR: This work forms the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance, and proposes a framework for evaluating routing algorithms in such environments.
Abstract: We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no contemporaneous end-to-end path may ever exist. This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to find an existing end-to-end path. We propose a framework for evaluating routing algorithms in such environments. We then develop several algorithms and use simulations to compare their performance with respect to the amount of knowledge they require about network topology. We find that, as expected, the algorithms using the least knowledge tend to perform poorly. We also find that with limited additional knowledge, far less than complete global knowledge, efficient algorithms can be constructed for routing in such environments. To the best of our knowledge this is the first such investigation of routing issues in DTNs.
1,854 citations
••
TL;DR: This article captures the state of the art in routing protocols in DTNs with three main approaches: the tree approach, the space and time approach, and the modified shortest shortest path approach.
Abstract: n the last few years, there has been much research activity in mobile, wireless, ad hoc networks (MANET). MANETs are infrastructure-less, and nodes in the networks are constantly moving. In MANETs, nodes can directly communicate with each other if they enter each others' communication range. A node can terminate packets or forward packets (serve as a relay). Thus, a packet traverses an ad hoc network by being relayed from one node to another, until it reaches its destination. As nodes are moving, this becomes a challenging task, since the topology of the network is in constant change. How to find a destination, how to route to that destination, and how to insure robust communication in the face of constant topology change are major challenges in mobile ad hoc networks. Routing in mobile ad hoc networks is a well-studied topic. To accommodate the dynamic topology of mobile ad hoc networks, an abundance of routing protocols have recent-For all these routing protocols, it is implicitly assumed that the network is connected and there is a contemporaneous end-to-end path between any source and destination pair. However, in a physical ad hoc network, the assumption that there is a contemporaneous end-to-end path between any source and destination pair may not be true, as illustrated below. In MANETs, when nodes are in motion, links can be obstructed by intervening objects. When nodes must conserve power, links are shut down periodically. These events result in intermittent connectivity. At any given time, when no path exists between source and destination, network partition is said to occur. Thus, it is perfectly possible that two nodes may never be part of the same connected portion of the network. Figure 1 illustrates the time evolving behavior in intermittent-ABSTRACT Recently there has been much research activity in the emerging area of intermittently connected ad hoc networks and delay/disruption tolerant networks (DTN). There are different types of DTNs, depending on the nature of the network environment. Routing in DTNs is one of the key components in the DTN architecture. Therefore, in the last few years researchers have proposed different routing protocols for different types of DTNs. In this article we capture the state of the art in routing protocols in DTNs. We categorize these routing protocols based on information used. For deter-ministic time evolving networks, three main approaches are discussed: the tree approach, the space and time approach, and the modified shortest …
861 citations