Skip to main content
Springer Nature Link
Log in

FISH: Finite Projective Plane Based Interference Cancellation for Slotted ALOHA

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Due to the large number of light weight, low power devices in the future Internet, an efficient distributed multiple access protocol that can support a small fixed number of machines with continuous traffic along with a large variable number of devices with sporadic traffic is needed. The traffic in the future Internet has fundamentally different requirements: first, the accessing devices are of low power, which limit the transmission range; secondly, the delay is very stringent; thirdly, the number of active devices is time varying. In this paper, we propose a finite projective plane (FPP) based multiple access protocol (FISH) to meet such requirements. A low power node can transmit the replicas of a data packet in multiple time slots to achieve the same range of transmission as a high power node at one time. The initialization time slot of a frame allows for the estimation of the number of active nodes and the adjustment of the size of the frame to maximize the throughput. The interference cancellation and conflict resolution scheme of the FISH protocol is based on the theory of FPP. By using the property that the union of the sets of the FPP sharing one common point is a complete set, we are able to extract each of the individual user signals. One distinguishing feature of the FISH protocol is the amplification of the signal-to-noise ratio (SNR), which can either extend the transmission range or improve the bit error rate without sacrificing the throughput. In the performance evaluation, we demonstrate that the throughput is identical to the Slotted Aloha, while the SNR is magnified m times, where m is the order of the FPP. The proposed FISH protocol is of great use in the machine-to-machine communications as well as traditional cellular and satellite systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Vazquez-Gallego, F., Rietti, M., Bas, J., Alonso-Zarate, J., & Alonso, L. (2015). Performance evaluation of frame slotted-ALOHA with successive interference cancellation in machine-to-machine networks. European Wireless, Barcelona, Spain.

  2. Jang, H.-S., Kim, S.-M., Ko, K., Cha, J., & Sung, D. (2014). Spatial group based random access for M2M communications. IEEE Communications Letters, 18(6), 961–964.

    Article  Google Scholar 

  3. Kleinrock, L., & Tobagi, F. (1975). Packet switching in radio channels: Part I—Carrier sense multiple access modes and their throughput-delay characteristics. IEEE Transactions on Communications, 23(12), 1400–1416.

    Article  MATH  Google Scholar 

  4. Abramson, N. (1977). The throughput of packet broadcasting channels. IEEE Transactions on Communications, 25, 117–128.

    Article  Google Scholar 

  5. Takagi, H., & Kleinrock, L. (1985). Throughput analysis for persistent CSMA systems. IEEE Transactions on Communications, 33(7), 627–638.

    Article  MathSciNet  MATH  Google Scholar 

  6. Abramson, N. (1970). The ALOHA system—Another alternative for computer communications. In Proceedings of 1970 fall joint computer conference (Vol. 37, pp. 281–285).

  7. Abramson, N. (1977). The throughput of packet broadcasting channels. IEEE Transactions on Communications, COM-25(1), 117–128.

    Article  MathSciNet  Google Scholar 

  8. Roberts, L. G. (1975). ALOHA packet systems with and without slots and capture. ACM SIGCOMM Computer Communication Review, 5(2), 28–42.

    Article  Google Scholar 

  9. Raychaudhuri, D. (1984). ALOHA with multipacket messages and ARQ-type retransmission protocols—Throughput analysis. IEEE Transactions on Communications, 32(2), 148–154.

    Article  Google Scholar 

  10. Choudhury, G. L., & Rappaport, S. S. (1983). Diversity ALOHA—A random access scheme for satellite communications. IEEE Transactions on Wireless Communications, 31(3), 450–457.

    Article  Google Scholar 

  11. Liu, Y., Yuen, C., Cao, X., Hassan, N., & Chen, J. (2014). Design of a scalable hybrid MAC protocol for heterogeneous M2M Networks. IEEE Internet of Things Journal, 1(1), 99–111.

    Article  Google Scholar 

  12. Rhee, I., Warrier, A., Aia, M., Min, J., & Sichitiu, M. L. (2008). Z-MAC: A hybrid MAC for wireless sensor networks. IEEE Transactions on Networking, 16(3), 511–524.

    Article  Google Scholar 

  13. Zhang, R., Ruby, R., Pan, J., Cai, L., & Shen, X. (2010). A hybrid reservation/contention-based MAC for video streaming over wireless networks. IEEE Journal on Selected Areas in Communications, 28(3), 389–398.

    Article  Google Scholar 

  14. Okada, H., Igarashi, Y., & Nakanishi, Y. (1977). Analysis and application of framed ALOHA channel in satellite packet switching networks—FADRA method. Electronic and Communications in Japan, 60, 60–72.

    Google Scholar 

  15. Cassini, E., Gardens, R. D., & del Rio Herero, O. (2007). Contention resolution diversity slotted ALOHA (CRDSA): An enhanced random access scheme for satellite access packet networks. IEEE Transactions on Wireless Communications, 6(4), 1408–1419.

    Article  Google Scholar 

  16. Liva, G. (2011). Graph-based analysis and optimization of contention resolution diversity slotted ALOHA. IEEE Transactions on Communications, 59(2), 477–487.

    Article  Google Scholar 

  17. Narayanan, K. R., & Pfister, H. D. (2012). Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy. In: Proceedings of 2012 ISTC (pp. 136–139). Gothenburg.

  18. Byers, J., Luby, M. M., Mitzenmacher, M., & Rege, A. (1989). A digital fountain approach to reliable distribution of bulk data. In Proceedings of 1998, ACM SIGCOMM (pp. 56–67). Vancouver.

  19. Stefanovic, C., Popovski, P., & Vukobratovic, D. (2012). Frameless ALOHA protocol for wireless networks. IEEE Communications Letters, 16(12), 2087–2090.

    Article  Google Scholar 

  20. Paolini, E., Stefanovi, C., Liva, G., & Popovski, P. (2015). Coded random access: Applying codes on graphs to design random access protocol. IEEE Communications Magazine (pp. 144–150).

  21. Hughes, D. R., & Piper, F. (1973). Projective planes. Berlin: Springer.

    MATH  Google Scholar 

  22. Hall, M, Jr. (1986). Combinatorial theory (2nd ed.). New York, NY: Wiley.

    MATH  Google Scholar 

  23. Nakajima, A. (1992). Using a finite projective plane with a duality for decentralized consensus protocols. In Proceedings of the 12th international conference on distributed computing systems (pp. 665–672).

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, National Defense University, Taipei, Taiwan

    Tai-Kuo Woo

Authors
  1. Tai-Kuo Woo
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Tai-Kuo Woo.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Woo, TK. FISH: Finite Projective Plane Based Interference Cancellation for Slotted ALOHA. Wireless Pers Commun 89, 181–194 (2016). https://doi.org/10.1007/s11277-016-3259-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-016-3259-z

Keywords