Optimal and suboptimal routing based on partial CSI in wireless ad-hoc networks

Richter, Yiftach; Bergel, Itsik

doi:10.1109/spawc.2015.7227026

Cited by 7 publications

(7 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The second line considers the nodes in the KZ that are assumed to be receivers (with b ℓ = 0 ) and hence do not induce interference. The third and fourth lines indicate that all nodes with b ℓ = 1 interfere with the reception except for the nearest transmitter that (17…”

Section: Thus We Approximatementioning

confidence: 99%

See 1 more Smart Citation

Opportunistic routing based on partial CSI in MIMO random ad-hoc networks

Richter

Bergel

2021

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

In this paper we consider opportunistic routing in multiple-input–multiple-output (MIMO) random wireless ad-hoc networks (WANETs). Our analysis uses a proper model of the physical layer together with an abstraction of the higher communication layers. We assume that the nodes are distributed according to a Poisson point process and consider a routing scheme that opportunistically selects the next relay and the number of spatially multiplexed data streams. The routing decisions are based on geographic locations, the channel gains of the neighbor nodes, and the statistical characterization of all other nodes. Unlike the single antenna case, the optimal routing scheme cannot be explicitly expressed. Hence, we propose a smart-routing scheme for MIMO that adapts the number of data streams per user to the channel conditions. The numerical results demonstrate that this scheme outperforms all previously published schemes for this scenario. The findings highlight the importance of channel state information for efficient routing, and the need for an adaptive selection of the number of data streams at each transmitter.

show abstract

Section: Thus We Approximatementioning

confidence: 99%

“…This type of algorithm is known as opportunistic relaying. Opportunistic relaying (e.g., [15][16][17][18][19][20]) was shown to outperform traditional routing (such as nearest neighbor). To date, however, opportunistic relaying has not been investigated for MIMO multihop networks.…”

mentioning

confidence: 99%

Opportunistic routing based on partial CSI in MIMO random ad-hoc networks

Richter

Bergel

2021

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

show abstract

“…Yiftach Richter and Itsik Bergel [9] proposed novel routing schemes for wideband WANETs, where the signal is transferred in multiple hops using an OFDM modulation. They demonstrated the routing scheme that maximizes the routing function.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The lowest computational routing function, the NBO, [9] is based on lower-bound and can be easily achieved using a lookup table. While they showed that for some cases (e.g., high transmission probability), nearest-neighbor routing has performance which is close to the performance of the limited knowledge schemes.…”

Section: Literature Reviewmentioning

confidence: 99%

Multi-hop Adaptive Link State Optimal Routing in Wireless Ad hoc Network

2017

IJSR

View full text Add to dashboard Cite

Exploitation of HALO scheme to accomplish unique routing is recently known as a superior technique. All previous works improved routing on WSN, there is no strong improvement on QoS and for multidestination routing with less traffic overhead. The enhancement on routing QoS and multi-destination packet routing are addressed by using triplet model and link state algorithm in this project. By exploitation of the approach each node, for all diverse node, the algorithm separately and regularly renews the piece of traffic bound to that leaves on each of its outgoing paths. At each recapitulation, the updates are calculated by applying on the shortest path evaluations to every target which in turns discovered by the inconsiderable costs of the network's paths. That means the insignificant link costs are applied to encounter the shortest paths are in turn acquired from link-state updates that are flooded within the network after each recapitulation. This way of system is also versatile which means it naturally discovers the constant network transforms and captures judgments considering the different convenient means. However this has accomplished to exclude the trade-off between optimality and comfort of execution and routing yet it can function properly if we tried to decreases the acknowledgement overhead traffic. This paper project that there is a overcrowding issue due to acknowledgements which is to be decreases by practicing 2ACK system with triplet model and this will encouraged to decrease traffic and improve link employment for multi-destination routing keeping QoS also it maintains the transmission path log history for future communication.

show abstract

“…We also present three sub-optimal, low-complexity routing schemes that can be evaluated in a closed form. Finally, we show that the routing scheme of [16] (termed here narrow-bound-optimal (NBO) routing) can be viewed as an approximation of the SO routing [18]. Thus, we can compare the performance of all the routing schemes; we show that the NBO routing scheme is very close to the optimal routing (given only local information at each transmitting node).…”

Section: Introductionmentioning

confidence: 95%

Optimal and Suboptimal Routing Based on Partial CSI in Random Ad-Hoc Networks

Richter

Bergel

2018

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

In this paper we consider routing in random wireless-adhoc-networks (WANETs), where each node is equipped with a single antenna. Our analysis uses a proper model of the physical layer together with an abstraction of higher communication layers. We assume that the nodes are distributed according to a Poisson-point-process and consider routing schemes that select the next relay based on the geographical locations, the channel gains of its neighbor nodes and the statistical characterization of all other nodes. While many routing problems are formulated as optimization problems, the optimal distributed solution is rarely accessible. In this work, we present the exact optimal solution for the scenario analyzed. The optimal routing is given as a maximization of a routing metric which depends solely on the known partial channel state information (CSI) and includes an expectation with respect to the interference statistics. The optimal routing scheme is important because it gives an upper bound on the performance of any other routing scheme. We also present sub-optimal routing schemes that only use part of the available knowledge and require much lower computational complexity. Numerical results demonstrate that the performance of the low complexity schemes is close to optimal and outperforms other tested routing schemes.The authors are with the

show abstract

Optimal and suboptimal routing based on partial CSI in wireless ad-hoc networks

Cited by 7 publications

References 12 publications

Opportunistic routing based on partial CSI in MIMO random ad-hoc networks

Opportunistic routing based on partial CSI in MIMO random ad-hoc networks

Multi-hop Adaptive Link State Optimal Routing in Wireless Ad hoc Network

Optimal and Suboptimal Routing Based on Partial CSI in Random Ad-Hoc Networks

Contact Info

Product

Resources

About