English
Related papers

Related papers: Cross-layer Balanced and Reliable Opportunistic Ro…

200 papers

Due to dynamic network conditions, routing is the most critical part in WMNs and needs to be optimised. The routing strategies developed for WMNs must be efficient to make it an operationally self configurable network. Thus we need to…

Networking and Internet Architecture · Computer Science 2013-07-12 Sharad Sharma , Shakti Kumar , Brahmjit Singh

Organization, scalability and routing have been identified as key problems hindering viability and commercial success of mobile ad hoc networks. Clustering of mobile nodes among separate domains has been proposed as an efficient approach to…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-09-20 Damianos Gavalas , Grammati Pantziou , Charalampos Konstantopoulos , Basilis Mamalis

We consider a simple network consisting of a source, a half-duplex DF relay with a buffer, and a destination. We assume that the direct source-destination link is not available and all links undergo fading. We propose two new buffer-aided…

Information Theory · Computer Science 2013-02-19 Nikola Zlatanov , Robert Schober

In this work, we develop a distributed source routing algorithm for topology discovery suitable for ISP transport networks, that is however inspired by opportunistic algorithms used in ad hoc wireless networks. We propose a plug-and-play…

Networking and Internet Architecture · Computer Science 2011-05-02 Christophe Betoule , Thomas Bonald , Remi Clavier , Dario Rossi , Giuseppe Rossini , Gilles Thouenon

Robots are increasingly deployed in dynamic and crowded environments, such as urban areas and shopping malls, where efficient and robust navigation is crucial. Traditional risk-based motion planning algorithms face challenges in such…

Robotics · Computer Science 2024-11-04 Zhirui Sun , Bingyi Xia , Peijia Xie , Xiaoxiao Li , Jiankun Wang

In this paper, we propose novel channel-hoppingbased distributed rendezvous algorithm based on grid-basedquorum techniques. The proposed algorithm increases the probability of rendezvous (RDV) within a single cycle by allowing CR nodes to…

Networking and Internet Architecture · Computer Science 2017-07-25 Esraa Al Jarrah , Haythem Bany Salameh , Ali Eyadeh

We consider the problem of carrier frequency offset (CFO) estimation for a two-way relaying system based on the amplify-and-forward (AF) protocol. Our contributions are in designing an optimal preamble, and the corresponding estimator, to…

Information Theory · Computer Science 2012-08-17 Chin Keong Ho , Patrick Ho Wang Fung , Sumei Sun

Path planning in high-dimensional spaces poses significant challenges, particularly in achieving both time efficiency and a fair success rate. To address these issues, we introduce a novel path-planning algorithm, Zonal RL-RRT, that…

Robotics · Computer Science 2024-11-01 AmirMohammad Tahmasbi , MohammadSaleh Faghfoorian , Saeed Khodaygan , Aniket Bera

In Opportunistic Networks (OppNets), the dissemination of information can only rely on transient pairwise radio contacts between mobile devices (peers). Designing distributed applications that can run in such conditions is a challenge, but…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-22 Frédéric Guidec , Yves Mahéo

Ad hoc networks are wireless mobile networks that can operate without infrastructure and without centralized network management. Traditional techniques of routing are not well adapted. Indeed, their lack of reactivity with respect to the…

Networking and Internet Architecture · Computer Science 2015-06-19 Omar Smail , Bernard Cousin , Zoulikha Mekkakia , Rachida Mekki

This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using OFDMA for both uplink and downlink. The goal is to improve the overall system performance by…

Information Theory · Computer Science 2010-09-03 Yuan Liu , Meixia Tao , Bin Li , Hui Shen

Cascading bandit (CB) is a popular model for web search and online advertising, where an agent aims to learn the $K$ most attractive items out of a ground set of size $L$ during the interaction with a user. However, the stationary CB model…

Machine Learning · Computer Science 2020-02-18 Lingda Wang , Huozhi Zhou , Bingcong Li , Lav R. Varshney , Zhizhen Zhao

AI-driven semi-autonomous robotic surgery is essential for addressing the medical challenges of long-duration interplanetary missions, where limited crew sizes and communication delays restrict traditional surgical approaches. Current…

Robotics · Computer Science 2025-04-28 Kaaustaaub Shankar , Wilhelm Louw , Bharadwaj Dogga , Nick Ernest , Tim Arnett , Kelly Cohen

Control Barrier Functions (CBF) are widely used to enforce the safety-critical constraints on nonlinear systems. Recently, these functions are being incorporated into a path planning framework to design safety-critical path planners.…

Robotics · Computer Science 2021-10-25 Aniketh Manjunath , Quan Nguyen

Efficient motion planning algorithms are essential in robotics. Optimizing essential parameters, such as batch size and nearest neighbor selection in sampling-based methods, can enhance performance in the planning process. However, existing…

Robotics · Computer Science 2025-08-29 Liding Zhang , Qiyang Zong , Yu Zhang , Zhenshan Bing , Alois Knoll

Network coding has been successfully used in the past for efficient broadcasting in wireless multi-hop networks. Two coding approaches are suitable for mobile networks; Random Linear Network Coding (RLNC) and XOR-based coding. In this work,…

Networking and Internet Architecture · Computer Science 2014-11-18 Nikolaos Papanikos , Evangelos Papapetrou

One of the most important challenges in deploying cognitive radio networks (CRNs) is to find a common control channel (CCC) to all secondary users (SUs) that enables efficient CR communications. This challenge is attributed to the dynamic…

Networking and Internet Architecture · Computer Science 2017-07-25 Esraa Jarrah

In a mobile ad hoc network (MANET), effective prediction of time-varying interferences can enable adaptive transmission designs and therefore improve the communication performance. This paper investigates interference prediction in MANETs…

Information Theory · Computer Science 2016-11-18 Yirui Cong , Xiangyun Zhou , Rodney A. Kennedy

The work proposes a new Combined Routing Protocol (CRP) for ad hoc networks that combines the benefits and annihilates the shortcomings of two well-known on-demand routing protocols in ad hoc networks: AODV (which provides a high…

Networking and Internet Architecture · Computer Science 2025-01-24 Anton Sergeev , Victor Minchenkov , Aleksei Soldatov , Yaroslav Mazikov

This paper focuses on the routing algorithm for the communications between vehicles and places in urban VANET. As one of the basic transportation facilities in an urban setting, buses periodically run along their fixed routes and widely…

Networking and Internet Architecture · Computer Science 2018-04-10 Gang Sun , Yijing Zhang , Dan Liao , Hongfang Yu , Xiaojiang Du , Mohsen Guizani
‹ Prev 1 3 4 5 6 7 10 Next ›