Cognitive Radio Networks (CRNs) are mainly used for path selection due to the added advantage of dynamic spectrum utilization when the frequency band is not under utilization. Path selection in multi-hop cognitive radio networks is done using dynamic spectrum allocation. We show that the overall throughput and the packet drop ratio determined by the proposed route selection strategy are better ...

A Mobile Ad hoc Network (MANET) is a selfconfigured, infrastructure less network. In MANETs wireless mobile nodes form a dynamic temporary network Due to mobility of nodes routing is a very critical issue in MANETs. Finding and selecting an optimal and reliable path that can exist as long as possible is a complex task. In the process of path selection and path failure, most of the routing proto...

Cognitive Radio Networks (CRNs) are mainly used for path selection due to the added advantage of dynamic spectrum utilization when the frequency band is not under utilization. Path selection in multi-hop cognitive radio networks is done using dynamic spectrum allocation. We show that the overall throughput and the packet drop ratio determined by the proposed route selection strategy are better ...

This paper addresses the problem of efficient routing in backbone wireless mesh networks (WMNs) where each mesh router (MR) is equipped with multiple radio interfaces and a subset of nodes serve as gateways to the Internet. Most routing schemes have been designed to reduce routing costs by optimizing one metric, e.g., hop count and interference ratio. However, when considering these metrics tog...

The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a network by a given deadline. However, in general, such a path is not the most critical path (MCP) and does not have the smallest estimate for the probability of completion time. The main idea of this paper is derived from the domination structure between ...

This paper proposes a set of novel distributed algorithms on m-D mesh overlay configurations for short delay and low resource consumption application layer multicast. In contrast to previous approaches, our application layer multicast adopts two-layer tree architecture and the novelty and contribution are: (1) cluster formation algorithm assigns the closest group members into the same cluster t...

Path selection in multihomed nodes can be enhanced by optimization techniques that consider multiple criteria. With NP-Hard problems, MADM techniques have the flexibility of including any number of benefits or costs criteria and are open regarding the functions that can be employed to normalize data or to determine distances. TOPSIS uses the Euclidean distance (straight line) while DiA employs ...

This paper studies the complicated interplay of the completion time (as a measure of throughput) and the decoding delay performance in instantly decodable network coded (IDNC) systems over wireless broadcast erasure channels with memory, and proposes two new algorithms that improve the balance between the completion time and decoding delay of broadcasting a block of packets. We first formulate ...

Multiple addresses within an OSPF area can be aggregated and advertised together to other areas. This process is known as address aggregation and is used to reduce router computational overheads and memory requirements and to reduce the network bandwidth consumed by OSPF messages. The downside of address aggregation is that it leads to information loss and consequently sub-optimal (non-shortest...

Sign change problem (SCP) in multivariate Quantitative Structure-Activity/Property Relationships (QSAR/QSPR) is the inconsistency in the direction of association between molecular descriptors and the dependent variable. Sign change is observed when the signs of the elements of the reference vector (correlation vector for the data set obtained from variable selection) are compared to the signs o...