97 Hits in 1.8 sec

On selection of candidates for opportunistic anypath forwarding

Zifei Zhong, Junling Wang, Srihari Nelakuditi, Guor-Huar Lu
2006 ACM SIGMOBILE Mobile Computing and Communications Review  
CONCLUSION We proposed a new metric EAX for opportunistic anypath forwarding and described a candidate selection and prioritization method based on EAX.  ...  The general idea behind these schemes is that, for each destination, a set of candidate next hops are selected in-advance and one of them is chosen for forwarding on a per-packet basis according to its  ... 
doi:10.1145/1215976.1215978 fatcat:c2yk3avcnnbsfagj6twvb3gsie

Valuable Detours: Least-Cost Anypath Routing

Henri Dubois-Ferriere, Matthias Grossglauser, Martin Vetterli
2011 IEEE/ACM Transactions on Networking  
This paper addresses the least-cost anypath routing (LCAR) problem: how to assign a set of candidate relays at each node for a given destination such that the expected cost of forwarding a packet to the  ...  The key is the following tradeoff: On one hand, increasing the number of candidate relays decreases the forwarding cost, but on the other, it increases the likelihood of "veering" away from the shortest-path  ...  On one hand, having many candidate relays decreases the forwarding cost (i.e., the cost to send to any of these candidates).  ... 
doi:10.1109/tnet.2010.2070844 fatcat:272w6btfu5gllon4xmrzq2kuoa

Fast Recovery Routing Algorithm for Software Defined Network based Operationally Responsive Space Satellite Networks

2016 KSII Transactions on Internet and Information Systems  
relaying and so on.  ...  ) for SDOS.  ...  Compared to legacy routing, opportunistic routing selects the forwarder from a set of multiple receivers, which are typically known as a candidate relay set (CRS).  ... 
doi:10.3837/tiis.2016.07.004 fatcat:emmidnkvovdhhlt5lqtb5tuteq

Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks [chapter]

Gunnar Schaefer, François Ingelrest, Martin Vetterli
2009 Lecture Notes in Computer Science  
Opportunistic routing limits these retransmissions by taking advantage of the broadcast nature of the wireless channel: sending packets to multiple receivers at once, and only then, based on the outcome  ...  We then propose Coordinated Anypath Routing, an opportunistic routing protocol designed for wireless sensor networks, in which the coordination between receivers is handled by an overhearing-based acknowledgment  ...  Acknowledgments This work was partially financed by the Swiss National Center of Competence in Research for Mobile Information and Communication Systems (NCCR MICS) and the European Commission under the  ... 
doi:10.1007/978-3-642-00224-3_8 fatcat:7xzmtmfdlbhzlaoelcp7sr5asu

An Anypath Routing Protocol for Multi-hop Cognitive Radio Ad Hoc Networks

Chih-Min Chao, Hsiang-Yuan Fu, Li-Ren Zhang
2014 2014 IEEE 11th Intl Conf on Ubiquitous Intelligence and Computing and 2014 IEEE 11th Intl Conf on Autonomic and Trusted Computing and 2014 IEEE 14th Intl Conf on Scalable Computing and Communications and Its Associated Workshops  
Anypath Routing, a kind of schemes that enables dynamic forwarder selection, seems to be a possible solution to the PU occupancy problem.  ...  In this paper, we propose an anypath routing scheme in CRAHNs that can be built on top of existing multichannel rendezvous solutions.  ...  In an anypath routing scheme, a node i multicasts a packet to multiple candidate forwarders (i.e., the forwarding set of node i).  ... 
doi:10.1109/uic-atc-scalcom.2014.109 dblp:conf/uic/ChaoFZ14 fatcat:dslc3mahlzfonhfsqbcczspuie

DART: Directional Anypath Routing in Wireless Mesh Networks

Xi Fang, Dejun Yang, Guoliang Xue
2011 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems  
For the routing layer, we propose two shortest directional anypath routing algorithms based on two antenna models.  ...  Anypath routing is proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium.  ...  From the perspective of the routing layer, looking for an optimal anypath can reduce to the selection of an optimal forwarding set for each node.  ... 
doi:10.1109/mass.2011.62 dblp:conf/mass/FangYX11a fatcat:cafdm4daeje4xlhbv5jwnbn2bu

MAP: Multiconstrained Anypath Routing in Wireless Mesh Networks

Xi Fang, Dejun Yang, Guoliang Xue
2013 IEEE Transactions on Mobile Computing  
Previous studies on anypath routing have been concentrated on finding an anypath which optimizes a single quality of service (QoS) parameter.  ...  In this paper, we study anypath routing subject to multiple constraints. We first prove that the problem is NP-hard when the number of constraints is larger than one.  ...  ACKNOWLEDGMENT We thank the editor and the anonymous reviewers whose comments on earlier versions of this paper have helped to significantly improve our paper.  ... 
doi:10.1109/tmc.2012.158 fatcat:6go7zsiawrfhdp4wvxvvzr5tdm

CoRoute: A new cognitive anypath vehicular routing protocol

Wooseong Kim, Soon Y. Oh, Mario Gerla, Kevin C. Lee
2011 2011 7th International Wireless Communications and Mobile Computing Conference  
These channels, however, are of limited capacity and are not sufficient to support the broad range of services envisioned in VANETs.  ...  In this paper, we propose CoVanet, a cognitive vehicular ad hoc network architecture that allows vehicles opportunistic access to WiFi channels.  ...  Anypath routing In CoRoute, vehicles select a route instantaneously among multiple candidates based on estimated channel conditions.  ... 
doi:10.1109/iwcmc.2011.5982643 dblp:conf/iwcmc/KimOGL11 fatcat:izm33vkdmrcchjdd65q27pfz5m

On Bit-Rate Selection for Opportunistic Routing

Chase Gray, Naveen Santhapuri, Srihari Nelakuditi
2008 2008 5th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops  
We then propose Bit-rate Selection for Opportunistic Routing (BitSOR) algorithm that minimizes ExACT for each pair of nodes in the network.  ...  Though the performance of OR schemes depend on the bitrate, they currently use a fixed rate for transmitting packets.  ...  Therefore, the utility of OR hinges on inter-candidate communication and candidate selection.  ... 
doi:10.1109/sahcnw.2008.17 fatcat:xoyhsixlt5glngqm4fxzxf3jsq

Anypath Routing Protocol Design via Q-Learning for Underwater Sensor Networks [article]

Yuan Zhou, Tao Cao, Wei Xiang
2020 arXiv   pre-print
In addition, a new holding time mechanism for packet forwarding is designed according to the priority of forwarding candidate nodes.  ...  This paper proposes a Q-learning-based localization-free anypath routing (QLFR) protocol to prolong the lifetime as well as reduce the end-to-end delay for underwater sensor networks.  ...  In our proposed routing protocol, s i selects a subset of N eighbor(s i ) to form the forwarding candidate set ϕ(s i ) and creates a priority list for these selected candidates according to their Q-values  ... 
arXiv:2002.09623v1 fatcat:c56wfbeg7vfz3i5xnbk6btnvte

Link correlation aware opportunistic routing

Anas Basalamah, Song Min Kim, Shuo Guo, Tian He, Yoshito Tobe
2012 2012 Proceedings IEEE INFOCOM  
Based on the model, we introduce a new link-correlation-aware opportunistic routing scheme, which improves the performance by exploiting the diverse uncorrelated forwarding links.  ...  For the first time, this paper formally analyzes the opportunistic routing gain under the presence of link correlation considering the loss of DATA and ACK packets.  ...  Also each node should select at most 2 nodes as candidate forwarders. For simplicity of presentation we also assume that the feedback packets are always received. Now lets focus on node 1.  ... 
doi:10.1109/infcom.2012.6195754 dblp:conf/infocom/BasalamahKGHT12 fatcat:yrs7pvnp6ffsfff3g6hkwbifc4

Optimum node placement in wireless opportunistic routing networks

Llorenç Cerdà-Alabern, Amir Darehshoorzadeh, Vicent Pla
2013 Ad hoc networks  
In contrast to traditional uni-path routing, in opportunistic routing the nodes overhearing neighbor's transmissions can become candidates to forward the packets towards the destination.  ...  We use this model to compute bounds to the minimum expected number of transmissions that can be achieved in a network using opportunistic routing.  ...  In [41] a method for avoiding duplicate forwarding in opportunistic routing is proposed which does not depend on any form of information exchange between next-hop candidates.  ... 
doi:10.1016/j.adhoc.2013.05.010 fatcat:462gjpxjgrfo3n4pbgzb5kmrm4

Context-aware opportunistic routing in mobile ad-hoc networks incorporating node mobility

Zhongliang Zhao, Denis Rosario, Torsten Braun, Eduardo Cerqueira
2014 2014 IEEE Wireless Communications and Networking Conference (WCNC)  
Opportunistic routing (OR) employs a list of candidates to improve reliability of wireless transmission.  ...  However, list-based OR features restrict the freedom of opportunism, since only the listed nodes can compete for packet forwarding.  ...  The performance of OR depends on several factors. The first one is the selection of candidates.  ... 
doi:10.1109/wcnc.2014.6952640 dblp:conf/wcnc/ZhaoRBC14 fatcat:pmpksu3l3fekdeg6zupbmtyhky

LSGO: Link State aware Geographic Opportunistic routing protocol for VANETs

Xuelian Cai, Ying He, Chunchun Zhao, Lina Zhu, Changle Li
2014 EURASIP Journal on Wireless Communications and Networking  
The LSGO aims to improve the reliability of data transmission in a highly dynamic environment, which selects the forwarders and prioritizes them based on the vehicle's geographic location and the link's  ...  The opportunistic routing protocols can improve the reliability of routing by making full use of the broadcast characteristics and assist in data transmission through additional backup links.  ...  We define C i = {N 1 , N 2 , ⋯, N n } as a candidate node set of node N i , which is a subset of neighbor nodes and contains all the forwarders selected based on a candidate node selection strategy.  ... 
doi:10.1186/1687-1499-2014-96 fatcat:cjkgk4ahzfewlmoatxgm6sxf2y

Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions

Haitao Liu, Baoxian Zhang, Hussein Mouftah, Xiaojun Shen, Jian Ma
2009 IEEE Communications Magazine  
ACKNOWLEDGMENT This work was supported in part by the Knowledge Innovation Program of the Chinese Academy of Sciences (no. KGCX2-YW-120) and NSF of China (no. 60702074). B.  ...  Zhang's work was partially supported by SRF for ROCS, SEM. X. Shen's work was partially supported by K.C. Wong Education Foundation, Hong Kong.  ...  Packet forwarding makes a one-hop decision on which neighbor should be chosen for forwarding a packet along the selected routes.  ... 
doi:10.1109/mcom.2009.5350376 fatcat:n4y2puf55ngu7gpsov2576mfxy
« Previous Showing results 1 — 15 out of 97 results