English
Related papers

Related papers: On the Random 1/2-Disk Routing Scheme in Wireless …

200 papers

This paper analyzes the performance of clustered decode-and-forward multi-hop relaying (CDFMR) wireless Rayleigh fading networks, and sheds light on their design principles for energy and spectral efficiency. The focus is on a general…

Information Theory · Computer Science 2014-07-01 Amin Azari , Jalil Seifali Harsini , Farshad Lahouti

Mobile wireless network research focuses on scenarios at the extremes of the network connectivity continuum where the probability of all nodes being connected is either close to unity, assuming connected paths between all nodes (mobile ad…

Networking and Internet Architecture · Computer Science 2016-11-15 Simon Heimlicher , Merkouris Karaliopoulos , Hanoch Levy , Thrasyvoulos Spyropoulos

In this paper, we present a new routing paradigm that generalizes opportunistic routing in wireless mesh networks. In multirate anypath routing, each node uses both a set of next hops and a selected transmission rate to reach a destination.…

Networking and Internet Architecture · Computer Science 2010-11-01 Rafael Laufer , Leonard Kleinrock

In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to…

Networking and Internet Architecture · Computer Science 2017-09-18 Dimitrios J. Vergados , Natalia Amelina , Yuming Jiang , Katina Kralevska , Oleg Granichin

The 5G wireless network architecture will bring dense deployments of base stations called {\em small cells} for both outdoors and indoors traffic. The feasibility of their dense deployments depends on the existence of a high data-rate…

Information Theory · Computer Science 2015-08-04 Song-Nam Hong , Ivana Maric , Dennis Hui

In this paper we present a new routing paradigm that generalizes opportunistic routing for wireless multihop networks. In multirate anypath routing, each node uses both a set of next hops and a selected transmission rate to reach a…

Networking and Internet Architecture · Computer Science 2010-11-01 Rafael Laufer , Henri Dubois-Ferrière , Leonard Kleinrock

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

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 wired network, a packet can be transmitted to a specified destination only, no broadcasting required. But in ad hoc wireless network a packet transmitted by a node can reach all neighbors due to broadcasting. This broadcasting…

Networking and Internet Architecture · Computer Science 2013-04-09 Md. Nazrul Islam , M. M. A. Hashem , A. M. Moshiur Rahman

A lot of work has been done on routing protocols for mobile ad hoc networks, but still standardization of them requires some more issues less addressed by the existing routing protocols. In this paper a new paradigm of maintaining multiple…

Networking and Internet Architecture · Computer Science 2009-12-23 Mano Yadav , Vinay Rishiwal , K. V. Arya

We analyze the multihop delay of ad hoc cognitive radio networks, where the transmission delay of each hop consists of the propagation delay and the waiting time for the availability of the communication channel (i.e., the occurrence of a…

Networking and Internet Architecture · Computer Science 2009-12-22 Wei Ren , Qing Zhao , Ananthram Swami

In this paper, we study the problem of secure routing in a multihop wireless ad-hoc network in the presence of randomly distributed eavesdroppers. Specifically, the locations of the eavesdroppers are modeled as a homogeneous Poisson point…

Information Theory · Computer Science 2016-11-17 Jianping Yao , Suili Feng , Xiangyun Zhou , Yuan Liu

We study the problem of geometric optimization of medium access control in multi-hop wireless network. We discuss the optimal placements of simultaneous transmitters in the network and our general framework allows us to evaluate the…

Information Theory · Computer Science 2012-08-02 Salman Malik , Philippe Jacquet , Cedric Adjih

In wireless ad hoc networks, distributed nodes can collaboratively form an antenna array for long-distance communications to achieve high energy efficiency. In recent work, Ochiai, et al., have shown that such collaborative beamforming can…

Information Theory · Computer Science 2007-07-13 Athina P. Petropulu , Lun Dong , H. Vincent Poor

We consider the problem of localizing wireless devices in an ad-hoc network embedded in a d-dimensional Euclidean space. Obtaining a good estimation of where wireless devices are located is crucial in wireless network applications including…

Networking and Internet Architecture · Computer Science 2011-10-14 Amin Karbasi , Sewoong Oh

Distributed opportunistic scheduling is studied for wireless ad-hoc networks, where many links contend for one channel using random access. In such networks, distributed opportunistic scheduling (DOS) involves a process of joint channel…

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

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

The use of existing network devices as relays has a potential to improve the overall network performance. In this work, we consider a two-hop wireless relay setting, where the channels between the source and relay nodes to the destination…

Networking and Internet Architecture · Computer Science 2017-04-11 Mehdi Salehi Heydar Abad , Ozgur Ercetin , Eylem Ekici

We consider the problem of determining asymptotic bounds on the capacity of a random ad hoc network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the Signal to…

Information Theory · Computer Science 2008-11-24 Vivek P. Mhatre , Catherine P. Rosenberg , Ravi R. Mazumdar

This article introduces a metric for performance evaluation of medium access schemes in wireless ad hoc networks known as local capacity. Although deriving the end-to-end capacity of wireless ad hoc networks is a difficult problem, the…

Information Theory · Computer Science 2012-02-22 Salman Malik , Philippe Jacquet