Available online at ScienceDirect. Procedia Computer Science 57 (2015 )
|
|
- Marcus Beasley
- 6 years ago
- Views:
Transcription
1 Available online at ScienceDirect Procedia Computer Science 57 (215 ) rd International Conference on Recent Trends in Computing 215 (ICRTC-215) Location Information and Inter-Contact based Routing approach for Delay Tolerant Networks Savita a*, Prof. D.K. Lobiyal b a* Research Scholar, Jawaharlal Nehru University, New Mehrauli Road, New Delhi 1167, India b Professor, Jawaharlal Nehru University, New Mehrauli Road, New Delhi 1167, India Abstract Delay tolerant networks (DTNs) are often susceptible to the problem of high delay. Quite often, the major reason behind the high delay in the network is lack of complete path from source to destination. One of the greatest challenges faced by DTN is to enable end to end communication in heterogeneous environment that possesses severe performance impairments. The DTN routing problem, amounts to a constrained optimization problem where edges may be unavailable for extended periods of time and storage constraints exists at each node. The proposed protocol aims at minimizing the energy required for communication by reducing several overheads. It determines the delivery probability through each of its neighbours and delivers copies of message accordingly. The proposed protocol directionalizes the delivery of packets according to the location information of the destination. This study will focus on directional dissemination of messages which results in forwarding small number of messages. 215 The The Authors. Published Published by Elsevier by Elsevier B.V. B.V. This is an open access article under the CC BY-NC-ND license ( Peer-review under responsibility of organizing committee of the 3rd International Conference on Recent Trends in Peer-review under responsibility of organizing committee of the 3rd International Conference on Recent Trends in Computing 215 (ICRTC-215) Computing 215 (ICRTC-215). Keywords: Delay Tolerant Networks (DTNs), Power Control, Oportunistic Nerworks, Overhead, 1. Introduction Wired and wireless devices are able to communicate directly with each other when they fall within each other transmission range. Delay Tolerant Network (DTN) is basically dealing with frequent disconnection and disruption in connectivity among nodes in the network. This causes high delay in transmitting data to the destination. DTN addresses the issues of disconnection arises in the heterogeneous networks. This issue underpins the popularity of the DTN among the research community. To maintain the high reliability of network in the presence of frequent topology changes attract researchers to explore the area. DTN have so many applications like Wildlife Monitoring, Village Networks, Military Applications, and disaster response networks etc. [1]-[3], which provides an extensive scope of research. The requirement of resource depends on types of application area. For example, in disaster response networks where resources/infrastructures are disrupted or destroyed. It becomes challenging to establish communication in such scenario. In this network battery power plays vital role in increasing the life time of the network. Hence, battery The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license ( Peer-review under responsibility of organizing committee of the 3rd International Conference on Recent Trends in Computing 215 (ICRTC-215) doi:1.116/j.procs
2 1368 Savita and D.K. Lobiyal / Procedia Computer Science 57 ( 215 ) power needs to be used efficiently and for that an energy efficient routing protocol should be designed for communication. Therefore, energy efficient routing schemes where system performance is not reduced are still an open issue in DTN. As discuss in previous there is no end to-end connectivity in DTN. Factors such as link failures, discharged batteries may be the reason of frequent disconnection in DTN. Message routing and node mobility have a great impact on energy consumption. The proposed work is to incorporate location information with may further reduce the requirement of energy consumption in communication. This study focuses on directional dissemination of messages with delivery probability of each of its neighbours which may result in forwarding small number of copies of a message. Some experimental results show that power consumption is very less in sleep and power off states and in idle state consumption is almost as high as in receive state. Some research work that deals with power consumption only considers the energy consumed in data transmission and tried to reduce the number of packets in the network. Obviously it degrades the system performance. According to S. Yang et al.[4], although the transmission consumes more energy as compared to receiving and idle listening, idle listening mode also consumes lot of energy as aforementioned. Mobile nodes spend most of its time in an idle listening mode searching for potential neighbours in DTN. Therefore, energy used in other states than data transmission cannot be ignored. On the contrary, in DTN, most of the energy is consumed just for contact discovery [5]. Therefore, in order to use energy efficiently one may have to limit not only to transmission, but also number of nodes that are active each time. There are two ways to reduce energy consumption in DTN [5], one is known as reduce forwarding and other is reduce beaconing. Beaconing is a periodic signalling for the node discovery for message reception. The rest of the paper is organized as follows. Section 2 gives a brief explanation about related work and ongoing research in the area of DTN routing. Section 3 elaborates the proposed network model and the proposed algorithm is discussed in Section 4. Further, the simulation setup and results are discussed in Section 5. Finally, Section 6 concludes the work and gives future directions. 2. Related Work There has been a considerable amount of work in the area of DTN routing addressed in[1],[2],[6],[7],[8],[9],[1][11], and [12]. There exist many routing algorithms for DTN, but only some of them consider energy constraint. Some researches proposed framework for DTN based on its characteristics. S. Jain et al. [3]proposed number of algorithms depending on the amount of knowledge about the traffic demand and topology characteristics there are four knowledge oracles, based on given oracle availability. They designed zero knowledge, partial knowledge, and complete knowledge algorithms. If complete knowledge is available, the mobile node schedules the discovery of contact and save energy to the maximum extent[6]. Another type of protocols based on social feature. Social feature based routing algorithm [13]-[17] are based on positive and negative features such as community, centrality, similarity, friendship and selfishness. These properties are used to build a social graph which is the most popular way to study social relationships. It is a global mapping of nodes and their relationship. An edge in contact graph represents the past encounter between the nodes. S. Merugu et al. [12] proposed Space and Time routing protocol. This protocol minimizes end-to-end delivery delay. A. Vahdat et al.[18]designed epidemic routing protocol, which uses the flooding method when two nodes come into the range of each other. Spray and Wait [19] approach which is a combination of epidemic and direct algorithms. Instead of blindly forwarding message to all or some nodes, the forwarding decision according to history based routing is made on predictable fashion. One example of this type of approach is proposed by Anders L. et al. [2] called probabilistic-routing protocol (PROPHET). C. Becker et al.[21]proposed World Model Based Routing (WMBR) approach. WMBR uses world models for better selection of relaying nodes and to find destination location without the use of flooding. World model has location information about the user profiles, building charts road map s etc. The mobility of data mules is controlled in some in an important category of DTN routing schemes to deliver messages among other nodes.
3 Savita and D.K. Lobiyal / Procedia Computer Science 57 ( 215 ) Message ferrying [22]is an example of such protocols M.Y.S. Uddin et al. [6] proposed ICR. This protocol takes advantage of recurrent mobility and contact patterns which are naturally present in the network. In ICR, the major objective is to identify more reliable routes and control replication, and to forward the messages depending on the estimation of route delay and delivery probability. 3. Network Model Each node maintains a set of neighbours which it encounters. We use intercontact graph instead of encounter graph. In intercontact graph, vertex represents an encounter between two nodes and an edge represents a delay between two encounters. Each edge, ab ac maintained by two values ( (ab ac),( σ 2 ac)), where (ab ac) is the average delay elapsed on node a between meeting nodes b and c,and ),( σ 2 ac) is the corresponding delay variance. Path in intercontact graph is represented as contact node for example (ab d) is a path from node ab to d. Suppose d is the destination node. Path delay represents as δ (ab d) and path variance as σ 2 (ab d).these are sum of edge delays and variances respectively[6]. 4. Routing Algorithm The entry for destination d at vertex ab consists of the path delay and variance. This entry is different from typical (eg. wired network) network entry, where we have only one value per destination. In the proposed algorithm, both values are considered as a parameter summary of the delay distribution. The delay distribution is used to determine the message delivery probability. Message independent path cost is defined as (1) This cost shows favour towards those paths with has less delay and delay variance. Each vertex ab in intercontact graph associated with two routing tables, one at node a and other at node b. When contact between two nodes a and b occur, they update each other s routing table for vertex ab. Considers a node b that comes in contact with node a. Node b recomputed its optimal paths to each of the destination and share it with node a. For every neighbour l N j (N j is set of neighbours of b) the mean, delay, variance and cost are first computed. (2) (3) (4) Then the optimal cost is found as: = arg (5) Node b now send delay l * and var l * to node a as a mean delay and variance of the destination w via b(optimal path). Node a update its routing table with d(ab d)=delay l and σ 2 (ab d) = var l. Similarly, node a updates routing table of node b [6].
4 137 Savita and D.K. Lobiyal / Procedia Computer Science 57 ( 215 ) When node a meets node other than destination, it forwards some copies to the encountered nodes. Suppose node a has a message with L copies to convey to w, and it comes in contact with its neighbour b. The node update time-to-live (TTL) field of the message. Later, it determines the delivery probability P c through each of its neighbours c, as follows; P c = P{< delay TTL /delay>} Where ф(.) is the Corresponding Distribution Function of normal distribution. Further, neighbours are logically arranged by delivery probability P c in descending order. Each neighbour c is allocated P c * L copies and these allotments are subtracted from L. This continues until all neighbours have been considered or L runs out [6]. We used directional delivery of packets towards the destination. It finds the location of the destination and then transfers the copies of the message to those who are in the direction of the destination. The incorporation of location information in the above approach and further reduces the energy consumption in communication. Our proposed scheme focused on directional forwarding of messages which results in a forwarding small number of messages. (6) Fig. 1 Location Calculation [28] As shown in Fig. 1 according to the location of the destination, calculation of area (Request zone) is possible[27]. The nodes present in this area have more chances of delivery. Therefore, in our approach we only forward the copies from the nodes which fall this area. This reduces the number of copies in the network and also the communication energy. 5. Simulation Setup and Results We used simulator THE ONE. This is a simulator written in Java developed for DTN. This section presents various experiments conducted to establish the efficiency and effectiveness of proposed algorithm. Here, we have evaluated the performance of the proposed Intercontact Routing using Location Information with other
5 Savita and D.K. Lobiyal / Procedia Computer Science 57 ( 215 ) protocols such as epidemic, spray-and-wait and. The comparative analysis between the proposed protocol and the existing protocols with similar simulation parameters are considered. We have evaluated different protocols with Map Based Movement model (MBM) because it captures the recurrent patterns efficiently. MBM maps data of roads and streets. In all simulation, a warm up period of 1 seconds is used. In our evaluation we focused on overhead because high overhead shows the high energy consumption. We use the (45m, 34m) area and the creation interval is seconds. It means creation of a new message in every 25 to 35 seconds. The time to live (TTL) of the messages created by the host group is 3 minutes and the size of the messages is in between 5KB- 1MB. We used Bluetooth interface for all nodes and the transmission speed is 25kbps. Delivery probability No of Nodes epidemic (a) overhead epidemic No of Nodes (b)
6 1372 Savita and D.K. Lobiyal / Procedia Computer Science 57 ( 215 ) Fig. 2. Varying Number of nodes (a) Delivery probability (b) overhead Delivery probability Buffer Size (a) epidemic 12 1 overhead epidemic snw prophet Buffer Size (b) Fig. 3. Varying Buffer Size (a) Delivery probability (b) overhead
7 Savita and D.K. Lobiyal / Procedia Computer Science 57 ( 215 ) Delivery probability No.of Initial Copies epidemic Overhead (a) No. of Initial Copies Epidemic (b) Fig. 4. Varying No. of initial copies (a) Delivery probability (b) overhead We perform three group of simulation with varying node density, buffer size and number of initial copies of messages as shown in Fig. 2, 3, 4 respectively. First, we discuss the comparative results of different protocol with varying node density. For this simulation we use the buffer size of 5M, that means buffer have a capacity to store 5 messages at a time. Number of initial copies for messages is 35. From the results, it is visible that there has been decrease in the overheads of our protocol except prophet in case of number of nodes 1, 2, 3, 4, 6 and 7 as shown in Fig. 2(b), which means for dense networks the proposed protocol performs better than the all other protocols. This happens due to the less number of copies in the network for messages. The proposed protocol sent messages only to better nodes. Fig. 2(a) shows delivery probability versus number of nodes. From the results, it is visible that proposed protocol has equal or reduced delivery probability. Second simulation presents the results with varying buffer size. This simulation we use 1 nodes and 35 initial copies for message. From the result it is visible that there has been decrease in the overhead of our protocol in all the cases as shown in Fig. 3(b). Fig. 3(a) shows delivery ratio versus buffer size. The proposed protocol has equal or reduced delivery probability with the same reasons as discussed above. Third simulation presents the results with varying number of copies. In this simulation we use 1 nodes and 5M buffer capacity. From the result, it is visible that there has been decrease in the overheads of our protocol except prophet in case of number of initial copies 15 and 7 as shown in Fig. 4(b). Fig. 4(a) shows delivery ratio
8 1374 Savita and D.K. Lobiyal / Procedia Computer Science 57 ( 215 ) versus buffer size. The proposed protocol has equal or reduced delivery probability the same reasons as discussed above. 6. Conclusion In spite of extensive research in the domain of Delay tolerant network in academics, it still faces several challenges. The key challenging issue among them is the requirement of energy. Some routing protocols focused on minimizing of energy. The work proposed in this paper aims at improving the energy for DTNs by reducing overhead. It determines the delivery probability through each of its neighbours and delivers copies of message to each of its neighbours accordingly incorporating location information. For the simulation purpose, we have used THE ONE simulator which is meant for opportunistic networks. We have evaluated the performance of protocols by taking delivery probability and overhead as statistical measures. It is observed that proposed protocol is reduced overhead in comparison to existing routing protocols. Further, we also have given attention to various other important factors like delivery ratio. As suggested by M.Y.S. Uddin et al.[6], this work can further be extended to propose a solution where network itself obtains number of copies by learning from the network. Other location based schemes can also be explored that may provide better direction of delivery towards the destination and therefore, may further reduce the communication energy consumption. Further, emphasis can be given on improvement of other important metrics to enhance delivery probability of proposed protocol. References [1] S. Jain, K. Fall, R. Patra, Routing in a Delay Tolerant Network, ACM SIGCOMM, 24. [2] A.E.Al Fagih and H.S Hassanein, Routing schemes for Delay-Tolerant Network- An Applications Perspective Technical Report , no. December 21, 212. [3] M.Y.S.Uddin, H.Ahmadi, T. Abdelzaher, Intercontact Routing for Energy Constrained Disaster Response Networks, IEEE, TMC,213. [4] S.Yang, C.K.Yeo, F.B.S.Lee, Cooperative Duty Cycling For Energy-Efficient Contact Discovery in Pocket Switched Networks, IEEE, TVT, 213. [5] E.Altman, A.P.Azad, T.Başar, Combined Optimal Control of Activation and Transmission in Delay-Tolerant Networks, IEEE/ACM, TNET, 213. [6] Y. S. Uddin, N. G. Ave, D. M. Nicol, and R. H. Kravets, A Post-Disaster Mobility Model for Delay Tolerant Networking, pp , 29. [7] Z. and D. S. Zhang, Routing in Intermittently Connected Mobile Adhoc Networks and Delay Tolerant Networks: Overview and Challenges, pp , 26. [8] P. Puri, A Survey Paper on Routing in Delay-tolerant Networks, pp , 213. [9] J.Shen, S.Moh, I.Chung Routing protocols in Delay-Tolerant Networks: A comparative survey, ITC-CSCC, 28. [1] E.P.C. Jones, L. Li, J.K.Schmidtke, P.A.S.Ward, Practical Routing in Delay-Tolerant Networks, IEEE Transactions on Mobile Computing, 27. [11] Z.Zhang, Routing in intermittently connected Mobile Adhoc Networks and Delay-Tolerant Networks: Overview and Challenges, IEEE CS&T, 26. [12] S. Merugu, M. Ammar, E. Zegura Routing in Space and Time in Networks with Predictable Mobility, GIT&CC, 24. [13] D. W. McMillian, D. M. Chavis, Sense of Community: A Definition and Theory, Journal of Community Psychology, vol. 14,no.1,pp.6-23, [14] P. V. Marsden, Egocentric and Sociocentric Measure of Network Centrality, Social Networks, vol. 56, no.4, pp , 25. [15] E. M. Daly, M. Haahr, Social Network Analysis for Routing in Disconnected Delay-Tolerant Manets, in MobiHoc 7 Proc. 8 th ACM International Symposium on Mobile Adhoc Networking and Computing, 27. [16] M. McPherson, L. Smith-Lovin, J.M. Cook, Birds of a Feather: Homophily in Social Networks, Annual Review of Sociology, Vol.27, pp , 21. [17] P. Hui., K. Xu, V. O. Li, J. Crowcroft, V. Latora, P. Lio, Selfishness, Altruism and message Spreding in mobile Social Networks, in Proc. 1 st IEEE International Workshop on Network Science for Communication Networks, April 24,29.
9 Savita and D.K. Lobiyal / Procedia Computer Science 57 ( 215 ) [18] A. Vahdat, D. Becker, Epidemic Routing for Partially Connected Ad Hoc Networks, Tech. Rep., Department of Computer Science, Duke University, NC, 2. [19] Thrasyvoulos,K.Psounis, C.S.Raghavendra, Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks, ACM SIGCOMM, 25. [2] A. Lindgren, A. Doria, O. Schelen, Probabilistic routing in intermittently connected networks, ACM SIGMOBILE CCR, 23. [21] C.Becker, G.Schiele, New Mechanisms for Routing in Ad Hoc Networks through world models, 4th Plenary Cabernet Wksp., Pisa, Italy, 21. [22] W. Zhao, M.Ammar,E. Zegura, A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks, MobiHoc 4, ACM, 24. [23] P. Hui, J. Crowcroft, How Small Labels Create Big Improvements, in International Workshop on Intermittently Connected Mobile Adhoc Networks in Conjunction with IEEE PerCom 27, March 19-23, 27. [24] P. Hui, J. Crowcroft, E.Yonek, Bubble Rap: Social Based Forwarding in Delay Tolerant Networks, in Proc. 9 th ACM International Symposium on Mobile Adhoc Networking and Computing, May, 28. [25] W. Gao, Q Li, B. Zhao, G. Cao, Multicasting in Delay Tolerant Networks: A Social Network Perspective Networks, in MobiHoc 9: Proc. 1 th ACM International Symposium on Mobile Adhoc Networking and Computing, 29. [26] Y. Zhang, J. Zhao, Social Network Analysis on Data Diffusion in Delay Tolerant Networks, in MobiHoc 9: Proc. 1 th ACM International Symposium on Mobile Adhoc Networking and Computing, 29. [27] E. Bulut, B.K. Szymanski, Friendship Based routing in Delay Tolerant Mobile Social Networks, in Proc. IEEE Global Telecommunication Conference., Dec, 21. [28] Y. Ko and N. H. Vaidya, Location-Aided Routing ( LAR ) in mobile ad hoc networks, vol. 6, pp , 2. [29] A. Mei, J. Stefa, Give2get: Forwarding in Social Mobile wireless Networks of Selfish Individuals, in ICDCS 1 Proc. 21 IEEE 3 th International Conference on Communications and Networking in China, Aug, 28. [3] Y. Wang, W.S. Yang, J. Wu, Analysis of a Hypercube Based Social Feature Multipath Routing in Delay Tolerant Networks, IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 9, 213. [31] J. Wu, Y. Wang, Hypercube Based Multipath Social Feature Routing in Human Contact Networks, IEEE Transactions on Computers, vol. 63, no. 2, 214. [32] Z. Li, H. Shen, SEDUM: Exploiting Social Networks in Utility Based Distributed Routing for DTNs, IEEE Transactions on Computers, vol. 62, no. 1, 213. [33] F. Li, C. Zhang, Z. Gao, L. Zhao, Y. Wang, Social Feature Enhanced Group Based Routing for Wireless Delay Tolerant Networks, in Proc.8 th IEEE International Conference on Mobile Adhoc and Sensor Networks, 213. [34] A. Keränen, T. Kärkkäinen, and J. Ott, Simulating Mobility and DTNs with the ONE (Invited Paper), J. Commun., vol. 5, no. 2, pp , Feb. 21. [35] A. Keränen, J. Ott, and T. Kärkkäinen, The ONE simulator for DTN protocol evaluation, Proc. Second Int. ICST Conf. Simul. Tools Tech., 29.
Improvement of Buffer Scheme for Delay Tolerant Networks
Improvement of Buffer Scheme for Delay Tolerant Networks Jian Shen 1,2, Jin Wang 1,2, Li Ma 1,2, Ilyong Chung 3 1 Jiangsu Engineering Center of Network Monitoring, Nanjing University of Information Science
More informationDesign and Implementation of Improved Routing Algorithm for Energy Consumption in Delay Tolerant Network
IJIRST International Journal for Innovative Research in Science & Technology Volume 3 Issue 07 December 2016 ISSN (online): 2349-6010 Design and Implementation of Improved Routing Algorithm for Energy
More informationComparing Delay Tolerant Network Routing Protocols for Optimizing L-Copies in Spray and Wait Routing for Minimum Delay
Conference on Advances in Communication and Control Systems 2013 (CAC2S 2013) Comparing Delay Tolerant Network Routing Protocols for Optimizing L-Copies in Spray and Wait Routing for Minimum Delay Anjula
More informationEnergy Consumption and Performance of Delay Tolerant Network Routing Protocols under Different Mobility Models
2016 7th International Conference on Intelligent Systems, Modelling and Simulation Energy Consumption and Performance of Delay Tolerant Network Routing Protocols under Different Mobility Models Bhed Bahadur
More informationPerformance of Efficient Routing Protocol in Delay Tolerant Network: A Comparative Survey. Namita Mehta 1 and Mehul Shah 2
, pp.151-158 http://dx.doi.org/10.14257/ijfgcn.2014.7.1.15 Performance of Efficient Routing Protocol in Delay Tolerant Network: A Comparative Survey Namita Mehta 1 and Mehul Shah 2 1 Student, Department
More informationImpact of Social Networks in Delay Tolerant Routing
Impact of Social Networks in Delay Tolerant Routing Eyuphan Bulut, Zijian Wang and Boleslaw K. Szymanski Department of Computer Science and Center for Pervasive Computing and Networking Rensselaer Polytechnic
More informationFriendship Based Routing in Delay Tolerant Mobile Social Networks
Friendship Based Routing in Delay Tolerant Mobile Social Networks Eyuphan Bulut and Boleslaw K. Szymanski Department of Computer Science and Center for Pervasive Computing and Networking Rensselaer Polytechnic
More informationEnergy Efficient Social-Based Routing for Delay Tolerant Networks
Energy Efficient Social-Based Routing for Delay Tolerant Networks Chenfei Tian,FanLi,, Libo Jiang,ZeyeWang, and Yu Wang 2, School of Computer Science, Beijing Institute of Technology, Beijing, 8, China
More informationImpact of Social Networks on Delay Tolerant Routing
Impact of Social Networks on Delay Tolerant Routing Eyuphan Bulut, Zijian Wang and Boleslaw K. Szymanski Department of Computer Science and Center for Pervasive Computing and Networking Rensselaer Polytechnic
More informationDATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACES
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACES B.Poonguzharselvi 1 and V.Vetriselvi 2 1,2 Department of Computer Science and Engineering, College of Engineering Guindy, Anna University Chennai,
More informationRouting with Multi-Level Social Groups in Mobile Opportunistic Networks
Routing with Multi-Level Social Groups in Mobile Opportunistic Networks Lunan Zhao Fan Li Chao Zhang Yu Wang School of Computer Science, Beijing Institute of Technology, Beijing, 100081, China. Department
More informationA ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DELAY-TOLERANT NETWORKS
A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DELAY-TOLERANT NETWORKS ABSTRACT Zhang Huijuan and Liu Kai School of Software Engineering, Tongji University, Shanghai, China
More informationSocial Properties Based Routing in Delay Tolerant Network
RESEARCH ARTICLE OPEN ACCESS Properties Based Routing in Delay Tolerant Network Aliasger k. Dhilawala 1, Vishal shah 2 1 (Computer Department, S.V.I.T, Vasad,India 2 (Computer Department, S.V.I.T, Vasad,India
More informationPerformance Analysis of Delay Tolerant Network Routing Protocols in Different Mobility Environments
Performance Analysis of Delay Tolerant Network Routing Protocols in Different Mobility Environments Bhed Bahadur Bista Faculty of Software and Information Science Iwate Prefectural University Takizawa
More informationElimination Of Redundant Data using user Centric Data in Delay Tolerant Network
IJIRST International Journal for Innovative Research in Science & Technology Volume 1 Issue 9 February 2015 ISSN (online): 2349-6010 Elimination Of Redundant Data using user Centric Data in Delay Tolerant
More informationRouting in a Delay Tolerant Network Sushant Jain, Kevin Fall and Rabin Patra SIGCOMM Presented by Xun Gong
Routing in a Delay Tolerant Network Sushant Jain, Kevin Fall and Rabin Patra SIGCOMM 2004 Presented by Xun Gong Outline Delay Tolerant Networks Routing Problem in DTNs Multiple-copy Approach Flooding and
More informationMessage Transmission with User Grouping for Improving Transmission Efficiency and Reliability in Mobile Social Networks
, March 12-14, 2014, Hong Kong Message Transmission with User Grouping for Improving Transmission Efficiency and Reliability in Mobile Social Networks Takuro Yamamoto, Takuji Tachibana, Abstract Recently,
More informationA Joint Replication-Migration-based Routing in Delay Tolerant Networks
A Joint -Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Dept. of Computer and Info. Sciences Temple University Philadelphia, PA 19122 Zhen Jiang Dept. of Computer Science West
More informationTimely Information Dissemination with Distributed Storage in Delay Tolerant Mobile Sensor Networks
27 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS): 27 IEEE Infocom MiseNet Workshop Timely Information Dissemination with Distributed Storage in Delay Tolerant Mobile Sensor Networks
More informationPERFORMANCE ANALYSIS OF ROUTING PROTOCOLS FOR DELAY TOLERANT NETWORKS
PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS FOR DELAY TOLERANT NETWORKS Sanjay Kumar, K. Suraj and Sudhakar Pandey Department of Information Technology, National Institute of Technology Raipur, India E-Mail:
More informationCOMPARATIVE ANALYSIS OF DIFFERENT ROUTING PROTOCOLS IN DELAY TOLERANT NETWORKS
COMPARATIVE ANALYSIS OF DIFFERENT ROUTING PROTOCOLS IN DELAY TOLERANT NETWORKS Chintan B. Desai PG Student, Electronics and Communication Department, Charotar University of Science & Technology, Changa,
More informationUsing local speed information as routing metric for delay tolerant networks
Using local speed information as routing metric for delay tolerant networks FUQUAN ZHANG 1, INWHEE JOE, DEMIN GAO 1 AND YUNFEI LIU 1 1 College of Information and Sciences NanJing Forestry University NanJing
More informationIntegrated Routing Protocol for Opportunistic Networks
Integrated Routing Protocol for Opportunistic Networks Anshul Verma Computer Science and Engineering Dept. ABV-Indian Institute of Information Technology and Management, Gwalior, India E-mail: anshulverma87@gmail.com
More informationCOMFA: Exploiting Regularity of People Movement for Message Forwarding in Community-based Delay Tolerant Networks
COMFA: Exploiting Regularity of People Movement for Message Forwarding in Community-based Delay Tolerant Networks Long Vu, Quang Do, Klara Nahrstedt Department of Computer Science, University of Illinois
More informationApplication of Graph Theory in DTN Routing
Application of Graph Theory in DTN Routing Madan H. T. 1, Shabana Sultana 2 1 M. Tech. (CNE), NIE, Mysuru 2 Associate Professor, Dept. of Computer Science & Eng., NIE, Mysuru Abstract: Delay tolerant network
More informationBuffer Management in Delay Tolerant Networks
Buffer Management in Delay Tolerant Networks Rachana R. Mhatre 1 And Prof. Manjusha Deshmukh 2 1,2 Information Technology, PIIT, New Panvel, University of Mumbai Abstract Delay tolerant networks (DTN)
More informationMDR Based Cooperative Strategy Adaptation in Wireless Communication
MDR Based Cooperative Strategy Adaptation in Wireless Communication Aswathy Mohan 1, Smitha C Thomas 2 M.G University, Mount Zion College of Engineering, Pathanamthitta, India Abstract: Cooperation among
More informationArchna Rani [1], Dr. Manu Pratap Singh [2] Research Scholar [1], Dr. B.R. Ambedkar University, Agra [2] India
Volume 4, Issue 3, March 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance Evaluation
More informationWei Gao, Qinghua Li, Bo Zhao and Guohong Cao The Pennsylvania State University From: MobiHoc Presentor: Mingyuan Yan Advisor: Dr.
Wei Gao, Qinghua Li, Bo Zhao and Guohong Cao The Pennsylvania State University From: MobiHoc 2009 Presentor: Mingyuan Yan Advisor: Dr. Yingshu Li 1 2 3 4 5 Introduction Problem definition Single-data multicast
More informationEstimation based Erasure-coding Routing in Delay Tolerant Networks
Estimation based Erasure-coding Routing in Delay Tolerant Networks Yong Liao, Kun Tan, Zhensheng Zhang, Lixin Gao Dep. of Electrical & Computer Eng. Microsoft Research Asia San Diego Research Center University
More informationRouting Protocol Approaches in Delay Tolerant Networks
Routing Protocol Approaches in Delay Tolerant Networks Shivi Shukla 1, Amit Munjal 2 and Y. N. Singh 2 AIM & ACT Dept., Banasthali Vidyapith, Rajasthan 1 EE Dept., Indian Institute of Technology, Kanpur
More informationABSTRACT I. INTRODUCTION II. CHARACTERISTICS OF DELAY TOLERANT NETWORKS
International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2017 IJSRCSEIT Volume 2 Issue 5 ISSN : 2456-3307 Survey of Various Protocols Used for Delay Tolerant
More informationHeterogeneous Community-based Routing in Opportunistic Mobile Social Networks
Heterogeneous Community-based Routing in Opportunistic Mobile Social Networks Yunsheng Wang Kettering University Jie Wu Temple University Mingjun Xiao University of Science and Tech. of China Daqiang Zhang
More informationAvailable online at ScienceDirect. Procedia Computer Science 57 (2015 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 57 (2015 ) 890 897 2015 International Conference on Recent Trends in Computing (ICRTC 2015) Performance Analysis of Efficient
More informationScienceDirect. Comparison of Energy Efficient Data Collection Techniques in Wireless Sensor Network
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 57 (2015 ) 146 151 3 rd International Conference on Recent Trends in Computing 2015 (ICRTC-2015) Comparison of Energy Efficient
More informationAvailable online at ScienceDirect. Procedia Computer Science 85 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 85 (2016 ) 891 898 International Conference on Computational Modeling and Security (CMS 2016) Analysis of routing and forwarding
More informationCapacity-Aware Routing Using Throw-Boxes
Capacity-Aware Routing Using Throw-Boxes Bo Gu, Xiaoyan Hong Department of Computer Science University of Alabama, Tuscaloosa, AL 35487 {bgu,hxy}@cs.ua.edu Abstract Deploying the static wireless devices
More informationNEW STRATEGY TO OPTIMIZE THE PERFORMANCE OF SPRAY AND WAIT ROUTING PROTOCOL
NEW STRATEGY TO OPTIMIZE THE PERFORMANCE OF SPRAY AND WAIT ROUTING PROTOCOL Mohamed Ababou 1, Rachid Elkouch 2, Mostafa Bellafkih 3 and Nabil Ababou 4 1 National Institute of Posts and Telecommunications
More informationChitChat: An Effective Message Delivery Method in Sparse Pocket-Switched Networks
ChitChat: An Effective Message Delivery Method in Sparse Pocket-Switched Networks Douglas McGeehan Dan Lin Sanjay Madria Department of Computer Science Missouri University of Science and Technology Rolla,
More information[Bhosale*, 4.(6): June, 2015] ISSN: (I2OR), Publication Impact Factor: 3.785
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY EFFECTIVE DATA FORWARDING TECHNIQUE IN MOBILE SOCIAL NETWORK Ms.Yogita Y.Bhosale*, Prof.Nilesh R.Pardeshi * Department of Computer
More informationSpray and Dynamic: Advanced Routing in Delay Tolerant Networks
Int. J. Communications, Network and System Sciences, 2012, 5, 98-104 http://dx.doi.org/10.4236/ijcns.2012.52013 Published Online February 2012 (http://www.scirp.org/journal/ijcns) Spray and Dynamic: Advanced
More informationSimulation of Epidemic, Spray and Wait and First Contact Routing Protocols in Delay Tolerant Network
Simulation of, Spray and Wait and First Contact Routing Protocols in Delay Tolerant Network 1 Monika Aneja, 2 Vishal Garg 1 (P.G. Student JMIT, Radaur, Yamunanagar) 2 (Assistant Professor JMIT Radaur Yamunanagar)
More informationGeographic information based Replication and Drop Routing (GeoRaDR): A Hybrid Message Transmission Approach for DTNs
Geographic information based Replication and Drop Routing (GeoRaDR): A Hybrid Message Transmission Approach for DTNs Dr. Santhi Kumaran Associate Professor, Dept of Computer Engineering,
More informationHierarchical Trust Management for Delay Tolerant Networks Using Stochastic Petrinet for Secure Routing
International OPEN ACCESS Journal Of Modern Engineering Research (IJMER) Hierarchical Trust Management for Delay Tolerant Networks Using Stochastic Petrinet for Secure Routing Chithra M. 1, Mr. Vimalathithan
More informationAvailable online at ScienceDirect. Procedia Computer Science 46 (2015 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 46 (2015 ) 1209 1215 International Conference on Information and Communication Technologies (ICICT 2014) Improving the
More informationRouting Issues & Performance Of Different Opportunistic Routing Protocols In Delay Tolerant Network
Routing Issues & Performance Of Different Opportunistic Routing Protocols In Delay Tolerant Network Ankur Upadhyay Department of Computer Science & Engineering School of Engineering & Technology, IFTM
More informationKeywords: Detection, Disruption Tolerant Networks, Mitigation, Routing Misbehavior, Security.
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY An Efficient Selfishness Aware Routing in Delay Tolerant Networks N.Senthilkumar *1, Dr. T.V U. Kiran Kumar 2 *1,2,3,4 Bharath
More informationIJSER. 1. Introduction. 1.1 Routing in DTN: Sukhpreet Kaur
International Journal of Scientific & Engineering Research, Volume 7, Issue 4, April-2016 1717 A Review of Energy Consumption on DTN Routing Protocols Sukhpreet Kaur Abstract: DTN is net of similar nets.
More informationResearch Article ISSN:
International Journal of Computer Science & Mechatronics A peer reviewed International Journal Article Available online www.ijcsm.in smsamspublications.com Vol.1.Issue 2.2015 Boosting Performance of Data
More informationCombined Mobile Ad-hoc and Delay/Disruption-tolerant Routing
This is an authors' version of the manuscript. Final version published in Proc. 13th International Conference on Ad-Hoc Networks and Wireless (ADHOC-NOW '14). Springer LNCS 8487, pp. 1-14, 2014. The final
More informationExploiting Heterogeneity in Mobile Opportunistic Networks: An Analytic Approach
Exploiting Heterogeneity in Mobile Opportunistic Networks: An Analytic Approach 7 th Annual IEEE Communication Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (IEEE SECON 10)
More informationTRUST FRAMEWORK FOR DATA FORWARDING IN OPPORTUNISTIC NETWORKS USING MOBILE TRACES
TRUST FRAMEWORK FOR DATA FORWARDING IN OPPORTUNISTIC NETWORKS USING MOBILE TRACES B.Poonguzharselvi 1 and V.Vetriselvi 2 1,2 Department of Computer Science and Engineering, College of Engineering Guindy,
More informationA SURVEY ON OPPORTUNISTIC ROUTING PROTOCOLS IN CELLULAR NETWORK FOR MOBILE DATA OFFLOADING
A SURVEY ON OPPORTUNISTIC ROUTING PROTOCOLS IN CELLULAR NETWORK FOR MOBILE DATA OFFLOADING Sanjit Kumar Dash 1, Chandrakanta Mahanty 2, Sasmita Mishra 3 and Jibitesh Mishra 1 1 College of Engineering and
More informationOverhead Reduction In Delay Tolerant Networks
Overhead Reduction In Delay Tolerant Networks Azadeh Omidvar School of Electrical Engineering Iran University of Science and Technology Tehran, Iran omidvar@elec.iust.ac.ir Karim Mohammadi School of Electrical
More informationPrediction Assisted Single-copy Routing in Underwater Delay Tolerant Networks
1 Prediction Assisted Single-copy Routing in Underwater Delay Tolerant Networks Zheng Guo, Bing Wang and Jun-Hong Cui Computer Science & Engineering Department, University of Connecticut, Storrs, CT, 6269
More informationOn Information Sharing Scheme for Automatic Evacuation Guiding System Using Evacuees Mobile Nodes
On Information Sharing Scheme for Automatic Evacuation Guiding System Using Evacuees Mobile Nodes Nobuhisa Komatsu, Masahiro Sasabe, and Shoji Kasahara Graduate School of Information Science, Nara Institute
More informationConstructing Time-Varying Contact Graphs for Heterogeneous Delay Tolerant Networks
Globecom 2012 - Wireless Networking Symposium Constructing Time-Varying Contact Graphs for Heterogeneous Delay Tolerant Networks Xiaoyan Hong, Bo Gu, Yuguang Zeng, Jingyuan Zhang Department of Computer
More informationSimulation and Analysis of Opportunistic Routing Protocols
Simulation and Analysis of Opportunistic Routing Protocols 1 The Purpose The purpose of this assignment is to gain familiarity with a network simulation tool and to get experience in basic data analysis.
More informationCLUSTERING BASED ROUTING FOR DELAY- TOLERANT NETWORKS
http:// CLUSTERING BASED ROUTING FOR DELAY- TOLERANT NETWORKS M.Sengaliappan 1, K.Kumaravel 2, Dr. A.Marimuthu 3 1 Ph.D( Scholar), Govt. Arts College, Coimbatore, Tamil Nadu, India 2 Ph.D(Scholar), Govt.,
More informationOpportunistic Networks: A Review
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 18, Issue 2, Ver. III (Mar-Apr. 2016), PP 20-26 www.iosrjournals.org Opportunistic Networks: A Review Navneet
More informationModeling Redundancy-based Routing in Delay Tolerant Networks
Modeling Redundancy-based Routing in Delay Tolerant Networks Yong Liao, Kun Tan, Zhensheng Zhang, Lixin Gao Dep. of Electrical & Computer Eng. Microsoft Research Asia San Diego Research Center University
More informationPeer-to-Peer Content sharing for Smart phones over Ad-Hoc Networks.
Peer-to-Peer Content sharing for Smart phones over Ad-Hoc Networks. Madhuri Marneni M.Tech, Student, Computer Science Engineering Department, Rao & Naidu Engineering College, Ongole. Abstract: The global
More informationKeywords: Store and carry networks, Forwarding strategies, routing, DTN, Minimum hop transmission
Global Journal of Computer Science and Technology Volume 11 Issue 9 Version 1.0 May 2011 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) ISSN: 0975-4172
More informationTowards Interoperability of Adaptive Social-Aware Routing at the Tactical Edge
1 Towards Interoperability of Adaptive Social-Aware Routing at the Tactical Edge Wei Gao and Mitesh Patel Department of Electrical Engineering and Computer Science, The University of Tennessee, Knoxville
More informationDTN Interworking for Future Internet Presented by Chang, Dukhyun
DTN Interworking for Future Internet 2008.02.20 Presented by Chang, Dukhyun Contents 1 2 3 4 Introduction Project Progress Future DTN Architecture Summary 2/29 DTN Introduction Delay and Disruption Tolerant
More informationA DTN Packet Forwarding Scheme Inspired by Thermodynamics
A DTN Packet Forwarding Scheme Inspired by Thermodynamics Mehdi Kalantari and Richard J. La Department of Electrical and Computer Engineering University of Maryland {mehkalan, hyongla}@umd.edu Abstract
More informationInvestigating Performance of Extended Epidemic Routing Protocol of DTN under Routing Attack
Investigating Performance of Extended Epidemic Routing Protocol of DTN under Routing Attack Harminder Singh Bindra 1, A L Sangal 2 1 Research Scholar, Department of CSE, DR B R Ambedkar National Institute
More informationIMPROVING PEER TO PEER FILE SHARING THROUGH REPLICATION IN MOBILE AD-HOC NETWORK
IMPROVING PEER TO PEER FILE SHARING THROUGH REPLICATION IN MOBILE AD-HOC NETWORK 1 MARATI ESHWARI, 2 P.SRINIVAS 1 M. Tech Student, Department of IT, Joginpally B R Engineering College, Village Yenkapally,
More informationHCS: hierarchical cluster-based forwarding scheme for mobile social networks
Wireless Netw (2015) 21:1699 1711 DOI 10.1007/s11276-014-0876-x HCS: hierarchical cluster-based forwarding scheme for mobile social networks Sun-Kyum Kim Ji-Hyeun Yoon Junyeop Lee Sung-Bong Yang Published
More informationFairness-Aware Cooperative Caching Scheme for Mobile Social Networks
Fairness-Aware Cooperative Caching Scheme for Mobile Social Networks Dongsheng Wei [, Konglin Zhu \, and Xin Wang [ [ School of Computer Science, Fudan University, Shanghai, China Engineering Research
More informationThreshold Based Best Custodian Routing Protocol for Delay Tolerant Network
INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL ISSN 1841-9836, 10(3):298-307, June, 2015. Threshold Based Best Custodian Routing Protocol for Delay Tolerant Network Q. Ayub, M. S. Mohd Zahid,
More informationOn Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks
On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks Wei Gao and Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University, University
More informationResearch Article Probabilistic Routing Based on Two-Hop Information in Delay/Disruption Tolerant Networks
Journal of Electrical and Computer Engineering Volume 215, Article ID 91865, 11 pages http://dx.doi.org/1.1155/215/91865 Research Article Probabilistic Routing Based on Two-Hop Information in Delay/Disruption
More informationEA-Epidemic: An Energy Aware Epidemic-Based Routing Protocol for Delay Tolerant Networks
Journal of Communications Vol. 12, No. 6, June 217 EA-Epidemic: An Energy Aware Epidemic-Based Routing Protocol for Delay Tolerant Networks Bhed B. Bista 1 and Danda B. Rawat 2 1 Iwate Prefectural University,
More informationOpportunistic Routing Algorithms in Delay Tolerant Networks
Opportunistic Routing Algorithms in Delay Tolerant Networks Eyuphan Bulut Rensselaer Polytechnic Institute Department of Computer Science and Network Science and Technology (NeST) Center PhD Thesis Defense
More informationSocial-Similarity-based Multicast Algorithm in Impromptu Mobile Social Networks
Social-Similarity-based Multicast Algorithm in Impromptu Mobile Social Networks Yuan Xu, Xiao Chen Department of Computer Science, Texas State University, San Marcos, TX, USA Email: y x3@txstate.edu, xc@txstate.edu
More informationMAXIMIZING P2P FILE ACCESS AVAILABILITY IN MOBILE AD HOC NETWORKS THOUGH REPLICATION FOR EFFICIENT FILE SHARING
MAXIMIZING P2P FILE ACCESS AVAILABILITY IN MOBILE AD HOC NETWORKS THOUGH REPLICATION FOR EFFICIENT FILE SHARING ASRAF 1*, K A LAXMI PRASAD 2* ABSTRACT: 1. MTech-Student, Dept of CSE. 2. Asst.Prof, Dept
More informationAvailable online at ScienceDirect. Procedia Computer Science 89 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 89 (2016 ) 162 169 Twelfth International Multi-Conference on Information Processing-2016 (IMCIP-2016) A Distributed Minimum
More informationNOWADAYS Delay and Disruptive Tolerant Networks
INTL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS, 2016, VOL. 62, NO. 2, PP. 167 172 Manuscript received March 12, 2016; revised June, 2016. DOI: 10.1515/eletel-2016-0023 SocialRouting: The social-based
More informationBUBBLE RAP: Social-Based Forwarding in Delay-Tolerant Networks
1 BUBBLE RAP: Social-Based Forwarding in Delay-Tolerant Networks Pan Hui, Jon Crowcroft, Eiko Yoneki Presented By: Shaymaa Khater 2 Outline Introduction. Goals. Data Sets. Community Detection Algorithms
More informationComparative Study of Routing Protocols for Opportunistic Networks
Comparative Study of Routing Protocols for Opportunistic Networks Majeed Alajeely School of Information Technology Deakin University Melbourne, Australia Email: malajeel@deakin.edu.au Asma a Ahmad School
More informationNodes Misbehavior in Vehicular Delay-Tolerant Networks
Nodes Misbehavior in Vehicular Delay-Tolerant Networks Naércio Magaia, Paulo Rogério Pereira, Miguel P. Correia INESC-ID/IST/UTL, Rua Alves Redol, 9. 1000-029 LISBOA, Portugal {naercio.magaia, miguel.p.correia}@ist.utl.pt,
More informationRouting in Delay Tolerant Networks (DTN)
Int. J. Communications, Network and System Sciences, 2011, 4, 53-58 doi:10.4236/ijcns.2011.41006 Published Online January 2011 (http://www.scirp.org/journal/ijcns) Routing in Delay Tolerant Networks (DTN)
More informationENSC 427: COMMUNICATION NETWORK PROJECT PRESENTATION Spring 2010 Instructor: Ljiljana Trajkovic. Message Ferrying
ENSC 427: COMMUNICATION NETWORK PROJECT PRESENTATION Spring 2010 Instructor: Ljiljana Trajkovic 1 Message Ferrying Group 9 Timbo Yuen (tty2@sfu.ca) Dan Hendry (danh@sfu.ca) Yazan Shehadeh (ysa5@sfu.ca)
More information1. INTRODUCTION. Saravanan.A 1 and Dr.Sunitha Abburu 2
www.ijcsi.org 365 Computing Conditional Intermeeting Time in Conditional Shortest Path Routing Saravanan.A 1 and Dr.Sunitha Abburu 2 1 Adhiyamaan College of Engineering, Department of Computer Application,
More informationERASURE-CODING DEPENDENT STORAGE AWARE ROUTING
International Journal of Mechanical Engineering and Technology (IJMET) Volume 9 Issue 11 November 2018 pp.2226 2231 Article ID: IJMET_09_11_235 Available online at http://www.ia aeme.com/ijmet/issues.asp?jtype=ijmet&vtype=
More informationSpray and forward: Efficient routing based on the Markov location prediction model for DTNs
. RESEARCH PAPER. SCIENCE CHINA Information Sciences February 2012 Vol. 55 No. 2: 433 440 doi: 10.1007/s11432-011-4345-1 Spray and forward: Efficient routing based on the Markov location prediction model
More informationRouting in Large-Scale Buses Ad Hoc Networks
1 Routing in Large-Scale Buses Ad Hoc Networks Michel Sede, Xu Li *, Da Li *, Min-You Wu * Laboratory for Computer Communications and Applications, EPFL, Switzerland * Department of Computer Science and
More informationInternational Journal of Computer Engineering and Applications, Volume XII, Special Issue, August 18, ISSN
International Journal of Computer Engineering and Applications, ANALYZING IMPACT OF FACTORS ON ROUTING DECISIONS IN OPPORTUNISTIC MOBILE NETWORKS Sonam Kumari 1, Dr. Itu Snigdh 2 Department of Computer
More informationInternational Journal of Innovative Research in Technology & Science A DTN ROUTING BASED ON AN ADAPTIVE DYNAMIC AGING FACTOR IN URBAN ENVIRONMENTS
A DT ROUTIG BASED O A ADAPTIVE DYAMIC AGIG FACTOR I URBA EVIROMETS *Tingwei Fu 1, *Wenzao Li 2, *Yang Liu 3, *Zhan Wen 1 1. School of Communication Engineering, Chengdu University of Information Technology,
More informationACICE-2013 ISSN: ; e-issn
1022 A Novel Ferry-Initiated Message Ferrying Approach for Data Delivery in Disconnected Mobile Ad Hoc Networks through Native Ferries K. MURALIDHAR 1, N. GEETHANJALI 2 1 Assistant Professor, Department
More informationhash chains to provide efficient secure solutions for DSDV [7].
A Ferry-based Intrusion Detection Scheme for Sparsely Connected Ad Hoc Networks M. Chuah, P.Yang, J. Han {chuah, pey24, jih26}@cse.lehigh.edu Department of Computer Science & Engineering Lehigh University
More informationA Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network
A Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network Humayun Bakht Research Fellow, London School of Commerce, United Kingdom humayunbakht@yahoo.co.uk
More informationST-Drop: A Novel Buffer Management Strategy for D2D Opportunistic Networks
ST-Drop: A Novel Buffer Management Strategy for D2D Opportunistic Networks Michael D. Silva, Ivan O. Nunes, Raquel A.F. Mini, Antonio A. F. Loureiro Department of Computer Science, Universidade Federal
More informationDTN Routing in Vehicular Sensor Networks
DTN Routing in Vehicular Sensor Networks Xu Li, Wei Shu, Minglu Li, Hongyu Huang and Min-You Wu Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China Department
More informationA Qualitative Survey on Multicast Routing in Delay Tolerant Networks
A Qualitative Survey on Multicast Routing in Delay Tolerant Networks Sushovan Patra 1, Sujoy Saha 2, Vijay Shah 1, Satadal Sengupta 1, Konsam Gojendra Singh 1, and Subrata Nandi 1 1 Department of Computer
More informationCFP: Integration of Fountain Codes and Optimal Probabilistic Forwarding in DTNs
: Integration of Fountain Codes and Optimal Probabilistic Forwarding in DTNs Ying Dai Software Institute Nanjing University dy06@software.nju.edu.cn Panlong Yang, Guihai Chen Dept. of Computer Sci. and
More informationCONCOR: context-aware community-oriented routing for intermittently connected network
Johari et al. EURASIP Journal on Wireless Communications and Networking (2015) 2015:148 DOI 10.1186/s13638-015-0357-7 RESEARCH Open Access CONCOR: context-aware community-oriented routing for intermittently
More informationMax-Pivot Routing for Opportunistic Networks
Max-Pivot Routing for Opportunistic Networks Tamer Dag Computer Engineering Department Kadir Has University Istanbul, Turkey tamer.dag@khas.edu.tr Abstract Opportunistic networks are challenging types
More informationWaterChat: A Group Chat Application Based on Opportunistic Mobile Social Networks
WaterChat: A Group Chat Application Based on Opportunistic Mobile Social Networks Tzu-Chieh Tsai, Ting-Shen Liu, and Chien-Chun Han Department of Computer Science, National Chengchi University, Taipei,
More information