• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Applied Schools
      • School of Applied Technology and Management
      • Computer Technology and Information Systems
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Applied Schools
      • School of Applied Technology and Management
      • Computer Technology and Information Systems
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      On the analysis of expected distance between sensor nodes and the base station in randomly deployed WSNs

      Thumbnail
      View / Download
      263.3 Kb
      Author(s)
      Sevgi, C.
      Ali, S.A.
      Date
      2014
      Source Title
      Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
      Print ISSN
      0302-9743
      Publisher
      Springer Verlag
      Volume
      8729
      Pages
      358 - 368
      Language
      English
      Type
      Article
      Item Usage Stats
      122
      views
      90
      downloads
      Abstract
      In this study, we focus on the analytical derivation of the expected distance between all sensor nodes and the base station (i.e., E[dtoBS]) in a randomly deployed WSN. Although similar derivations appear in the related literature, to the best of our knowledge, our derivation, which assumes a particular scenario, has not been formulated before. In this specific scenario, the sensing field is a square-shaped region and the base station is located at some arbitrary distance to one of the edges of the square. Having the knowledge of E[dtoBS] value is important because E[dtoBS] provides a network designer with the opportunity to make a decision on whether it is energy-efficient to perform clustering for WSN applications that aim to pursue the clustered architectures. Similarly, a network designer might make use of this expected value during the process of deciding on the modes of communications (i.e., multi-hop or direct communication) after comparing it with the maximum transmission ranges of devices. Last but not least, the use of our derivation is not limited to WSN domain. It can be also exploited in any domain when there is a need for a probabilistic approach to find the average distance between any given number of points which are all assumed to be randomly and uniformly located in any square-shaped region and at a specific point outside this region. © Springer International Publishing Switzerland 2014.
      Keywords
      Base station location
      Energy efficiency
      Optimal cluster numbers
      Random deployment
      Wireless sensor networks
      Base stations
      Energy efficiency
      Mobile telecommunication systems
      Sensor nodes
      Telecommunication networks
      Base station location
      Clustered architectures
      Direct communications
      Expected distance
      Optimal cluster number
      Probabilistic approaches
      Random deployment
      Transmission ranges
      Wireless sensor networks
      Permalink
      http://hdl.handle.net/11693/26662
      Collections
      • Computer Technology and Information Systems 62
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      LoginRegister

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy