Journal ArticleDOI
Optimal Hop Distance and Power Control for a Single Cell, Dense, Ad Hoc Wireless Network
Reads0
Chats0
TLDR
There exists an intrinsic aggregate bit rate (\Theta_{opt} bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control.Abstract:
We consider a dense, ad hoc wireless network, confined to a small region. The wireless network is operated as a single cell, i.e., only one successful transmission is supported at a time. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organize into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention-based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first motivate that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc wireless network (described above) as a single cell, we study the hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (\Theta_{opt} bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d_{opt}(\bar{P_t}) \times \Theta_{opt} with d_{opt} scaling as \bar{P_t}^{{1\over \eta}}, where \bar{P_t} is the available time average transmit power and \eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterization of the optimal operating point. Simulation results are provided comparing the performance of the optimal strategy derived here with some simple strategies for operating the network.read more
Citations
More filters
Journal ArticleDOI
Opportunistic Routing Algorithm for Relay Node Selection in Wireless Sensor Networks
TL;DR: Extensive simulations and real testbed results show that the proposed solution ENS_OR can significantly improve the network performance on energy saving and wireless connectivity in comparison with other existing WSN routing schemes.
Journal ArticleDOI
Optimal Energy Strategy for Node Selection and Data Relay in WSN-based IoT
TL;DR: This paper first analyzes energy consumption model and data relay model in WSN-based IoT, and then proposes the concept of “equivalent node” to select relay node for optimal data transmission and energy conservation, and develops a probabilistic dissemination algorithm, called ENS_PD.
Journal ArticleDOI
Link Quality Based Opportunistic Routing Algorithm for QOS: Aware Wireless Sensor Networks Security
TL;DR: Simulation results shows that the proposed novel link quality based opportunistic routing method achieves more energy savings, and higher packet delivery ratio.
Journal ArticleDOI
Goodput and throughput comparison of single-hop and multi-hop routing for IEEE 802.11 DCF-based wireless networks under hidden terminal existence
Canan Aydogdu,Ezhan Karasan +1 more
TL;DR: A semi-Markov chain-based goodput and throughput model for IEEE 802.11-based wireless networks is proposed, which works accurately with both multi-hopping and single hopping for different network topologies and over a large range of traffic loads.
Journal ArticleDOI
Event-triggered feedback for power allocation in wireless networks
TL;DR: A power allocation strategy based on an event-triggered transmission (ETT) to reduce the feedback signalling in the network and establishes a relation between performance and feedback reduction.
References
More filters
Book
Wireless Communications: Principles and Practice
TL;DR: WireWireless Communications: Principles and Practice, Second Edition is the definitive modern text for wireless communications technology and system design as discussed by the authors, which covers the fundamental issues impacting all wireless networks and reviews virtually every important new wireless standard and technological development, offering especially comprehensive coverage of the 3G systems and wireless local area networks (WLANs).
Journal ArticleDOI
The capacity of wireless networks
Piyush Gupta,P. R. Kumar +1 more
TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.
Journal ArticleDOI
Capacity of fading channels with channel side information
Andrea Goldsmith,Pravin Varaiya +1 more
TL;DR: The Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the receiver alone is obtained, analogous to water-pouring in frequency for time-invariant frequency-selective fading channels.
Proceedings ArticleDOI
Dynamic power allocation and routing for time varying wireless networks
TL;DR: A joint routing and power allocation policy is developed which stabilizes the system and provides bounded average delay guarantees whenever the input rates are within this capacity region.
Proceedings ArticleDOI
Optimal routing, link scheduling and power control in multihop wireless networks
Rene L. Cruz,A.V. Santhanam +1 more
TL;DR: This paper addresses the problem of finding an optimal link scheduling and power control policy that minimizes the total average transmission power in the wireless multihop network, subject to given constraints regarding the minimum average data rate per link, as well as peak transmission power constraints per node.