View in EDS PDF Full Text

On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks.

Saved in:
Bibliographic Details
Title: On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks.
Authors: Nelson Antunes1, Gonçalo Jacinto2, António Pacheco3
Source: Telecommunication Systems. Oct2008, Vol. 39 Issue 2, p137-143. 7p. 1 Diagram, 3 Graphs.
Subjects: Ad hoc computer networks, RADIUS (Computer network protocol), TCP/IP, Computer networks, Wireless communications, Telecommunication systems
Abstract: Abstract  This paper investigates connectivity in one-dimensional ad hoc networks by means of the distribution of the minimum hop count between source and destination nodes. We derive the exact probability distribution of the minimum hop count from the location density of relay nodes in the multihop path selected with the Most Forward within Radius (MFR) scheme. The probability that the source and destination nodes are connected (provided by Ghasemi and Nader-Esfahani [IEEE Commun. Lett. 10(4):251–253, 2006]) can be obtained by summing the probability masses for each possible value of the minimum hop count, which provides new insights to the connectivity probability. Numerical results show the effect of the number of nodes and the transmission range on the minimum hop count. [ABSTRACT FROM AUTHOR]
Copyright of Telecommunication Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 34371022
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Nelson+Antunes%22">Nelson Antunes</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Gonçalo+Jacinto%22">Gonçalo Jacinto</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22António+Pacheco%22">António Pacheco</searchLink><relatesTo>3</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Telecommunication+Systems%22">Telecommunication Systems</searchLink>. Oct2008, Vol. 39 Issue 2, p137-143. 7p. 1 Diagram, 3 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Ad+hoc+computer+networks%22">Ad hoc computer networks</searchLink><br /><searchLink fieldCode="DE" term="%22RADIUS+%28Computer+network+protocol%29%22">RADIUS (Computer network protocol)</searchLink><br /><searchLink fieldCode="DE" term="%22TCP%2FIP%22">TCP/IP</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+networks%22">Computer networks</searchLink><br /><searchLink fieldCode="DE" term="%22Wireless+communications%22">Wireless communications</searchLink><br /><searchLink fieldCode="DE" term="%22Telecommunication+systems%22">Telecommunication systems</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract  This paper investigates connectivity in one-dimensional ad hoc networks by means of the distribution of the minimum hop count between source and destination nodes. We derive the exact probability distribution of the minimum hop count from the location density of relay nodes in the multihop path selected with the Most Forward within Radius (MFR) scheme. The probability that the source and destination nodes are connected (provided by Ghasemi and Nader-Esfahani [IEEE Commun. Lett. 10(4):251–253, 2006]) can be obtained by summing the probability masses for each possible value of the minimum hop count, which provides new insights to the connectivity probability. Numerical results show the effect of the number of nodes and the transmission range on the minimum hop count. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Telecommunication Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=34371022
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11235-008-9118-9
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 7
        StartPage: 137
    Subjects:
      – SubjectFull: Ad hoc computer networks
        Type: general
      – SubjectFull: RADIUS (Computer network protocol)
        Type: general
      – SubjectFull: TCP/IP
        Type: general
      – SubjectFull: Computer networks
        Type: general
      – SubjectFull: Wireless communications
        Type: general
      – SubjectFull: Telecommunication systems
        Type: general
    Titles:
      – TitleFull: On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Nelson Antunes
      – PersonEntity:
          Name:
            NameFull: Gonçalo Jacinto
      – PersonEntity:
          Name:
            NameFull: António Pacheco
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: Oct2008
              Type: published
              Y: 2008
          Identifiers:
            – Type: issn-print
              Value: 10184864
          Numbering:
            – Type: volume
              Value: 39
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Telecommunication Systems
              Type: main
ResultId 1