On the Achievable Throughput Over TVWS Sensor Networks
AbstractIn this letter, we study the throughput achievable by an unlicensed sensor network operating over TV white space spectrum in presence of coexistence interference. Through the letter, we first analytically derive the achievable throughput as a function of the channel ordering. Then, we show that the problem of deriving the maximum expected throughput through exhaustive search is computationally unfeasible. Finally, we derive a computational-efficient algorithm characterized by polynomial-time complexity to compute the channel set maximizing the expected throughput and, stemming from this, we derive a closed-form expression of the maximum expected throughput. Numerical simulations validate the theoretical analysis. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Caleffi, M.; Cacciapuoti, A.S. On the Achievable Throughput Over TVWS Sensor Networks. Sensors 2016, 16, 457.
Caleffi M, Cacciapuoti AS. On the Achievable Throughput Over TVWS Sensor Networks. Sensors. 2016; 16(4):457.Chicago/Turabian Style
Caleffi, Marcello; Cacciapuoti, Angela S. 2016. "On the Achievable Throughput Over TVWS Sensor Networks." Sensors 16, no. 4: 457.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.