Please use this identifier to cite or link to this item: https://repository.cihe.edu.hk/jspui/handle/cihe/1362
DC FieldValueLanguage
dc.contributor.authorChan, Anthony Hing-Hungen_US
dc.contributor.otherSalami, O.-
dc.contributor.otherBagula, A.-
dc.date.accessioned2021-08-20T06:41:02Z-
dc.date.available2021-08-20T06:41:02Z-
dc.date.issued2009-
dc.identifier.urihttps://repository.cihe.edu.hk/jspui/handle/cihe/1362-
dc.description.abstractIn inter-working multi-hop wireless networks, establishing resilient connectivity between source-destination node pairs is a major issue. The issues of connectivity in Multi-hop wireless networks have been studied. However, these analyses focused on network connectivity in ad-hoc networks. Since the next generation of wireless networks will be inter-working, an understanding of connectivity as it applies to such networks is needed. Specifically, this research emphasizes that the connectivity of node pairs in inter-working multi-hop wireless networks can be evaluated based on the availability of radio links and communication routes. This paper presents an analytical study of the link and route availability in inter-working multi-hop wireless networks.en_US
dc.language.isoenen_US
dc.titleA connectivity model for inter-working multi-hop wireless networksen_US
dc.typeconference proceedingsen_US
dc.relation.publicationProceedings of the Southern Africa Telecommunication Networks and Applications Conference (SATNAC 2009)en_US
dc.contributor.affiliationSchool of Computing and Information Sciencesen_US
dc.cihe.affiliatedNo-
item.languageiso639-1en-
item.fulltextNo Fulltext-
item.openairetypeconference proceedings-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_5794-
item.cerifentitytypePublications-
crisitem.author.deptYam Pak Charitable Foundation School of Computing and Information Sciences-
crisitem.author.orcid0000-0001-7479-0787-
Appears in Collections:CIS Publication
SFX Query Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.