نتایج جستجو برای: Probabilistic Epidemic Forwarding
تعداد نتایج: 121643 فیلتر نتایج به سال:
Due to the increasing use of wireless communications, infrastructure-less networks such as Delay Tolerant Networks (DTNs) should be highly considered. DTN is most suitable where there is an intermittent connection between communicating nodes such as wireless mobile ad hoc network nodes. In general, a message sending node in DTN copies the message and transmits it to nodes which it encounters. A...
We define a self-limiting epidemic service as a dissemination service for ad-hoc environments that is broadcast in nature, but is limited to a local scope around each source. Example applications are chatting or bulletin boards in a traffic jam, in an instant crowd in a campus or, in contrast, along a desert highway. Our goal is to support such a service across a wide range of conditions (dense...
Given the frequent topology changes in Mobile Ad Hoc Networks (MANET), the choice of appropriate broadcasting techniques is crucial to ensure reliable delivery of messages. The spreading of broadcast messages has a strong similarity with the spreading of infectious diseases. Applying epidemiological models to broadcasting allows an easy evaluation of such strategies depending on the MANET chara...
To balance the tradeoff of the routing throughput in DTNs, we try to propose a new method to integrate the delivery predictability of ProPHET-Routing with our previous OOP-Routing, called OOPProPHET-Routing. Also, we have used the NS2 network simulator to verify our proposed routing method is better than before, and we have achieved a good tradeoff between the delivery ratio and the numbers of ...
In intermittently connected mobile ad hoc networks, how to guarantee the packet delivery ratio and reduce the transmission delay has become the new challenge for the researchers. Epidemic theory based routing had shown the better performance in the aspect of improving transmission successful rate and reducing the delay, which under the situation that there is no limitation of the node buffer an...
Epidemic routing [18] has been proposed as an approach for routing in sparse and/or highly mobile networks in which there may not be a contemporaneous path from source to destination. Epidemic routing adopts a so-called “store-carry-forward” paradigm – a node receiving a packet buffers and carries that packet as it moves, passing the packet on to new nodes that it encounters. Analogous to the s...
Optimization of Bloom Filter Parameters for Practical Bloom Filter Based Epidemic Forwarding in DTNs
Epidemic forwarding has been proposed as a forwarding technique to achieve opportunistic communication in Delay Tolerant Networks. Even if this technique is well known and widely referred, one has to first deal with several practical problems before using it. In particular, in order to manage the redundancy and to avoid useless transmissions, it has been proposed to ask nodes to exchange inform...
There are many routing strategies for message delivery in Delay Tolerant Networks. Among them Multicopying routing strategies have been considered the most applicable DTNs. Epidemic routing and two-hop forwarding routing are the two best approaches of DTN. These two approaches belong to multicopying routing strategies as they allow multiple message replicas to increase message delivery delay. T...
In this work we investigate Epidemic novel strategies called SNPS and EAER-SNPS applied to a DTN Network. These strategies extend the approach of the basic epidemic routing by using the node density estimation and the nodes energy levels; they adopt the forwarding scheme of the n-Epidemic routing. However, differently from nEpidemic, it applies a dynamic forwarding scheme based on nodes density...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید