Search

The number of contending neighbors of a node in a multihop ad hoc network has to be adjusted while analyzing the performance of the network such as computing the end-to-end delays along a path from a given source to a destination. In this paper, we describe a method to adjust the number of contending neighbors of a node in a multihop wireless ad hoc network. Our method is based on the minimum number of neighbors that has to be common between two consecutive nodes along a path. We derive an analytical expression for the adjustment factor., Comment: 12 pages, 4 figures

Devising an appropriate scheme that assigns the weights to share credits among multiple authors of a paper is a challenging task. This challenge comes from the fact that different types of conventions might be followed among different research discipline or research groups. In this paper, we discuss that for the purpose of evaluating the quality of research produced by authors, one can resequence either authors or weights and can apply a weight assignment policy which the evaluator deems fit for the particular research discipline or research group., Comment: 3 pages, 2 figures

Designing a wireless node that supports quality of service (QoS) in a mobile ad hoc network is a challenging task. In this paper, we propose an architecture of a wireless node that may be used to form a mobile ad hoc network that supports QoS. We discuss the core functionalities required for such a node and how those functionalities can be incorporated. A feature of our architecture is that the node has the ability to utilize multiple paths, if available, for the provision of QoS. However, in the absence of multiple paths it can utilize the resources provided by a single path between the source and the destination. We follow a modular approach where each module is expanded iteratively. We compare the features of our architecture with the existing architectures proposed in the literature. Our architecture has provisions of energy and mobility management and it can be customized to design a system-on-chip (SoC)., Comment: 6 pages, 6 figures, 1 table

Finding relationships among different indices such as h-index, g-index, e-index, and generalized impact factor is a challenging task. In this paper, we describe some bounds and inequalities relating h-index, g-index, e-index, and generalized impact factor. We derive the bounds and inequalities relating these indexing parameters from their basic definitions and without assuming any continuous model to be followed by any of them., Comment: 17 pages, 6 figures, 5 tables