Sharif Digital Repository

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... 

Wireless Mesh Networks (WMNs) can be considered as the result of cooperation among two ad hoc networks, one composed of Mesh Points (MPs) and another one composed of Mesh Clients (MCs) as well as corresponding Access (Mesh) Points. Each one has its own functions and properties. This cooperation results in a flexible network that to fully demonstrate its potentials, requires special routing algorithms and access schemes.Here, we study and analyze three routing algorithms in IEEE 802.11s-based WMNs from throughput point of view. To this end, each node in the network is modeled by a queue during Contention-Free Periods (CFPs). During Contention-Based Period, however, to simplify modeling, we... 

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... 

Shipment of hazardous materials has got an important role in the world of today. Nowadays, sustainable development has got serious attention, and human health and environment are one of the sustainable development bases. The risk of hazardous materials for human health and environment, and also importance of this kind of materials in the industrial economy, make necessity of programming for shipment of hazardous materials more serious. This thesis, presents an optimiziation model for routing and scheduling for shipment of hazardous materials. This model is a multi criteria time varing mixed integer programming (MIP). The presented model, finds the optimal routs and scheduling of movement... 

To reduce construction costs selecting the optimal route for water conveyance line entails ample observation and considering all effective parameters. Some part of Aidoghmoush dam project of water conveyance line located in Azerbijan the east has been investigated in this research. First, by investigating, effective factors in determining the optimal route have been identified and then categorized into two groups of quantitative criteria(technical-economical) and qualitative criteria(environmental). Quantitative objectives include: slope, transportation system, infrastructures, fault and soil type. Qualitative objectives include: environmental considerations, land use and land cover. Because... 

Mobile robots are increasingly being used to perform tasks in unknown environments. The potential of robots to undertake such tasks lies in their ability to intelligently and efficiently locate and interact with objects in their environment. My research focuses on developing algorithms to navigate mobile robots in a partially known environment observed by an overhead camera. The environment consists of stationary and dynamic obstacles and a moving target. The aim of the robot is to select avoidance maneuvers to avoid the dynamic obstacles while approaching the target. The core of the navigation algorithm is based on the velocity obstacle avoidance method and the guidance-based tracking... 

In this thesis, a “Game Theory” approach for finding an optimal path in a “Wireless Sensor Network” is discussed. WSN is one of the most interesting research fields in the communication networks, and is the center of attention in recent years. In our model, a pricing and payment technique is presented to obtain an optimal path in a WSN by considering reliability, energy, and traffic load. The proposed algorithm is able to find a path which improves network lifetime and load distribution.

 

Wireless Sensor Network (WSN) is a rapidly growing technology that is used to meet different requirements of a wide range of applications. Energy conservation is one of the main design challenges in WSNs due to limited energy resources. Routing plays a significant role for energy efficient communication in WSNs. Although there are many research studies that utilize energy efficient routing to conserve energy in WSNs, there are a few works that took advantage of machine learning techniques for saving energy through energy efficient routing.The main goal of this thesis is to indicate that machine learning is a functional approach to many problems in WSNs. To fulfill this goal we first... 

Wireless sensor networks consist of many small sensor nodes which suffer from some limitations like energy level, band width, processing ability and memory; therefore, decreasing energy consumption, increasing network lifetime and scalability are the main challenges in the area of routing in wireless sensor networks. In the field of routing in sensor networks, many algorithms have been suggested, one group of which is clusterbased hierarchical algorithms. The main goals of such algorithms are reducing energy consumption, distributing consumed energy within whole network and increasing scalability of algorithm. There are some problems in most of cluster-based routing algorithms which cause... 

In this project we present a method to support execution of multiple applications on an NoC simultaneously. To this end we are going to use resource sharing methods, especially Spacial Division Multiplexing (SDM). In this work we first present a mapping algorithm to map the nodes of a compound graph (a graph that is composed of all the task graphs that are supposed to work simultaneously) in to mesh nodes. We also present an architecture to support SDM. After that we present a routing and resource allocation algorithm to find a circuit for each communication flow in the task graph. Our results show that the proposed mapping algorithm reduces the average packet latency compared to NMAP... 

This project presents a routing algorithm to cope with the dynamic traffic pattern of network-on-chip (NoC) architectures aiming to distribute the on-chip traffic evenly across the network. In this algorithm, instead of relying solely on local congestion information, the routes are determined based on the global information about on-chip traffic. This is achieved by employing a light-weight and efficient control network which monitors the on-chip traffic and collects the required information for determining the appropriate path between any pairs of communicating nodes in such a way that the congestion is avoided and the NoC load is balanced. Our experiments show that the proposed method... 

Switching as one of important characteristics of on-chip network affects on power consumption and performance. In general there are two switching methods as circuit-switching and packet-switching. Hybrid switching includes both switching to have both resource utilization and scalability of packet switching and low power consumption and improved latency of circuit switching. Also topology is another network attribute that greatly affects the power, performance, cost, and design time/effort of NoCs. In this thesis, we propose a novel NoC architecture which holds both fixed connections between adjacent nodes and long connections virtually connecting non-adjacent nodes. Our proposed NoC... 

A Wireless Sensor Network is one of the attended research context that is used to meet different requirements of a wide range of applications. One of the usages of WSNs is in Animal Tracking. Many Animal Tracking methods have weaknesses that can be enhanced. By considering WSN properties and many different usages of Machine Learning techniques reported in a variety of fields and considering Animal Tracking methods characteristics, WSNs can be improved by applying Machine Learning techniques. The main goal of this thesis is to show that with help of Machine Learning techniques, performance of Animal Tracking by means of Wireless Sensor Networks increases. To fulfill this goal, we first... 

Mobile ad hoc networks (MANETs) are networks which consist entirely of mobile nodes, placed together in ad hoc manner, i.e. with minimal prior planning. In these networks, all nodes have routing capabilities and forward data packets for other nodes. Nodes can enter or leave the network at any time and may also be mobile. Hence, the network topology changes frequently. There are lots of challenges in these networks, which make routing to be a hard task. These challenges arise from the dynamic and unplanned nature of these networks such as unreliability of wireless communication, limited resources available in terms of bandwidth, processing capacity, network size, and etc. Due to these... 

Due to the rapid growth of technology, the number of cores on a single chip has increased, caused thousands (or millions) of transistors being tight in a new layout consequently. Technology scaling arise the sensitivity and likelihood of faults. Thus, fault management is one of the important challenging issues in multiple core design we should face. Faults can be permanent, transient, and intermittent. Apart from the fact that how and when a fault occurs, supporting a fault-tolerant or fault-prevention routing is a must in NoCs. To target mentioned problem, we have proposed two routing algorithm in this thesis. The first algorithm is FaulToleReR, which is a reconfigurable fault (faults can... 

Path planning of a robot inside an environment with obstacles is to determine an appropriate path for moving from an initial point to a destination without colliding the obstacles. The main considerations in selecting such a path are its length and simplicity in terms of links or turn angles. In this paper, we study this problem for a point robot in the plane and our goal is to minimize the path length. We solve this problem by converting it to an optimization problem and solving the resulted optimization problem by a recurrent neural network. According to the implementation results, the obtained path is a proper approximation of the minimum length path, especially when obstacles are not too... 

Introductions: The routing Problem in SMS networks, start from subscriber called origin and end to other subscriber called destination. SMSs passed throw the switches, relay and routers. When the traffic of a SMS network increase, a global optimization is required to reduce the charge that SMS center must be paid meanwhile maximize total flow and minimize delivery time.
Methods: in this study after investigation in Short Message service, Routing Algorithms and letreture review, first we used our models for Telephone networks. The total model with Features and constrains was build. In order apply this model on Mobile networks, with using Latin Multy Plications Algorithms we develope a... 

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... 

Due to the dynamic topology of vehicular ad hoc networks, routing of packets in these networks faces a lot of difficulties. The situation will become more challenging when we have to deal with Delay Tolerant Networks (DTN) which are also sparse and partitioned and we need to use some vehicles to store the packets and carry them from one partition to another. Despite all these difficulties, by looking through movements of vehicles in an urban environment, we can find out that the topology of the network does not change in a pure random way and we can bring the traffic models of streets into account for having better routing performance. In this thesis, we proposed an intelligent routing... 

Wireless Sensor Networks (WSNs) have attracted much attention in recent years for their unique characteristics and wide use in many different applications. WSNs are composed of many tiny sensor nodes that have limitations on energy level, bandwidth, processing power and memory. Therefore, reducing energy consumption and the increased network lifetime and scalability are the main routing challenges in sensor networks. Many algorithms were presented for routing in sensor networks; a class of theses algorithms is hierarchical algorithms based on clustering. Their main goals are to reduce energy consumption, distribution energy consumption in the whole network and increasing scalability. There...