Abstract

We consider the base station placement problem for wireless sensor networks with successive interference cancellation (SIC) to improve throughput. We build a mathematical model for SIC. Although this model cannot be solved directly, it enables us to identify a necessary condition for SIC on distances from sensor nodes to the base station. Based on this relationship, we propose to divide the feasible region of the base station into small pieces and choose a point within each piece for base station placement. The point with the largest throughput is identified as the solution. The complexity of this algorithm is polynomial. Simulation results show that this algorithm can achieve about 25% improvement compared with the case that the base station is placed at the center of the network coverage area when using SIC.

Highlights

  • IntroductionIt is a challenge to increase throughput in a wireless sensor network (WSN) [1]

  • Due to limited resources, it is a challenge to increase throughput in a wireless sensor network (WSN) [1]

  • Their analytical results showed that successive interference cancellation (SIC) can achieve potential gain in wireless networks, especially in heterogeneous cellular networks

Read more

Summary

Introduction

It is a challenge to increase throughput in a wireless sensor network (WSN) [1]. Jiang et al proposed an optimal cross-layer algorithm that can be used in a multi-hop network with SIC and showed that their algorithm can increase throughput by 47% compared with the interference avoidance model [13]. To investigate a joint femtocell base station placement and power control problem, Liu et al built a mixed-integer linear program (MILP) model for the femtocell network in commercial building environments [19] They proposed an optimization algorithm based on this model and showed that their algorithm had low complexity in simulation. Other researchers focused their interests on the base station problems in cellular networks and mainly on how to design energy-saving algorithms for base stations [20,21,22].

The Problem Model
The Base Station Placement Algorithm
Find the Feasible Region for Base Station Placement
The Main Idea for Finding a Good Position of B
Complexity
Simulation Results
Results for a Network with 20 Nodes
Results for All Network Instances
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call