Results 1 
4 of
4
Placement and Range Assignment in PowerAware Radio Networks
, 2007
"... Due to the extraordinary growth in the demand of mobile communication services in general, design of efficient systems for providing specialized services has also become an important issue in wireless mobility research. Broadly speaking, there are two major models for wireless networking: singleho ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Due to the extraordinary growth in the demand of mobile communication services in general, design of efficient systems for providing specialized services has also become an important issue in wireless mobility research. Broadly speaking, there are two major models for wireless networking: singlehop and multihop. The single
Analysis of Wireless MultiHop Broadcasting: Optimal and Approximate Solutions and Applications
, 2015
"... ii In this work, we design and analyze transmission range assignments for broadcasting in wireless multihop networks. Moreover, we study different features of wireless networks. We consider network scenarios in which the exact location of the nodes is known and others where the nodes location is k ..."
Abstract
 Add to MetaCart
(Show Context)
ii In this work, we design and analyze transmission range assignments for broadcasting in wireless multihop networks. Moreover, we study different features of wireless networks. We consider network scenarios in which the exact location of the nodes is known and others where the nodes location is known probabilistically. For the former, we propose optimal and nearoptimal algorithms to solve the MinimumEnergy Broadcasting problem for linear (onedimensional) networks. We further extend our solutions to encompass cross networks, in which the nodes are located on two perpendicular lines. The proposed algorithms have polynomialtime complexity, and are shown to perform better than previously known algorithms (for some cases, they are the first polynomialtime solutions). For probabilistic networks, we propose a transmission range assignment such that for a given average total consumed power, the linear network is connected with high probability. We then analyze some features of these networks, including derivation
1LowComplexity EnergyEfficient Broadcasting in OneDimensional Wireless Networks
"... In this paper, we investigate the transmission range assignment for N wireless nodes located on a line (a linear wireless network) for broadcasting data from one specific node to all the nodes in the network with minimum energy. Our goal is to find a solution that has low complexity and yet performs ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper, we investigate the transmission range assignment for N wireless nodes located on a line (a linear wireless network) for broadcasting data from one specific node to all the nodes in the network with minimum energy. Our goal is to find a solution that has low complexity and yet performs close to optimal. We propose an algorithm for finding the optimal assignment (which results in the minimum energy consumption) with complexity O(N2). An approximation algorithm with complexity O(N) is also proposed. It is shown that, for networks with uniformly distributed nodes, the lineartime approximate solution obtained by this algorithm on average performs practically identical to the optimal assignment. Both the optimal and the suboptimal algorithms require the full knowledge of the network topology and are thus centralized. We also propose a distributed algorithm of negligible complexity, i.e., with complexity O(1), which only requires the knowledge of the adjacent neighbors at each wireless node. Our simulations demonstrate that the distributed solution on average performs almost as good as the optimal one for networks with uniformly distributed nodes.