Loading...
Search for: mesh-networking
0.01 seconds
Total 52 records

    A class of ball-and-bin problems and its application to mesh networks

    , Article 2003 10th IEEE International Conference on Electronics, Circuits and Systems, ICECS2003, Sharjah, 14 December 2003 through 17 December 2003 ; Volume 3 , 2003 , Pages 1038-1041 ; 0780381637 (ISBN); 9780780381636 (ISBN) Sarbazi Azad, H ; Khonsari, A ; Sharif University of Technology
    2003
    Abstract
    Non-recursive and explicit expressions for calculating the number of ways to distribute n indistinguishable balls into m distinguishable bins with different capacities have been derived. Similar expression for the special case where bins have the same capacity was previously reported in the literature. Theses expressions can be used to study network graphs with grid structures. In this line, we have derived some topological properties of meshes, furnishing some expressions to calculate the surface area and volume of radial spheres in the mesh network. © 2003 IEEE  

    Interference analysis in an urban mesh network operating in the 60-GHz band

    , Article ETRI Journal ; Volume 35, Issue 5 , 2013 , Pages 775-785 ; 12256463 (ISSN) Rasekh, M. E ; Farzaneh, F ; Sharif University of Technology
    2013
    Abstract
    Because of their exclusive features, millimeter wave directive mesh networks can be considered for small cell backhaul support in urban environments. For this purpose, a network of closely spaced stations has been considered with very directive line-of-sight links operating in the 60-GHz band. An attempt is made to evaluate channel response and interference behavior in such a network, taking into account the effect of building blockage. A simple grid of building blocks is considered as the propagation environment, and wave propagation is simulated using 2.5-dimensional (2.5D) ray tracing (2D with ground effect) to calculate the received signal at different nodes in the network. The results... 

    A distributed locality-aware neighbor selection algorithm for P2P video streaming over wireless mesh networks

    , Article 2012 6th International Symposium on Telecommunications, IST 2012 ; 2012 , Pages 639-643 ; 9781467320733 (ISBN) Moayeri, F ; Akbari, B ; Khansari, M ; Ahmadifar, B ; Sharif University of Technology
    2012
    Abstract
    Nowadays, deployment of peer-to-peer video streaming systems over wireless mesh networks has attained raising popularity among large number of users around the world. In this paper, we present an efficient peer-to-peer live video streaming architecture over multi-hop wireless mesh networks. In our proposed architecture, we take the physical topology of network into account and based on a distributed distributed locality-aware neighbor selection algorithm in the overlay construction phase, we generate an efficient mesh-based overlay on top of wireless mesh networks. In locality-aware neighbor selection algorithm, instead of choosing randomly, peers find their best neighbors based on their... 

    Analysis of gossip-based information propagation in wireless mesh networks

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 12 October 2011 through 13 October 2011, Borrowdale ; Volume 6977 LNCS , 2011 , Pages 174-188 ; 03029743 (ISSN) ; 9783642247484 (ISBN) Shamsaie, A ; Fokkink, W ; Habibi, J ; Sharif University of Technology
    Abstract
    Analytical models exist for evaluating gossip-based information propagation. Up to now these models were developed only for fully connected networks. We provide analytical models for information propagation of a push-pull gossiping protocol in a wireless mesh network. The underlying topology is abstracted away by assuming that the wireless nodes are uniformly deployed. We compare our models with simulation results for different topologies  

    On the topological properties of grid-based interconnection networks: Surface area and volume of radial spheres

    , Article Computer Journal ; Vol. 54, issue. 5 , 2011 , p. 726-737 ; ISSN: 00104620 Sarbazi-Azad, H ; Khonsari, A ; Ould-Khaoua, M ; Sharif University of Technology
    Abstract
    Grid-based networks (or grids for short), such as meshes and tori, have been the underlying topology for many multicomputers, and have been extensively studied in the past as a graph topology. In this paper, we investigate some topological properties of grids without boundary wrap-around (meshes) and with boundary wrap-around (tori). In particular, we study the problem of finding the number of nodes located at/within a given distance from a given node (surface area/volume) in the network and derive some expressions for computing such a number. Furthermore, we provide similar expressions that improve on previous results already reported in the literature for some special cases of grids,... 

    Performance modeling of Cartesian product networks

    , Article Journal of Parallel and Distributed Computing ; Volume 71, Issue 1 , 2011 , Pages 105-113 ; 07437315 (ISSN) Moraveji, R ; Sarbazi Azad, H ; Zomaya, A. Y ; Sharif University of Technology
    Abstract
    This paper presents a comprehensive performance model for fully adaptive routing in wormhole-switched Cartesian product networks. Besides the generality of the model which makes it suitable to be used for any product graph, experimental (simulation) results show that the proposed model exhibits high accuracy even in heavy traffic and saturation region, where other models have severe problems to predict the performance of the network. Most popular interconnection network can be defined as a Cartesian product of two or more networks including the mesh, hypercube, and torus networks. Torus and mesh networks are the most popular topologies used in recent supercomputing parallel machines. They... 

    QoS Multicast Routing in Wireless Mesh Networks

    , M.Sc. Thesis Sharif University of Technology Kharraz, Mohammad Amin (Author) ; Sarbazi Azad, Hamid (Supervisor)
    Abstract
    Multicasting has gained a lot of research attentions in facilitating group communications in wireless networks. Applying multicast mechanisms in Wireless Mesh Networks, brings a lot of benefits to these networks. In our research, we have introduced Cost-aware On-Demand Multicast Routing Protocol (C-ODMRP) as an extension of ODMRP that supports QoS provisioning for high quality applications in WMNs. In C-ODMRP, the nodes are prevented from applying the links that do not meet the QoS requirements. The multicast receivers are provided with resource-aware information to efficiently compute the cost of the routes when multiple routes from source to destination nodes are established. C-ODMRP takes... 

    Dynamic Spectrum Sharing in Wireless Mesh Networks for Throughput Enhancement

    , M.Sc. Thesis Sharif University of Technology Darchini Maragheh, Kamaloddin (Author) ; Ashtiani, Farid (Supervisor)
    Abstract
    Having special advantages over existing networks, mesh networks have attracted much attention. Proposing new MAC protocols which are in compliance with these networks is an interesting field in which many works have been done. Also, Task Group S of the IEEE802.11 is going to release a standard for the mesh networks. Analysis of a simplified version of IEEE802.11s is the first goal of this thesis. The standard is a spectrum sharing algorithm based on scheduling and contention. Although IEEE802.11e manages the contention for accessing the wireless medium in the standard, but for the sake of simplicity, in this thesis we used SlottedALOHA instead. Also, one gateway and six other nodes are... 

    Peer-to-Peer Video Streaming System Over Wireless Mesh Networks

    , M.Sc. Thesis Sharif University of Technology Moayeri, Faranak (Author) ; Akbari, Behzad (Supervisor) ; Khansari, Mohammad (Co-Advisor)
    Abstract
    Nowadays, deployment of peer-to-peer video streaming systems over wireless mesh networks has attained increasing popularity among a large number of users around the world. In this thesis, we present an efficient peer-to-peer live video streaming architecture over multi-hop wireless mesh networks. In our proposed architecture, we take the physical topology of the network into account and based on a distributed locality-aware neighbor selection algorithm in the overlay construction phase, we generate an efficient mesh-based overlay on top of wireless mesh networks. In locality-aware neighbor selection algorithm, instead of choosing randomly, peers find their best neighbors based on their... 

    Multicast Routing on Wireless Mesh Networks

    , M.Sc. Thesis Sharif University of Technology Abbasi, Reza (Author) ; Yazdani, Naser (Supervisor)
    Abstract
    Wireless mesh networks (WMN) appeared as popular communication networks supporting high speed and high throughput applications. They consist of mesh routers and mesh clients and they have unique characteristics like self organizing and self configuring of the mesh nodes that bring a great deal of efficiency, reliability and robustness to networks and decreases networks maintenance cost notably. Also WMNs provide an integration of different types of wireless networks by exploiting the gateway involvement. One of the important group communication technologies that offers high level of bandwidth conservation and efficiency is multicasting. It also decreases the cost of communication compared to... 

    On pancyclicity properties of OTIS-mesh

    , Article Information Processing Letters ; Vol. 111, issue. 8 , 2011 , p. 353-359 ; ISSN: 00200190 Shafiei, T ; Hoseiny-Farahabady, M.R ; Movaghar, A ; Sarbazi-Azad, H ; Sharif University of Technology
    Abstract
    In optoelectronic OTIS multicomputer networks (also known as Swapped networks), electrical and optical interconnects are used for local and global communication, respectively. An interesting instance of the OTIS multicomputers is the OTIS-mesh. Pancyclicity is of great importance in the implementation of a variety of parallel algorithms in multicomputers. This paper addresses the Pancyclicity problem of OTIS-mesh. More precisely, we prove that if the factor graph G of an OTIS network is a 2-D or 3-D mesh with at least one even radix, OTIS-G can embed any cycle of length l, l?{4,6,7,8,9,...,|G|2}  

    On the topological properties of grid-based interconnection networks: Surface area and volume of radial spheres

    , Article Computer Journal ; Volume 54, Issue 5 , 2011 , Pages 726-737 ; 00104620 (ISSN) Sarbazi Azad, H ; Khonsari, A ; Ould Khaoua, M ; Sharif University of Technology
    Abstract
    Grid-based networks (or grids for short), such as meshes and tori, have been the underlying topology for many multicomputers, and have been extensively studied in the past as a graph topology. In this paper, we investigate some topological properties of grids without boundary wrap-around (meshes) and with boundary wrap-around (tori). In particular, we study the problem of finding the number of nodes located at/within a given distance from a given node (surface area/volume) in the network and derive some expressions for computing such a number. Furthermore, we provide similar expressions that improve on previous results already reported in the literature for some special cases of grids,... 

    On pancyclicity properties of OTIS-mesh

    , Article Information Processing Letters ; Volume 111, Issue 8 , March , 2011 , Pages 353-359 ; 00200190 (ISSN) Shafiei, T ; Hoseiny Farahabady, M. R ; Movaghar, A ; Sarbazi Azad, H ; Sharif University of Technology
    2011
    Abstract
    In optoelectronic OTIS multicomputer networks (also known as Swapped networks), electrical and optical interconnects are used for local and global communication, respectively. An interesting instance of the OTIS multicomputers is the OTIS-mesh. Pancyclicity is of great importance in the implementation of a variety of parallel algorithms in multicomputers. This paper addresses the Pancyclicity problem of OTIS-mesh. More precisely, we prove that if the factor graph G of an OTIS network is a 2-D or 3-D mesh with at least one even radix, OTIS-G can embed any cycle of length l, l∈{4,6,7,8,9,...,|G|2}  

    An empirical comparison of OTIS-mesh and OTIS-hypercube multicomputer systems under deterministic routing

    , Article 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005, Denver, CO, 4 April 2005 through 8 April 2005 ; Volume 2005 , 2005 ; 0769523129 (ISBN); 0769523129 (ISBN); 9780769523125 (ISBN) Najaf abadi, H. H ; Sarbazi azad, H ; Sharif University of Technology
    2005
    Abstract
    In optoelectronic OTIS architectures, electrical and optical interconnects are used for local and global communication, respectively. Interesting instances of the OTIS architecture are the OTIS-hypercube and OTIS-mesh. This paper conducts a performance evaluation and comparison of these networks under different structural conditions and traffic loads. All judgments made, are based on observations from extensive simulation results of the interconnection networks. We conclude that, when the OTIS-hypercube and equivalent 2-D OTIS-mesh are compared under the constraint of equal bisection bandwidth, the performance of the OTIS-hypercube is of superior performance. We however show that the... 

    The 2D digraph-based NoCs: Attractive alternatives to the 2D mesh NoCs

    , Article Journal of Supercomputing ; Volume 59, Issue 1 , January , 2012 , Pages 1-21 ; 09208542 (ISSN) Sabbaghi Nadooshan, R ; Modarressi, M ; Sarbazi Azad, H ; Sharif University of Technology
    Kluwer Academic Publishers  2012
    Abstract
    This paper proposes two-dimensional directed graphs (or digraphs for short) as a promising alternative to the popular 2D mesh topology for networks-onchip (NoCs). Mesh is the most popular topology for the NoCs, mainly due to its suitability for on-chip implementation and low cost. However, the fact that a digraph offers a lower diameter than its equivalent linear array of equal cost motivated us to evaluate digraphs as the underlying topology of NoCs. This paper introduces a family of NoC topologies based on three well-known digraphs, namely de Bruijn, shuffleexchange, and Kautz. We study topological properties of the proposed topologies. We show that the proposed digraph-based topologies... 

    PPMN: a resilient public peer-to-peer mesh network of IEEE802.16 users

    , Article 2009 International Conference on Signal Processing Systems, ICSPS 2009, Singapore, 15 May 2009 through 17 May 2009 ; 2009 , Pages 488-492 ; 9780769536545 (ISBN) Kavianfar, A ; Habibi, J ; Sharif University of Technology
    2009
    Abstract
    In these days, IEEE802.16 protocol is being developed and in the next years, 802.16 modems will be used in every house to connect to the Internet through base-stations in both urban and rural areas. Since user bandwidth for connection to the Internet is limited, a large fraction of each modem's bandwidth is not used. In this paper, we propose an architecture to construct a public peer-to-peer mesh network using the non-utilized bandwidth of independent 802.16 users. The architecture is composed of a routing algorithm, a forwarding incentive mechanism, and a security-resiliency scheme. Design challenges are discussed in each case. © 2009 IEEE  

    Peer-to-Peer Application over Wimax

    , M.Sc. Thesis Sharif University of Technology Kavianfar, Azadeh (Author) ; Habibi, Jafar (Supervisor)
    Abstract
    IEEE802.16 protocol is being developed and 802.16 modems will be used in every house to connect to the Internet through base-stations in both urban and rural areas. Since user bandwidth for connection to the Internet is limited, a large fraction of each modem’s bandwidth is not used. In this thesis, we propose an architecture to make a PPMN (Public Peer-to-peer Mesh Network) of all users in a city. Users can be wired or wireless under any authority. They have to forward intra-city traffic themselves. As a result, it is not required to transfer intra-city traffic through BSs except for critical information. The architecture is composed of a routing algorithm, a forwarding incentive... 

    Performance Comparison of Processor Allocation Algorithms

    , M.Sc. Thesis Sharif University of Technology Taghdimi Abbas Pour, Majid (Author) ; Sarbazi Azad, Hamid (Supervisor)
    Abstract
    Efficient processor allocation and job scheduling algorithms are critical if the full computational power of large-scale multicomputers is to be harnessed effectively. Processor allocation is responsible for selecting the set of processors on which parallel jobs are executed, whereas job scheduling is responsible for determining the order in which the jobs are executed. Many processor allocation strategies have been devised for mesh-connected multicomputers and these can be divided into two main categories: contiguous and non-contiguous. In contiguous allocation, jobs are allocated distinct contiguous processor submeshes for the duration of their execution. Such a strategy could lead to high... 

    A Modified Artificial bee Colony Algorithm for Channel Assignment in Wireless Mesh Network

    , M.Sc. Thesis Sharif University of Technology Majidi, Abbas (Author) ; Mahdavi Amiri, Nezamoddin (Supervisor)
    Abstract
    Wireless Mesh Network (WMN) is a new technology for developing wireless networks. In a wireless communication system, a transmitter communicates with a receiver by magnetic waves. Channel is the medium used to convey information from a sender to a receiver. Interference exists between two links if they are within interference range and are assigned to the same channel. Channel assignment is all about mapping available channels to the network interfaces in order to achieve optimal network performance. A good channel assignment algorithm minimizes the total network interference. Here, we propose a modified artificial bee colony (ABC) algorithm for the fixed channel assignment (FCA) problem in... 

    Fuzzy-Based Routing in Irregular Mesh Noc

    , M.Sc. Thesis Sharif University of Technology Rezaei Mayahi Nejad, Mehdi (Author) ; Sarbazi Azad, Hamid (Supervisor)
    Abstract
    In past decades, we have seen the rise of integration density in chips making it possible to design a whole system on a single chip. The previously designed interconnection architectures for multiprocessors systems cannot directly be applied in on-chip systems (especially when the number of processor elements increases) since they require a different type of a cost-performance trade-off. This is why the interconnection networks of systems-on-chip (SoC) are such a problem. Network-on-chip (NoC) was being proposed as a scalable and reusable communication platform for SoCs, which makes use of the network model to develop efficient on-chip communication infrastructures. The NoC has a layered and...