Sagar Naik

A new fairness index for radio resource allocation in wireless networks

In this paper, we investigate the measurement of fairness, discuss well known fairness notions, and propose a new utility-based framework to evaluate the degree of fairness of resource allocation schemes in wireless access networks. The proposed framework has certain desirable features. It offers clear definitions and relevant methodology, takes into account both effort and service unfairness, and can be customized for different application types with different QoS requirements. Numerical examples and case studies are given to demonstrate the effectiveness of the proposed framework.

Software Testing and Quality Assurance

SOFTWARE QA AND TESTING RESOURCE CENTER. WELCOME PQA TESTING PROFESSIONAL QUALITY ASSURANCE LTD. FUZZING FOR SOFTWARE SECURITY TESTING AND QUALITY ASSURANCE. SOFTWARE QUALITY SOFTWARE TESTING FUNDAMENTALS. QUALITY ASSURANCE VS QUALITY CONTROL SOFTWARE TESTING. SOFTWARE TESTING WIKIPEDIA. SPECIALIST QA AMP SOFTWARE TESTING COMPANY TESTINGXPERTS. QUALITY ASSURANCE COMPANY QAWERK OUTSOURCE QA TO OUR. SOFTWARE QUALITY TESTING AND SECURITY ANALYSIS MCCABE. 15 1199 01 SOFTWARE QUALITY ASSURANCE ENGINEERS AND TESTERS. SOFTWARE QUALITY ASSURANCE PLAN SQAP TEMPLATE. SOFTWARE QA TRAINING QA COURSES ONLINE. BEST QUALITY ASSURANCE QA SOFTWARE TESTING TRAINING. IBETA QUALITY ASSURANCE. SOFTWARE TESTING CURRENT AFFAIRS 2018 APACHE COMMONS. SOFTWARE TESTING SERVICES SOFTWARE QUALITY ASSURANCE TESTING. SOFTWARE QUALITY ASSURANCE FROM THEORY TO IMPLEMENTATION. SOFTWARE QUALITY ASSURANCE SOFTWARE TESTING FUNDAMENTALS. SOFTWARETESTING AND QUALITY ASSURANCE TEST PLAN SAMPLE. SOFTWARE QA AND TESTING RESOURCE CENTER FAQ PART 1. PROGRAMMING FOUNDATIONS SOFTWARE QUALITY ASSURANCE. WHAT IS QUALITY ASSURANCE QA DEFINITION FROM WHATIS COM. ACUTEST IS THE LEADING INDEPENDENT SOFTWARE TESTING. QA SOFTWARE TESTING TRAINING QUALITY ASSURANCE ENGINEER. SOFTWARE QUALITY ASSURANCE. A1QA SOFTWARE TESTING COMPANY SOFTWARE QUALITY. QUALITY ASSURANCE WIKIPEDIA

Parameterized neighborhood based flooding for ad hoc wireless networks

Flooding is a simple routing technique that can be used to transmit data from one node to every other node in a network. The focus of this paper is to investigate improvements to flooding techniques used in ad hoc wireless networks. Recent work has focused on using topological information to reduce the number of broadcasts. The number of broadcasts necessary to flood the network was the major performance metric used to compare previous neighborhood-based flooding algorithms. We build upon this foundation by first presenting a parameterized neighborhood-based flooding (PNBF) algorithm, which provides a single platform for the performance comparison of various multihop neighborhood-based flooding algorithms. We also introduce and motivate the use of additional performance metrics, including total number of collisions and percentage of nodes that receive the message, for comparing flooding algorithms. An analysis is given of how different network properties, such as average node degree, communication patterns, affect the performance of the different neighborhood-based flooding algorithms. Our simulation results demonstrate that our algorithm is capable of handling a wide variety of situations where properties of ad hoc networks along with the relative importance of the performance criteria are taken into consideration.

A node cooperative ARQ scheme for wireless ad-hoc networks

We propose a Node Cooperative Automatic Repeat reQuest (ARQ) scheme for wireless ad-hoc networks to combat the effects of channel fading on the performance of link layer retransmission scheme. The proposed scheme is inspired by the idea of cooperative diversity. Simulation results are given to demonstrate the significant throughput gain, even when the quality of channel between the communicating nodes is poor.

Efficient Localized Protocols to Compute Connected Dominating Sets for Ad Hoc Networks

Mobile Ad Hoc networks (MANETs) are gaining increased interest due to their wide range of potential applications in civilian and military sectors. The self-control, self-organization, topology dynamism, and bandwidth limitation of the wireless communication channel make implementation of MANETs a challenging task. Vehicular Ad Hoc Networks (VANETs) are a special kind of MANETs that aims at providing communications among vehicles on the roads. The fact that a vehicles movement is predictable and constrained by the road trajectory is a feature that gives VANETs their distinction. The Connected Dominating Set (CDS), a.k.a. virtual backbone or spine, has been proposed to facilitate routing, broadcasting, and establishing a dynamic infrastructure for distributed location databases in MANETs and VANETs. Minimizing the CDS cardinality simplifies the network abstracted topology, allows for using shorter routes, and reduces the number of required retransmissions in broadcasting scenarios. Due to the fact that minimizing the CDS size is NP-complete problem, approximation algorithms and heuristics have been used to reduce the CDS size. Localized CDS creation algorithms proved to run fast and to generate light signaling overhead. Computationally, the simplest localized CDS creation algorithms is Wu and Li algorithm; however, this algorithm is characterized by a relatively high signaling overhead. To reduce the signaling overhead of Wu and Li algorithm, a modified version of the algorithm is proposed; this version is built on the assumption that utilizing the location information of network members reduces the signaling overhead. In this paper, we claim that utilizing location information does not guarantee signaling overhead reduction and it may increase it; moreover, we introduce some modifications that guarantee overhead reduction. we conduct extensive simulations to investigate the correctness of our claim, and we study the impact of using location information on the run time and the size of the CDS

An inexpensive unstructured platform for wireless mobile peer-to-peer networks

In this paper, we propose an unstructured platform, namely InexpensivePeer-to-PeerSubsystem (IPPS), for wireless mobile peer-to-peer networks. The platform addresses the constraints of expensive bandwidth of wireless medium, and limited memory and computing power of mobile devices. It uses a computationally-, memory requirement- and communication- wise inexpensive gossip protocol as the main maintenance operation, and exploits location information of the wireless nodes to minimize the number of link-level messages for communication between peers. As a result, the platform is not only lightweight by itself, but also provides a low cost framework for different peer-to-peer applications. In addition, further enhancements are introduced to enrich the platform with robustness and tolerance to failures without incurring any additional computational and memory complexity, and communication between peers. In specific, we propose schemes for a peer (1) to chose a partner for a gossip iteration, (2) to maintain the neighbors, and (3) to leave the peer-to-peer network. Simulation results are given to demonstrate the performance of the platform.

A variable degree based clustering algorithm for networks

Hierarchical routing is used to reduce routing update costs, and clustering algorithms partition networks into multilevel cluster structures. In hierarchical networks, routing performance is greatly affected by the sizes and structures of partitioned clusters. Two existing clustering algorithms are based on the concepts of the lowest ID and the maximum degree of nodes. In this paper, we present a new clustering algorithm based on the concept of the variable degree of nodes. Our new algorithm produces clusters with the low cluster variance in size, and the number of the clusters is close to the optimal value that leads to the smallest total routing table size. The performance of the algorithm is evaluated by using simulated ad hoc networks.

QoS Support in Delay Tolerant Vehicular Ad Hoc Networks

In this paper, we propose a new intersection-based geographical routing protocol, called delay tolerant routing protocol (DTRP) that adapts to the changes in the local topology within city environments. DTRP is based on an effective selection of road intersections through which a packet must pass to reach the gateway to the Internet. The selection, in such delay tolerant VANETs, is made in a way that maximizes the connectivity probability of the route between mobile nodes and the gateway while maintaining a threshold for the end-to-end delay and the hop count within the network. To achieve this, we formulate the QoS routing problem mathematically as a constrained optimization problem. Specifically, analytical expressions for the connectivity probability as well as the delay and hop count of a route in a two-way road scenario are derived. Then, we propose a genetic algorithm to solve the optimization problem. Numerical and simulation results show that the proposed approach gives optimal or near-optimal solutions and improves significantly the VANETs performance when compared with several prominent routing protocols, such as GPSR, GPCR and OLSR.

Optimal solution of total routing table size for hierarchical networks

Hierarchical routing is an effective way to solve the scalability problem in flat networks. The optimal total routing table (RT) size is affected by four parameters: the total number of nodes in a network hierarchy levels, the number of clusters at each level, and cluster size distribution. An optimal solution of total RT size was given in L. Kleinrock et al. (1977). However, the optimal solution was based on a major assumption: all nodes in the network have equal size RTs. It is not clear whether the optimal results stated in L. Kleinrock et al. (1977) still hold without this assumption. We provide the general integer solution of optimal RT sizes without this assumption. In addition, we will show how the total number of nodes, the number of hierarchical levels, and the number of the highest-level clusters affect the total RTsize. Moreover, some important properties of the two-level cluster structure are extensively addressed, namely the impact of the variance of cluster size distribution on intra-cluster update costs and the RTsize.

Energy-Aware Co-Operative (ECO) Relay-Based Packet Transmission in Wireless Networks

In infrastructure wireless networks, nodes at the edge of the coverage area need to spend more energy to transmit their packets than those close to the Access Point (AP). Less energy is required if intermediate nodes can be used to forward data. To enable this, intermediate nodes need an incentive and there must be a mechanism for selecting these nodes. In this paper we propose Energy-aware Co-Operative (ECO) relaying for selecting relays to forward packets. The technique is based on the idea of Relative Energy Usage (REU), which reflects the proportion of energy that a node saves by forwarding its packets through relays. A node which saves more energy by using relays is more likely to be chosen as a relay. Conversely, nodes are only permitted to use relays proportionate to the amount of energy they themselves have spent as relays. We compare our scheme with direct transmission, minimum energy path (MnEP), and maximum residual energy path (MxRE). We show that ECO can transmit 50% more data than direct transmission, while using less energy on average. Although MnEP and MxRE can also transmit more data than direct transmission, they do so at severe energy cost to a small number of nodes, doubling the average energy usage, making them ill-suited to commercial networks.