CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: Opportunistic data forwarding (ODF)</title> <meta name="description" content="Search results for: Opportunistic data forwarding (ODF)"> <meta name="keywords" content="Opportunistic data forwarding (ODF)"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="Opportunistic data forwarding (ODF)" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="Opportunistic data forwarding (ODF)"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 7488</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Opportunistic data forwarding (ODF)</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7488</span> A Comparative Study of Novel Opportunistic Routing Protocols in Mobile Ad Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Poonkuzhali">R. Poonkuzhali</a>, <a href="https://publications.waset.org/search?q=M.%20Y.%20Sanavullah"> M. Y. Sanavullah</a>, <a href="https://publications.waset.org/search?q=M.%20R.%20Gurupriya"> M. R. Gurupriya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Opportunistic routing is used, where the network has the features like dynamic topology changes and intermittent network connectivity. In Delay tolerant network or Disruption tolerant network opportunistic forwarding technique is widely used. The key idea of opportunistic routing is selecting forwarding nodes to forward data packets and coordination among these nodes to avoid duplicate transmissions. This paper gives the analysis of pros and cons of various opportunistic routing techniques used in MANET.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Expected%20Transmission%20Count%20%28ETX%29" title="Expected Transmission Count (ETX)">Expected Transmission Count (ETX)</a>, <a href="https://publications.waset.org/search?q=Opportunistic%0D%0Arouting" title=" Opportunistic routing"> Opportunistic routing</a>, <a href="https://publications.waset.org/search?q=Proactive%20Source%20Routing%20%28PSR%29" title=" Proactive Source Routing (PSR)"> Proactive Source Routing (PSR)</a>, <a href="https://publications.waset.org/search?q=throughput." title=" throughput."> throughput.</a> </p> <a href="https://publications.waset.org/9999570/a-comparative-study-of-novel-opportunistic-routing-protocols-in-mobile-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999570/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999570/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999570/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999570/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999570/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999570/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999570/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999570/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999570/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999570/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999570.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2412</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7487</span> A Preemptive Link State Spanning Tree Source Routing Scheme for Opportunistic Data Forwarding in MANET</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Poonkuzhali">R. Poonkuzhali</a>, <a href="https://publications.waset.org/search?q=M.%20Y.%20Sanavullah"> M. Y. Sanavullah</a>, <a href="https://publications.waset.org/search?q=A.%20Sabari"> A. Sabari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Opportunistic Data Forwarding (ODF) has drawn much attention in mobile adhoc networking research in recent years. The effectiveness of ODF in MANET depends on a suitable routing protocol which provides a powerful source routing services. PLSR is featured by source routing, loop free and small routing overhead. The update messages in PLSR are integrated into a tree structure and no need to time stamp routing updates which reduces the routing overhead.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Mobile%20ad%20hoc%20network%20%28MANET%29" title="Mobile ad hoc network (MANET)">Mobile ad hoc network (MANET)</a>, <a href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29" title=" Opportunistic data forwarding (ODF)"> Opportunistic data forwarding (ODF)</a>, <a href="https://publications.waset.org/search?q=Preemptive%20link%20state%20spanning%20tree%20routing%20%28PLSR%29" title=" Preemptive link state spanning tree routing (PLSR)"> Preemptive link state spanning tree routing (PLSR)</a>, <a href="https://publications.waset.org/search?q=Depth%20First%20Search%20%28DFS%29." title=" Depth First Search (DFS)."> Depth First Search (DFS).</a> </p> <a href="https://publications.waset.org/9998678/a-preemptive-link-state-spanning-tree-source-routing-scheme-for-opportunistic-data-forwarding-in-manet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998678/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998678/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998678/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998678/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998678/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998678/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998678/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998678/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998678/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998678/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998678.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1935</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7486</span> TBOR: Tree Based Opportunistic Routing for Mobile Ad Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Y.%20Harold%20Robinson">Y. Harold Robinson</a>, <a href="https://publications.waset.org/search?q=M.%20Rajaram"> M. Rajaram</a>, <a href="https://publications.waset.org/search?q=E.%20Golden%20Julie"> E. Golden Julie</a>, <a href="https://publications.waset.org/search?q=S.%20Balaji"> S. Balaji</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A mobile ad hoc network (MANET) is a wireless communication network where nodes that are not within direct transmission range establish their communication via the help of other nodes to forward data. Routing protocols in MANETs are usually categorized as proactive. Tree Based Opportunistic Routing (TBOR) finds a multipath link based on maximum probability of the throughput. The simulation results show that the presented method is performed very well compared to the existing methods in terms of throughput, delay and routing overhead. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Mobile%20ad%20hoc%20networks" title="Mobile ad hoc networks">Mobile ad hoc networks</a>, <a href="https://publications.waset.org/search?q=opportunistic%20data%20forwarding" title=" opportunistic data forwarding"> opportunistic data forwarding</a>, <a href="https://publications.waset.org/search?q=proactive%20Source%20routing" title=" proactive Source routing"> proactive Source routing</a>, <a href="https://publications.waset.org/search?q=BFS." title=" BFS."> BFS.</a> </p> <a href="https://publications.waset.org/10005195/tbor-tree-based-opportunistic-routing-for-mobile-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10005195/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10005195/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10005195/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10005195/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10005195/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10005195/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10005195/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10005195/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10005195/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10005195/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10005195.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1222</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7485</span> Adaptive Fuzzy Routing in Opportunistic Network (AFRON)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Payam%20Nabhani">Payam Nabhani</a>, <a href="https://publications.waset.org/search?q=Sima%20Radmanesh"> Sima Radmanesh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Opportunistic network is a kind of Delay Tolerant Networks (DTN) where the nodes in this network come into contact with each other opportunistically and communicate wirelessly and, an end-to-end path between source and destination may have never existed, and disconnection and reconnection is common in the network. In such a network, because of the nature of opportunistic network, perhaps there is no a complete path from source to destination for most of the time and even if there is a path; the path can be very unstable and may change or break quickly. Therefore, routing is one of the main challenges in this environment and, in order to make communication possible in an opportunistic network, the intermediate nodes have to play important role in the opportunistic routing protocols. In this paper we proposed an Adaptive Fuzzy Routing in opportunistic network (AFRON). This protocol is using the simple parameters as input parameters to find the path to the destination node. Using Message Transmission Count, Message Size and Time To Live parameters as input fuzzy to increase delivery ratio and decrease the buffer consumption in the all nodes of network.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Opportunistic%20Routing" title="Opportunistic Routing">Opportunistic Routing</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20Routing" title=" Fuzzy Routing"> Fuzzy Routing</a>, <a href="https://publications.waset.org/search?q=Opportunistic%20Network" title=" Opportunistic Network"> Opportunistic Network</a>, <a href="https://publications.waset.org/search?q=Message%20Routing." title=" Message Routing."> Message Routing.</a> </p> <a href="https://publications.waset.org/8280/adaptive-fuzzy-routing-in-opportunistic-network-afron" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8280/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8280/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8280/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8280/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8280/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8280/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8280/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8280/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8280/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8280/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8280.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1537</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7484</span> Broadcasting Mechanism with Less Flooding Packets by Optimally Constructing Forwarding and Non-Forwarding Nodes in Mobile Ad Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Reka">R. Reka</a>, <a href="https://publications.waset.org/search?q=R.%20S.%20D.%20Wahidabanu"> R. S. D. Wahidabanu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The conventional routing protocol designed for MANET fail to handle dynamic movement and self-starting behavior of the node effectively. Every node in MANET is considered as forward as well receiver node and all of them participate in routing the packet from source to the destination. While the interconnection topology is highly dynamic, the performance of the most of the routing protocol is not encouraging. In this paper, a reliable broadcast approach for MANET is proposed for improving the transmission rate. The MANET is considered with asymmetric characteristics and the properties of the source and destination nodes are different. The non-forwarding node list is generated with a downstream node and they do not participate in the routing. While the forwarding and non-forwarding node is constructed in a conventional way, the number of nodes in non-forwarding list is more and increases the load. In this work, we construct the forwarding and non-forwarding node optimally so that the flooding and broadcasting is reduced to certain extent. The forwarded packet is considered as acknowledgements and the non-forwarding nodes explicitly send the acknowledgements to the source. The performance of the proposed approach is evaluated in NS2 environment. Since the proposed approach reduces the flooding, we have considered functionality of the proposed approach with AODV variants. The effect of network density on the overhead and collision rate is considered for performance evaluation. The performance is compared with the AODV variants found that the proposed approach outperforms all the variants.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Flooding" title="Flooding">Flooding</a>, <a href="https://publications.waset.org/search?q=Forwarded%20Nodes" title=" Forwarded Nodes"> Forwarded Nodes</a>, <a href="https://publications.waset.org/search?q=MANET" title=" MANET"> MANET</a>, <a href="https://publications.waset.org/search?q=Non-forwarding%20nodes" title=" Non-forwarding nodes"> Non-forwarding nodes</a>, <a href="https://publications.waset.org/search?q=Routing%20protocols." title=" Routing protocols."> Routing protocols.</a> </p> <a href="https://publications.waset.org/9997714/broadcasting-mechanism-with-less-flooding-packets-by-optimally-constructing-forwarding-and-non-forwarding-nodes-in-mobile-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997714/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997714/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997714/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997714/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997714/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997714/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997714/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997714/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997714/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997714/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997714.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2026</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7483</span> A Survey on Opportunistic Routing in Mobile Ad Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Poonkuzhali">R. Poonkuzhali</a>, <a href="https://publications.waset.org/search?q=M.%20Y.%20Sanavullah"> M. Y. Sanavullah</a>, <a href="https://publications.waset.org/search?q=A.%20Sabari"> A. Sabari</a>, <a href="https://publications.waset.org/search?q=T.%20Dhivyaa"> T. Dhivyaa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Opportunistic Routing (OR) increases the transmission reliability and network throughput. Traditional routing protocols preselects one or more predetermined nodes before transmission starts and uses a predetermined neighbor to forward a packet in each hop. The opportunistic routing overcomes the drawback of unreliable wireless transmission by broadcasting one transmission can be overheard by manifold neighbors. The first cooperation-optimal protocol for Multirate OR (COMO) used to achieve social efficiency and prevent the selfish behavior of the nodes. The novel link-correlation-aware OR improves the performance by exploiting the miscellaneous low correlated forward links. Context aware Adaptive OR (CAOR) uses active suppression mechanism to reduce packet duplication. The Context-aware OR (COR) can provide efficient routing in mobile networks. By using Cooperative Opportunistic Routing in Mobile Ad hoc Networks (CORMAN), the problem of opportunistic data transfer can be tackled. While comparing to all the protocols, COMO is the best as it achieves social efficiency and prevents the selfish behavior of the nodes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=CAOR" title="CAOR">CAOR</a>, <a href="https://publications.waset.org/search?q=COMO" title=" COMO"> COMO</a>, <a href="https://publications.waset.org/search?q=COR" title=" COR"> COR</a>, <a href="https://publications.waset.org/search?q=CORMAN" title=" CORMAN"> CORMAN</a>, <a href="https://publications.waset.org/search?q=MANET" title=" MANET"> MANET</a>, <a href="https://publications.waset.org/search?q=Opportunistic%20Routing" title=" Opportunistic Routing"> Opportunistic Routing</a>, <a href="https://publications.waset.org/search?q=Reliability" title=" Reliability"> Reliability</a>, <a href="https://publications.waset.org/search?q=Throughput." title=" Throughput."> Throughput.</a> </p> <a href="https://publications.waset.org/10003139/a-survey-on-opportunistic-routing-in-mobile-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003139/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003139/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003139/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003139/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003139/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003139/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003139/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003139/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003139/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003139/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003139.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1882</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7482</span> Packet Forwarding with Multiprotocol Label Switching</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.N.Pise">R.N.Pise</a>, <a href="https://publications.waset.org/search?q=S.A.Kulkarni"> S.A.Kulkarni</a>, <a href="https://publications.waset.org/search?q=R.V.Pawar"> R.V.Pawar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> MultiProtocol Label Switching (MPLS) is an emerging technology that aims to address many of the existing issues associated with packet forwarding in today-s Internetworking environment. It provides a method of forwarding packets at a high rate of speed by combining the speed and performance of Layer 2 with the scalability and IP intelligence of Layer 3. In a traditional IP (Internet Protocol) routing network, a router analyzes the destination IP address contained in the packet header. The router independently determines the next hop for the packet using the destination IP address and the interior gateway protocol. This process is repeated at each hop to deliver the packet to its final destination. In contrast, in the MPLS forwarding paradigm routers on the edge of the network (label edge routers) attach labels to packets based on the forwarding Equivalence class (FEC). Packets are then forwarded through the MPLS domain, based on their associated FECs , through swapping the labels by routers in the core of the network called label switch routers. The act of simply swapping the label instead of referencing the IP header of the packet in the routing table at each hop provides a more efficient manner of forwarding packets, which in turn allows the opportunity for traffic to be forwarded at tremendous speeds and to have granular control over the path taken by a packet. This paper deals with the process of MPLS forwarding mechanism, implementation of MPLS datapath , and test results showing the performance comparison of MPLS and IP routing. The discussion will focus primarily on MPLS IP packet networks – by far the most common application of MPLS today. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Forwarding%20equivalence%20class" title="Forwarding equivalence class">Forwarding equivalence class</a>, <a href="https://publications.waset.org/search?q=incoming%20label%20map" title=" incoming label map"> incoming label map</a>, <a href="https://publications.waset.org/search?q=label" title="label">label</a>, <a href="https://publications.waset.org/search?q=next%20hop%20label%20forwarding%20entry." title=" next hop label forwarding entry."> next hop label forwarding entry.</a> </p> <a href="https://publications.waset.org/9804/packet-forwarding-with-multiprotocol-label-switching" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9804/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9804/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9804/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9804/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9804/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9804/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9804/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9804/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9804/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9804/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9804.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2693</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7481</span> Selective Forwarding Attack and Its Detection Algorithms: A Review</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sushil%20Sarwa">Sushil Sarwa</a>, <a href="https://publications.waset.org/search?q=Rajeev%20Kumar"> Rajeev Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The wireless mesh networks (WMNs) are emerging technology in wireless networking as they can serve large scale high speed internet access. Due to its wireless multi-hop feature, wireless mesh network is prone to suffer from many attacks, such as denial of service attack (DoS). We consider a special case of DoS attack which is selective forwarding attack (a.k.a. gray hole attack). In such attack, a misbehaving mesh router selectively drops the packets it receives rom its predecessor mesh router. It is very hard to detect that packet loss is due to medium access collision, bad channel quality or because of selective forwarding attack. In this paper, we present a review of detection algorithms of selective forwarding attack and discuss their advantage & disadvantage. Finally we conclude this paper with open research issues and challenges.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=CAD%20algorithm" title="CAD algorithm">CAD algorithm</a>, <a href="https://publications.waset.org/search?q=CHEMAS" title=" CHEMAS"> CHEMAS</a>, <a href="https://publications.waset.org/search?q=selective%20forwarding%0D%0Aattack" title=" selective forwarding attack"> selective forwarding attack</a>, <a href="https://publications.waset.org/search?q=watchdog%20%26%20pathrater" title=" watchdog & pathrater"> watchdog & pathrater</a>, <a href="https://publications.waset.org/search?q=wireless%20mesh%20network." title=" wireless mesh network."> wireless mesh network.</a> </p> <a href="https://publications.waset.org/16344/selective-forwarding-attack-and-its-detection-algorithms-a-review" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16344/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16344/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16344/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16344/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16344/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16344/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16344/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16344/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16344/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16344/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16344.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2796</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7480</span> Trustworthy Link Failure Recovery Algorithm for Highly Dynamic Mobile Adhoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Y.%20Harold%20Robinson">Y. Harold Robinson</a>, <a href="https://publications.waset.org/search?q=M.%20Rajaram"> M. Rajaram</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Trustworthy link failure recovery algorithm is introduced in this paper, to provide the forwarding continuity even with compound link failures. The ephemeral failures are common in IP networks and it also has some proposals based on local rerouting. To ensure forwarding continuity, we are introducing the compound link failure recovery algorithm, even with compound link failures. For forwarding the information, each packet carries a blacklist, which is a min set of failed links encountered along its path, and the next hop is chosen by excluding the blacklisted links. Our proposed method describes how it can be applied to ensure forwarding to all reachable destinations in case of any two or more link or node failures in the network. After simulating with NS2 contains lot of samples proved that the proposed protocol achieves exceptional concert even under elevated node mobility using Trustworthy link Failure Recovery Algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Wireless%20Sensor%20Networks" title="Wireless Sensor Networks">Wireless Sensor Networks</a>, <a href="https://publications.waset.org/search?q=Predistribution%20Scheme" title=" Predistribution Scheme"> Predistribution Scheme</a>, <a href="https://publications.waset.org/search?q=Cryptographic%20Techniques." title=" Cryptographic Techniques."> Cryptographic Techniques.</a> </p> <a href="https://publications.waset.org/10001667/trustworthy-link-failure-recovery-algorithm-for-highly-dynamic-mobile-adhoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10001667/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10001667/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10001667/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10001667/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10001667/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10001667/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10001667/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10001667/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10001667/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10001667/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10001667.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1874</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7479</span> Opportunistic Routing with Secure Coded Wireless Multicast Using MAS Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=E.%20Golden%20Julie">E. Golden Julie</a>, <a href="https://publications.waset.org/search?q=S.%20Tamil%20Selvi"> S. Tamil Selvi</a>, <a href="https://publications.waset.org/search?q=Y.%20Harold%20Robinson"> Y. Harold Robinson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Many Wireless Sensor Network (WSN) applications necessitate secure multicast services for the purpose of broadcasting delay sensitive data like video files and live telecast at fixed time-slot. This work provides a novel method to deal with end-to-end delay and drop rate of packets. Opportunistic Routing chooses a link based on the maximum probability of packet delivery ratio. Null Key Generation helps in authenticating packets to the receiver. Markov Decision Process based Adaptive Scheduling algorithm determines the time slot for packet transmission. Both theoretical analysis and simulation results show that the proposed protocol ensures better performance in terms of packet delivery ratio, average end-to-end delay and normalized routing overhead.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Delay-sensitive%20data" title="Delay-sensitive data">Delay-sensitive data</a>, <a href="https://publications.waset.org/search?q=Markovian%20Decision%20Process%20based%20Adaptive%20Scheduling" title=" Markovian Decision Process based Adaptive Scheduling"> Markovian Decision Process based Adaptive Scheduling</a>, <a href="https://publications.waset.org/search?q=Opportunistic%20Routing" title=" Opportunistic Routing"> Opportunistic Routing</a>, <a href="https://publications.waset.org/search?q=Digital%20Signature%20authentication." title=" Digital Signature authentication. "> Digital Signature authentication. </a> </p> <a href="https://publications.waset.org/9999073/opportunistic-routing-with-secure-coded-wireless-multicast-using-mas-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999073/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999073/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999073/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999073/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999073/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999073/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999073/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999073/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999073/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999073/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999073.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1957</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7478</span> Pervasive Differentiated Services: A QoS Model for Pervasive Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sherif%20G.%20Aly">Sherif G. Aly</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this article, we introduce a mechanism by which the same concept of differentiated services used in network transmission can be applied to provide quality of service levels to pervasive systems applications. The classical DiffServ model, including marking and classification, assured forwarding, and expedited forwarding, are all utilized to create quality of service guarantees for various pervasive applications requiring different levels of quality of service. Through a collection of various sensors, personal devices, and data sources, the transmission of contextsensitive data can automatically occur within a pervasive system with a given quality of service level. Triggers, initiators, sources, and receivers are four entities labeled in our mechanism. An explanation of the role of each is provided, and how quality of service is guaranteed.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Pervasive%20systems" title="Pervasive systems">Pervasive systems</a>, <a href="https://publications.waset.org/search?q=quality%20of%20service" title=" quality of service"> quality of service</a>, <a href="https://publications.waset.org/search?q=differentiated%20services" title=" differentiated services"> differentiated services</a>, <a href="https://publications.waset.org/search?q=mobile%20devices." title=" mobile devices."> mobile devices.</a> </p> <a href="https://publications.waset.org/8635/pervasive-differentiated-services-a-qos-model-for-pervasive-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8635/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8635/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8635/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8635/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8635/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8635/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8635/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8635/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8635/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8635/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8635.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1497</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7477</span> Simulation using the Recursive Method in USN</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tae%20Kyung%20Kim">Tae Kyung Kim</a>, <a href="https://publications.waset.org/search?q=Hee%20Suk%20Seo"> Hee Suk Seo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sensor networks are often deployed in unattended environments, thus leaving these networks vulnerable to false data injection attacks in which an adversary injects forged reports into the network through compromised nodes, with the goal of deceiving the base station or depleting the resources of forwarding nodes. Several research solutions have been recently proposed to detect and drop such forged reports during the forwarding process. Each design can provide the equivalent resilience in terms of node compromising. However, their energy consumption characteristics differ from each other. Thus, employing only a single filtering scheme for a network is not a recommendable strategy in terms of energy saving. It's very important the threshold determination for message authentication to identify. We propose the recursive contract net protocols which less energy level of terminal node in wireless sensor network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Data%20filtering" title="Data filtering">Data filtering</a>, <a href="https://publications.waset.org/search?q=recursive%20CNP" title=" recursive CNP"> recursive CNP</a>, <a href="https://publications.waset.org/search?q=simulation." title=" simulation."> simulation.</a> </p> <a href="https://publications.waset.org/8708/simulation-using-the-recursive-method-in-usn" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8708/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8708/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8708/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8708/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8708/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8708/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8708/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8708/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8708/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8708/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8708.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1503</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7476</span> Tree-on-DAG for Data Aggregation in Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Prakash%20G%20L">Prakash G L</a>, <a href="https://publications.waset.org/search?q=Thejaswini%20M"> Thejaswini M</a>, <a href="https://publications.waset.org/search?q=S%20H%20Manjula"> S H Manjula</a>, <a href="https://publications.waset.org/search?q=K%20R%20Venugopal"> K R Venugopal</a>, <a href="https://publications.waset.org/search?q=L%20M%20Patnaik"> L M Patnaik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreover, structured approaches are sensitive to the waiting time that is used by nodes to wait for packets from their children before forwarding the packet to the sink. An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. We propose Tree on DAG (ToD), a semistructured approach that uses Dynamic Forwarding on an implicitly constructed structure composed of multiple shortest path trees to support network scalability. The key principle behind ToD is that adjacent nodes in a graph will have low stretch in one of these trees in ToD, thus resulting in early aggregation of packets. Based on simulations on a 2,000-node Mica2- based network, we conclude that efficient aggregation in large-scale networks can be achieved by our semistructured approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Aggregation" title="Aggregation">Aggregation</a>, <a href="https://publications.waset.org/search?q=Packet%20Merging" title=" Packet Merging"> Packet Merging</a>, <a href="https://publications.waset.org/search?q=Query%20Processing." title=" Query Processing."> Query Processing.</a> </p> <a href="https://publications.waset.org/5132/tree-on-dag-for-data-aggregation-in-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5132/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5132/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5132/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5132/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5132/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5132/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5132/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5132/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5132/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5132/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5132.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1931</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7475</span> REDD: Reliable Energy-Efficient Data Dissemination in Wireless Sensor Networks with Multiple Mobile Sinks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20Singh">K. Singh</a>, <a href="https://publications.waset.org/search?q=T.%20P.%20Sharma"> T. P. Sharma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In wireless sensor network (WSN) the use of mobile sink has been attracting more attention in recent times. Mobile sinks are more effective means of balancing load, reducing hotspot problem and elongating network lifetime. The sensor nodes in WSN have limited power supply, computational capability and storage and therefore for continuous data delivery reliability becomes high priority in these networks. In this paper, we propose a Reliable Energy-efficient Data Dissemination (REDD) scheme for WSNs with multiple mobile sinks. In this strategy, sink first determines the location of source and then directly communicates with the source using geographical forwarding. Every forwarding node (FN) creates a local zone comprising some sensor nodes that can act as representative of FN when it fails. Analytical and simulation study reveals significant improvement in energy conservation and reliable data delivery in comparison to existing schemes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Energy%20Efficient" title="Energy Efficient">Energy Efficient</a>, <a href="https://publications.waset.org/search?q=REED" title=" REED"> REED</a>, <a href="https://publications.waset.org/search?q=Sink%20Mobility" title=" Sink Mobility"> Sink Mobility</a>, <a href="https://publications.waset.org/search?q=WSN." title=" WSN."> WSN.</a> </p> <a href="https://publications.waset.org/4632/redd-reliable-energy-efficient-data-dissemination-in-wireless-sensor-networks-with-multiple-mobile-sinks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4632/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4632/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4632/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4632/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4632/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4632/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4632/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4632/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4632/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4632/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4632.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1939</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7474</span> Seamless Multicast Handover in Fmipv6-Based Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Moneeb%20Gohar">Moneeb Gohar</a>, <a href="https://publications.waset.org/search?q=Seok%20Joo%20Koh"> Seok Joo Koh</a>, <a href="https://publications.waset.org/search?q=Tae-Won%20Um"> Tae-Won Um</a>, <a href="https://publications.waset.org/search?q=Hyun-Woo%20Lee"> Hyun-Woo Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a fast tree join scheme to provide seamless multicast handover in the mobile networks based on the Fast Mobile IPv6 (FMIPv6). In the existing FMIPv6-based multicast handover scheme, the bi-directional tunnelling or the remote subscription is employed with the packet forwarding from the previous access router (AR) to the new AR. In general, the remote subscription approach is preferred to the bi-directional tunnelling one, since in the remote subscription scheme we can exploit an optimized multicast path from a multicast source to many mobile receivers. However, in the remote subscription scheme, if the tree joining operation takes a long time, the amount of data packets to be forwarded and buffered for multicast handover will increase, and thus the corresponding buffer may overflow, which results in severe packet losses. In order to reduce these costs associated with packet forwarding and buffering, this paper proposes the fast join to multicast tree, in which the new AR will join the multicast tree as fast as possible, so that the new multicast data packets can also arrive at the new AR, by which the packet forwarding and buffering costs can be reduced. From numerical analysis, it is shown that the proposed scheme can give better performance than the existing FMIPv6-based multicast handover schemes in terms of the multicast packet delivery costs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Mobile%20Multicast" title="Mobile Multicast">Mobile Multicast</a>, <a href="https://publications.waset.org/search?q=FMIPv6" title=" FMIPv6"> FMIPv6</a>, <a href="https://publications.waset.org/search?q=Seamless%20Handover" title=" Seamless Handover"> Seamless Handover</a>, <a href="https://publications.waset.org/search?q=Fast%20Tree%20Join." title=" Fast Tree Join."> Fast Tree Join.</a> </p> <a href="https://publications.waset.org/10679/seamless-multicast-handover-in-fmipv6-based-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10679/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10679/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10679/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10679/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10679/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10679/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10679/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10679/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10679/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10679/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10679.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1426</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7473</span> Optimal Opportunistic Maintenance Policy for a Two-Unit System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nooshin%20Salari">Nooshin Salari</a>, <a href="https://publications.waset.org/search?q=Viliam%20Makis"> Viliam Makis</a>, <a href="https://publications.waset.org/search?q=Jane%20Doe"> Jane Doe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a maintenance policy for a system consisting of two units. Unit 1 is gradually deteriorating and is subject to soft failure. Unit 2 has a general lifetime distribution and is subject to hard failure. Condition of unit 1 of the system is monitored periodically and it is considered as failed when its deterioration level reaches or exceeds a critical level N. At the failure time of unit 2 system is considered as failed, and unit 2 will be correctively replaced by the next inspection epoch. Unit 1 or 2 are preventively replaced when deterioration level of unit 1 or age of unit 2 exceeds the related preventive maintenance (PM) levels. At the time of corrective or preventive replacement of unit 2, there is an opportunity to replace unit 1 if its deterioration level reaches the opportunistic maintenance (OM) level. If unit 2 fails in an inspection interval, system stops operating although unit 1 has not failed. A mathematical model is derived to find the preventive and opportunistic replacement levels for unit 1 and preventive replacement age for unit 2, that minimize the long run expected average cost per unit time. The problem is formulated and solved in the semi-Markov decision process (SMDP) framework. Numerical example is provided to illustrate the performance of the proposed model and the comparison of the proposed model with an optimal policy without opportunistic maintenance level for unit 1 is carried out. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Condition-based%20maintenance" title="Condition-based maintenance">Condition-based maintenance</a>, <a href="https://publications.waset.org/search?q=opportunistic%0D%0Amaintenance" title=" opportunistic maintenance"> opportunistic maintenance</a>, <a href="https://publications.waset.org/search?q=preventive%20maintenance" title=" preventive maintenance"> preventive maintenance</a>, <a href="https://publications.waset.org/search?q=two-unit%20system." title=" two-unit system."> two-unit system.</a> </p> <a href="https://publications.waset.org/10007253/optimal-opportunistic-maintenance-policy-for-a-two-unit-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007253/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007253/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007253/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007253/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007253/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007253/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007253/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007253/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007253/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007253/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007253.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1017</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7472</span> Implementation and Demonstration of Software-Defined Traffic Grooming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Lei%20Guo">Lei Guo</a>, <a href="https://publications.waset.org/search?q=Xu%20Zhang"> Xu Zhang</a>, <a href="https://publications.waset.org/search?q=Weigang%20Hou"> Weigang Hou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Since the traditional network is closed and it has no architecture to create applications, it has been unable to evolve with changing demands under the rapid innovation in services. Additionally, due to the lack of the whole network profile, the quality of service cannot be well guaranteed in the traditional network. The Software Defined Network (SDN) utilizes global resources to support on-demand applications/services via open, standardized and programmable interfaces. In this paper, we implement the traffic grooming application under a real SDN environment, and the corresponding analysis is made. In our SDN: 1) we use OpenFlow protocol to control the entire network by using software applications running on the network operating system; 2) several virtual switches are combined into the data forwarding plane through Open vSwitch; 3) An OpenFlow controller, NOX, is involved as a logically centralized control plane that dynamically configures the data forwarding plane; 4) The traffic grooming based on SDN is demonstrated through dynamically modifying the idle time of flow entries. The experimental results demonstrate that the SDN-based traffic grooming effectively reduces the end-to-end delay, and the improvement ratio arrives to 99%.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=NOX" title="NOX">NOX</a>, <a href="https://publications.waset.org/search?q=OpenFlow" title=" OpenFlow"> OpenFlow</a>, <a href="https://publications.waset.org/search?q=software%20defined%20network" title=" software defined network"> software defined network</a>, <a href="https://publications.waset.org/search?q=traffic%20grooming." title=" traffic grooming."> traffic grooming.</a> </p> <a href="https://publications.waset.org/10005278/implementation-and-demonstration-of-software-defined-traffic-grooming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10005278/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10005278/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10005278/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10005278/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10005278/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10005278/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10005278/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10005278/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10005278/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10005278/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10005278.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1029</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7471</span> An Adaptive Opportunistic Transmission for Unlicensed Spectrum Sharing in Heterogeneous Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Daehyoung%20Kim">Daehyoung Kim</a>, <a href="https://publications.waset.org/search?q=Pervez%20Khan"> Pervez Khan</a>, <a href="https://publications.waset.org/search?q=Hoon%20Kim"> Hoon Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Efficient utilization of spectrum resources is a fundamental issue of wireless communications due to its scarcity. To improve the efficiency of spectrum utilization, the spectrum sharing for unlicensed bands is being regarded as one of key technologies in the next generation wireless networks. A number of schemes such as Listen-Before-Talk(LBT) and carrier sensor adaptive transmission (CSAT) have been suggested from this aspect, but more efficient sharing schemes are required for improving spectrum utilization efficiency. This work considers an opportunistic transmission approach and a dynamic Contention Window (CW) adjustment scheme for LTE-U users sharing the unlicensed spectrum with Wi-Fi, in order to enhance the overall system throughput. The decision criteria for the dynamic adjustment of CW are based on the collision evaluation, derived from the collision probability of the system. The overall performance can be improved due to the adaptive adjustment of the CW. Simulation results show that our proposed scheme outperforms the Distributed Coordination Function (DCF) mechanism of IEEE 802.11 MAC. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Spectrum%20sharing" title="Spectrum sharing">Spectrum sharing</a>, <a href="https://publications.waset.org/search?q=adaptive%20opportunistic%20transmission" title=" adaptive opportunistic transmission"> adaptive opportunistic transmission</a>, <a href="https://publications.waset.org/search?q=unlicensed%20bands" title=" unlicensed bands"> unlicensed bands</a>, <a href="https://publications.waset.org/search?q=heterogeneous%20networks." title=" heterogeneous networks."> heterogeneous networks.</a> </p> <a href="https://publications.waset.org/10004604/an-adaptive-opportunistic-transmission-for-unlicensed-spectrum-sharing-in-heterogeneous-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004604/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004604/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004604/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004604/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004604/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004604/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004604/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004604/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004604/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004604/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004604.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1375</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7470</span> Neurological Manifestations in Patients with HIV Infection in the Era of Combined Antiretroviral Therapy </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sharan%20Badiger">Sharan Badiger</a>, <a href="https://publications.waset.org/search?q=Prema%20T.%20Akkasaligar"> Prema T. Akkasaligar</a>, <a href="https://publications.waset.org/search?q=Deepak%20Kadeli"> Deepak Kadeli</a>, <a href="https://publications.waset.org/search?q=M.%20Vishok"> M. Vishok </a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Neurological disorders are the most debilitating of manifestations seen in patients infected with HIV. The clinical profile of neurological manifestations in HIV patients has undergone a shift in recent years with opportunistic infections being controlled with combination anti-retroviral therapy and the advent of drugs which have higher central nervous system penetrability. The aim of this paper is to study the clinical, investigation profile and various neurological disorders in HIV patients on anti‐retroviral therapy. Fifty HIV patients with neurological manifestations were studied. A complete neurological examination including neurocognitive functioning using Montreal Cognitive Assessment and HIV Dementia scale were assessed. Apart from relevant investigations, CD4 count, cerebrovascular fluid analysis, computed tomography (CT) and magnetic resonance imaging (MRI) of brain were done whenever required. Neurocognitive disorders formed the largest group with 42% suffering from HIV associated Neurocognitive Disorders. Among them, asymptomatic neurocognitive impairment was seen in 28%; mild neurocognitive disorder in 12%, and 2% had HIV‐associated dementia. Opportunistic infections of the nervous system accounted for 32%, with meningitis being the most common. Four patients had space occupying lesions of central nervous system; four tuberculomas, and one toxoplasmosis. With the advent of highly active retroviral therapy, HIV patients have longer life spans with suppression of viral load leading to decrease in opportunistic infections of the nervous system. Neurocognitive disorders are now the most common neurological dysfunction seen and thus neurocognitive assessment must be done in all patients with HIV.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Anti%20retroviral%20therapy" title="Anti retroviral therapy">Anti retroviral therapy</a>, <a href="https://publications.waset.org/search?q=cognitive%20dysfunction" title=" cognitive dysfunction"> cognitive dysfunction</a>, <a href="https://publications.waset.org/search?q=dementia" title=" dementia"> dementia</a>, <a href="https://publications.waset.org/search?q=neurological%20manifestations" title=" neurological manifestations"> neurological manifestations</a>, <a href="https://publications.waset.org/search?q=opportunistic%20infections." title=" opportunistic infections."> opportunistic infections.</a> </p> <a href="https://publications.waset.org/10004102/neurological-manifestations-in-patients-with-hiv-infection-in-the-era-of-combined-antiretroviral-therapy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004102/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004102/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004102/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004102/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004102/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004102/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004102/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004102/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004102/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004102/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004102.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1668</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7469</span> A Broadcasting Strategy for Interactive Video-on-Demand Services</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yu-Wei%20Chen">Yu-Wei Chen</a>, <a href="https://publications.waset.org/search?q=Li-Ren%20Han"> Li-Ren Han</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we employ the approach of linear programming to propose a new interactive broadcast method. In our method, a film S is divided into n equal parts and broadcast via k channels. The user simultaneously downloads these segments from k channels into the user-s set-top-box (STB) and plays them in order. Our method assumes that the initial p segments will not have fast-forwarding capabilities. Every time the user wants to initiate d times fast-forwarding, according to our broadcasting strategy, the necessary segments already saved in the user-s STB or are just download on time for playing. The proposed broadcasting strategy not only allows the user to pause and rewind, but also to fast-forward. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Broadcasting" title="Broadcasting">Broadcasting</a>, <a href="https://publications.waset.org/search?q=Near%20Video-on-Demand%20%28VOD%29" title=" Near Video-on-Demand (VOD)"> Near Video-on-Demand (VOD)</a>, <a href="https://publications.waset.org/search?q=Linear%20Programming" title="Linear Programming">Linear Programming</a>, <a href="https://publications.waset.org/search?q=Video-Cassette-Recorder%20%28VCR%29%20Functions" title=" Video-Cassette-Recorder (VCR) Functions"> Video-Cassette-Recorder (VCR) Functions</a>, <a href="https://publications.waset.org/search?q=Waiting%20Time." title="Waiting Time.">Waiting Time.</a> </p> <a href="https://publications.waset.org/253/a-broadcasting-strategy-for-interactive-video-on-demand-services" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/253/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/253/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/253/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/253/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/253/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/253/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/253/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/253/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/253/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/253/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/253.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1747</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7468</span> Suitable Partner Node Selection and Resource Allocation in Cooperative Wireless Communication Using the Trade-Off Game</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Oluseye%20A.%20Adeleke">Oluseye A. Adeleke</a>, <a href="https://publications.waset.org/search?q=Mohd.%20F.%20M.%20Salleh"> Mohd. F. M. Salleh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The performance of any cooperative communication system depends largely on the selection of a proper partner. Another important factor to consider is an efficient allocation of resource like power by the source node to help it in forwarding information to the destination. In this paper, we look at the concepts of partner selection and resource (power) allocation for a distributed communication network. A type of non-cooperative game referred to as Trade-Off game is employed so as to jointly consider the utilities of the source and relay nodes, where in this case, the source is the node that requires help with forwarding of its information while the partner is the node that is willing to help in forwarding the source node’s information, but at a price. The approach enables the source node to maximize its utility by selecting a partner node based on (i) the proximity of the partner node to the source and destination nodes, and (ii) the price the partner node will charge for the help being rendered. Our proposed scheme helps the source locate and select the relay nodes at ‘better’ locations and purchase power optimally from them. It also aids the contending relay nodes maximize their own utilities as well by asking proper prices. Our game scheme is seen to converge to unique equilibrium.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cooperative%20communication" title="Cooperative communication">Cooperative communication</a>, <a href="https://publications.waset.org/search?q=game%20theory" title=" game theory"> game theory</a>, <a href="https://publications.waset.org/search?q=node" title=" node"> node</a>, <a href="https://publications.waset.org/search?q=power%20allocation" title=" power allocation"> power allocation</a>, <a href="https://publications.waset.org/search?q=trade-off" title=" trade-off"> trade-off</a>, <a href="https://publications.waset.org/search?q=utility." title=" utility."> utility.</a> </p> <a href="https://publications.waset.org/9997713/suitable-partner-node-selection-and-resource-allocation-in-cooperative-wireless-communication-using-the-trade-off-game" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997713/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997713/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997713/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997713/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997713/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997713/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997713/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997713/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997713/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997713/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997713.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1938</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7467</span> Study on the Presence of Protozoal Coinfections among Patients with Pneumocystis jirovecii Pneumonia in Bulgaria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=N.%20Tsvetkova">N. Tsvetkova</a>, <a href="https://publications.waset.org/search?q=R.%20Harizanov%20A.%20Ivanova"> R. Harizanov A. Ivanova</a>, <a href="https://publications.waset.org/search?q=I.%20Rainova"> I. Rainova</a>, <a href="https://publications.waset.org/search?q=N.%20Yancheva-Petrova"> N. Yancheva-Petrova</a>, <a href="https://publications.waset.org/search?q=D.%20Strashimirov"> D. Strashimirov</a>, <a href="https://publications.waset.org/search?q=R.%20Enikova"> R. Enikova</a>, <a href="https://publications.waset.org/search?q=M.%20Videnova"> M. Videnova</a>, <a href="https://publications.waset.org/search?q=E.%20Kaneva"> E. Kaneva</a>, <a href="https://publications.waset.org/search?q=I.%20Kaftandjiev"> I. Kaftandjiev</a>, <a href="https://publications.waset.org/search?q=V.%20Levterova"> V. Levterova</a>, <a href="https://publications.waset.org/search?q=I.%20Simeonovski"> I. Simeonovski</a>, <a href="https://publications.waset.org/search?q=N.%20Yanev"> N. Yanev</a>, <a href="https://publications.waset.org/search?q=G.%20Hinkov"> G. Hinkov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The Pneumocystis jirovecii (P. jirovecii) and protozoan of the genera Acanthamoeba, Cryptosporidium, and Toxoplasma gondii are opportunistic pathogens that can cause life-threatening infections in immunocompromised patients. Aim of the study was to evaluate the coinfection rate with opportunistic protozoal agents among Bulgarian patients diagnosed with P. jirovecii pneumonia. 38 pulmonary samples were collected from 38 patients (28 HIV-infected) with P. jirovecii infection. P. jirovecii DNA was detected by real-time PCR targeting the large mitochondrial subunit ribosomal RNA gene. Acanthamoeba was determined by genus-specific conventional PCR assay. Real-time PCR for the detection of a Toxoplasma gondii and Cryptosporidium DNA fragment was used. Pneumocystis DNA was detected in all 38 specimens; 28 (73.7%) were from HIV-infected patients. Three (10,7%) of them were coinfected with T. gondii and 1 (3.6%) with Cryptosporidium. In the group of non-HIV-infected (n = 10), Cryptosporidium DNA was detected in an infant (10%). Acanthamoeba DNA was not found in the tested samples. The current study showed a relatively low rate of coinfections of Cryptosporidium spp./T. gondii and P. jirovecii in the Bulgarian patients studied.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Coinfection" title="Coinfection">Coinfection</a>, <a href="https://publications.waset.org/search?q=opportunistic%20protozoal%20agents" title=" opportunistic protozoal agents"> opportunistic protozoal agents</a>, <a href="https://publications.waset.org/search?q=Pneumocystis%20jirovecii" title=" Pneumocystis jirovecii"> Pneumocystis jirovecii</a>, <a href="https://publications.waset.org/search?q=pulmonary%20infections." title=" pulmonary infections."> pulmonary infections.</a> </p> <a href="https://publications.waset.org/10013227/study-on-the-presence-of-protozoal-coinfections-among-patients-with-pneumocystis-jirovecii-pneumonia-in-bulgaria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10013227/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10013227/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10013227/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10013227/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10013227/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10013227/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10013227/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10013227/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10013227/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10013227/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10013227.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">236</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7466</span> A New Protocol for Concealed Data Aggregation in Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Abbasi%20Dezfouli">M. Abbasi Dezfouli</a>, <a href="https://publications.waset.org/search?q=S.%20Mazraeh"> S. Mazraeh</a>, <a href="https://publications.waset.org/search?q=M.%20H.%20Yektaie"> M. H. Yektaie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless sensor networks (WSN) consists of many sensor nodes that are placed on unattended environments such as military sites in order to collect important information. Implementing a secure protocol that can prevent forwarding forged data and modifying content of aggregated data and has low delay and overhead of communication, computing and storage is very important. This paper presents a new protocol for concealed data aggregation (CDA). In this protocol, the network is divided to virtual cells, nodes within each cell produce a shared key to send and receive of concealed data with each other. Considering to data aggregation in each cell is locally and implementing a secure authentication mechanism, data aggregation delay is very low and producing false data in the network by malicious nodes is not possible. To evaluate the performance of our proposed protocol, we have presented computational models that show the performance and low overhead in our protocol. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Wireless%20Sensor%20Networks" title="Wireless Sensor Networks">Wireless Sensor Networks</a>, <a href="https://publications.waset.org/search?q=Security" title=" Security"> Security</a>, <a href="https://publications.waset.org/search?q=Concealed%0AData%20Aggregation." title=" Concealed Data Aggregation."> Concealed Data Aggregation.</a> </p> <a href="https://publications.waset.org/14018/a-new-protocol-for-concealed-data-aggregation-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14018/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14018/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14018/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14018/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14018/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14018/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14018/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14018/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14018/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14018/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14018.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1735</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7465</span> The New Method of Concealed Data Aggregation in Wireless Sensor: A Case Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Abbasi%20Dezfouli">M. Abbasi Dezfouli</a>, <a href="https://publications.waset.org/search?q=S.%20Mazraeh"> S. Mazraeh</a>, <a href="https://publications.waset.org/search?q=M.%20H.%20Yektaie"> M. H. Yektaie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Wireless sensor networks (WSN) consists of many sensor nodes that are placed on unattended environments such as military sites in order to collect important information. Implementing a secure protocol that can prevent forwarding forged data and modifying content of aggregated data and has low delay and overhead of communication, computing and storage is very important. This paper presents a new protocol for concealed data aggregation (CDA). In this protocol, the network is divided to virtual cells, nodes within each cell produce a shared key to send and receive of concealed data with each other. Considering to data aggregation in each cell is locally and implementing a secure authentication mechanism, data aggregation delay is very low and producing false data in the network by malicious nodes is not possible. To evaluate the performance of our proposed protocol, we have presented computational models that show the performance and low overhead in our protocol.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Wireless%20Sensor%20Networks" title="Wireless Sensor Networks">Wireless Sensor Networks</a>, <a href="https://publications.waset.org/search?q=Security" title=" Security"> Security</a>, <a href="https://publications.waset.org/search?q=Concealed%20Data%20Aggregation." title=" Concealed Data Aggregation."> Concealed Data Aggregation.</a> </p> <a href="https://publications.waset.org/2249/the-new-method-of-concealed-data-aggregation-in-wireless-sensor-a-case-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2249/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2249/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2249/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2249/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2249/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2249/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2249/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2249/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2249/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2249/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2249.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1768</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7464</span> An Efficient Data Collection Approach for Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hanieh%20Alipour">Hanieh Alipour</a>, <a href="https://publications.waset.org/search?q=Alireza%20Nemaney%20Pour"> Alireza Nemaney Pour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the most important applications of wireless sensor networks is data collection. This paper proposes as efficient approach for data collection in wireless sensor networks by introducing Member Forward List. This list includes the nodes with highest priority for forwarding the data. When a node fails or dies, this list is used to select the next node with higher priority. The benefit of this node is that it prevents the algorithm from repeating when a node fails or dies. The results show that Member Forward List decreases power consumption and latency in wireless sensor networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Data%20Collection" title="Data Collection">Data Collection</a>, <a href="https://publications.waset.org/search?q=Wireless%20Sensor%20Network" title=" Wireless Sensor Network"> Wireless Sensor Network</a>, <a href="https://publications.waset.org/search?q=SensorNode" title=" SensorNode"> SensorNode</a>, <a href="https://publications.waset.org/search?q=Tree-Based" title=" Tree-Based"> Tree-Based</a> </p> <a href="https://publications.waset.org/9875/an-efficient-data-collection-approach-for-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9875/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9875/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9875/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9875/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9875/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9875/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9875/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9875/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9875/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9875/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9875.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2408</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7463</span> High Level Synthesis of Digital Filters Based On Sub-Token Forwarding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Iyad%20F.%20Jafar">Iyad F. Jafar</a>, <a href="https://publications.waset.org/search?q=Sandra%20J.%20Alrawashdeh"> Sandra J. Alrawashdeh</a>, <a href="https://publications.waset.org/search?q=Ban%20K.%20Alhamayel"> Ban K. Alhamayel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> High level synthesis (HLS) is a process which generates register-transfer level design for digital systems from behavioral description. There are many HLS algorithms and commercial tools. However, most of these algorithms consider a behavioral description for the system when a single token is presented to the system. This approach does not exploit extra hardware efficiently, especially in the design of digital filters where common operations may exist between successive tokens. In this paper, we modify the behavioral description to process multiple tokens in parallel. However, this approach is unlike the full processing that requires full hardware replication. It exploits the presence of common operations between successive tokens. The performance of the proposed approach is better than sequential processing and approaches that of full parallel processing as the hardware resources are increased. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Digital%20filters" title="Digital filters">Digital filters</a>, <a href="https://publications.waset.org/search?q=High%20level%20synthesis" title=" High level synthesis"> High level synthesis</a>, <a href="https://publications.waset.org/search?q=Sub-token%0Aforwarding" title=" Sub-token forwarding"> Sub-token forwarding</a> </p> <a href="https://publications.waset.org/14496/high-level-synthesis-of-digital-filters-based-on-sub-token-forwarding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14496/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14496/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14496/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14496/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14496/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14496/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14496/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14496/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14496/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14496/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14496.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1461</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7462</span> Dynamic Window Secured Implicit Geographic Forwarding Routing for Wireless Sensor Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Z.M.%20Hanapi">Z.M. Hanapi</a>, <a href="https://publications.waset.org/search?q=M.%20Ismail"> M. Ismail</a>, <a href="https://publications.waset.org/search?q=K.%20Jumari"> K. Jumari</a>, <a href="https://publications.waset.org/search?q=M.%20Mahdavi"> M. Mahdavi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Routing security is a major concerned in Wireless Sensor Network since a large scale of unattended nodes is deployed in ad hoc fashion with no possibility of a global addressing due to a limitation of node-s memory and the node have to be self organizing when the systems require a connection with the other nodes. It becomes more challenging when the nodes have to act as the router and tightly constrained on energy and computational capabilities where any existing security mechanisms are not allowed to be fitted directly. These reasons thus increasing vulnerabilities to the network layer particularly and to the whole network, generally. In this paper, a Dynamic Window Secured Implicit Geographic Forwarding (DWSIGF) routing is presented where a dynamic time is used for collection window to collect Clear to Send (CTS) control packet in order to find an appropriate hoping node. The DWIGF is expected to minimize a chance to select an attacker as the hoping node that caused by a blackhole attack that happen because of the CTS rushing attack, which promise a good network performance with high packet delivery ratios. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=sensor" title="sensor">sensor</a>, <a href="https://publications.waset.org/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/search?q=attack" title=" attack"> attack</a>, <a href="https://publications.waset.org/search?q=random." title=" random."> random.</a> </p> <a href="https://publications.waset.org/6813/dynamic-window-secured-implicit-geographic-forwarding-routing-for-wireless-sensor-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6813/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6813/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6813/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6813/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6813/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6813/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6813/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6813/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6813/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6813/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6813.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1404</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7461</span> Performance Evaluation of QoS Based Forwarding and Non Forwarding Energetic Node Selection Algorithm for Reducing the Flooding in Multihop Routing in Highly Dynamic MANET</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Reka">R. Reka</a>, <a href="https://publications.waset.org/search?q=R.%20S.%20D.%20Wahidabanu"> R. S. D. Wahidabanu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The aim of this paper is to propose a novel technique to guarantee Quality of Service (QoS) in a highly dynamic environment. The MANET changes its topology dynamically as the nodes are moved frequently. This will cause link failure between mobile nodes. MANET cannot ensure reliability without delay. The relay node is selected based on achieving QoS in previous transmission. It considers one more factor Connection Existence Period (CEP) to ensure reliability. CEP is to find out the period during that connection exists between the nodes. The node with highest CEP becomes a next relay node. The relay node is selected dynamically to avoid frequent failure. The bandwidth of each link changed dynamically based on service rate and request rate. This paper proposes Active bandwidth setting up algorithm to guarantee the QoS. The series of results obtained by using the Network Simulator (NS-2) demonstrate the viability of our proposed techniques.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bandwidth" title="Bandwidth">Bandwidth</a>, <a href="https://publications.waset.org/search?q=Connection%20Existence%20Period%20%28CEP%29" title=" Connection Existence Period (CEP)"> Connection Existence Period (CEP)</a>, <a href="https://publications.waset.org/search?q=Mobile%20Adhoc%20Network%20%28MANET%29" title=" Mobile Adhoc Network (MANET)"> Mobile Adhoc Network (MANET)</a>, <a href="https://publications.waset.org/search?q=Quality%20of%20Service%20%28QoS%29" title=" Quality of Service (QoS)"> Quality of Service (QoS)</a>, <a href="https://publications.waset.org/search?q=Relay%0D%0Anode." title=" Relay node."> Relay node.</a> </p> <a href="https://publications.waset.org/9999823/performance-evaluation-of-qos-based-forwarding-and-non-forwarding-energetic-node-selection-algorithm-for-reducing-the-flooding-in-multihop-routing-in-highly-dynamic-manet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999823/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999823/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999823/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999823/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999823/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999823/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999823/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999823/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999823/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999823/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999823.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2107</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7460</span> Improving Packet Latency of Video Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Arijit%20Ghosh">Arijit Ghosh</a>, <a href="https://publications.waset.org/search?q=Tony%20Givargis"> Tony Givargis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Video sensor networks operate on stringent requirements of latency. Packets have a deadline within which they have to be delivered. Violation of the deadline causes a packet to be treated as lost and the loss of packets ultimately affects the quality of the application. Network latency is typically a function of many interacting components. In this paper, we propose ways of reducing the forwarding latency of a packet at intermediate nodes. The forwarding latency is caused by a combination of processing delay and queueing delay. The former is incurred in order to determine the next hop in dynamic routing. We show that unless link failures in a very specific and unlikely pattern, a vast majority of these lookups are redundant. To counter this we propose source routing as the routing strategy. However, source routing suffers from issues related to scalability and being impervious to network dynamics. We propose solutions to counter these and show that source routing is definitely a viable option in practical sized video networks. We also propose a fast and fair packet scheduling algorithm that reduces queueing delay at the nodes. We support our claims through extensive simulation on realistic topologies with practical traffic loads and failure patterns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Sensor%20networks" title="Sensor networks">Sensor networks</a>, <a href="https://publications.waset.org/search?q=Packet%20latency" title=" Packet latency"> Packet latency</a>, <a href="https://publications.waset.org/search?q=Network%20design" title=" Network design"> Network design</a>, <a href="https://publications.waset.org/search?q=Networkperformance." title=" Networkperformance."> Networkperformance.</a> </p> <a href="https://publications.waset.org/1528/improving-packet-latency-of-video-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1528/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1528/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1528/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1528/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1528/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1528/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1528/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1528/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1528/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1528/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1528.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1557</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7459</span> Theoretical Analysis of Capacities in Dynamic Spatial Multiplexing MIMO Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Imen%20Sfaihi">Imen Sfaihi</a>, <a href="https://publications.waset.org/search?q=Noureddine%20Hamdi"> Noureddine Hamdi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we investigate the study of techniques for scheduling users for resource allocation in the case of multiple input and multiple output (MIMO) packet transmission systems. In these systems, transmit antennas are assigned to one user or dynamically to different users using spatial multiplexing. The allocation of all transmit antennas to one user cannot take full advantages of multi-user diversity. Therefore, we developed the case when resources are allocated dynamically. At each time slot users have to feed back their channel information on an uplink feedback channel. Channel information considered available in the schedulers is the zero forcing (ZF) post detection signal to interference plus noise ratio. Our analysis study concerns the round robin and the opportunistic schemes. In this paper, we present an overview and a complete capacity analysis of these schemes. The main results in our study are to give an analytical form of system capacity using the ZF receiver at the user terminal. Simulations have been carried out to validate all proposed analytical solutions and to compare the performance of these schemes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=MIMO" title="MIMO">MIMO</a>, <a href="https://publications.waset.org/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/search?q=ZF%20receiver" title=" ZF receiver"> ZF receiver</a>, <a href="https://publications.waset.org/search?q=spatial%0Amultiplexing" title=" spatial multiplexing"> spatial multiplexing</a>, <a href="https://publications.waset.org/search?q=round%20robin%20scheduling" title=" round robin scheduling"> round robin scheduling</a>, <a href="https://publications.waset.org/search?q=opportunistic." title=" opportunistic."> opportunistic.</a> </p> <a href="https://publications.waset.org/2505/theoretical-analysis-of-capacities-in-dynamic-spatial-multiplexing-mimo-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2505/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2505/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2505/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2505/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2505/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2505/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2505/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2505/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2505/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2505/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2505.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1317</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29&page=249">249</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29&page=250">250</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Opportunistic%20data%20forwarding%20%28ODF%29&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>