English
Related papers

Related papers: Parallel Opportunistic Routing in Wireless Network…

200 papers

Distributed opportunistic scheduling (DOS) protocols are proposed for multiple-input multiple-output (MIMO) ad-hoc networks with contention-based medium access. The proposed scheduling protocols distinguish themselves from other existing…

Information Theory · Computer Science 2016-11-17 Man-On Pun , Weiyan Ge , Dong Zheng , Junshan Zhang , H. Vincent Poor

We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the…

Information Theory · Computer Science 2016-11-17 Seyed Pooya Shariatpanahi , Babak Hossein Khalaj , Kasra Alishahi , Hamed Shah-Mansouri

In this work we develop a new theory to analyse the process of routing in large-scale ad-hoc wireless networks. We use a path integral formulation to examine the properties of the paths generated by different routing strategies in these…

Information Theory · Computer Science 2007-07-16 Antonio J. Caamaño , Juan J. Vinagre , Mark Wilby , Javier Ramos

We study outage regions for energy-constrained multi-hop and adaptive multi-route networks with an arbitrary number of relay nodes. Optimal power allocation strategies in the sense that outage probability is minimized are derived depending…

Information Theory · Computer Science 2009-08-10 Tobias Renk , Holger Jaekel , Friedrich K. Jondral

The opportunistic routing has advantages on improving the packet delivery ratio between source node and candidate set (PDRsc). However, considering the frequent topology variation in wireless sensor networks, how to improve and control the…

Networking and Internet Architecture · Computer Science 2017-10-02 Ning Li , Jose-Fernan Martinez-Ortega , Vicente Hernandez Diaz

This letter studies distributed opportunistic channel access in a wireless network with decode-and-forward relays. All the sources use channel contention to get transmission opportunity. If a source wins the contention, the channel state…

Information Theory · Computer Science 2015-02-24 Zhou Zhang , Shuai Zhou , Hai Jiang

Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are even greater when nodes perform mutual information…

Information Theory · Computer Science 2009-08-27 Stark C. Draper , Lingjia Liu , Andreas F. Molisch , Jonathan S. Yedidia

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

Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simply put, DOS involves a process of joint channel probing and…

Information Theory · Computer Science 2009-07-14 Chandrashekhar Thejaswi P. S. , Junshan Zhang , Man-On Pun , H. Vincent Poor , Dong Zheng

We consider a time-slotted two-hop wireless system in which the sources transmit to the relays in the even time slots (first hop) and the relays forward the packets to the destinations in the odd time slots (second hop). Each source may…

Information Theory · Computer Science 2009-01-16 Radha Krishna Ganti , Martin Haenggi

To account for the randomness of propagation channels and interference levels in hierarchical spectrum sharing, a novel approach to multihop routing is introduced for cognitive random access networks, whereby packets are randomly routed…

Optimization and Control · Mathematics 2012-07-05 Emiliano Dall'Anese , Georgios B. Giannakis

In recent work, Ozgur, Leveque, and Tse (2007) obtained a complete scaling characterization of throughput scaling for random extended wireless networks (i.e., $n$ nodes are placed uniformly at random in a square region of area $n$). They…

Information Theory · Computer Science 2016-11-17 Urs Niesen , Piyush Gupta , Devavrat Shah

This paper addresses the challenge of packet-based information routing in large-scale wireless communication networks. The problem is framed as a constrained statistical learning task, where each network node operates using only local…

Signal Processing · Electrical Eng. & Systems 2025-04-15 Sourajit Das , Kirtan Gopal Panda , Navid NaderiAlizadeh

This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower…

Information Theory · Computer Science 2013-02-08 Yuxin Chen , Jeffrey G. Andrews

Inspired by the Statistical Physics of complex networks, wireless multihop ad hoc communication networks are considered in abstracted form. Since such engineered networks are able to modify their structure via topology control, we search…

Networking and Internet Architecture · Computer Science 2009-11-11 Wolfram Krause , Jan Scholz , Martin Greiner

In this paper, we study how to determine concurrent transmissions and the transmission power level of each link to maximize spectrum efficiency and minimize energy consumption in a wireless ad hoc network. The optimal joint transmission…

Networking and Internet Architecture · Computer Science 2017-06-20 Kamal Rahimi Malekshan , Weihua Zhuang

This paper develops a contention-based opportunistic feedback technique towards relay selection in a dense wireless network. This technique enables the forwarding of additional parity information from the selected relay to the destination.…

Information Theory · Computer Science 2012-08-27 Caleb K. Lo , Robert W. Heath, , Sriram Vishwanath

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, a cooperative two-hop communication scheme, together with opportunistic relaying (OR), is applied within a mobile wireless body area network (WBAN). Its effectiveness in interference mitigation is investigated in a scenario…

Networking and Internet Architecture · Computer Science 2012-12-20 Jie Dong , David Smith

In this paper, we study Two-way relaying networks well-known for its throughput merits. In particular, we study the fundamental throughput delay trade-off in two-way relaying networks using opportunistic network coding. We characterize the…

Information Theory · Computer Science 2015-02-11 Maha Zohdy , Tamer ElBatt , Mohamed Nafie