Filters








226 Hits in 4.1 sec

Routing for Opportunistic Networks Based on Probabilistic Erasure Coding [chapter]

Fani Tsapeli, Vassilis Tsaoussidis
2012 Lecture Notes in Computer Science  
We investigate the problem of routing in opportunistic networks and propose a novel routing algorithm, which combines probabilistic routing with erasure coding.  ...  Erasure coding generates large amounts of code blocks with fixed overhead; we apply a sophisticated but realistic method to allocate the generated code blocks to nodes that relies on a probabilistic metric  ...  This paper reflects only the authors views and the Community is not liable for any use that may be made of the information contained therein.  ... 
doi:10.1007/978-3-642-30630-3_22 fatcat:oddggzb5fvfs7moe4wl6shw7cy

A hybrid routing approach for opportunistic networks

Ling-Jyh Chen, Chen-Hung Yu, Tony Sun, Yung-Chih Chen, Hao-hua Chu
2006 Proceedings of the 2006 SIGCOMM workshop on Challenged networks - CHANTS '06  
H-EC is designed to fully combine the robustness of erasure coding based routing techniques, while preserving the performance advantages of replication techniques.  ...  design for an effective routing scheme that considers and accommodates the various intricate behaviors observed in an opportunistic network is of interest and remained desirable.  ...  We will defer the evaluation on routing schemes that are based on other advance techniques (e.g., network coding based routing [28] ).  ... 
doi:10.1145/1162654.1162658 dblp:conf/sigcomm/ChenYSCC06 fatcat:weg5tzdxdzggbdl3baizl3mugu

A content-centric framework for effective data dissemination in opportunistic networks

Ling-Jyh Chen, Chen-Hung Yu, Cheng-Long Tseng, Hao-hua Chu, Cheng-Fu Chou
2008 IEEE Journal on Selected Areas in Communications  
In this paper, we address the challenges of content transfer in opportunistic networks, and propose techniques to better facilitate data dissemination based on the characteristics of the content.  ...  Three types of content (file, video and web) are considered and evaluated, and the dissemination methods considered are Layered Multiple Description Coding (LMDC) based and file-based.  ...  HEC: AN ERASURE CODING-BASED HYBRID ROUTING APPROACH A.  ... 
doi:10.1109/jsac.2008.080603 fatcat:7yskcjd3rncpxkcsdsy3t5et7i

An Evaluation of Routing Reliability in Non-collaborative Opportunistic Networks

Ling-Jyh Chen, Che-Liang Chiou, Yi-Chao Chen
2009 2009 International Conference on Advanced Information Networking and Applications  
We also evaluate the impacts of the five types of behavior on the data transmission performance of three widely used routing schemes.  ...  An opportunistic network is a type of challenged network that has attracted a great deal of attention in recent years.  ...  Meanwhile, [25] suggested combining erasure coding and the simple replication-based routing method to improve data delivery for cases with the worst delay performance in opportunistic networks.  ... 
doi:10.1109/aina.2009.54 dblp:conf/aina/ChenCC09 fatcat:vaesfy2bbzcpfpumnnzhhzk7a4

Optimising Replication versus Redundancy in Window-Aware Opportunistic Routing

Gabriel Sandulescu, Simin Nadjm-Tehrani
2010 2010 Third International Conference on Communication Theory, Reliability, and Quality of Service  
In this paper we address the replication versus redundancy optimisation problem for a class of intermittentlyconnected ad hoc networks with the following three characteristics: routing is performed by  ...  Our model builds upon a component for message latency distribution that we have borrowed from earlier works (SprayAndWait) and that has been extended for erasure coding and constrained resources.  ...  Unlike erasure coding, network coding was studied by Lin et al. [20] as an add-on to replication. However, network coding and erasure coding are essentially different.  ... 
doi:10.1109/ctrq.2010.40 fatcat:kqp3ykdouvgwxavoncqj4ooniy

Research on Routing Protocols and Simulation Analysis for Opportunistic Networks

Wentao Wang, Feng Guo, Fang Zheng, Wan Tang, Jiangqing Wang
2015 International Journal of Multimedia and Ubiquitous Engineering  
Thirdly, we carried out the computer simulation and analysis for opportunistic network routing protocols in aspect of message delivery ratio, network latency, routing overhead and the number of lost packets  ...  Then we summarized the advantages and disadvantages of routing protocol and discussed its applicability. Finally we looked ahead the hotspot of recent routing protocols under opportunistic networks.  ...  The authors are grateful for the anonymous reviewers who made constructive comments and improvements.  ... 
doi:10.14257/ijmue.2015.10.3.18 fatcat:siozvp2lxbdsjespjpkevlnf3e

Control of coding in DTN's for progressive packet arrivals dynamically

Uma Upadhya, Dr. Shubhangi D. C, Rekha B Venkatapur
2014 IOSR Journal of Computer Engineering  
We account for linear block-codes and rateless random linear coding to efficiently generate red undancy, as well as for an energy constraint in the optimization.  ...  This motivates us to study general packet arrivals at the source, derive performance analysis of replication based routing policies and study their optimization under two-hop routing.  ...  "Erasure-Coding Based Routing for Opportunistic Networks" Routing in Delay Tolerant Networks (DTN) with unpredictable node mobility is a challenging problem because disconnections are prevalent and lack  ... 
doi:10.9790/0661-1645106111 fatcat:wfs6ilqmbfge5nczlj2ia2m6k4

Redundancy and distributed caching in mobile DTNs

Mikko Juhani Pitkänen, Jörg Ott
2007 Proceedings of first ACM/IEEE international workshop on Mobility in the evolving internet architecture - MobiArch '07  
In this opportunistic model, routing and forwarding functionality in intermediate nodes enables data transfer following the store, carry, and forward paradigm.  ...  Thereby, even in sparsely populated settings, node-to-node contacts can be exploited for communications where network infrastructure does not exist or is not viable to use.  ...  In addition fragmentation may stem from routing protocols, as seen with erasure-or network-coding based routing [30, 8, 31] .  ... 
doi:10.1145/1366919.1366930 fatcat:65vb2kdpwrahpjj67zc2lfqdwm

Improving Opportunistic Data Dissemination via Known Vector

Jyh-How Huang, Ying-Yu Chen, Yi-Chao Chen, Shivakant Mishra, Ling-Jyh Chen
2009 2009 International Conference on Advanced Information Networking and Applications Workshops  
In opportunistic network, the replicating protocols are preferred over forwarding protocols. Yet, a big overhead is to be solved for replicating routing protocols, i.e. the exchanging of metadata.  ...  An opportunistic network is a network where each node only has connectiviy with other nodes opportunistically.  ...  Following the concept of erasure coding-based data forwarding [15] , an Estimation based Erasure-Coding routing scheme (EBEC) has been proposed to adapt the delivery of erasure coded blocks using the  ... 
doi:10.1109/waina.2009.128 dblp:conf/aina/HuangCCMC09 fatcat:pgpys7nxzbgsjagouuabbi5m6m

Erasure Encoding: A Technique to enhance performance over Spray and Wait Protocol

Gireesh Kumar, Vineet Richhariya, Vikram Rajput
2015 International Journal of Computer Applications  
In order to enhance performance for large packet we have introduced Erasure encoding based spray and wait technique which improved the result in terms of required parameter.  ...  Keywords Delay tolerant networks (DTNs), Routing, store carry and forward.  ...  The erasure-coding based approach, instead, utilizes kr relays for the same amount of overhead.  ... 
doi:10.5120/ijca2015907003 fatcat:uo7iqakikjfwjlh4ufwcjmynu4

Content Distribution Strategies in Opportunistic Networks [article]

Syed Haani Masood, Syed Ali Raza, Mark Coates
2013 arXiv   pre-print
We also study the rate of content retrieval by the subscribers under coding strategies (Network Coding, Erasure Coding) and under Flooding, Epidemic Routing.  ...  This paper describes a mechanism for content distribution through opportunistic contacts between subscribers. A subset of subscribers in the network are seeded with the content.  ...  In [51] network coding based on probabilistic routing is presented for efficient communication on extreme networks.  ... 
arXiv:1308.0786v1 fatcat:tdl5tbk75zdpnivenw26zhrdla

Network coded routing in delay tolerant networks

Agoston Petz, Chien-Liang Fok, Christine Julien, Brenton Walker, Calvin Ardi
2011 Proceedings of the 3rd Extreme Conference on Communication The Amazon Expedition - ExtremeCom '11  
In this paper, we report on our experience integrating both erasure coded and network coded routing into the well-adopted DTN2 Reference Implementation.  ...  Probabilistic routing performs well in such networks and has been the dominant focus of research in this area.  ...  Erasure coding can improve the worst-case delay in DTNs [2, 13, 23, 24] , and network coded routing compares favorably with probabilistic routing and has the advantage of lower overhead [25] .  ... 
doi:10.1145/2414393.2414397 fatcat:osgqepxbfba4fm5s6huwmvkwk4

Towards Designing a Routing Protocol for Opportunistic Networks

Thabotharan Kathiravelu, Arnold Pears
2012 The International Journal on Advances in ICT for Emerging Regions  
Simulation based comparative studies show that the proposed routing protocol outperforms existing Epidemic and Probabilistic routing protocols in delivering messages.  ...  Intermittently connected opportunistic networks experience frequent disconnections and shorter contact durations.  ...  Recent work in opportunistic routing environments use erasure coding based techniques to balance message replication.  ... 
doi:10.4038/icter.v4i3.4678 fatcat:6ipu53achvberc7npdyy63oswm

Routing Approaches in Delay Tolerant Networks: A Survey

R. J. D'Souza, Johny Jose
2010 International Journal of Computer Applications  
The design of routing protocol for such networks is an important issue. This work surveys the literature and classifies the various routing approaches.  ...  This leads to the problem of how to route a packet from one node to another, in such a network. This problem becomes more complex, when the node mobility also is considered.  ...  Lin et al [42] utilised opportunistic routing to network coded packets. Wang et al [63] and Jain et al [32] introduced erasure coding. This approach bounded the number of copies in the network.  ... 
doi:10.5120/370-557 fatcat:3rwigc7m4bbcpi6nao7n3rce3m

Efficient Network Coded Data Transmissions in Disruption Tolerant Networks

Y. Lin, B. Li, B. Liang
2008 2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications  
With such insights, we propose E-NCP, an efficient protocol in DTNs based on network coding, that reduces data transmissions significantly, while increasing data transmission delay only slightly as compared  ...  By making an analogy between the routing protocol and low-density erasure codes, we investigate the information-theoretical optimal number of data transmissions in delivering data.  ...  For these reasons, probabilistic routing [2] , [3] and spray-and-wait [4] , [5] are proposed to achieve tradeoffs between network resource consumption and protocol performance by focusing on routing  ... 
doi:10.1109/infocom.2007.210 fatcat:qc3b5rtv5vf3nl2zulx4gkvxnm
« Previous Showing results 1 — 15 out of 226 results