Filters








7,358 Hits in 7.0 sec

Loop-free routing using diffusing computations

J.J. Garcia-Lunes-Aceves
<span title="">1993</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wn5qtqh7ejhpfdjtrxhija73bq" style="color: black;">IEEE/ACM Transactions on Networking</a> </i> &nbsp;
The new algorithms are shown to converge in finite time after an arbitrary sequence of link coat or topological changes, to be loop-free at every instan~and to outperform all other loop-free routing algorithms  ...  According to these algorithms, each node maintains a vector with its distance to every other node.  ...  ACKNOWLEDGMENT The author wishes to thank Z. S. Su for many fruitful discussions that helped in the design of DUAL, and W.T. Zaumen for all the work that went into DUAL's simulation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/90.222913">doi:10.1109/90.222913</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c4drznzn45djpoq6gn4wa3ya6i">fatcat:c4drznzn45djpoq6gn4wa3ya6i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060901231316/http://cs-www.cs.yale.edu/homes/arvind/cs425/doc/diffuse.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/db/33/db33de57de2011056d582aec0b51140cfe656086.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/90.222913"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

SCALABLE INTERNETWORKING: Final Technical Report [article]

JJ Garcia-Luna-Aceves, A. Varma
<span title="2019-08-31">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This report covers work performed from 1 April 1993 to 31 December 1995. Results on routing and multicasting for large-scale internets are summarized.  ...  detection distance-vector and link-state algorithms, which can be used to improve the performance of existing interdomain and intradomain routing protocols. • Developing new distributed approaches to  ...  or LVA) since the development of the ARPANET's routing protocols, which introduced the first distance-vector and link-state algorithms for computer networks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1909.00260v1">arXiv:1909.00260v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i6xhsdqpsrfrpci6ok3ewoiqqq">fatcat:i6xhsdqpsrfrpci6ok3ewoiqqq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200930151921/https://arxiv.org/pdf/1909.00260v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/64/63/646318d25d70800e72684a45366ca4465125dd00.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1909.00260v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Reinforcing reachable routes

Srinidhi Varadarajan, Naren Ramakrishnan, Muthukumar Thirunavukkarasu
<span title="">2003</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/blfmvfslmbggxhopuigjdb3jma" style="color: black;">Computer Networks</a> </i> &nbsp;
Distance-vector protocols pass computed information or 'hearsay' among themselves.  ...  More importantly, we need new loop detection algorithms; current shortest-path routing algorithms use their optimality metric to implicitly eliminate loops.  ...  Comparing Link-State and Distance-Vector Protocols The distance-vector and link-state protocols have traditionally been considered as two orthogonal approaches to network routing.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1389-1286(03)00288-3">doi:10.1016/s1389-1286(03)00288-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/u4lt7v3bwfethe7kaaf3uw5fvq">fatcat:u4lt7v3bwfethe7kaaf3uw5fvq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100606133043/http://eprints.cs.vt.edu/archive/00000654/01/rrr.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2d/23/2d23ba4dac1fd969beeea3cd069dc5b9b0099a15.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1389-1286(03)00288-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Reinforcing Reachable Routes [article]

Srinidhi Varadarajan, Naren Ramakrishnan
<span title="2002-07-21">2002</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The setting of the reinforcement learning problem offers several advantages, including loop resolution, multi-path forwarding capability, cost-sensitive routing, and minimizing state overhead, while maintaining  ...  This paper studies the evaluation of routing algorithms from the perspective of reachability routing, where the goal is to determine all paths between a sender and a receiver.  ...  Comparing Link-State and Distance-Vector Protocols The distance-vector and link-state protocols have traditionally been considered as two orthogonal approaches to network routing.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0207073v1">arXiv:cs/0207073v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v6ozenbziva7hflbh5gvjeplzy">fatcat:v6ozenbziva7hflbh5gvjeplzy</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs0207073/cs0207073.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/89/bf/89bf2ca227397cbe450ef74f6fd6337d60c4e203.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0207073v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Loop-Free Link-State Routing

Pierre Fransson, Lenka Carr-Motyckova
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3x67lwnpmjf6xcsnrggez3gqqe" style="color: black;">2007 16th International Conference on Computer Communications and Networks</a> </i> &nbsp;
The algorithm improves on previous loop-free algorithms for link-state routing by reducing the number of state transitions necessary before a router can update its routing table to a new, guaranteed to  ...  We present an algorithm that can be used in conjunction with link-state routing, to ensure that temporary loops do not form during convergence.  ...  The paper by Garcia-Luna-Aceves [5] describes a unified approach to loop-free routing for both distance-vector and link-state routing.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icccn.2007.4317933">doi:10.1109/icccn.2007.4317933</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icccn/FranssonC07.html">dblp:conf/icccn/FranssonC07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a56y4em47je37py2oj2j6kx6ia">fatcat:a56y4em47je37py2oj2j6kx6ia</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921205904/http://ltu.diva-portal.org/smash/get/diva2:1004743/FULLTEXT01" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/49/6e/496ef8081afc3ebd584fdc22baf050c00040a1af.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icccn.2007.4317933"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Always Acyclic Distributed Path Computation

S. Ray, R. Guerin, Kin-Wah Kwong, R. Sofia
<span title="">2010</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wn5qtqh7ejhpfdjtrxhija73bq" style="color: black;">IEEE/ACM Transactions on Networking</a> </i> &nbsp;
In addition, DIV's universal applicability is illustrated by studying its use with a routing that operates according to a nonshortest path objective.  ...  The key contribution of DIV, besides its ability to operate with any routing algorithm, is an update mechanism using simple message exchanges between neighboring nodes that guarantees loop-freedom at all  ...  Garcia-Luna-Aceves for introducing them to the LFI-based algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tnet.2009.2025374">doi:10.1109/tnet.2009.2025374</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wusdgpgsznfvjd76ama34yn5dq">fatcat:wusdgpgsznfvjd76ama34yn5dq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100723192018/http://www.seas.upenn.edu/%7Ekkw/paper/Div-ToN.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e1/46/e1469453e0f3975a31b0a51a6fa896953a344ba1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tnet.2009.2025374"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Space-Time Routing in Ad Hoc Networks [chapter]

Henri Dubois-Ferrière, Matthias Grossglauser, Martin Vetterli
<span title="">2003</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We introduce Space-Time Routing (STR), a new approach to routing in mobile ad hoc networks. In STR, the age of routing state is considered jointly with the distance to the destination.  ...  We discuss a third STR algorithm using only physical notions of space and time, and finally show that STR provides loop-free routes.  ...  a new routing entry can only override an existing one if it offers a shorter f (d, t) S-T distance to the destination. We can now show that STR is route loop-free: Theorem 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-39611-6_1">doi:10.1007/978-3-540-39611-6_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b2r7i37eifempfhkms7qwsw5aa">fatcat:b2r7i37eifempfhkms7qwsw5aa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922035341/https://infoscience.epfl.ch/record/33969/files/33969-Dubois-Ferri%C3%A8reGV03.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/49/4e/494e398e9a6b0e2c041e2e4c2c9d57703578e343.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-39611-6_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A distributed algorithm for delay-constrained unicast routing

D.S. Reeves, H.F. Salama
<span title="">2000</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wn5qtqh7ejhpfdjtrxhija73bq" style="color: black;">IEEE/ACM Transactions on Networking</a> </i> &nbsp;
Due to their distributed nature, distance-vector protocols may suffer from looping problems when the network is not in steady state.  ...  This information is stored in a cost vector and a delay vector which resemble the distance vectors of some existing routing protocols.  ...  The paths constructed by existing distance-vector protocols are guaranteed to be loop-free if the contents of the distance vectors at all nodes are up-to-date and the network is in stable condition.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/90.842145">doi:10.1109/90.842145</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6vxnnh6pdzf77aqbyggk36hgfy">fatcat:6vxnnh6pdzf77aqbyggk36hgfy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200310142923/https://repository.lib.ncsu.edu/bitstream/handle/1840.4/946/TR_1996_26.pdf;jsessionid=F7F60F5D627829C0A314E78233F6CF26?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/15/0b/150be14644b30ec183c8eff1fbc7b06e31c33671.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/90.842145"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Channel Fading Detection in Manets with Hand off Strategy

Vani Prasanna
<span title="">2013</span> <i title="IOSR Journals"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vabuspdninc75epczdurccts4u" style="color: black;">IOSR Journal of Computer Engineering</a> </i> &nbsp;
This paper proposes a novel channel adaptive routing protocol which extends the Ad hoc On-Demand Multipath Distance Vector (AOMDV) routingprotocol to accommodate channel fading.  ...  maintenance of time-based states in each node: a routing entry not recently used is expired.  ...  AODV provides loop-free routes even while repairing broken links.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9790/0661-1417783">doi:10.9790/0661-1417783</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g74nqe2dk5b7vhwcpqabf234ie">fatcat:g74nqe2dk5b7vhwcpqabf234ie</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180602131750/http://www.iosrjournals.org/iosr-jce/papers/Vol14-issue1/L01417783.pdf?id=6826" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2e/aa/2eaad9927b7b732ebd10fac59d8c998ed6a3f308.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9790/0661-1417783"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Routing protocols in Ad-hoc Networks- A Simulation Study

Chanchal Chanchal
<span title="">2013</span> <i title="IOSR Journals"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vabuspdninc75epczdurccts4u" style="color: black;">IOSR Journal of Computer Engineering</a> </i> &nbsp;
For this reason, each node acts both as a router and a host, meaning that every node must be willing to forward packets for other nodes. For this reason a routing protocol is needed.  ...  An ad-hoc network is a temporary network without any form of centralized administration. Multiple hops might be necessary to reach other nodes in the network.  ...  Loop free: To improve the overall performance, we want the routing protocol to guarantee that the routes supplied are loop-free. This avoids any waste of bandwidth or CPU consumption. 3 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9790/0661-1064249">doi:10.9790/0661-1064249</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bms5zalumjed7p73bmuw3vsute">fatcat:bms5zalumjed7p73bmuw3vsute</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180602093601/http://www.iosrjournals.org/iosr-jce/papers/Vol10-issue6/G01064249.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5b/9d/5b9d7473e975e2a2a455ace82299e0b07e3dbd7e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9790/0661-1064249"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Policy-Based Adaptive Routing in Mobile Ad Hoc Wireless Networks

Suli Zhao, Dipankar Raychaudhuri
<span title="">2006</span> <i title="IEEE"> 2006 IEEE Sarnoff Symposium </i> &nbsp;
routing algorithm which incorporates adaptation of key network state parameters such as link speed or congestion.  ...  Control information is disseminated through the network to exchange state variables, and a global distributed policy manager is responsible for the adaptive operations at nodes of the network.  ...  Most prior work on this topic is specific to a certain routing protocol or approach.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sarnof.2006.4534724">doi:10.1109/sarnof.2006.4534724</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/u7ml3tz52ja3xdcvs65qc2zg5a">fatcat:u7ml3tz52ja3xdcvs65qc2zg5a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809134516/http://www.winlab.rutgers.edu/~sulizhao/szhao_sarnoff06.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/58/28/5828d9a5d5beefc2b79b3ab11e45b09b0607a4f3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sarnof.2006.4534724"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Declarative Network Verification [chapter]

Anduo Wang, Prithwish Basu, Boon Thau Loo, Oleg Sokolsky
<span title="">2008</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
To validate the use of DNV, we present case studies using DNV in conjunction with the PVS theorem prover to verify routing protocols, including eventual properties of protocols in dynamic settings.  ...  DNV is a significant improvement compared to existing use case of theorem proving which typically require several man-months to construct the system specifications.  ...  We base our illustration on the verification of the distance-vector protocol, commonly used for computing shortest routes in a network.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-92995-6_5">doi:10.1007/978-3-540-92995-6_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fpd2ello2jgbnglvk5bqtufg3i">fatcat:fpd2ello2jgbnglvk5bqtufg3i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090115225738/http://www.cis.upenn.edu/~boonloo/papers/dnv_tr.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f7/99/f79930ba02caaf36454b523c9f85588324ae2be4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-92995-6_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Collaborative Routing, Scheduling and Frequency Assignment for Wireless Ad Hoc Networks Using Spectrum-Agile Radios

Xin Wang, J.J. Garcia-Luna-Aceves
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3x67lwnpmjf6xcsnrggez3gqqe" style="color: black;">2008 Proceedings of 17th International Conference on Computer Communications and Networks</a> </i> &nbsp;
CROWN is a cross-layer optimization approach for spectrum-agile nodes to adjust their spectrum allocation and transmission scheduling according to the underlying traffic demands.  ...  information into the routing metric calculation, so that the route with the maximal joint spatial and frequency reuse is selected.  ...  To do so, we adapt a proactive distance-vector routing protocol.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icccn.2008.ecp.110">doi:10.1109/icccn.2008.ecp.110</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icccn/WangG08.html">dblp:conf/icccn/WangG08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/z7vp3lnlmbat5hka5omlpaghke">fatcat:z7vp3lnlmbat5hka5omlpaghke</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171013052917/http://publisher-connector.core.ac.uk/resourcesync/data/Springer-OA/pdf/5b0/aHR0cDovL2xpbmsuc3ByaW5nZXIuY29tLzEwLjEwMDcvczExMjc2LTAxMC0wMjcxLTEucGRm.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/45/93/45933345363e3625e928a6fe1d1e44f7cda33a9b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icccn.2008.ecp.110"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Collaborative routing, scheduling and frequency assignment for wireless Ad Hoc networks using spectrum-agile radios

Xin Wang, J. J. Garcia-Luna-Aceves
<span title="2010-08-10">2010</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wpzihu2scrb7nntl4ywanbryai" style="color: black;">Wireless networks</a> </i> &nbsp;
CROWN is a cross-layer optimization approach for spectrum-agile nodes to adjust their spectrum allocation and transmission scheduling according to the underlying traffic demands.  ...  information into the routing metric calculation, so that the route with the maximal joint spatial and frequency reuse is selected.  ...  To do so, we adapt a proactive distance-vector routing protocol.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11276-010-0271-1">doi:10.1007/s11276-010-0271-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kovardrmobfw3gzd2ghgyvlbhi">fatcat:kovardrmobfw3gzd2ghgyvlbhi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171013052917/http://publisher-connector.core.ac.uk/resourcesync/data/Springer-OA/pdf/5b0/aHR0cDovL2xpbmsuc3ByaW5nZXIuY29tLzEwLjEwMDcvczExMjc2LTAxMC0wMjcxLTEucGRm.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/45/93/45933345363e3625e928a6fe1d1e44f7cda33a9b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11276-010-0271-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Survey on distributed detection mechanism for Byzantine attack in tree-based topology

Apeksha B. Dhakde, S. U. Nimbhorkar
<span title="">2014</span> <i title="IEEE"> 2014 International Conference on Computation of Power, Energy, Information and Communication (ICCPEIC) </i> &nbsp;
Routing protocols helps to provide the way through which the nodes can be able to communicate with each other.  ...  Byzantine attack is one of the most important security thread as it interrupt the communication of nodes in the network and behave like a innocent nodes while participating normally.  ...  Examples of proactive routing protocols contain: Destination-Sequenced Distance-Vector (DSDV) or Optimized Link State Routing (OLSR). II.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iccpeic.2014.6915338">doi:10.1109/iccpeic.2014.6915338</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/w7gy2bb3incydidrdnddwg6sci">fatcat:w7gy2bb3incydidrdnddwg6sci</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829215416/http://www.iaeme.com/MasterAdmin/UploadFolder/50720140101004/50720140101004.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/79/7b/797b5777ba4f9f21cca39847d85317195a619575.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iccpeic.2014.6915338"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 7,358 results