Routing With (p-Percent) Partial Flooding for Opportunistic Networks

dc.contributor.author Erdoğan, Mustafa
dc.contributor.author Dağ, Tamer
dc.contributor.author Günel, Kadir
dc.contributor.author Koç, Tuğba
dc.contributor.author Sökün, Hamza Ümit
dc.contributor.author Dağ, Tamer
dc.contributor.other Computer Engineering
dc.date.accessioned 2019-06-28T11:11:21Z
dc.date.available 2019-06-28T11:11:21Z
dc.date.issued 2010
dc.department Fakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümü en_US
dc.department Fakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Elektrik-Elektronik Mühendisliği Bölümü en_US
dc.description.abstract Opportunistic networks are one of the fast developing research areas in mobile communications. Under opportunistic networks mobile nodes try to communicate with other nodes without any prior information and knowledge about the network topology. Furthermore the network topologies are dynamic and can rapidly change. In addition communication under opportunistic networks can be erratic thus routes between a source node and a destination node sometimes might not exist. These issues would make traditonal routing approaches insufficient and unusable for opportunistic networks. In this paper a new routing approach for opportunistic networks is proposed. The approach is called is p% partial flooding algorithm. With flooding it is possible to reach a destination node with the minimum number of hops and minimum end-to-end delay. But the major disadvantage of flooding is the excessive usage of the network resources. With p% partial flooding algorithm the aim is to decrease the network traffic by randomly selecting neighbor nodes and routing traffic through them. This paper explains these two approaches (flooding and p% partial flooding) and compares their performance through various simulations. It is observed that p% partial flooding can result in the same benefits of flooding while decreasing the network traffic. Copyright © 2010 The authors. en_US]
dc.identifier.citationcount 4
dc.identifier.isbn 9781905824182
dc.identifier.scopus 2-s2.0-79952905931 en_US
dc.identifier.uri https://hdl.handle.net/20.500.12469/1550
dc.institutionauthor Erdoğan, Mustafa en_US
dc.institutionauthor Günel, Kadir en_US
dc.institutionauthor Koç, Tuğba en_US
dc.institutionauthor Sökün, Hamza Ümit en_US
dc.institutionauthor Dağ, Tamer en_US
dc.language.iso en en_US
dc.relation.journal 2010 Future Network and Mobile Summit en_US
dc.relation.publicationcategory Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı en_US
dc.rights info:eu-repo/semantics/closedAccess en_US
dc.scopus.citedbyCount 4
dc.subject Flooding en_US
dc.subject Opportunistic networks en_US
dc.subject Routing en_US
dc.subject Selective flooding en_US
dc.title Routing With (p-Percent) Partial Flooding for Opportunistic Networks en_US
dc.type Conference Object en_US
dspace.entity.type Publication
relation.isAuthorOfPublication 6e6ae480-b76e-48a0-a543-13ef44f9d802
relation.isAuthorOfPublication.latestForDiscovery 6e6ae480-b76e-48a0-a543-13ef44f9d802
relation.isOrgUnitOfPublication fd8e65fe-c3b3-4435-9682-6cccb638779c
relation.isOrgUnitOfPublication.latestForDiscovery fd8e65fe-c3b3-4435-9682-6cccb638779c

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Routing with (p-percent) partial flooding for opportunistic networks.pdf
Size:
1.05 MB
Format:
Adobe Portable Document Format
Description: