Abstract-Mobile ad-hoc networking involves peer-to-peer communication in a network with a dynamically changing topology. Achieving energy efficient communication in such a network is more challenging than in cellular networks since there is no centralized arbiter such as a base station that can administer power management. In this paper, we propose and evaluate a power control loop, similar to those commonly found in cellular CDMA networks, for ad-hoc wireless networks. We use a comprehensive simulation infrastructure consisting of group mobility, group communication and terrain blockage models. A major focus of research in ad-hoc wireless networking is to reduce energy consumption because the wireless devices are envisioned to have small batteries and be incapable of energy scavenging. We show that this power control loop reduces energy consumption per transmitted byte by 10 -20%. Furthermore, we show that it increases overall throughput by 15%.
Abstract-In this paper we introduce the notion of power management within the context of wireless ad-hoc networks. More specifically, we investigate the effects of using different transmit powers on the average power consumption and end-to-end network throughput in a wireless ad-hoc environment. This power management approach would help in reducing the system power consumption and hence prolonging the battery life of mobile nodes. Furthermore, it improves the end-to-end network throughput as compared to other ad-hoc networks in which all mobile nodes use the same transmit power. The improvement is due to the achievement of a tradeoff between minimizing interference ranges, reduction in the average number of hops to reach a destination, the probability of having isolated clusters, and the average number of transmissions (including retransmissions due to collisions). The protocols would first dynamically determine an optimal connectivity range wherein they adapt their transmit powers so as to only reach a subset of the nodes in the network. The connectivity range would then be dynamically changed in a distributed manner so as to achieve the near optimal throughput. Minimal power routing is used to further enhance performance. Simulation studies are carried out in order to investigate these design approaches. It is seen a network with such a power managed scheme would achieve a better throughput performance and lower transmit power than a network without such a scheme.
Abstract-MAC layer protocols for wireless ad hoc networks typically assume that the network is homogeneous with respect to the transmit power capability of individual nodes in the network. The IEEE 802.11 MAC protocol has been popular for use in ad hoc networks. We investigate the performance of this protocol when it is used in a network with nodes that transmit at various power levels. We show that overall throughput is lower than the throughput of a network in which all nodes transmit at identical power levels. In addition, low power nodes have a disadvantage in accessing the medium due to higher levels of interference from the high power nodes. We consider propagating the control messages generated by a node wishing to initiate communication to distant nodes so that they may forbear transmissions for some time, thereby allowing clear access to the initiating node. We find that the overhead incurred due to the additional message transmissions outweighs the potential gain achieved by propagating these messages. This indicates that the signalling mechanism used in the IEEE 802.11 standard or the variants thereof are not sufficient to alleviate the loss in throughput and the lack of fairness engendered by networks that are heterogeneous with regard to the transmit power capabilities of individual nodes.
Consider a database that represents the location of moving objects, such as taxi-cabs typical query: retrieve the cabs that are currently within 1 mile of 33 Michigan Ave., Chicago, or objects in a battle-eld. Existing database management systems DBMS's are not well equipped to handle continuously changing data, such as the position of moving objects, since data is assumed t o b e c onstant unless it is explicitly modied.In this paper we address position-update policies and imprecision. Namely, assuming that the actual position of a moving object m deviates from the position computed by the DBMS, when should m update its position in the database in order to eliminate the deviation? Furthermore, how can the DBMS provide a bound on the error i.e. the deviation when it replies to a query: what is the current position of m? We propose a cost based approach to update policies that answers both questions. We develop several update policies and analyze them theoretically and experimentally.
Abstract-Ad-Hoc Networks consist of peer-to-peer communicating nodes that are highly mobile. As such, an ad-hoc network lacks infrastructure and the topology of the network changes dynamically. The task of routing data from a source to a destination in such a network is challenging. Several routing protocols have been proposed for wireless ad-hoc networks. Most of these protocols, however, pre-suppose the presence of bi-directional links between the nodes in the network. In reality the ad-hoc network may consist of heterogeneous nodes with different power capabilities and hence, different transmission ranges. When this is the case, a given node might be able to receive the transmission of another given node but might not be able to successfully transmit to the latter. Thus, unidirectional links are formed. Most of the current routing protocols are unsuitable for deployment when such unidirectional links are present. We consider a routing protocol called the zone routing protocol (ZRP) that has been proposed for wireless ad-hoc networks with bi-directional links. The zone routing protocol employs a hybrid proactive (table driven) and reactive (ondemand) methodology to provide scalable routing in the ad-hoc network. However, in the presence of unidirectional links some routes remain undiscovered if ZRP is used. We propose extensions to ZRP to support its deployment when unidirectional links are present. In particular, we propose a query enhancement mechanism that recursively builds partial routes to a destination. Simulation results show that even at a high mobility of 20m/s, the queries resulting due to the enhancement mechanism result in the computation of valid routes more than 80% of the time. These results are valid even when a large number (40% of nodes have half the transmission range as that of the remaining nodes) of unidirectional links are present in the network.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.