IRJET- Vitality Rooted Modern Trends in Delay Tolerant Networks

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395-0056

Volume: 06 Issue: 05 | May 2019

p-ISSN: 2395-0072

www.irjet.net

Vitality Rooted modern Trends in Delay Tolerant Networks Shivam Awasthi1, Dr. Hari Om Sharan2 1M.Tech.

Student, Department of Computer Science Engineering, Rama University, Uttar Pradesh, Kanpur Department of Computer Science Engineering, Rama University, Uttar Pradesh, Kanpur

2Professor,

---------------------------------------------------------------------***------------------------------------------------------------

Abstract. Vitality assumes significant job in any sort of system. As the greater part of steering conventions and systems are planned by considering the well-associated arrange but since of the versatility of hubs these directing conventions don't work adequately. For such sort of irregular availability, Delay Tolerant Network is utilized.

Among all the versatile hubs, many have an exceptionally restricted measure of vitality and to play out any sort of activity vitality is required. Along these lines, it is important to lessen the utilization of vitality. The powerful and effective utilization of vitality builds the lifetime of hub and system. Henceforth, there are a few methodologies which proposed various plans to lessen the vitality utilization of hub and furthermore increment the conveyance likelihood.

By utilizing various parts of the preservation of vitality the vitality effectiveness has been expanded. Among them, couple of ongoing methodologies is clarified in this papers which consider the vitality unmistakably.

them, a portion of the exceptionally popular directing procedures are: plague [4], Spray-and-Wait [5], and PROPHET [6] [7]. These procedures are particularly celebrated, yet they didn't think about the vitality requirements.

DTN utilizes the store convey and forward system to advance the bundle from source to goal. This instrument stores the message in each hub which comes into the contact which builds the replication of message, subsequently results in the utilization of the assets which are extremely restricted in sum. Henceforth, the steering conventions portrayed in [8], [9], [10], and [11] are utilized to improve the use of assets adequately and furthermore to expand the conveyance proportion of the message. In this paper, in area II related work is clarified.

In area III different ongoing patterns dependent on vitality in DTN are clarified in subtleties and toward the finish of this segment, the near investigation has been finished. In the last area, the end is clarified.

Keywords: Vitality-aware, priority transmission, robustness, location-based, store-carry-forward, Delay Tolerant Networks

2 Related Work:

1 Introduction:

In [12], node forwards the packet when and only when it has n neighbor nodes in its maximum transmission range to reduce the vitality consumption. But it is difficult to decide the value of n. In [13], F. D. Rango, S. Amelio, and P. Fazio implement the protocol, which was an improvement over the [12]. Previously the value of the n has to be set statically but in [13] the value has been chosen dynamically. It chooses a value based on the current neighbor node and the energy level. In [14], the trade-off has been achieved in between the forwarding efficiency and the energy preservation.

Many Routing protocols have been proposed to decrease the quantity of duplicates of the message and to expand the conveyance likelihood proportion, yet not many consider the vitality imperatives into a thought. Presently multi day's numerous cell phones like wireless, workstation, PCs, tablets have the constrained measure of vitality and these gadgets expend considerably more vitality for the correspondence reason. So it is important to moderate vitality in DTN. There are different things which are in charge of the exhaustion of vitality for ex. hub versatility, the span of a cushion and wasteful spending plan and so forth. So it is important to use the suitable directing methodology or steering convention to decrease the utilization of vitality. Evaluation [3] in DTN demonstrates that the vast majority of the steering methodologies are broad vitality wasteful and subsequently the vitality utilization of hub additionally expanded. This is mostly caused because of the portability of a hub, message size, and sending methodology. There are different directing methodologies in DTN. Among

Š 2019, IRJET

|

Impact Factor value: 7.211

The routing protocols generally classified into two categories: topology based and location based. The topology based protocol uses the link information to find the path. And the Location based protocol uses the location information of the node, destination and neighbor nodes.

In [15]-[17], the topology based routing protocols are being studied. In [18] - [22], few location-based routing protocols has been designed in DTN and described in detail.

|

ISO 9001:2008 Certified Journal

|

Page 1759

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395-0056

Volume: 06 Issue: 05 | May 2019

p-ISSN: 2395-0072

www.irjet.net

3 Vitality Rooted Strategies: 3.1 A Novel Vitality Aware Priority Transmission Scheme based on Context-Metric:

implemented, i.e. connectivity buffer and persistent storage. To manage the message effectively, two kinds of units are implemented here Admission Control Unit and Transmission Control Unit.

This ensures to achieve the high probability of delivery of HIGH priority messages. It also introduces the new buffered model which consists of the Admission Unit and Transmission Control Unit. This Context Metric queuing method can also be called as CEAMS [23]. It also introduces the Vitality Aware message transmission strategy.

Admission control Unit: This checks whether the buffer is full or not. If the buffer is full then it drops the LOW priority message. Based on the level of priority it decides whether to send a message to connectivity buffer or to persistent storage. If a message has the HIGH priority then it is sent to Persistent storage otherwise to connectivity buffer.

In many cases the importance of the message is not measured while transmitting the data. Sometimes the importance of the message needs to be taken into consideration when the transmission of the message is crucial i.e. disaster relief application or military networks.

With the depletion of energy the chance of the message delivery decreases. In queuing method the message gets dropped if the priority of the message is not considered. As the priority is not given, the message may be queued at the end of the list and the message get drop later on due the message Time to live (TTL) or the unavailability of resources. If the message does not have the priority assigned, then it may suffer from the multiple replications due to the long delay. So here a context metric queuing method has been implemented to accomplish the high delivery ratio of the HIGH priority message and also to use the energy of node effectively.

Transmission Control Unit: Based on the remaining energy it determines whether the intermediate node is capable of delivering the message or not. Depends on the certain criteria it takes a particular action. If the energy of an intermediate node is greater than 75%, then the intermediate node accepts all the messages. If it is in between 75% to 25%, then it accepts HIGH and MEDIUM messages only, and if remaining energy is less than 25% then it accepts only HIGH priority messages.

3.2 A Robust Energy Efficient Epidemic Routing Protocol: In this protocol mainly two things are taken into consideration while forwarding the message. It checks whether the energy of the intermediate node is greater than the current node. If it is greater then and only then it forwards the message to the intermediate node. And it also checks the buffer space is available or not, to store the data. The network is said to be robust [24] if node consumes very less energy and the lifetime of node increase.

Node Delivery Capability: The NDC states that the higher the Energy, Speed and the lesser the Distance to the destination, increase the probability of delivering. It identifies the probability that the message will reach to destination successfully or not.

Remaining Energy, Estimated Distance and Speed are taken into consideration and utilized while taking the queuing decision of message.

This method takes these things into consideration:

Vitality Aware Transmission Scheme: The source node stores the information until and unless it comes in the contact of another node. When an intermediate node comes in the range of source node then the summary vector is exchanged between both the nodes i.e. index of messages. The nodes can request the message they don’t have from another node. But this does not consider the priority of the message.

In the implemented system the authors initialized the three kinds of level priorities to the messages, i.e. LOW, MEDIUM, and HIGH. Two kinds of Buffers are

© 2019, IRJET

|

Impact Factor value: 7.211

|



The node exchanges the summary vector, free buffer size available and the current energy available with its neighbor node



Then the node checks the remaining energy of a neighbor node. It checks whether the neighbor nodes energy is greater or not. It also checks messages which node has to copy to neighbor node and the free buffer space available or not, to store the message



If the neighbor node has the more remaining energy and the free buffer space than the current node, then node copies the message to Transmit List

ISO 9001:2008 Certified Journal

|

Page 1760

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395-0056

Volume: 06 Issue: 05 | May 2019

p-ISSN: 2395-0072

www.irjet.net



If the current node has the remaining energy more than neighbor node and also has the free buffer space, then it will keep the message information to Receiving From List



message and it stores the copy of that message



condition. Hubs have been considered as the circle molded and with sweep r, which means the inclusion scope of that hub. The directions of the hub are meant by x, y and z. This displayed plan utilizes the area data by utilizing Global Positioning System (GPS) to decrease the outside overhead of the system. The accompanying suppositions are contemplated:All nodes know their current location information by using the 3D coordinates of nodes(x, y, z).

This presented scheme uses the location information by using Global Positioning System (GPS) to reduce the external overhead of the network. The following assumptions are taken into consideration:

In epidemic routing if the buffer space is not available, then it drops the old message from the buffer which results in the reduction of delivery probability. Hence, this robust energy efficient epidemic routing protocol methodology is implemented to increase the message delivery probability and also use the energy effectively.

3.3 3D Location-Based Energy Aware Routing Protocol: This steering utilizes the area data for genuine DTN to decrease its overhead. It likewise executes the vitality mindful steering plan to expand the lifetime of the system.

The greater part of the steering conventions is structured based on the 2-Dimensional (2D) area based data. Just few directing systems are found by thinking about the 3D area based data in Ad hoc systems, which do not function admirably in DTN. Along these lines, it is the first run through the 3D area based directing convention [25] is actualized for the DTN. As a rule, all hubs in DTN are remote which is conveyed everywhere throughout the 3D

Expected zone: Before starting the sending of messages from source to destination the source node first finds the path from source to destination at time t0. And it is possible that the destination may move at the speed of v from its position. So source node estimates the expected zone of destination at time t1. Hence, the expected zone must be a sphere with the radius of v (t1-t0). If the source does not know the speed of destination, then it is difficult to estimate the expected zone.



The limited amount of energy and buffer space.



Transmission speed has to be pretty enough to forward the message when both nodes come into the contact range.

In the event that the greatest transmission scope of the hub is u, at that point it is expanded to r to discover the neighbor. On the off chance that it doesn't discover the neighbor, at that point source forward the message by restrictive flooding to all hubs which go under the solicitation zone. In the best case, the message is sent by

Routing schemes: Neighbor discovery: Here the need of the message isn't considered. The message starts things out is added to support earlier. At the point when a source hub comes in

Impact Factor value: 7.211

All nodes also exchange the message information by using the “hello-reply” message.

Transmission conspires: The hub right off the bat checks for the ongoing ways to the goal. On the off chance that any ongoing way exists, at that point it advances the bundle through that ongoing way. In the event that there isn't any ongoing way, at that point it will check for the following best bounce. In the event that a next best jump is additionally not accessible, at that point it will check the most extreme transmission scope of the hub.

Request zone: If the source does not find the path for the destination then it increases the coverage range to a maximum radius. After increment of the radius if a source node does not find the proper next hop for forwarding the message, then the source node broadcast the message to all the nodes which come under the request zone. It uses the certain condition strategy for broadcasting the message.

|



the contact scope of any better bounce hub, at that point it sends the message according to the cradle lining. The source hub right off the bat communicates the HELLO message to the whole hub which comes into the transmission go u for example half of the most extreme transmission scope of hubs. The accepting hub checks the neighbor list. On the off chance that the source hub is as of now in its neighbor list, at that point it drops the HELLO parcel. Something else, acknowledge the Hello parcel and answer with an ACK bundle. It is important to refresh the neighbor list in a continuous way.

Expected Zone and Request Zone:

© 2019, IRJET

After the completion of comparison with all the nodes, the message is broadcasted and the neighbor who has the higher remaining energy and high free buffer space receives the

|

ISO 9001:2008 Certified Journal

|

Page 1761

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395-0056

Volume: 06 Issue: 05 | May 2019

p-ISSN: 2395-0072

www.irjet.net

picking the best jump hub with the assistance of actualized plot. In the most pessimistic scenario, the condition flooding plan must be connected to flood the message to demand zone, which is dictated by the speed and area of the source and goal hub nail overhead of the system.

 

3.4 Augmented DTN based Energy Efficient Routing Protocol for Vehicular Ad hoc Networks:

All nodes know their location information.

The system can able to estimate the distance between two nodes, path between them and the time required.

Transmission range selection based on the angular region:

Vehicular Ad-hoc Network (VANET) is gotten from the Mobile Ad-hoc Network (MANET). Enlarged DTN based Energy Efficient Routing Protocol for Vehicular Ad hoc Networks (ADTNEER) [26] is a mix of different systems, for example, store stay splash, association lifetime and connection state data. It uses those various methodologies to give preferred execution over the VANET. It additionally utilizes the rakish locale system for choosing the best reasonable next bounce. VANET essentially comprise of two elements: vehicle and Road-side Infrastructure Units (PSU). The vehicle is the moving substance and PSU is the fixed elements which are associated with the web. VANET hub can speak with different vehicles legitimately. Due the versatility of hubs, it is challengeable to perform start to finish correspondence.

The choice of the particular area for the transmission of information decreases the overhead of transmission. Out and about, a vehicle goes in the one heading. Consequently, by constraining the point of transmission overhead is diminished. Right off the bat, source hub discovers its area and data about the goal and neighbors. At first, the point of 30 is introduced and can be expanded up to 180. In the event that inside the transmission run the hub isn't discovered, at that point the transmission edge is expanded by 15 on both the side with considering the source and goal hub vector.

Association Lifetime: The vitality depleting rate and the versatility of hubs are utilized to foresee the association lifetime. Every hub has memory space which stores the data of residual vitality; vitality spent on effective correspondence and got flag quality. This data additionally predicts the association lifetime.

There are different components which are in charge of the execution of the system, vitality, portability, and so forth. It is extremely hard to accomplish the vitality productivity and dependability for the transmission of information when the development of the vehicle is quick in the system. Consequently, for that reason ADTNEER has been proposed to accomplish preferable execution over the VANET. It utilizes different methodologies like store stay splash, association lifetime and connection state data to take the proper choice for sending the information.

Following two assumptions are being considered:

Store-stay-splash component: In this proposed instrument the message is duplicated to the hub or sent to the hub which guarantees to go nearer the goal hub. Every hub dependably finds the better next bounce for the further transmission and picks the best way for the parcel transmission. This improves the productivity.

Table 1 Comparative Study Objective of Study A Novel Energy Aware Priority Transmission Scheme based on Context-Metric

© 2019, IRJET

|

Strategies or Schemes Queuing Management Energy-aware transmission scheme Message forwarding

Advantages

Limitations

Results

Improve message delivery in DTN

Only a limited amount of energy efficiency is achieved The message redundancy ratio is not reduced to a full extent. Still, it is possible to reduce the message redundancy ration

It achieves a high delivery rate of message with high Priority and effective utilization of nodes energy in transmission

Impact Factor value: 7.211

|

ISO 9001:2008 Certified Journal

|

Page 1762

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395-0056

Volume: 06 Issue: 05 | May 2019

p-ISSN: 2395-0072

www.irjet.net

A Robust Energy Efficient Epidemic Routing Protocol

By considering: Nodes remaining energy Free buffer space available

No need to set any predefined value Number of nodes does not affect the energy consumption of the node

3D Location-Based Energy Aware Routing Protocol

Location based (3D Location information i.e. GPS)

No need to establish and maintain global routing table Less control overhead

Augmented DTN based Energy Efficient Routing Protocol for Vehicular Ad hoc Networks

Geographical region Angular based Store-stay-spray Connection Lifetime prediction Link state information

It is reactive protocol, i.e. it takes routing decision to forward the packet to the destination

4 Conclusion

References 1. K. Fall, and S. Farrell, “DTN: An architectural retrospective,” IEEE Journal on Selected Areas in Communications, vol. 26, no. 5, pp. 828- 836, Jun. 2008.

2. K. Fall, “A delay-tolerant network architecture for challenged internets,” in Proceedings of the

|

Impact Factor value: 7.211

Network lifetime is extended & delivery probability is also improved

Introduced energy aware scheme to save power & extend the network lifetime Reduce network overload ADTNEER given results shows better performance than VANET

2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, ser. SIGCOMM ’03. New York, NY, USA: ACM, pp. 27–34, 2003.

3. R. Cabacas, H. Nakamura, I. Ra, “Performance Evaluation of Routing Protocols in Delay Tolerant Networks in terms of Energy Consumption,” Proceedings of the 2nd International Conference on Smart Media and Applications. 2013.

4. A. Vahdat and D. Becker, “Epidemic Routing for Partially-Connected Ad Hoc Networks,” CS-2006, Duke University, Tech. Rep., Apr. 2000.

5. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and wait: An efficient routing scheme for intermittently connected mobile networks,” in Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, ser. WDTN ’05. New York, NY, USA: ACM, pp.

252–259, 2005.

6. A. Lindgren, A. Doria, and O. Schel´en, “Probabilistic routing in intermittently connected networks,” SIGMOBILE Mob. Computer. Communication . Rev., vol. 7, no. 3, pp. 19– 20, Jul. 2003.

7. A. Lindgren, A. Doria, E. Davies, and S. Grasic, “Probabilistic routing protocol for intermittently connected networks,” Internet Requests for Comments, RFC Editor, RFC 6693, August 2012.

Every one of the procedures referenced above think about vitality while structuring the methodologies. They accomplished their objective to execute the methodology with expanding the vitality effectiveness. Every one of the systems has a few constraints which are referenced in the correlation table. So by diminishing every one of these constraints the compelling steering convention can be executed which will devour less vitality and the system lifetime increment. All previously mentioned techniques are as of late proposed procedures. Every methodology has some particular claim to fame and an alternate outcome. Be that as it may, all uses the vitality all around viably.

© 2019, IRJET

with maintaining delivery rate Size of buffer, size of message, varying mobility speed & data rate is not considered in simulation setting of this protocol Congestion control and Priority of the message is not considered here Does not work fine in large density of node The message redundancy ratio is not reduced to full extent still it is possible to reduce the message redundancy ratio with maximum delivery rate

|

ISO 9001:2008 Certified Journal

|

Page 1763

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395-0056

Volume: 06 Issue: 05 | May 2019

p-ISSN: 2395-0072

www.irjet.net

8. E. Daly and M. Haahr, “Social network analysis for information flow in disconnected delay-tolerant manets ,” Mobile Computing, IEEE Transactions on, vol. 8, no. 5, pp.

606–621, May 2009.

9. E. Altman, A. Azad, T. Basar, and F. De Pellegrino, “Optimal activation and transmission control in delay tolerant networks,” in INFOCOM, 2010 Proceedings IEEE, pp. 1–5, , March 2010.

10. E. C. R. de Oliveira and C. V. N. de Albuquerque, “NECTAR: A DTN routing protocol based on neighborhood contact history,” in Proceedings of the 2009 ACM Symposium on Applied Computing, ser. SAC ’09. New York, NY, USA: ACM, pp. 40–46, , 2009.

11. S. Nelson, M. Bakht, and R. Kravets, “Encounter-based routing in DTNs,” in INFOCOM 2009, IEEE, pp. 846–854,, April 2009.

12. X. Lu and P. Hui, “An energy-efficient n-epidemic routing protocol for delay tolerant networks,” in Networking, Architecture and Storage (NAS), 2010 IEEE Fifth International Conference on, pp. 341–347, July 2010.

13. F. De Rango, S. Amelio, and P. Fazio, “Enhancements of epidemic routing in delay tolerant networks from an energy perspective,” in Wireless Communications and Mobile Computing Conference (IWCMC), 2013 9th International, pp. 731–735, July 2013.

14. M. Khouzani, S. Eshghi, S. Sarkar, N. B. Shroff, and S. S. Venkatesh, “Optimal energy-aware epidemic routing in DTNs,” in Proceedings of the Thirteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, ser. Mobile Hoc ’12. New York, NY, USA: ACM, pp. 175–182, 2012.

15. S. Jain, K. Fall, and R. Patra, “Routing in a delay tolerant network, vol. 34, no. 4, Portland, OR, United states, pp. 145 – 157, 2004.

16. Z. Zhang, “Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges,” Communications Surveys & Tutorials, IEEE communications Surveys & Tutorials, IEEE, vol. 8, no.

1, pp. 24–37, 2006.

17. L. Zhang, X.-W. Zhou, J.-P. Wang, Y. Deng, and Q.-W. Wu, “Routing protocols for delay and disruption tolerant networks,” Ruan Jian Xue Bao/Journal of Software, vol. 21, no. 10, pp. 2554 – 2572, 2010.

18. J. Shen, S. Moh, and I. Chung, “A priority routing protocol based on location and moving direction in delay tolerant networks,” IEICE Transactions on Information and Systems, vol. e93-d, no. 10, pp. 2763 – 75, 2010.

19. F. Yasmeen, S. Urushidani, and S. Yamada, “A probabilistic positionbased routing scheme for delaytolerant networks,” Piscataway, NJ, USA, pp. 88 – 93, 2009.

20. G. Luo, J. Zhang, K. Qin, and H. Sun, “Location-aware social routing in delay tolerant networks,” IEICE

© 2019, IRJET

|

Impact Factor value: 7.211

Transactions on Communications, vol. E95-B, no. 5, pp.

1826 – 9, 2012.

21. X. Lu, P. Hui, D. Towsley, J. Pu, and Z. Xiong, “Lopp: a location privacy protected anonymous routing protocol for disruption tolerant network,” IEICE Transactions on Information and Systems, vol. E93-D, no. 3, pp. 503 – 9, 2010.

22. Y. Tian and J. Li, “Location-aware routing for delay tolerant networks,” Beijing, China, 2010.

23. R. Cabacas, and I. H. Ra, “A Novel Energy-Aware Priority Transmission Scheme based on Context-Metric Queuing for Delay Tolerant Networks” in Proc. IEEE Information Science, Electronics and Electrical Engineering, vol. 2, pp. 1095-1099, 2014.

24. B. B. Bista, and D. B. Rawat, "A Robust Energy Efficient Epidemic Routing Protocol for Delay Tolerant Networks,” in Proc. IEEE International Conference on Data Science and Data Intensive Systems, pp. 290-296, 2015.

25. C. Tian, L. Ci, B. Cheng, and X. Li, “A 3D Location-Based Energy Aware Routing Protocol in Delay Tolerant Networks,” in Proc. IEEE Dependable, Autonomic and Secure Computing, pp. 485-490, 2014.

26. B. Paramasivan, M. Bhuvaneswari, and K. M. Pitchai, “Augmented DTN based Energy Efficient Routing Protocol for Vehicular Ad hoc Networks”, ,” in Proc. IEEE SENSORS, pp. 1-4, 2015.

|

ISO 9001:2008 Certified Journal

|

Page 1764