Skip to main content

Interference Power Bound Analysis of a Network of Wireless Robots

  • Conference paper
  • First Online:
Communication Systems and Networks (COMSNETS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 10340))

Included in the following conference series:

  • 878 Accesses

Abstract

We consider a fundamental problem concerning the deployment of a wireless robotic network: to fulfill various end-to-end performance requirements, a “sufficient” number of robotic relays must be deployed to ensure that links are of acceptable quality. Prior work has not addressed how to find this number. We use the properties of Carrier Sense Multiple Access (CSMA) based wireless communication to derive an upper bound on the spacing between any transmitter-receiver pair, which directly translates to a lower bound on the number of robots to deploy. We focus on SINR-based performance requirements due to their wide applicability. Next, we show that the bound can be improved by exploiting the geometrical structure of a network, such as linearity in the case of flow-based robotic router networks. Furthermore, we also use the bound on robot count to formulate a lower bound on the number of orthogonal codes required for a high probability of interference free communication. We demonstrate and validate our proposed bounds through simulations.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Williams, R., Gasparri, A., Krishnamachari, B.: Route swarm: wireless network optimization through mobility. In: Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (2014)

    Google Scholar 

  2. Penders, J., Alboul, L., Witkowski, U., Naghsh, A., Saez-Pons, J., Herbrechtsmeier, S., El-Habbal, M.: A robot swarm assisting a human fire-fighter. Adv. Robot. 25(1–2), 93–117 (2011)

    Article  Google Scholar 

  3. Thrun, S., Thayer, S., Whittaker, W., Baker, C., Burgard, W., Ferguson, D., Hahnel, D., Montemerlo, D., Morris, A., Omohundro, Z.: Autonomous exploration and mapping of abandoned mines. IEEE Rob. Autom. Mag. 11(4), 79–91 (2004)

    Article  Google Scholar 

  4. Nguyen, H.G., Pezeshkian, N., Raymond, M., Gupta, A., Spector, J.M.: Autonomous communication relays for tactical robots. Technical report, DTIC Document (2003)

    Google Scholar 

  5. Haenggi, M.: Mean interference in hard-core wireless networks. IEEE Commun. Lett. 15(8), 792–794 (2011)

    Article  Google Scholar 

  6. Ganti, R.K., Haenggi, M.: Interference and outage in clustered wireless ad hoc networks. IEEE Trans. Inf. Theory 55(9), 4067–4086 (2009)

    Google Scholar 

  7. Busson, A., Chelius, G.: Capacity and interference modeling of CSMA/CA networks using SSI point processes. Telecommun. Syst. 57(1), 25–39 (2014)

    Article  Google Scholar 

  8. ElSawy, H., Hossain, E.: Modeling random CSMA wireless networks in general fading environments. In: Proceedings of the IEEE International Conference on Communications (ICC). IEEE (2012)

    Google Scholar 

  9. Busson, A., Chelius, G.: Point processes for interference modeling in CSMA/CA ad-hoc networks. In: Proceedings of the 6th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (2009)

    Google Scholar 

  10. Cardieri, P.: Modeling interference in wireless ad hoc networks. IEEE Commun. Surv. Tutorials 12(4), 551–572 (2010)

    Article  Google Scholar 

  11. Hekmat, R., Van Mieghem, P.: Interference in wireless multi-hop ad-hoc networks and its effect on network capacity. Wirel. Netw. 10(4), 389–399 (2004)

    Article  Google Scholar 

  12. Bianchi, G.: Performance analysis of the IEEE 802.11 distributed coordination function. IEEE J. Sel. Areas Commun. 18(3), 535–547 (2000)

    Article  MathSciNet  Google Scholar 

  13. Rappaport, T.S.: Wireless Communications: Principles and Practice, vol. 2. Prentice Hall PTR, New Jersey (1996)

    MATH  Google Scholar 

  14. Zeng, Y., Pathak, P.H., Mohapatra, P.: A first look at 802.11ac in action: energy efficiency and interference characterization. In: Proceedings of IFIP Networking Conference (2014)

    Google Scholar 

  15. Safak, A.: Statistical analysis of the power sum of multiple correlated log-normal components. IEEE Trans. Veh. Technol. 42(1), 58–61 (1993)

    Article  Google Scholar 

  16. Ghosh, P., Krishnamachari, B.: Interference power bound analysis of a network of wireless robots. Technical report ANRG-2016-04, arXiv:1608.08261, USC ANRG (2016)

  17. Hifi, M., M’hallah, R.: A literature review on circle and sphere packing problems: models and methodologies. Adv. Oper. Res. 2009 (2009)

    Google Scholar 

  18. Yan, Y., Mostofi, Y.: Robotic router formation in realistic communication environments. IEEE Trans. Rob. 28(4), 810–827 (2012)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pradipta Ghosh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Ghosh, P., Krishnamachari, B. (2017). Interference Power Bound Analysis of a Network of Wireless Robots. In: Sastry, N., Chakraborty, S. (eds) Communication Systems and Networks. COMSNETS 2017. Lecture Notes in Computer Science(), vol 10340. Springer, Cham. https://doi.org/10.1007/978-3-319-67235-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67235-9_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67234-2

  • Online ISBN: 978-3-319-67235-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics