A practical scheme for wireless network operation

doi:10.1109/TCOMM.2007.892448

A practical scheme for wireless network operation

2007-03-01

12

PRE

AI

DOI：10.1109/TCOMM.2007.892448

Original

Original request for help

Save

Abstract

En 中文

In many problems in wireline networks, it is known that achieving capacity on each link or subnetwork is optimal for the entire network operation. In this paper, we present examples of wireless networks in which decoding and achieving capacity on certain links or subnetworks gives us lower rates than other simple schemes, like forwarding. This implies that the separation of channel and network coding that holds for,many classes of wireline networks does not, in general, hold for wireless networks. Next, we consider Gaussian and erasure wireless networks where nodes are permitted only two possible operations: nodes can either decode what they receive (and then re-encode and transmit the message) or simply forward it. We present a simple greedy algorithm that returns the optimal scheme from the exponential-sized set of possible schemes. This algorithm will go over each node at most once to determine its operation, and hence, is very efficient. We also present a decentralized algorithm whose performance can approach the optimum arbitrarily closely in an iterative fashion.

Keywords:

forward/decode scheme

separation principle

wireless networks

A practical scheme for wireless network operation

Abstract

AI Summary

Journal

Organization