The aggregate capacity of wireless mesh networks can be improved significantly by equipping each node with multiple interfaces and by using multiple channels in order to reduce the effect of interference. Efficient channel assignment is required to ensure the optimal use of the limited channels in the radio spectrum. In this paper, a Cluster-based Multipath Topology control and Channel assignment scheme (CoMTaC), is proposed, which explicitly creates a separation between the channel assignment and topology control functions, thus minimizing flow disruptions. A cluster-based approach is employed to ensure basic network connectivity. Intrinsic support for broadcasting with minimal overheads is also provided. CoMTaC also takes advantage of the inherent multiple paths that exist in a typical WMN by constructing a spanner of the network graph and using the additional node interfaces. The second phase of CoMTaC proposes a dynamic distributed channel assignment algorithm, which employs a novel interference estimation mechanism based on the average link-layer queue length within the interference domain. Partially overlapping channels are also included in the channel assignment process to enhance the network capacity. Extensive simulation based experiments have been conducted to test various parameters and the effectiveness of the proposed scheme. The experimental results show that the proposed scheme outperforms existing dynamic channel assignment schemes by a minimum of a factor of 2.

Objective:To determine the frequency of post-operative pulmonary complications (PPCs) after cardio-pulmonary bypass and association of pre-operative and intraoperative risk factors with incidence of PPCs.Methods:This study was an observational analysis of five hundred and seventeen (517) patients who underwent cardiac surgery using cardiopulmonary bypass. Incidence of PPCs and risk factors of PPCs were noted. Logistic regression was applied to determine the association of pre-operative and intraoperative risk factors with incidence of PPCs.Results:Post-operative pulmonary complications occurred in 32 (6.2%) patients. Most common post-operative pulmonary complication was atelectasis that occurred in 20 (3.86%) patients, respiratory failure in 8 (1.54%) patients, pneumonia in 3 (0.58%) patients and acute respiratory distress syndrome in 1 (0.19%) patients. The main risk factor of PPCs were advance age ≥ 60 years [odds ratio 4.16 (1.99-8.67), p-value <0.001], prolonged CPB time > 120 minutes [odds ratio 3.62 (1.46-8.97) p-value 0.003], pre-op pulmonary hypertension [odds ratio 2.60 (1.18-5.73), p-value 0.016] and intraoperative phrenic nerve injury [odds ratio 7.06 (1.73-28.74), p-value 0.002]. Operative mortality was 9.4% in patients with PPCs and 1.0% in patients without PPCs (p-value 0.01).Conclusion:The incidence of post-operative pulmonary complications was 6.2% in this study. Advanced age (age ≥ 60 years), prolonged CPB time (CPB time > 120 minutes), pre-op pulmonary hypertension and intraoperative phrenic nerve injury are independent risk factors of PPCs after surgery.

Quality-of-service (QoS) requirements have always posed a challenge from scheduling perspective and it becomes more complicated with the emergence of new standards and applications. Classical techniques like maximum throughput, proportional fair, and exponential rule have been used in common network scenarios but these techniques fail to address diverse service requirements for QoS provisioning in long-term evolution (LTE). These QoS requirements in LTE are implemented in the form of delay budgets, scheduling priorities, and packet loss rates. Scheduler design for LTE networks therefore requires handling service class attributes but preciously proposed scheduling methods ignored service class-based design and focused more on single network prospect. To address service class requirements in LTE, we propose a modified radio resource management-based scheduler with minimum guarantee in the downlink following network capacity and service class attributes defined in LTE standard. The scheduler takes advantage of best available channel conditions while maintaining data rates corresponding to minimum resources guaranteed for all major classes including the best effort class. A method is proposed to determine the scheduling resource capacity of active users in LTE networks with an admission control to limit the number of users according to available resources. In addition to closely matched theoretical and simulated active users that can be accommodated in the system, promising results are provided for system delay, throughput, and user mobility.

Flexible Job Shop Scheduling Problem (FJSSP) is an extension of the classical Job Shop Scheduling Problem (JSSP). The FJSSP is known to be NP-hard problem with regard to optimization and it is very difficult to find reasonably accurate solutions of the problem instances in a rational time. Extensive research has been carried out in this area especially over the span of the last 20 years in which the hybrid approaches involving Genetic Algorithm (GA) have gained the most popularity. Keeping in view this aspect, this article presents a comprehensive literature review of the FJSSPs solved using the GA. The survey is further extended by the inclusion of the hybrid GA (hGA) techniques used in the solution of the problem. This review will give readers an insight into use of certain parameters in their future research along with future research directions.

No abstract