Analyzing routing strategy NFP in multihop packet radio networks on a line

Mathar, Rudolf; Mattfeldt, J.

doi:10.1109/26.380130

Cited by 22 publications

(14 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since all hops have the same distance (attenuation), the same noise level, and no interference, the uniform power allocation is optimal. The bandwidth efficiency-power efficiency characteristic (10) consequently simplifies to (16) The preceding formulas suggest a tradeoff involved in the choice of -increasing the number of nodes leads to a shorter inter-node distance and a larger effective received power, at the cost of decreasing the slot duration.…”

Section: )mentioning

confidence: 99%

Bandwidth- and power-efficient routing in linear wireless networks

Sikora

Laneman

Haenggi

et al. 2006

IEEE Trans. Inform. Theory

213

161

View full text Add to dashboard Cite

Abstract-The goal of this paper is to establish which practical routing schemes for wireless networks are most suitable for power-limited and bandwidth-limited communication regimes. We regard channel state information (CSI) at the receiver and point-to-point capacity-achieving codes for the additive white Gaussian noise (AWGN) channel as practical features, interference cancellation (IC) as possible, but less practical, and synchronous cooperation (CSI at the transmitters) as impractical. We consider a communication network with a single source node, a single destination node, and 1 intermediate nodes placed equidistantly on a line between them. We analyze the minimum total transmit power needed to achieve a desired end-to-end rate for several schemes and demonstrate that multihop communication with spatial reuse performs very well in the power-limited regime, even without IC. However, within a class of schemes not performing IC, single-hop transmission (directly from source to destination) is more suitable for the bandwidth-limited regime, especially when higher spectral efficiencies are required. At such higher spectral efficiencies, the gap between single-hop and multihop can be closed by employing IC, and we present a scheme based upon backward decoding that can remove all interference from the multihop system with an arbitrarily small rate loss. This new scheme is also used to demonstrate that rates of (log ) are achievable over linear wireless networks even without synchronous cooperation.

show abstract

Section: )mentioning

confidence: 99%

Bandwidth- and power-efficient routing in linear wireless networks

Sikora

Laneman

Haenggi

et al. 2006

IEEE Trans. Inform. Theory

213

161

View full text Add to dashboard Cite

show abstract

“…Since the camera towers form a one-dimensional chain, this leads to a linear network topology. Under such topology, the communication protocols [23,29,41] are favorable since they are specifically designed for linear networks that deal with scalar data. However, to support the centralized detection scheme, all captured images have to be forwarded to the remote control center.…”

Section: Camera-remote Center Transmissionmentioning

confidence: 99%

BorderSense: Border patrol through advanced wireless sensor networks

et al. 2011

View full text Add to dashboard Cite

“…For the purpose of maximizing the transmission efficiency defined as the ratio between the expected progress and the area covered by the transmission, Hajek [17] suggested that each node should adjust its power to cover about three nearest neighbors on average. Mathar and Mattfeldt [18] analyzed the wireless network generated by a Poisson point process on a line, and also obtained some magic numbers.…”

Section: Theorem 1: [2] Letmentioning

confidence: 99%

Asymptotic Critical Transmission Radius for $k$-Connectivity in Wireless Ad Hoc Networks

Wan

Wang

2010

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-A range assignment to the nodes in a wireless ad hoc network induces a topology in which there is an edge between two nodes if and only if both of them are within each other's transmission range. The critical transmission radius for k-connectivity is the smallest r such that if all nodes have the transmission radius r, the induced topology is k-connected. In this paper, we study the asymptotic critical transmission radius for k -connectivity in a wireless ad hoc network whose nodes are uniformly and independently distributed in a unit-area square or disk. We provide a precise asymptotic distribution of the critical transmission radius for k-connectivity. In addition, the critical neighbor number for k-connectivity is the smallest integer l such that if every node sets its transmission radius equal to the distance between itself and its l-th nearest neighbor, the induced (symmetric) topology is k-connected. Applying the critical transmission radius for k-connectivity, we can obtain an asymptotic almost sure upper bound on the critical neighbor number for k-connectivity.

show abstract

Analyzing routing strategy NFP in multihop packet radio networks on a line

Cited by 22 publications

References 5 publications

Bandwidth- and power-efficient routing in linear wireless networks

Bandwidth- and power-efficient routing in linear wireless networks

BorderSense: Border patrol through advanced wireless sensor networks

Asymptotic Critical Transmission Radius for $k$-Connectivity in Wireless Ad Hoc Networks

Contact Info

Product

Resources

About