In this letter, we propose the reactive relay selection scheme based on cumulative distribution function (CDF) of SNRs for two-way relay networks over Nakagami-m fading channels. We analyze average relay fairness by deriving the exact integral and asymptotic expressions for relay selection probability. Also, we obtain diversity order by deriving outage probability. Numerical results show […]
Read moreWith the advent of smart portable devices and location-based applications, user’s mobility pattern is found to be highly dependent on varying locations. In this paper, we analyze asymptotic throughput-delay performance of mobile ad hoc networks (MANETs) under a location popularity based scenario, where users are more likely to visit popular locations. This work provides a […]
Read moreThe emerging trend towards utilizing chip multicore processors (CMPs) that support dynamic voltage and frequency scaling (DVFS) is driven by user requirements for high performance and low power. To overcome limitations of the conventional chip-wide DVFS and achieve the maximum possible energy saving, per-core DVFS is being enabled in the recent CMP offerings. While power […]
Read more
No Comments
New Approach to the Stability of Chemical Reaction Networks: Piecewise Linear in Rates Lyapunov Functions
Piecewise-Linear in Rates (PWLR) Lyapunov functions are introduced for a class of Chemical Reaction Networks (CRNs). In addition to their simple structure, these functions are robust with respect to arbitrary monotone reaction rates, of which Mass-Action is a special case. The existence of such functions ensures the convergence of trajectories towards equilibria, and can be […]
Read moreNetwork selection plays an important role in load balancing and radio resources management. In this paper, we use the evolutionary game theory to address the network selection problem in the constrained heterogeneous networks. An indication function is introduced into the payoff function to represent the punishment term. The population dynamics can be obtained by the […]
Read moreNetwork-on-chip (NoC) has emerged as a vital factor that determines the performance and power consumption of many-core systems. This paper proposes a hybrid scheme for NoCs, which aims at obtaining low latency and low power consumption. In the presented hybrid scheme, a novel switching mechanism, called virtual circuit switching, is proposed to intermingle with circuit […]
Read more
No Comments
Impulsive Multiconsensus of Second-Order Multiagent Networks Using Sampled Position Data
A multiconsensus problem of multiagent networks is solved in this paper, where multiconsensus refers to that the states of multiple agents in each subnetwork asymptotically converge to an individual consistent value when there exist information exchanges among subnetworks. A distributed impulsive protocol is proposed to achieve multiconsensus of second-order multiagent networks in terms of three […]
Read more
No Comments
Multiuser Admission Control and Beamforming Optimization Algorithms for MISO Heterogeneous Networks
This paper investigates the problem of joint multiuser admission control and beamforming optimization for multiple-input single-output (MISO) heterogeneous networks (HetNet). Considered is a HetNet where multiple newly deployed femtocell base-stations (FBS) have the coverage overlapped with that of an existing macrocell base-station (MBS). The design objective is to serve as many femto-users (FUE) as possible […]
Read moreThe diversity provided by disjoint paths can increase the survivability of communication networks. This paper considers the allocation of network error correction flow on a network that consists of disjoint paths from the source node to the destination node. Specifically, we propose an algorithm of allocating the path-flows to support the given rate with minimum […]
Read moreIn this paper, we describe dynamic unicast to increase communication efficiency in opportunistic Information-centric networks. The approach is based on broadcast requests to quickly find content and dynamically creating unicast links to content sources without the need of neighbor discovery. The links are kept temporarily as long as they deliver content and are quickly removed […]
Read more