Researcher:
Genç, Zülküf

Profile Picture
ORCID

Job Title

Master Student

First Name

Zülküf

Last Name

Genç

Name

Name Variants

Genç, Zülküf

Email Address

Birth Date

Filters

2005 - 20064

Advanced Search

Filter by

Settings

Researcher Of Publications: search.filters.isAuthorOfPublication.c0e810e0-4a55-45f6-84f0-428e97e4b384

Search Results

Now showing 1 - 4 of 4
  • Placeholder
    PublicationMetadata only
    Epidemic-based approaches for reliable multicast in mobile ad hoc networks
    (Association for Computing Machinery (ACM), 2006) N/A; Department of Computer Engineering; N/A; N/A; Özkasap, Öznur; Genç, Zülküf; Atsan, Emre; Faculty Member; Doctor; Master Student; Department of Computer Engineering; College of Engineering; N/A; Graduate School of Sciences and Engineering; N/A; Koç University Hospital; N/A; 113507; N/A; N/A
    We present a classification of epidemic-based approaches utilized in the context of mobile ad hoc networks (MANET) with a focus on reliable multicast protocols. We provide a brief description of the other approaches to reliable multicasting in MANETs as well. Then, we describe our protocol, namely EraMobile, offering Epidemic-based Reliable and Adaptive Multicast for Mobile ad hoc networks. EraMobile's target is group applications requiring high-level of reliability and the protocol aims to provide fully reliable multicast data delivery with minimal network overhead even in the adverse network conditions. EraMobile utilizes an epidemic-based method in multicast operation to cope with dynamic and unpredictable topology changes arising from the mobility. Our epidemic mechanism does not require the maintenance of any tree- or mesh-like structure for multicasting. It also needs neither having global or partial view of the network nor having information of neighboring nodes and group members. Besides, it substantially minimizes the overhead incurred by eliminating redundant data transmissions. Another distinguishing feature of EraMobile is its capability of adapting to varying node densities in order to provide reliable data delivery in both sparse networks, where the network connectivity is prone to interruptions, and dense networks, where congestion is likely to occur. EraMobile is shown to achieve fully reliable multicast data delivery studied through extensive simulations by outperforming the other protocols compared, especially in terms of both packet delivery ratio and overhead efficiency.
  • Placeholder
    PublicationMetadata only
    SFG: smart flooding by gossiping
    (Association for Computing Machinery (ACM), 2005) N/A; Genç, Zülküf; Master Student; Graduate School of Sciences and Engineering; N/A
    We aspire to define a reliable and scalable multicast protocol for ad hoc networks. Our target is to utilize epidemic techniques in the design of this protocol. As the first step, we developed an information dissemination method called SFG and presented its initial performance results compared to flooding in this poster paper. The most important contribution of this work is offering a method which requires the nodes neither to be aware of network topology nor to have neighborhood knowledge to disseminate information.
  • Placeholder
    PublicationMetadata only
    Peer-to-peer epidemic algorithms for reliable multicasting in ad hoc networks
    (World acad Sci, Eng and Tech-Waset, 2005) N/A; Department of Computer Engineering; Genç, Zülküf; Özkasap, Öznur; Master Student; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Engineering; N/A; 113507
    Characteristics of ad hoc networks and even their existence depend on the nodes forming them. Thus, services and applications designed for ad hoc networks should adapt to this dynamic and distributed environment. in particular, multicast algorithms having reliability and scalability requirements should abstain from centralized approaches. We aspire to define a reliable and scalable multicast protocol for ad hoc networks. Our target is to utilize epidemic techniques for this purpose. in this paper, we present a brief survey of epidemic algorithms for reliable multicasting in ad hoc networks, and describe formulations and analytical results for simple epidemics. then, P2P anti-entropy algorithm for content distribution and our prototype simulation model are described together with our initial results demonstrating the behavior of the algorithm.
  • Thumbnail Image
    PublicationOpen Access
    Peer-to-peer epidemic algorithms for reliable multicasting in ad hoc networks
    (World Academy of Science, Engineering and Technology (WASET), 2005) Department of Computer Engineering; Genç, Zülküf; Özkasap, Öznur; Faculty Member; Department of Computer Engineering; College of Engineering; N/A; 113507
    Characteristics of ad hoc networks and even their existence depend on the nodes forming them. Thus, services and applications designed for ad hoc networks should adapt to this dynamic and distributed environment. In particular, multicast algorithms having reliability and scalability requirements should abstain from centralized approaches. We aspire to define a reliable and scalable multicast protocol for ad hoc networks. Our target is to utilize epidemic techniques for this purpose. In this paper, we present a brief survey of epidemic algorithms for reliable multicasting in ad hoc networks, and describe formulations and analytical results for simple epidemics. Then, P2P anti-entropy algorithm for content distribution and our prototype simulation model are described together with our initial results demonstrating the behavior of the algorithm.