PROJECT TITLE :

Routing in Accumulative Multi-Hop Networks - 2017

ABSTRACT:

This paper investigates the problem of finding optimal methods in single-source single-destination accumulative multi-hop networks. We contemplate one supply that communicates to one destination assisted by several relays through multiple hops. At every hop, only one node transmits, while all the other nodes receive the transmitted signal, and store it once processing/decoding and mixing it with the signals received in previous hops. That is, we have a tendency to contemplate that terminals make use of advanced energy accumulation transmission/reception techniques, like maximal ratio combining reception of repetition codes, or data accumulation with rateless codes. Accumulative techniques increase Communication reliability, reduce energy consumption, and decrease latency. We tend to investigate the properties that a routing metric must satisfy in these accumulative networks to guarantee that optimal ways will be computed with Dijkstra's algorithm. We tend to model the matter of routing in accumulative multi-hop networks, as the matter of routing in an exceedingly hypergraph. We tend to show that optimality properties in an exceedingly traditional multi-hop network (monotonicity and isotonicity) are no longer useful and derive a brand new set of sufficient conditions for optimality. We tend to illustrate these results by studying the minimum energy routing problem in static accumulative multi-hop networks for various forwarding strategies at relays.