• Login
    • Login
    Advanced Search
    View Item 
    •   UoN Digital Repository Home
    • Journal Articles
    • Faculty of Engineering, Built Environment & Design (FEng / FBD)
    • View Item
    •   UoN Digital Repository Home
    • Journal Articles
    • Faculty of Engineering, Built Environment & Design (FEng / FBD)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Achievable capacity design for irregular and clustered high performance mesh networks

    Thumbnail
    Date
    2013
    Author
    Masonta, Moshe Timothy
    Olwal, Thomas Otieno
    Type
    Article
    Language
    en
    Metadata
    Show full item record

    Abstract
    This study has presented the End to End (E2E) upper bound capacity limits for high performance mesh nodes that can be deployed in rural and remote areas. The achievable capacity limits for both irreg- ular and clustered placements of nodes have been analytically derived. Numerical results based on the data sheets of IEEE 802.11a/n standards reveal the e cacy of such designs to typical rural networks such as the Peebles valley mesh in rural South Africa.
    URI
    http://hdl.handle.net/11295/64770
    Citation
    Olwal, Thomas Otieno, and Moshe Timothy Masonta. "Achievable capacity design for irregular and clustered high performance mesh networks." e-Infrastructure and e-Services for Developing Countries. Springer Berlin Heidelberg, 2013. 45-54.
    Subject
    HPN
    clustered & irregular placement
    Achievable capacity
    Collections
    • Faculty of Engineering, Built Environment & Design (FEng / FBD) [1465]

    Copyright © 2022 
    University of Nairobi Library
    Contact Us | Send Feedback

     

     

    Useful Links
    UON HomeLibrary HomeKLISC

    Browse

    All of UoN Digital RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Copyright © 2022 
    University of Nairobi Library
    Contact Us | Send Feedback