Transmission Range

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 234000 Experts worldwide ranked by ideXlab platform

Pradeep K. Varshney - One of the best experts on this subject based on the ideXlab platform.

  • Optimal Transmission Range for Wireless Ad Hoc Networks Based on Energy Efficiency
    IEEE Transactions on Communications, 2007
    Co-Authors: Jing Deng, Po-ning Chen, Pradeep K. Varshney
    Abstract:

    The Transmission Range that achieves the most economical use of energy in wireless ad hoc networks is studied for uniformly distributed network nodes. By assuming the existence of forwarding neighbors and the knowledge of their locations, the average per-hop packet progress for a Transmission Range that is universal for all nodes is derived. This progress is then used to identify the optimal per-hop Transmission Range that gives the maximal energy efficiency. Equipped with this analytical result, the relation between the most energy-economical Transmission Range and the node density, as well as the path loss exponent, is numerically investigated. It is observed that when the path loss exponent is high (such as four), the optimal Transmission Ranges are almost identical over the Range of node densities that we studied. However, when the path loss exponent is only two, the optimal Transmission Range decreases noticeably as the node density increases. Simulation results also confirm the optimality of the per-hop Transmission Range, which we found analytically.

  • optimum Transmission Range for wireless ad hoc networks
    Wireless Communications and Networking Conference, 2004
    Co-Authors: Jing Deng, Po-ning Chen, Yunghsiang S Han, Pradeep K. Varshney
    Abstract:

    The Transmission Range that achieves the most economical use of energy in wireless ad hoc networks is studied under homogeneous node distribution. By assuming the knowledge of node location, we first proposed a Transmission strategy to ensure the progress of data packets toward their final destinations. Then the average packet progress for a Transmission Range universal for all nodes is derived, which is accordingly used to determine the optimal Transmission Range that gives the maximum efficiency of energy consumption. Different from some previous work, our analysis does not make the assumption of large nodal density in the wireless ad hoc networks studied. Numerical and simulation results are presented to examine our analysis for wireless ad hoc networks.

Jing Deng - One of the best experts on this subject based on the ideXlab platform.

  • Optimal Transmission Range for Wireless Ad Hoc Networks Based on Energy Efficiency
    IEEE Transactions on Communications, 2007
    Co-Authors: Jing Deng, Po-ning Chen, Pradeep K. Varshney
    Abstract:

    The Transmission Range that achieves the most economical use of energy in wireless ad hoc networks is studied for uniformly distributed network nodes. By assuming the existence of forwarding neighbors and the knowledge of their locations, the average per-hop packet progress for a Transmission Range that is universal for all nodes is derived. This progress is then used to identify the optimal per-hop Transmission Range that gives the maximal energy efficiency. Equipped with this analytical result, the relation between the most energy-economical Transmission Range and the node density, as well as the path loss exponent, is numerically investigated. It is observed that when the path loss exponent is high (such as four), the optimal Transmission Ranges are almost identical over the Range of node densities that we studied. However, when the path loss exponent is only two, the optimal Transmission Range decreases noticeably as the node density increases. Simulation results also confirm the optimality of the per-hop Transmission Range, which we found analytically.

  • optimum Transmission Range for wireless ad hoc networks
    Wireless Communications and Networking Conference, 2004
    Co-Authors: Jing Deng, Po-ning Chen, Yunghsiang S Han, Pradeep K. Varshney
    Abstract:

    The Transmission Range that achieves the most economical use of energy in wireless ad hoc networks is studied under homogeneous node distribution. By assuming the knowledge of node location, we first proposed a Transmission strategy to ensure the progress of data packets toward their final destinations. Then the average packet progress for a Transmission Range universal for all nodes is derived, which is accordingly used to determine the optimal Transmission Range that gives the maximum efficiency of energy consumption. Different from some previous work, our analysis does not make the assumption of large nodal density in the wireless ad hoc networks studied. Numerical and simulation results are presented to examine our analysis for wireless ad hoc networks.

Andrew T Campbell - One of the best experts on this subject based on the ideXlab platform.

  • variable Range Transmission power control in wireless ad hoc networks
    IEEE Transactions on Mobile Computing, 2007
    Co-Authors: Javier Gomez, Andrew T Campbell
    Abstract:

    In this paper, we investigate the impact of variable-Range Transmission power control on the physical and network connectivity, on network capacity, and on power savings in wireless multihop networks. First, using previous work by Steele (1988), we show that, for a path attenuation factor a = 2, the average Range of links in a planar random network of A m2 having n nodes is ~aradicA/n1. We show that this average Range is approximately half the Range obtained when common-Range Transmission control is used. Combining this result and previous work by Gupta and Kumar (2000), we derive an expression for the average traffic carrying capacity of variable-Range-based multihop networks. For a = 2, we show that this capacity remains constant even when more nodes are added to the network. Second, we derive a model that approximates the signaling overhead of a routing protocol as a function of the Transmission Range and node mobility for both route discovery and route maintenance. We show that there is an optimum setting for the Transmission Range, not necessarily the minimum, which maximizes the capacity available to nodes in the presence of node mobility. The results presented in this paper highlight the need to design future MAC and routing protocols for wireless ad hoc and sensor networks based, not on common-Range which is prevalent today, but on variable-Range power control

  • a case for variable Range Transmission power control in wireless multihop networks
    International Conference on Computer Communications, 2004
    Co-Authors: Javier Gomez, Andrew T Campbell
    Abstract:

    We study the impact of individual variable-Range Transmission power control on the physical and network connectivity, network capacity and power savings of wireless multihop networks such as ad hoc and sensor networks. First, using previous work by Steele (1988) and Gupta (2000) we derive an asymptotic expression for the average traffic carrying capacity of nodes in a multihop network where nodes can individually control the Transmission Range they use. For the case of a path attenuation factor /spl alpha/ = 2 we show that this capacity remains constant even when more nodes are added to the network. Second, we show that the ratio between the minimum Transmission Range levels obtained using common-Range and variable-Range based routing protocols is approximately 2. This is an important result because it suggests that traditional routing protocols based on common-Range Transmission can only achieve about half the traffic carrying capacity of variable-Range power control approaches. In addition, common-Range approaches consume /spl sim/ (1 $2/(2/sup /spl alpha//)) % more Transmission power. Second, we derive a model that approximates the signaling overhead of a routing protocol as a function of the Transmission Range and node mobility for both route discovery and route maintenance. We show how routing protocols based on common-Range Transmission power limit the capacity available to mobile nodes. The results presented in the paper highlight the need to design future wireless network protocols (e.g., routing protocols) for wireless ad hoc and sensor networks based, not on common-Range which is prevalent today, but on variable-Range power control.

Yuguang Fang - One of the best experts on this subject based on the ideXlab platform.

  • the capacity of wireless ad hoc networks using directional antennas
    IEEE Transactions on Mobile Computing, 2011
    Co-Authors: Pan Li, Chi Zhang, Yuguang Fang
    Abstract:

    Considering a disk of unit area with n nodes, we investigate the capacity of wireless networks using directional antennas. First, we study the throughput capacity of random directional networks with multihop relay schemes, and find that the capacity gain compared to random omnidirectional networks is O(log n), which is tighter than previous results. We also show that using directional antennas can significantly reduce power consumption in the networks. Second, for the first time, we explore the throughput capacity of random directional networks with one-hop relay schemes. Interestingly and against our intuition, we find that one-hop instead of multihop delivery schemes can make random directional networks scale. Third, we investigate the trade-offs between Transmission Range and throughput in random directional networks and show that using larger Transmission Range can result in higher throughput. Finally, we present a lower bound on the transport capacity of arbitrary directional networks, and find that without side lobe directional antenna gain, arbitrary directional networks can also scale.

  • asymptotic connectivity in wireless ad hoc networks using directional antennas
    IEEE ACM Transactions on Networking, 2009
    Co-Authors: Pan Li, Chi Zhang, Yuguang Fang
    Abstract:

    Connectivity is a crucial issue in wireless ad hoc networks (WANETs). Gupta and Kumar have shown that in WANETs using omnidirectional antennas, the critical Transmission Range to achieve asymptotic connectivity is O(radic(log n/n)) if n nodes are uniformly and independently distributed in a disk of unit area. In this paper, we investigate the connectivity problem when directional antennas are used. We first assume that each node in the network randomly beam forms in one beam direction. We find that there also exists a critical Transmission Range for a WANET to achieve asymptotic connectivity, which corresponds to a critical Transmission power (CTP). Since CTP is dependent on the directional antenna pattern, the number of beams, and the propagation environment, we then formulate a non-linear programming problem to minimize the CTP. We show that when directional antennas use the optimal antenna pattern, the CTP in a WANET using directional antennas at both transmitter and receiver is smaller than that when either transmitter or receiver uses directional antenna and is further smaller than that when only omnidirectional antennas are used. Moreover, we revisit the connectivity problem assuming that two neighboring nodes using directional antennas can be guaranteed to beam form to each other to carry out the Transmission. A smaller critical Transmission Range than that in the previous case is found, which implies smaller CTP.

Po-ning Chen - One of the best experts on this subject based on the ideXlab platform.

  • Optimal Transmission Range for Wireless Ad Hoc Networks Based on Energy Efficiency
    IEEE Transactions on Communications, 2007
    Co-Authors: Jing Deng, Po-ning Chen, Pradeep K. Varshney
    Abstract:

    The Transmission Range that achieves the most economical use of energy in wireless ad hoc networks is studied for uniformly distributed network nodes. By assuming the existence of forwarding neighbors and the knowledge of their locations, the average per-hop packet progress for a Transmission Range that is universal for all nodes is derived. This progress is then used to identify the optimal per-hop Transmission Range that gives the maximal energy efficiency. Equipped with this analytical result, the relation between the most energy-economical Transmission Range and the node density, as well as the path loss exponent, is numerically investigated. It is observed that when the path loss exponent is high (such as four), the optimal Transmission Ranges are almost identical over the Range of node densities that we studied. However, when the path loss exponent is only two, the optimal Transmission Range decreases noticeably as the node density increases. Simulation results also confirm the optimality of the per-hop Transmission Range, which we found analytically.

  • optimum Transmission Range for wireless ad hoc networks
    Wireless Communications and Networking Conference, 2004
    Co-Authors: Jing Deng, Po-ning Chen, Yunghsiang S Han, Pradeep K. Varshney
    Abstract:

    The Transmission Range that achieves the most economical use of energy in wireless ad hoc networks is studied under homogeneous node distribution. By assuming the knowledge of node location, we first proposed a Transmission strategy to ensure the progress of data packets toward their final destinations. Then the average packet progress for a Transmission Range universal for all nodes is derived, which is accordingly used to determine the optimal Transmission Range that gives the maximum efficiency of energy consumption. Different from some previous work, our analysis does not make the assumption of large nodal density in the wireless ad hoc networks studied. Numerical and simulation results are presented to examine our analysis for wireless ad hoc networks.