A channel assignment scheme for FDMA based wireless ad hoc networks in Rayleigh fading environments

Kulkarni, G.; Srivastava, Mani

doi:10.1109/vetecf.2002.1040770

Cited by 12 publications

(19 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We adapted some of the underlying assumptions of each work to allow for equitable comparison, while maintaining their unique algorithmic features. In light of changes from their original work in [1,2,4,5], these adapted algorithms are renamed as: Least Interfering Channel and Non-Iterative Power Assignment (LICNPA), Spatial Channel Separation and Iterative Power Assignment (SCSI-PA), Least Interfering Channel and Iterative Power Assignment (LICIPA), Minimum Power Increase Assignment (MPIA), and Conflict Graph Assignment (CGA). We also propose a new distributed algorithm LICIPA, which combines mechanisms from [2,4].…”

Section: Algorithmsmentioning

confidence: 99%

“…Research on Dynamic Channel and Power Assignment (DCPA) seeks effective ways in which a CN of autonomous radios can assign an appropriate frequency channel and transmit power to improve connectivity and spectral efficiency given available spectrum. Many DCPA techniques have been proposed in the literature [1][2][3][4][5]8], and evaluating the tradeoffs among these techniques from the existing body of work is a difficult task. Each DCPA algorithm can be evaluated under different topologies, node densities, and metrics.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Evaluation of Dynamic Channel and Power Assignment for Cognitive Networks

Deaton

Ahmad

Shukla

et al. 2010

Wireless Pers Commun

View full text Add to dashboard Cite

In this paper, we develop a unifying optimization formulation to describe the Dynamic Channel and Power Assignment (DCPA) problem and an evaluation method for comparing DCPA algorithms. DCPA refers to the allocation of transmit power and frequency channels to links in a cognitive network so as to maximize the total number of feasible links while minimizing the aggregate transmit power. We apply our evaluation method to five 123 6 J. D. Deaton et al.representative DPCA algorithms proposed in the literature. This comparison illustrates the tradeoffs between control modes (centralized versus distributed) and channel/power assignment techniques. We estimate the complexity of each algorithm. Through simulations, we evaluate the effectiveness of the algorithms in achieving feasible link allocations in the network, and their power efficiency. Our results indicate that, when few channels are available, the effectiveness of all algorithms is comparable and thus the one with smallest complexity should be selected. The Least Interfering Channel and Iterative Power Assignment algorithm does not require cross-link gain information, has the overall lowest run time, and achieves the highest feasibility ratio of all the distributed algorithms; however, this comes at a cost of higher average power per link.

show abstract

Section: Algorithmsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Evaluation of Dynamic Channel and Power Assignment for Cognitive Networks

Deaton

Ahmad

Shukla

et al. 2010

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…When each b c i takes only binary values 2 f0; Kg for some integer K, the problem reduces to joint power control and scheduling [7], [8], [22]. Now, R i represents the number of times a link needs to be scheduled and this depends on the traffic.…”

Section: System Model and Problem Formulationmentioning

confidence: 99%

Subcarrier allocation and bit loading algorithms for OFDMA-based wireless networks

Kulkarni¹,

Adlakha

Srivastava

2005

IEEE Trans. on Mobile Comput.

Self Cite

114

View full text Add to dashboard Cite

Abstract-Orthogonal Frequency Division Multiple Access (OFDMA) is an emerging multiple access technology. In this paper, we consider OFDMA in the context of fixed wireless networks. This paper addresses the problem of assigning subcarriers and bits to point-to-point wireless links in the presence of cochannel interference and Rayleigh fading. The objective is to minimize the total transmitted power over the entire network while satisfying the data rate requirement of each link. We formulate this problem as a constrained optimization problem and present centralized algorithms. The simulation results show that our approach results in an efficient assignment of subcarriers and transmitter power levels in terms of the energy required for transmitting each bit of information. However, centralized algorithms require knowledge of the entire network topology and channel characteristics of every link. In a practical scenario, that would not be the situation and there is a need for distributed rate allocation algorithms. To address this need, we also present a distributed algorithm for allocating subcarriers and bits in order to satisfy the rate requirements of the links.

show abstract

“…Numerous channelized medium access control (MAC) schemes and channel allocation algorithms, either dynamic or static, have been proposed for WSNs, where channels can be implemented as time slots, frequency channels, spreading codes, etc., or combinations thereof [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17]. Because the number of available channels is limited and the number of nodes is usually large, channels must be spatially reused, which leads to co-channel interference.…”

Section: Introductionmentioning

confidence: 99%

“…The reason is that, although individual transmitting antennas may cause only small interference at a far receiver, the aggregate interference of a numbers of far transmitters can cause the SIR to drop below the threshold and hence disrupt communications. A few centralized SIR-maintaining schemes have been proposed [3,5,6,13,15,17]. In these schemes, it is assumed that some central node has knowledge of the complete network layout which it uses to assign channels in such a way that the SIR level is always above γ .…”

Section: Introductionmentioning

confidence: 99%

Spatial channel reuse in wireless sensor networks

Wang

Berger

2006

Wireless Netw

View full text Add to dashboard Cite

Wireless sensor networks (WSN) are formed by network-enabled sensors spatially randomly distributed over an area. Because the number of nodes in the WSNs is usually large, channel reuse must be applied, keeping co-channel nodes sufficiently separated geographically to achieve satisfactory SIR level. The most efficient channel reuse configuration for WSN has been determined and the worst-interference scenario has been identified. For this channel reuse pattern and worst-case scenario, the minimum co-channel separation distance consistent with an SIR level constraint is derived. Our results show that the two-hop co-channel separations often assumed for sensor and ad hoc networks are not sufficient to guarantee communications. Minimum co-channel separation curves given various parameters are also presented. The results in this paper provide theoretical basis for channel spatial reuse and medium access control for WSNs and also serve as a guideline for how channel assignment algorithms should allocate channels. Furthermore, because the derived co-channel separation is a function of the sensor transmission radius, it also provides a connection between network data transport capacity planning and network topology control which is administered by varying transmission powers.

show abstract

A channel assignment scheme for FDMA based wireless ad hoc networks in Rayleigh fading environments

Cited by 12 publications

References 5 publications

Evaluation of Dynamic Channel and Power Assignment for Cognitive Networks

Evaluation of Dynamic Channel and Power Assignment for Cognitive Networks

Subcarrier allocation and bit loading algorithms for OFDMA-based wireless networks

Spatial channel reuse in wireless sensor networks

Contact Info

Product

Resources

About