English
Related papers

Related papers: A Selection Region Based Routing Protocol for Rand…

200 papers

In Heterogeneous mobile ad hoc networks (MANETs) congestion occurs with limited resources. Due to the shared wireless channel and dynamic topology, packet transmissions suffer from interference and fading. In heterogeneous ad hoc networks,…

Networking and Internet Architecture · Computer Science 2009-08-03 B. Narasimhan , S. Santhosh baboo

In this paper, we investigate relay selection for cooperative multiple-antenna systems that are equipped with buffers, which increase the reliability of wireless links. In particular, we present a novel relay selection technique based on…

Information Theory · Computer Science 2019-03-27 F. L. Duarte , R. C. de Lamare

Relay selection enhances the performance of the cooperative networks by selecting the links with higher capacity. Meanwhile link adaptation improves the spectral efficiency of wireless data-centric networks through adapting the modulation…

Information Theory · Computer Science 2010-09-02 Wei Yang , Lihua Li , Gang Wu , Haifeng Wang

This paper investigates on the problem of combining routing scheme and physical layer security in multihop wireless networks with cooperative diversity. We propose an ad-hoc natured hop-by-hop best secure relay selection in a multihop…

Information Theory · Computer Science 2018-07-20 Anish Prasad Shrestha , Kyung Sup Kwak

Flying ad hoc network (FANET) provides portable and flexible communication for many applications and possesses several unique design challenges; a key one is the successful delivery of messages to the destination, reliably. For reliable…

Networking and Internet Architecture · Computer Science 2020-10-14 Qamar Usman , Omer Chughtai , Nadia Nawaz , Zeeshan Kaleem , Kishwer Abdul Khaliq , Long D. Nguyen

This paper considers trajectory planning for a mobile robot which persistently relays data between pairs of far-away communication nodes. Data accumulates stochastically at each source, and the robot must move to appropriate positions to…

Robotics · Computer Science 2022-08-24 Winston Hurst , Yasamin Mostofi

We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of optimal placement of relay nodes along the straight line joining a source node and a sink node. The achievable rate formulas that we…

Networking and Internet Architecture · Computer Science 2015-03-20 Arpan Chattopadhyay , Abhishek Sinha , Marceau Coupechoux , Anurag Kumar

In this paper, we analyze the performance of cooperative transmissions in wireless ad hoc networks with random node locations. According to a contention probability for message transmission, each source node can either transmits its own…

Information Theory · Computer Science 2016-11-17 M. Mohammadi , H. A. Suraweera , X. Zhou

In this paper we consider routing in random wireless-adhoc-networks (WANETs), where each node is equipped with a single antenna. Our analysis uses a proper model of the physical layer together with an abstraction of higher communication…

Information Theory · Computer Science 2018-03-06 Yiftach Richter , Itsik Bergel

We study the problem of optimal sequential ("as-you-go") deployment of wireless relay nodes as a person walks along a line of random length (with a known distribution). The objective is to create an impromptu multihop wireless network for…

Networking and Internet Architecture · Computer Science 2013-03-12 Arpan Chattopadhyay , Marceau Coupechoux , Anurag Kumar

In a bi-directional relay channel, a pair of nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of relays. Recent work has mostly considered information theoretic limits of the…

Information Theory · Computer Science 2010-02-02 Sang Joon Kim , Besma Smida , Natasha Devroye

In this paper, we propose a new relaying protocol for large multihop networks combining the concepts of cooperative diversity and opportunistic relaying. The cooperative relaying protocol is based on two diversity mechanisms, incremental…

Information Theory · Computer Science 2015-08-11 Amogh Rajanna , Mos Kaveh

This paper analyses the data rate achieved by various relay selection schemes in a single-user multi-hop relay network with decode-and-forward (DF) relaying. While the single-user relay selection problem is well studied in the literature,…

Information Theory · Computer Science 2023-08-17 Shalanika Dayarathna , Rajitha Senanayake , Jamie Evans

Extensive research has been done to achieve better throughput and reliability in wireless networks, with focus on multiple-input multiple-output systems. Recently, cooperative networking techniques have been investigated to increase the…

Networking and Internet Architecture · Computer Science 2019-11-19 Muhammad Asam , Zeeshan Haider , Tauseef Jamal , Kashif Ghuman , Aleena Ajaz

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…

Information Theory · Computer Science 2016-11-18 Jeffrey G. Andrews , Steven Weber , Marios Kountouris , Martin Haenggi

Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example…

Statistical Mechanics · Physics 2007-05-23 Ingmar Glauche , Wolfram Krause , Rudolf Sollacher , Martin Greiner

In this paper, we propose an ad-hoc on-demand distance vector routing algorithm for mobile ad-hoc networks taking into account node mobility. Changeable topology of such mobile ad-hoc networks provokes overhead messages in order to search…

Networking and Internet Architecture · Computer Science 2017-06-30 Trung Kien Vu , Sungoh Kwon

Localization is one of the pivotal issues in wireless sensor network applications. In 3D localization studies, most algorithms focus on enhancing the location prediction process, lacking theoretical derivation of the detection distance of…

Networking and Internet Architecture · Computer Science 2024-01-12 Penghong Wang , Hao Wang , Wenrui Li , Xiaopeng Fan , Debin Zhao

In this paper an optimal relay selection algorithm with non-negligible probing time is proposed and analyzed for cooperative wireless networks. Relay selection has been introduced to solve the degraded bandwidth efficiency problem in…

Information Theory · Computer Science 2015-02-10 Yang Liu , Yi Ouyang , Mingyan Liu

We investigate a probabilistic model for routeing in a multihop ad-hoc communication network, where each user sends a message to the base station. Messages travel in hops via other users, used as relays. Their trajectories are chosen at…

Optimization and Control · Mathematics 2019-02-18 Wolfgang König , András Tóbiás