English
Related papers

Related papers: On the Throughput Capacity of Wireless Multi-hop N…

200 papers

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

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

In this work, we evaluate local capacity of wireless ad hoc networks with several medium access protocols and identify the most optimal protocol. We define local capacity as the average information rate received by a receiver randomly…

Networking and Internet Architecture · Computer Science 2011-11-10 Salman Malik , Philippe Jacquet

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…

Information Theory · Computer Science 2016-11-18 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor , Shlomo Shamai

In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the locations of the transmitters is often modeled as a Poisson…

Information Theory · Computer Science 2016-11-17 Radha Krishna Ganti , Jeffrey G. Andrews , Martin Haenggi

The analogies between successive interference cancellation (SIC) in slotted ALOHA framework and iterative belief-propagation erasure-decoding, established recently, enabled the application of the erasure-coding theory and tools to design…

Information Theory · Computer Science 2016-11-17 Cedomir Stefanovic , Miyu Momoda , Petar Popovski

In this paper we propose two analytically tractable stochastic models of non-slotted Aloha for Mobile Ad-hoc NETworks (MANETs): one model assumes a static pattern of nodes while the other assumes that the pattern of nodes varies over time.…

Networking and Internet Architecture · Computer Science 2010-10-28 Bartek Blaszczyszyn , Paul Muhlethaler

Transmission capacity of an ad hoc wireless network is analyzed when each node of the network harvests energy from nature, e.g. solar, wind, vibration etc. Transmission capacity is the maximum allowable density of nodes, satisfying a per…

Information Theory · Computer Science 2015-03-20 Rahul Vaze

Herein, we consider the problem of cooperative multi-access in the presence of overlapped coverage areas. Assuming a frameless ALOHA transmission scheme, we derive exact analytical throughput expressions for throughput in the aforementioned…

Information Theory · Computer Science 2018-08-21 Shun Ogata , Koji Ishibashi , Giuseppe Abreu

In this paper, a simple variation of classical Slotted Aloha is introduced and analyzed. The enhancement relies on adding multiple receivers that gather different observations of the packets transmitted by a user population in one slot. For…

Networking and Internet Architecture · Computer Science 2014-01-16 Andrea Munari , Michael Heindlmaier , Gianluigi Liva , Matteo Berioli

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

We develop a framework for communication-control co-design in a wireless networked control system with multiple geographically separated controllers and controlled systems, modeled via a Poisson point process. Each controlled system…

Information Theory · Computer Science 2024-12-02 Gourab Ghatak , Geethu Joseph , Chen Quan

We consider ALOHA and slotted ALOHA protocols as medium access rules for a multi-channel message delivery system. Users decide randomly and independently with a minimal amount of knowledge about the system at random times to make a message…

Probability · Mathematics 2023-01-20 Wolfgang König , Charles Kwofie

We study medium access in FMCW radar networks. We assume that all the radars use same parameters, e.g., chirp duration, chirp slope, cutoff frequency, number of chirps per packet, etc, and propose and analyze slotted ALOHA and CSMA…

Systems and Control · Electrical Eng. & Systems 2022-01-26 Haritha K , Vineeth Bala Sukumaran , Chandramani Singh

We study the optimal transmission scheme that maximizes the local capacity in two-dimensional (2D) wireless networks. Local capacity is defined as the average information rate received by a node randomly located in the network. Using…

Networking and Internet Architecture · Computer Science 2011-11-10 Salman Malik , Philippe Jacquet

We propose a novel distributed random access scheme for wireless networks based on slotted ALOHA, motivated by the analogies between successive interference cancellation and iterative belief-propagation decoding on erasure channels. The…

Information Theory · Computer Science 2016-11-15 Cedomir Stefanovic , Petar Popovski , Dejan Vukobratovic

In this paper, a random access scheme is introduced which relies on the combination of packet erasure correcting codes and successive interference cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph representation…

Information Theory · Computer Science 2016-11-15 Enrico Paolini , Gianluigi Liva , Marco Chiani

Various applications of wireless Machine-to-Machine (M2M) communications have rekindled the research interest in random access protocols, suitable to support a large number of connected devices. Slotted ALOHA and its derivatives represent a…

Information Theory · Computer Science 2013-08-08 Cedomir Stefanovic , Petar Popovski

In this paper, we study the transport capacity of large multi-hop wireless CSMA networks. Different from previous studies which rely on the use of centralized scheduling algorithm and/or centralized routing algorithm to achieve the optimal…

Networking and Internet Architecture · Computer Science 2016-11-17 Tao Yang , Guoqiang Mao , Wei Zhang , Xiaofeng Tao

Random access protocols relying on the transmission of packet replicas in multiple slots and exploiting interference cancellation at the receiver have been shown to achieve per- formance competitive with that of orthogonal schemes. So far…

Information Theory · Computer Science 2017-07-03 Federico Clazzer , Enrico Paolini , Iacopo Mambelli , Cedomir Stefanovic
‹ Prev 1 2 3 10 Next ›