194 research outputs found

    ESAR: Energy Saving Ad Hoc Routing Protocol for Mobile Ad Hoc Networks

    Get PDF
    Mobile ad hoc networks support multi hop routing where the deployment of central base station is neither economic nor easy. Efficient routing of the packets is a major challenge in the ad hoc networks. There exist several proactive (like DSDV etc.) and reactive (Like AODV etc.) routing algorithms for the dynamic networks.The ESAR algorithm selects the path with minimum cost value indicating that the path has the shortest distance to the destination and has the maximum of the minimum available battery power of the node among the different paths. This selected path is chosen as the best path for packet transmission till any node in the path exhausts battery power beyond a threshold value. At this point of time, a backup path having the next lower cost is selected as an alternate path for packet transmission. The process is repeated till all the paths from the same source to destination are exhausted with their battery power. When this situation occurs, the cost of the paths is re-calculated and the process continues. The simulation result of the proposed algorithm ESAR enhances the network life time over the AODV and EEAODR algorithm

    Theoretical Priors and the Dark Energy Equation of State

    Full text link
    We revisit the theoretical priors used for inferring Dark Energy (DE) parameters. Any DE model must have some form of a tracker mechanism such that it behaved as matter or radiation in the past. Otherwise, the model is fine-tuned. We construct a model-independent parametrization that takes this prior into account and allows for a relatively sudden transition between radiation/matter to DE behavior. We match the parametrization with current data, and deduce that the adiabatic and effective sound speeds of DE play an important role in inferring the cosmological parameters. We find that there is a preferred transition redshift of 1+z29301+z\simeq 29-30, and some reduction in the Hubble and Large Scale Structure tensions.Comment: 51 Pages, 11 figures, 19 Tables including appendices, Comments are welcome, references and footnote adde

    Blackhole in Nonlocal Gravity: Comparing Metric from Newmann-Janis Algorithm with Slowly Rotating Solution

    Full text link
    The strong gravitational field near massive blackhole is an interesting regime to test General Relativity(GR) and modified gravity theories. The knowledge of spacetime metric around a blackhole is a primary step for such tests. Solving field equations for rotating blackhole is extremely challenging task for the most modified gravity theories. Though the derivation of Kerr metric of GR is also demanding job, the magical Newmann-Janis algorithm does it without actually solving Einstein equation for rotating blackhole. Due to this notable success of Newmann-Janis algorithm in the case of Kerr metric, it has been being used to obtain rotating blackhole solution in modified gravity theories. In this work, we derive the spacetime metric for the external region of a rotating blackhole in a nonlocal gravity theory using Newmann-Janis algorithm. We also derive metric for a slowly rotating blackhole by perturbatively solving field equations of the theory. We discuss the applicability of Newmann-Janis algorithm to nonlocal gravity by comparing slow rotation limit of the metric obtained through Newmann-Janis algorithm with slowly rotating solution of the field equation.Comment: 8 pages, 1 figure, minor corrections, references added; to appear in EPJ
    corecore