Throughput-optimal relay selection in multiuser cooperative relaying networks

Halabian, Hassan; Lambadaris, Ioannis; Lung, Chung-Horng; Srinivasan, Anand

doi:10.1109/milcom.2010.5680399

Cited by 11 publications

(15 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The elements of this matrix are chosen randomly in the interval [0,1]. The applied relay selection policy is the maximum weighted matching policy that was used in the previous simulation . We have run the simulation for 1000 iterations or equivalently 10 5 transmission frames.…”

Section: Simulation Results and Discussionmentioning

confidence: 99%

“…We assume that relay selection in each frame is performed independent of relay selections in the previous or future frames. Although this assumption seems to be restrictive, such a class of policies is discussed and has been widely used in cooperative communication research .…”

Section: System Descriptionmentioning

confidence: 99%

“…It is worth mentioning that the proposed method is independent of the employed relay selection policy and similar results can be drawn for other relay selection policies with independent decisions in different transmission frames. Examples of other relay selection policies can be found in .…”

Section: Trust Establishment For Wireless Relaying Networkmentioning

confidence: 99%

See 2 more Smart Citations

Trust establishment in cooperative wireless relaying networks

Changiz

Halabian

et al. 2012

Wirel. Commun. Mob. Comput.

Self Cite

View full text Add to dashboard Cite

In cooperative wireless networks, relay nodes are employed to improve the performance of the network in terms of throughput and reliability. However, the presence of malicious relay nodes in the network may severely degrade the performance of the system. When a relay node behaves maliciously, there exists a possibility that such a node refuses to cooperate when it is selected for cooperation or deliberately drops the received packets. Trust establishment is a mechanism to detect misbehaving nodes in a network. In this paper, we propose a trust establishment method for cooperative wireless networks by using Bayesian framework. In contrast with the previous schemes proposed in wireless networks, this approach takes the channel state information and the relay selection decisions into account to derive a pure trust value for each relay node. The proposed method can be applied to any cooperative system with a general relay selection policy whose decisions in each cooperative transmission are independent of the previous ones. Moreover, it does not impose additional communication overhead on the system as it uses the available information in relay selection procedure. Copyright © 2012 John Wiley & Sons, Ltd.

show abstract

Section: Simulation Results and Discussionmentioning

confidence: 99%

Section: System Descriptionmentioning

confidence: 99%

See 1 more Smart Citation

Trust establishment in cooperative wireless relaying networks

Changiz

Halabian

et al. 2012

Wirel. Commun. Mob. Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…They find efficient and low overhead relay nodes for data delivery to destination through data mining-based network optimization [10], network clustering [18], cooperative beamforming [12], or balancing between shorter high-quality links, and longer lossy links [15]. Previous works [6,8,16,17,19] have proposed relay selection schemes in cooperative networks that utilize game theory [8,16,19] or Markov modeling [6,17]. The proposed schemes choose the optimal cooperative relay nodes that maximize their own utilities, while contributing to the entire network benefit.…”

Section: Related Workmentioning

confidence: 99%

Power-Aware Relay Selection and Routing Scheme for Multi-Interface Sensor Networks

Zheleva

Lee

2015

INT J COMPUT COMMUN

View full text Add to dashboard Cite

We present a joint relay and radio interface selection algorithm with packet deadline under limited power usage in multi-interface sensor networks. We find route optimization techniques in multi-interface networks: 1) selecting the most conservatively lowest-power interface to guarantee timely transmission considering the remaining hops to destination, and 2) searching detouring paths when the power level of an involved relay node is too low to use the necessary interface that guarantees timely delivery. We aim to achieve data delivery with packet deadline requirement while minimizing energy consumption at each node, and further prolonging network lifetime by selecting cost-effective relay nodes and wireless interfaces. We evaluate our proposed algorithm in terms of total power consumption and packet delivery performance, compared to homogeneous radio interface scenarios of only WiFi interface and only 802.15.4 ZigBee interface. Simulation results show that the proposed algorithm fully exploits the given packet delivery time to conserve power consumption by selecting the interface that consumes the least power, and spreading out network traffic over the network. Our proposed algorithm achieves reliable packet delivery without delivery failures due to power outage and missed deadline.

show abstract

“…are shared among users and therefore can be studied using our model (e.g. [2], [16]). Bipartite Matching also has been extensively used in literature (e.g.…”

Section: Model Descriptionmentioning

confidence: 99%

Delay optimal server assignment to symmetric parallel queues with random connectivities

Halabian

Lambadaris

Lung

2011

IEEE Conference on Decision and Control and European Control Conference

Self Cite

View full text Add to dashboard Cite

In this paper, we investigate the problem of assignment of K identical servers to a set of N parallel queues in a time slotted queueing system. The connectivity of each queue to each server is randomly changing with time; each server can serve at most one queue and each queue can be served by at most one server per time slot. Such queueing systems were widely applied in modeling the scheduling (or resource allocation) problem in wireless networks. It has been previously proven that Maximum Weighted Matching (MWM) is a throughput optimal server assignment policy for such queueing systems [1], [2]. In this paper, we prove that for a symmetric system with i.i.d. Bernoulli packet arrivals and connectivities, MWM minimizes, in stochastic ordering sense, a broad range of cost functions of the queue lengths including total queue occupancy (or equivalently average queueing delay).

show abstract

Throughput-optimal relay selection in multiuser cooperative relaying networks

Cited by 11 publications

References 20 publications

Trust establishment in cooperative wireless relaying networks

Trust establishment in cooperative wireless relaying networks

Power-Aware Relay Selection and Routing Scheme for Multi-Interface Sensor Networks

Delay optimal server assignment to symmetric parallel queues with random connectivities

Contact Info

Product

Resources

About