Sharif Digital Repository

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

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

The efficient scheduling of independent and sequential tasks on distributed and heterogeneous computing resources within grid computing environments is an NP-complete problem. Therefore, using heuristic approaches to solve the scheduling problem is a very common and also acceptable method in these environments. In this thesis, a new task scheduling algorithm based on bee colony optimization approach is proposed. The algorithm uses artificial bees to appropriately schedule the submitted tasks to the grid resources. Applying the proposed algorithm to the grid computing environments, the maximum delay and finish times of the tasks are reduced.Furthermore, the total makespan of the environment... 

Reducing interconnection costs on chip and power consumption are important issues in designing processors. In a processor, a significant amount of total chip power is consumed in the interconnection. The goal of this research is to find a way to reduce power consumption in the interconnection. In this project we propose a new data sending method in which an LZW-like compression algorithm is exploited to compress data before sending it over the interconnection. Then, the codes of the compressed data are sent through the interconnection in order to reduce the number of dynamic cycles. The simulation results show that using this method can reduce 52% of dynamic power consumption  

In recent years peer-to-peer video streaming systems have become the major alternative for traditional client-server models, and several P2P streaming applications have attracted a large number of users on the Internet. In a mesh based P2P streaming architecture a video stream is portioned into video blocks and each peer pulls these video blocks from its neighbors. Since the uplink bandwidth of each peer is its main constraint in transmission video blocks, efficient block scheduling can play an important role in improving the perceived video quality by peers. Moreover, the granularity of video blocks can have a significant impact on the performance of the system. In this thesis, we propose... 

In this thesis, we propose a QoS-aware routing algorithm for multimedia streaming that uses cross-layer information (application layer and physical layer) in Wireless Multimedia Sensor Networks (WMSN). Our goal is to use cross-layer information to route video packets efficiently and deliver a higher quality video in streaming applications. Our QoS-Aware Multi-Path Selection (QAMPS) method is based on multi-path multi-priority selection algorithm that uses Two-Phase geographic Greedy Forwarding (TPGF) as a routing algorithm. The proposed method guarantees QoS by splitting video streams into I-frames, P-frames and B-frames in the application layer and passes them to the network layer for... 

In this thesis, we propose a processor allocation mechanism for run-time assignment of a set of communicating tasks of input applications onto the processing nodes of a Chip Multiprocessor (CMP), when the arrival order and execution life-time of the input applications are not known a priori. This mechanism targets the on-chip communication and aims to reduce the power and latency of the Network-on-Chip (NoC). In this work, we benefit from the advantages of non-contiguous processor allocation mechanisms, by allowing the tasks of the input application to be mapped onto disjoint regions (sub-meshes) and then virtually connecting them by bypassing the router pipeline stages of inter-region... 

Worldwide interoperability for Microwave Access (WiMAX) is one of the most dominant cell-based broadband wireless metropolitan access technologies. Packet scheduling algorithm specifies the packet transmission order. In WiMAX standard, packet scheduling algorithm is not defined and its efficient design is left for developers and researchers. The existing researches in the scope of uplink packet scheduling, which is the most challenging packet scheduling scheme, consider only one cell. However the uplink available resources might not be enough when there are many packets that should be scheduled. To solve this problem, we propose an algorithm that uses the load balancing mechanisms that are... 

Networks on Chip have been proposed as a solution to mitigate complex on-chip communication problems. NoCs are composed of IP cores (or processing elements) which are interconnected by on-chip switching fabrics. A step in the design process of NoCs is hardware virtualization which is mapping the IP cores on to the tiles of chips. The communication among the IP cores greatly affects the performance and power consumption of NoCs which itself is deeply related to the placement of IPs on to the tiles of the network. Different mapping algorithms have been proposed for Network on Chips which allocate a set of Intellectual Properties (IPs) to determined network topologies. In these mapping... 

The increasing complexity of integrated circuits drives the research of new on chip interconnection architectures. Network On Chip (NoCs) are a candidate architecture to be used in future systems, due to its increased performance, reusability and scalability. A NoC is a set of interconnected switches, with IP cores connected to these switches. Different routing algorithms have been proposed for NoCs such as XY deterministic algorithm, and WF (West First), NL (North Last) and NF (Negative First) as partially adaptive algorithms. OE (Odd Even) is not based on adding virtual channels to network topologies. Unlike previous methods, which rely on prohibiting certain turns in order to achieve... 

Heterogeneity is one of the challenges in the current NoC (Network-on-Chip) domain which oblige designers to consider less regular topologies to provide the best cost-performance trade-off while minimizing resource and power consumption and providing the maximum flexibility. Irregular mesh is a topology which combines the benefits of regularity and advantage of irregularity. Another important issue in any NoC is the selection of routing algorithm which provides the best performance. Routing algorithms especially those coupled with wormhole switching should deal with deadlock occurrences. Deadlock detection and recovery-based routing schemes for this type of switching gained attraction since... 

This thesis presents a dynamic multidimensional data structure, which is called Improved Skip Quadtree for peer-to peer networks. This data structure is the Improved version of Skip Quadtree which originally presented jointly by D.Eppstein, M.T.Goodrich, and J.Z.Sun. It tries to combine the best features of two well-known data structures; hieracical structure search quadtree, and skip list. In this thesis, it is tried to focus on algorithms for inserting and deleting points in both skip quadtree and Improved skip quadtree, which is fast method for performing point location and approximate range queries. The result of experimentation and implementation of this structure shows that it can be... 

Coverage rate is a critical criterion in all of communication networks. In this regard, there are many different methods for distribution of network particles duo to attain the most efficient region of coverage. This emerges from the limited ability of each networks particle both in range of communicate and power consumption. In this thesis an evolutionary method is introduced to how Wireless Sensor Networks (WSN) particles can be dispensed to have more reliable coverage rate. Using both static and mobile sensor packages to cover the desired area and used a cost function, coverage rate, the authors tried to maximize it to have an excellent performance of network. Then proposed algorithm is... 

WSNs have been gained much attention in both industrial and educational communities, as they are expected to bring interaction between humans, environment, and machines into a new level. Due to the differences between Wireless Sensor Networks and other wireless networks, new network architectures have been developed and many new routing protocols have been proposed for these architectures. To solve routing problems in WSNs by Swarm Algorithm (SA) is an active, interesting research area and this thesis tries to bring up a new SA towards this mater. Using artificial intelligence (AI) techniques in this environment is a promising task which is challenging at the same time. In this thesis we... 

Network coding, as a novel technique, suggests that the intermediate nodes of a network can combine independent flows to optimize the usage of a shared communication channel. Also, distributed source coding, exploits the joint statistics of correlated information sources to reduce the volume of transmitted information. Surprisingly, it has been shown that linear network codes are able to compress correlated sources. In this project, we have focused on this problem, i.e. joint distributed source and network coding. We have two important contributions with different directions. First we give a practical design for joint coding. Second, we use an evolutionary approach to find the best placement... 

Queuing algorithms are used in packet forwarding elements such as routers or switches and the goal is to minimize transmission delays as well as to help manage network congestions. On the other hand, over 90 to 95% of the packets in the Internet use TCP and correspond to the transfer of digital documents of one form or another (Web pages, data files, MP3 tracks etc.) ; this kind of traffic is called elastic. In this thesis, we present a new Start-time Fair Queuing (SFQ) algorithm called Weighted Start-time Fair Queuing (WSFQ) which is more efficient and achieves better fairness than SFQ in the presence of small and huge elastic traffic flows. WSFQ scheduler, like SFQ uses a start time... 

This study deals with the heuristic solution of flexible flow shop scheduling problems with unrelated parallel machines. No preemption of jobs is allowed. As an objective function, this paper considers the minimization of total tardiness. As a first step to propose solution, two different mixed integer mathematical models are developed which tackle the problem at hand. The problem is NP-hard and thus the developed mathematical program can only solve problem instances for small sizes in a reasonable amount of time. The next step is to build heuristics which can provide feasible solutions in polynomial time for larger problem instances. Then in the study develops a constructive heuristic for... 

Multi core processors are becoming mainstream in the computation area, wide application of multi core processors in Engineering, Industrial purposes and scientific applications made them popular among users and Manufacturers, cloud computing is a very well known Concept which technically is a Multicore processing environment, most of Businesses, enterprises and engineering works nowadays are getting done by the help of cloud services, hence, to get the best of these multi core cloud computing systems, scheduling of the tasks on the cores and virtual machines(VMs) is necessary, which is the answer to two questions: each task must be assigned to which core(VM)? And What is the order of... 

This thesis presents an inventory control system which is based on Meta-heuristic Algorithms.In this thesis we will optimize the input values of our tree-echelon inventory model (keeping costs,stock worth,reorder costs,...) with these Algorithms. The presented method is able to determine the optimal stock level, costs of system and number of shipments in the system. The method is basically a decision support system (DES) and it is able to provide the order scheduling parameters of goods at operational level. The aim of the current research is to demonstrate that a Meta-heuristic algorithmis capable of solving complex inventory problems and with future improvements it is able to achieve... 

Knowing the shape and type of the breakdown of a system or the system components, for a maintenance manager or maintenance engineer is significantly important. It is also important that the existing information concerning the system performance predict and prevent a sudden failure to be probably taken place. Maintenance has gained in importance as a support function for ensuring equipment availability, quality products, on-time deliveries, and plant safety. Cost effectiveness and accuracy are two basic criteria for good maintenance. Many studies in the area of equipment maintenance, replacement, and reliability require that the failure characteristic of a component to be estimated from...