Rozprawy doktorskie na temat „Node scheduling”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 36 najlepszych rozpraw doktorskich naukowych na temat „Node scheduling”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Tian, Di. "Node activity scheduling schemes in large-scale wireless sensor networks". Thesis, University of Ottawa (Canada), 2005. http://hdl.handle.net/10393/29266.
Pełny tekst źródłaKhasawneh, Samer Fayiz. "Static Scheduling for Synchronous Data Flow Graphs". University of Akron / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=akron1184612284.
Pełny tekst źródłaSEETHARAMAN, SUMATHI. "SELF-ORGANIZED SCHEDULING OF NODE ACTIVITY IN LARGE-SCALE SENSOR NETWORKS". University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1092939502.
Pełny tekst źródłaPazand, Babak. "Location-free node scheduling schemes for energy efficient, fault tolerant and adaptive sensing in wireless sensor networks". University of Western Australia. School of Computer Science and Software Engineering, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0185.
Pełny tekst źródłaMahfoudh, Saoucene. "Energy efficiency in wireless ad hoc and sensor networks : routing, node activity scheduling and cross-layering". Phd thesis, Université Pierre et Marie Curie - Paris VI, 2010. http://tel.archives-ouvertes.fr/tel-00757251.
Pełny tekst źródłaFan, Yuqi. "Burst Scheduling, Grooming and QoS Provisioning in Optical Burst-Switched Networks". Wright State University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=wright1239828363.
Pełny tekst źródłaKhan, Farhan, i Muhammad Umer Khan and Noman Ellahi. "Ad Hoc Network Nodes Scheduling using DS and FH CDMA". Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4784.
Pełny tekst źródłaSchönemann, René [Verfasser], Jürgen [Akademischer Betreuer] Siegmann, Jürgen [Gutachter] Siegmann i Thomas [Gutachter] Siefer. "Scheduling rail freight node operations through a slot allocation approach / René Schönemann ; Gutachter: Jürgen Siegmann, Thomas Siefer ; Betreuer: Jürgen Siegmann". Berlin : Technische Universität Berlin, 2016. http://d-nb.info/1156181763/34.
Pełny tekst źródłaBountourelis, Theologos. "Efficient pac-learning for episodic tasks with acyclic state spaces and the optimal node visitation problem in acyclic stochastic digaphs". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/28144.
Pełny tekst źródłaCommittee Chair: Reveliotis, Spyros; Committee Member: Ayhan, Hayriye; Committee Member: Goldsman, Dave; Committee Member: Shamma, Jeff; Committee Member: Zwart, Bert.
Bekono, Nina Pelagie. "Impact du changement du protocole de routage dans un réseau". Thesis, Université Clermont Auvergne (2017-2020), 2018. http://www.theses.fr/2018CLFAC058/document.
Pełny tekst źródłaRouting protocols in networks may change for many reasons: detection of a particular event, planned or unplanned change of topology, mobility of nodes, version obsolescence, etc. As these changes can not be simultaneously detected or taken into account by all nodes of the network, it is necessary to consider the case where some nodes use the initial routing protocol, while others have migrated to the new routing protocol. The work of this thesis deals with the problem of routing loops that may appear in this context, and which considerably degrade the performance of the network. We propose node scheduling solutions to control migration to avoid these loops. First, we consider the context of static networks and centralized protocols with the particular case of changing metrics. We propose two centralized avoidance solutions: SCH-m (minor improvement of an existing heuristic), and ACH (new contribution), based on the identification of the routing loops in the strongly connected components contained in the union of the two routing protocols. We accelerate the migration of the network by a step-by-step merge operation of the different transitions produced. Second, we evolve towards the distributed protocols while preserving the static context of the network, and consider the particular case of the withdrawal or breakdown of a node. We also propose two solutions: RTH-d (minor improvement of an existing heuristic) and DLF (new contribution for loops of size 2) based on message exchange of nodes for both failure detection and for migration notification. Thirdly, we consider the context of nodes mobility, and study the performance of DLF- k (improved version of DLF which takes into account loops of size less than or equal to k, with k >= 2) on two types of applications: applications with a single mobile node that is the destination, and applications with a group of mobile nodes
Prakash, Divya. "Bi-criteria Scheduling Problems on Parallel Machines". Thesis, Virginia Tech, 1995. http://hdl.handle.net/10919/36732.
Pełny tekst źródłaMaster of Science
Marchini, Andrea. "Performance evaluation of improved output scheduling in 3lihon nodes". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amslaurea.unibo.it/6435/.
Pełny tekst źródłaYang, Hengzhao. "Task scheduling in supercapacitor based environmentally powered wireless sensor nodes". Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/48962.
Pełny tekst źródłaSchulz, Andreas S., Rolf H. Möhring, Frederik Stork i Marc Uetz. "A Note on Scheduling Problems with Irregular Starting Time Costs". Massachusetts Institute of Technology, Operations Research Center, 2000. http://hdl.handle.net/1721.1/5402.
Pełny tekst źródłaMarchini, Andrea. "Modifications to and performance evaluation of output scheduling in 3LIHON nodes". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for telematikk, 2013. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-24243.
Pełny tekst źródłaCerovic, Stefan. "Cooperative wireless communications in the presence of limited feedback". Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLC079/document.
Pełny tekst źródłaIn this thesis, cooperation techniques have been studied for Multiple Access Multiple Relay Channel, consisted of at least two sources which communicate with a single destination with the help of at least two half-duplex relaying nodes. Time Division Multiplexing is assumed. First, the link adaptation algorithm is performed at the centralised scheduler. Sources transmit in turns in consecutive time slots during the first transmission phase. In each time slot of the second phase, the destination schedules a node to transmit redundancies, implementing a cooperative Hybrid Automatic Repeat reQuest (HARQ) protocol, where bidirectional limited control channels are available from sources and relays towards the destination. In the first part of the thesis, centralized node selection strategies are proposed for the second phase. The scheduling decisions are made based on the knowledge of the correctly decoded source sets of each node, with the goal to maximize the average spectral efficiency. An information outage analysis is conducted and Monte-Carlo (MC) simulations are performed to evaluate their performance. In the second part, a slow-link adaptation algorithm is proposed which aims at maximizing the average spectral efficiency under individual QoS targets for a given modulation and coding scheme family relying on the reported Channel Distribution Information of all channels. Discrete source rates are first determined using the "Genie-Aided" assumption, which is followed by an iterative rate correction algorithm. The resulting link adaptation algorithm yields performance close to the exhaustive search approach as demonstrated by MC simulations. In the third part, performances of Incremental Redundancy (IR) HARQ with Single and Multi User encoding, as well as the Chase Combining HARQ with Single User encoding are compared. MC simulations demonstrate that IR-HARQ with Single User encoding offers the best trade-off between performance and complexity for a small number of sources in our setting. Practical coding scheme is proposed and validated using MC simulations
Liu, Xing. "Hybrid real-time operating system integrated with middleware for resource-constrained wireless sensor nodes". Thesis, Clermont-Ferrand 2, 2014. http://www.theses.fr/2014CLF22472/document.
Pełny tekst źródłaWith the recent advances in microelectronic, computing and communication technologies, wireless sensor network (WSN) nodes have become physically smaller and more inexpensive. As a result, WSN technology has become increasingly popular in widespread application domains. Since WSN nodes are minimized in physical size and cost, they are mostly restricted to platform resources such as processor computation ability, memory resources and energy supply. The constrained platform resources and diverse application requirements make software development on the WSN platform complicated. On the one hand, the software running on the WSN platform should be small in the memory footprint, low in energy consumption and high in execution efficiency. On the other hand, the diverse application development requirements, such as the real-time guarantee and the high reprogramming performance, should be met by the WSN software. The operating system (OS) technology is significant for the WSN proliferation. An outstanding WSN OS can not only utilize the constrained WSN platform resources efficiently, but also serve the WSN applications soundly. Currently, a set of WSN OSes have been developed, such as the TinyOS, the Contiki, the SOS, the openWSN and the mantisOS. However, many OS development challenges still exist, such as the development of a WSN OS which is high in real-time performance yet low in memory footprint; the improvement of the utilization efficiency to the memory and energy resources on the WSN platforms, and the providing of a user-friendly application development environment to the WSN users. In this thesis, a new hybrid, real-time, energy-efficient, memory-efficient, fault-tolerant and user-friendly WSN OS MIROS is developed. MIROS uses the hybrid scheduling to combine the advantages of the event-driven system's low memory consumption and the multithreaded system's high real-time performance. By so doing, the real-time scheduling can be achieved on the severely resource-constrained WSN platforms. In addition to the hybrid scheduling, the dynamic memory allocators are also realized in MIROS. Differing from the other dynamic allocation approaches, the memory heap in MIROS can be extended and the memory fragments in the MIROS can be defragmented. As a result, MIROS allocators become flexible and the memory resources can be utilized more efficiently. Besides the above mechanisms, the energy conservation mechanism is also implemented in MIROS. Different from most other WSN OSes in which the energy resource is conserved only from the software aspect, the energy conservation in MIROS is achieved from both the software aspect and the multi-core hardware aspect. With this conservation mechanism, the energy cost reduced significantly, and the lifetime of the WSN nodes prolonged. Furthermore, MIROS implements the new middleware software EMIDE in order to provide a user-friendly application development environment to the WSN users. With EMIDE, the WSN application space can be decoupled from the low-level system space. Consequently, the application programming can be simplified as the users only need to focus on the application space. Moreover, the application reprogramming performance can be improved as only the application image other than the monolithic image needs to be updated during the reprogramming process. The performance evaluation works to the MIROS prove that MIROS is a real-time OS which has small memory footprint, low energy cost and high execution efficiency. Thus, it is suitable to be used on many WSN platforms including the BTnode, IMote, SenseNode, TelosB, T-Mote Sky, etc. The performance evaluation to EMIDE proves that EMIDE has less memory cost and low energy consumption. Moreover, it supports small-size application code. Therefore, it can be used on the high resource-constrained WSN platforms to provide a user-friendly development environment to the WSN users
Dridi, Khaled. "Spécification du protocole MAC pour les réseaux IEEE 802.11e à différentiation de services sous contrainte de mobilité". Thesis, Paris Est, 2011. http://www.theses.fr/2011PEST1016/document.
Pełny tekst źródłaThis thesis proposes a new approach relating to the packets scheduling algorithm, the cooperation scheme and the nodes' mobility for IEEE 802.11 wireless network family. Considering the QoS delivery process at the MAC level consists the main feature of the proposal research study. The analysis of the current mechanisms leads to keep the protocol EDCF as the basic model for our work platform. In order to overcome the weakness of the earlier 802.11 standard, a new model based on multi-scheduler algorithm, called HCF-T, is proposed. The achieved performances are summarized following several criteria: traffic control, throughput improving, collisions avoidance, and network load decreasing. Furthermore, in the way of getting better results according to the PHY layer, we presented and analyzed a model of cooperative diversity scheme. It included a couple of relaying protocols AAF and DAF supported by a set of combining techniques to backup the signal at the receiver. To support node's mobility within EDCF, we built-up a model of WLAN which able to track node motion and control the access as in real condition. In the case of overlapping APs ranges, we developed a Multi-coverage algorithm aiming to carry out the session associations. As a result, three levels (Low, Medium, and High) of node's speed are discerned. Finally, EDCF has been implemented on various static and dynamic scenarios. The performances, based on the main MAC-layer metrics, such as throughput, End-2-End delay, and jitter, have been classified and comprehensively evaluated
Keckler, Stephen W. "A Coupled Multi-ALU Processing Node for a Highly Parallel Computer". 1992. http://hdl.handle.net/1721.1/6807.
Pełny tekst źródłaLin, Han-Sheng, i 林漢昇. "The Study of Node Scheduling in Wireless Sensor Networks". Thesis, 2010. http://ndltd.ncl.edu.tw/handle/20468973237194764119.
Pełny tekst źródła義守大學
資訊工程學系碩士班
98
Wireless sensor networks are applied in many areas, which require long-term supervising, such as medical, military, catastrophe sensor, and environment monitor. In general, these areas are not easy to supervise and are not suitable for people to operate. Therefore, wireless sensor networks can take the place to conduct and monitor theses areas. WSN consists of low power and unreliable sensor nodes. As a result, WSN encounters a lot of problems. One major problem is to avoid sacrificing sensing coverage and sensing reliability whereas extending the lifetime of the sensor network. Since we need to save the energy of sensor nodes, we thereby don’t turn on all the sensor nodes, and have some of them in sleep. Therefore we propose our algorithm of sleeping schedule for the sensor network in this thesis. We undertake experiments to prove that our algorithm helps select more sleeping nodes than traditional algorithms. In the way, hopefully each sensor node can be effectively utilized in order to extend the lifetime of sensor network.
Chen, Gui-Ray, i 陳國瑞. "Grid-based Node Scheduling Algorithm in Wireless Sensor Networks". Thesis, 2008. http://ndltd.ncl.edu.tw/handle/30668863648378733783.
Pełny tekst źródła元智大學
資訊工程學系
97
In wireless sensor networks (WSNs), due to that sensor nodes have limited energy and it''s difficult to recharge or replace the batteries. So scheduling play an important role in WSNs. In this paper, we proposed a grid-based node scheduling algorithm which can reduce the overall system energy consumption thus extending the system lifetime. First, we investigate the relationship of the intersection points between the sensor node and the sides of the grid. Via the investigation of the intersection points, we proposed mono-grid algorithm to separate the nodes into subsets while each subset guarantee the grid area is full cover. We further present multi-grid algorithm to turn off the redundant node through estimating the coverage degree of the nodes. Using extensive simulation in ns2, we demonstrate that the grid-based scheduling can reduce energy consumption and the active node density decrease up to 83% while maintaining the coverage.
Tsai, Chih-TIng, i 蔡志廷. "Design and analysis of the process scheduling of grid node". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/72358525359029554563.
Pełny tekst źródła中國文化大學
資訊管理學系
99
A collaborated framework of grid computing was well defined, every grid node would be able to share resources and collaborate with each other. In grid environment, every dynamically used resources should be monitored and analyzed. How should we monitor and allocate dynamic resources in grid is an important issue all the time. In this thesis, there are two different types of process scheduling model, one is non-grouped grid node process scheduling model and the other one is grouped grid node process scheduling model. With non-grouped grid node process scheduling model, users could assign jobs at any node in the grid, and this node would dispatch those jobs based on collected information of resources and job scheduling algorithm. That is to say the overall performance of grid environment would be improved because non-grouped grid node process scheduling model could monitor and allocate dynamic resources. However, there is a CPU consumption caused by monitoring dynamic resources in grid. The non-grouped grid node process scheduling model is not suitable when there are more than fifty nodes in the grid environment. With grouped grid node process scheduling model, nodes would be classified into five classifications by the CPU specification scores. Within each classification, every node in the same classification would be assigned to a group which is no more than ten nodes in that group. By separating nodes into groups, the CPU consumption caused by monitoring the resources of nodes in a group would be effectively reduced. While the group-agents node deal with all the resource allocation between groups, the utility ratio of the grid resource would be increase. Grouped process scheduling grid node model could be implemented in the grid with more than fifty nodes. By implementing these two types of process scheduling model, the overall performance of grid would be improved.
Ho, Chih-Yu, i 何志宥. "Node Scheduling Guaranteeing Q-coverage in Heterogeneous Wireless Sensor Networks". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/17063365155192760828.
Pełny tekst źródła國立高雄大學
資訊工程學系碩士班
99
The coverage problems in wireless sensor network are always been concerned. In Q-coverage, every object should be monitored by specific sensors. In the study, we try to arrange sensors in Q-coverage restriction and maximize their lifetimes. Most assumptions in other approaches are discussed in homogeneous sensor network, but this approaches in heterogeneity. Therefore, this problem can be discussed in different consumptions and radius. In this approach, we offer an algorithm to choose the set of sensors in greedy method. By this algorithm, the experiment will present the performance of sensors’ life and approach to the theory (upper- bound). Q-coverage was proved as NPC problem, and there are no polynomial solutions to optimize. But In this study, we offer a heuristic to trace network and monitor time, and we try to find the best solutions in restriction.
Kung, Ting-Yuan, i 龔鼎元. "LDPC Decoder Architecture Using Variable-node-centric Sequential Scheduling Algorithm". Thesis, 2012. http://ndltd.ncl.edu.tw/handle/22834836659358924408.
Pełny tekst źródła國立臺灣科技大學
電機工程系
100
With advances in the flash memory process technology and reduction of manufacturing costs, flash memory has been used in many popular products recently. The controller IC technology is the critical one making flash memory function well. Error control coding is one of the key components in the controller IC. BCH code has been adopted for the error control on the NAND flash memory for many years. However, due to high error characteristic of the new-generation NAND flash memory system, the industry must find more powerful and efficient error correction codes to perform error correction. Low-density parity-check codes (LDPC codes) are good candidates, especially, when soft information is used to decode. LDPC codes usually result in good bit error performance. This thesis is mainly focus on implementing the hardware architecture of decoding algorithm for LDPC codes. After investigating several well-known decoding algorithms, the variable-node-centric sequential scheduling algorithm is adopted to reduce the hardware complexity of the decoder. This algorithm is one kind of group shuffled scheduling algorithms, which combine the parallel and serial decoding features to reduce the hardware complexity. By using this algorithm one can reduce the connection number of the hardware architecture to make routing easier. Moreover, the check node units and variable node units in the decoder can be simplified efficiently. The proposed LDPC decoder circuit is synthesized with UMC 0.11 μm standard process and the size of gate count is provided.
Yang, Pai-Mou, i 楊佰謀. "A Relay-Node and CoMP-Based Scheduling for LTE-A". Thesis, 2015. http://ndltd.ncl.edu.tw/handle/4qjhck.
Pełny tekst źródła國立中山大學
資訊工程學系研究所
103
Nowadays, with the rapid growth of handheld devices, people rely on wireless network more than anytime before. Since wireless network are more and more important, 3GPP proposed a new 4G wireless communication standard called “Long Term Evolution Advance” (LTE-A). In Release 9, 3GPP set a standard of “Relay” architecture to improve locations with bad connection, such as Hot Spot, Dead Spot, and Cell-edge. RN (Relay Node) can connect with DeNB (Donor eNodeB) by wireless Backhaul Link, therefore makes it a better choice for a large outdoor event held in a short duration compared to the wired Backhaul connection. CoMP (Coordinated multipoint transmission/reception) is a new architecture widely discussed and researched in LTE-A. CoMP can improve Cell-edge connection, and improve bitrate while decreasing interference. In this paper, we proposed a new scheduling mechanism combined of Relay and CoMP to improve the efficiency of wireless RN. The proposed scheduling can identify different UE (User Equipment) under a eNB (eNodeB). UE will report how many users served and the CSI (Channel State Information) to eNB. After gathering the information, our mechanism calculate a new weight. Then the weight and CSI exchange between eNBs, so RN can get more resources and allow RN combined with CoMP JT (Joint Transmission) mechanism to get higher priority. That is, four different priorities from high to low for JT RN, RN, JT UE, and UE are arranged. In the end of paper, we use a network simulator ns3 to simulate our method. Experiment results show the scheduling mechanism can improve the average throughput, and let the Relay Node has higher throughput by keeping benefit of CoMP.
Fan-Chiang, Tii, i 范姜迪. "Node-wise Quota-based Dynamic Scheduling for Decoding LDPC Codes". Thesis, 2018. http://ndltd.ncl.edu.tw/handle/a59nxs.
Pełny tekst źródła國立交通大學
電信工程研究所
106
Low-density parity-check (LDPC) codes provide the powerful capability of error correction. Therefore, they have been widely adopted for data protection in many communication standards. LDPC Codes are often decoded by the sum-product algorithm with flooding scheduling which is based on updating all of the edges in the Tanner graph simultaneously. In the previous researches, dynamic scheduling schemes which update only part of the edges in the Tanner graph at the same time have been shown to result in faster convergence speed or better error rate performance. For some traditional dynamic scheduling schemes, some variable nodes are observed to change their signs repeatedly in a single iteration of decoding. We think that the decoding messages associated with the edges in the Tanner graph connected to those variable nodes are unstable. Keeping on updating those nodes according to the unstable messages might not lead to a better convergence of decoding and it may be more effective to update other variable nodes preferentially. In this study, we propose to control the numbers of updated variable nodes in order to limit the numbers of changed signs based on the above discovery. Simulation results also show that our method can obtain better a decoding performance than other traditional schemes.
Sih-HanFang i 方思涵. "A node restoration scheduling problem considering time-dependent demands on nodes or origin-destination pairs". Thesis, 2018. http://ndltd.ncl.edu.tw/handle/8xp82e.
Pełny tekst źródłaChien-HungWu i 吳建宏. "Efficient Real-time Group Multicast Node Scheduling Schemes in Wireless Multi-hop Networks". Thesis, 2010. http://ndltd.ncl.edu.tw/handle/31466067030724874662.
Pełny tekst źródła國立成功大學
電腦與通信工程研究所
98
In this thesis, we study for minimizing frame length of group communications in node scheduling, which is based on wireless multi-hop networks given source-specific tree and collision-free, called “In-Order Collision-Free Multiple Group Communications Scheduling (OCF-MGCS)”problem. We prove that OCF-MGCS problem is NP-complete and can be represented as an integer-linear programming (ILP) problem. The solution of the ILP is an optimal solution in OCF-MGCS. Here we develop a novel algorithm in polynomial time to attain an approximate solution efficiently in OCF-MGCS, called “ Broadcasting Level-by-Level ” (B-LBL) algorithm. The complexity of B-LBL is O(N2). Unlike link scheduling, the performance of B-LBL is much better because of the characteristic of “Broadcast”. Moreover, the effect of “Spatial reuse” and stream scheduling scheme make the result that the performance of B-LBL is better than Tree-based scheduling algorithm and pure color scheduling algorithm separately. Furthermore, for conquering the exposed terminal problem in wireless networks, we propose a new node scheduling algorithm, which has the characteristic of “Spatial reuse” and “Broadcast”, called “Collision Allowed Level-by-Level” (CA-LBL) algorithm. Under the condition that guaranteeing group communications form fail, CA-LBL allows partial and lesser collisions to increase the utilization of channel. Even though CA-LBL is against the collision-free in OCF-MGCS, the performance of CA-LBL is much better than B-LBL. By the way, for guaranteeing group communications form fail and avoiding the determining color problem in general color algorithms, CA-LBL filters constraints directly rather than general color algorithms. In the simulations, the performance of CA-LBL is better than other node scheduling algorithm certainly. Finally, we find that the frame length of CA-LBL varies little as the number of maximal degree increases in a specific number of nodes.
Shuen-ShiungYou i 游順雄. "Distributed Node Scheduling Algorithms for Multiple Group Communications in Wireless Multi-hop Networks". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/92654024735840998470.
Pełny tekst źródłaLi, Ju-Mei, i 李如梅. "Energy-Aware Node Placement, Topology Control and MAC Scheduling for Mesh-based Wireless Sensor Networks". Thesis, 2005. http://ndltd.ncl.edu.tw/handle/29754307390048755307.
Pełny tekst źródła淡江大學
資訊工程學系碩士班
93
Wireless sensor networks (WSNs) comprise a sink node and a large number of sensor nodes. In the application of environmental monitoring, sensor nodes that are deployed far away from the sink node transmit the gathered information to the sink node in a multi-hop manner. Therefore, sensor nodes nearby the sink node tend to exhaust their energy earlier than other nodes due to their heavy traffic for packet forwarding. The unbalanced power consumption among sensor nodes may cause network partitioned. This paper proposes efficient node placement, topology control, and MAC scheduling protocols to prolong the sensor network lifetime, reduce the packet transmission delay, and avoid collision. Firstly, a virtual tree topology is constructed based on mesh-based WSNs. Then two node-placement techniques, namely distance-based and density-based deployments are proposed to balance the power consumption of sensor nodes. Finally, a collision-free MAC scheduling protocol is proposed to prevent the packet transmissions from collision. In addition, extension of the proposed protocols are made from the mesh-based WSN to the random deployed WSN, making the mechanisms developed for Mesh-based WSNs can be applied to random deployed WSNs. Simulation results reveal that the developed protocols can efficiently balance each sensor node’s power consumption and prolong the network lifetime in both mesh-based and random deployed WSNs.
Ramasamy, Solairaja. "Delay-aware Scheduling in Wireless Coding Networks: To Wait or Not to Wait". Thesis, 2010. http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8989.
Pełny tekst źródłaΓεωργιόπουλος, Μιχάλης. "Αρχιτεκτονικές χρονοπρογραμματισμού διεργασιών σε κόμβο ασύρματου δικτύου αισθητήρων". Thesis, 2008. http://nemertes.lis.upatras.gr/jspui/handle/10889/849.
Pełny tekst źródła-
Luo, Dao-Ji, i 羅道蹟. "Performance measurement of job scheduling base on grid nodes". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/21898775087442300894.
Pełny tekst źródła中國文化大學
資訊管理學系
99
This article explains the whole grid environment, how can the best system perfor-mance. The whole point of the grid points to monitor, backup, monitoring points and enforcement points. Each point in the grid environment has its own particular portfolio. Each implementation of the point of its current work status to the monitoring point of collection, establishment of enforcement points is currently working conditions database. When a busy executive spots, it will pass on the work of monitoring points, processing, monitoring points, such as busy work, it can point the current status of work from the implementation of the database to find a free and appropriate implementation of the work points to pass on the work of turn found in the implementation of enforcement points. Case, the whole grid environment, resources will be fully utilized, and to reach the whole system performance optimization.
Lin, Che-Ming, i 林哲民. "Distributed Work Scheduling for Wireless Sensor Nodes Using Game Theory". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/23187010624743195130.
Pełny tekst źródła國立高雄大學
資訊工程學系碩士班
99
In wireless sensor network, there are several sensors and targets. All targets have to be monitored by sensors. Each target has a coverage level requirement. The targets can satisfy requirements by opening a part of the sensors. The paper research how to schedule the sensors. The power consumption can be reduced, and the network life time can be extended. The traditional methods almost use the greedy methods and the heuristic algorithms to solve the problem. In this paper, we employ Game Theory to solve it. The sensor selects whether to open the power or not. We prove that the game we defined can converge to a stable state, and the simulation result show it can extend the network life time. But the time that a game converges to a stable state has to be regarding as a cost. We propose two solutions to get the stable state more quickly. By simulation result, reaching stable state quickly leads to the little reduction of the network life time. The result is very good.
Chang, Shujye, i 張述傑. "An Energy-Aware Link Scheduling Algorithm to Maximize Relay Nodes Life Cycle on IEEE 802.16e Mesh Networks". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/83254868245276440068.
Pełny tekst źródła國立中正大學
資訊工程研究所
99
The IEEE 802.16 standard is defined to meet the high-speed and wide-range data transmission in an efficient way. The purpose of this thesis is to study how to minimize the energy consumption of mobile stations so as to maximize the network lifetime. We consider the real-time connections and focus on the resource scheduling which includes time slots allocation, QoS guarantee of real-time flows, interference-free on each link, and spectral reuse for the channel. The proposed energy-aware link scheduling algorithms construct a mathematical model of the energy consumption problem and provide a computationally efficient scheme to solve the problem. Comparing with traditional algorithm for real-time flows, simulation results show that the proposed scheme significantly improves the life cycle of mobile stations.
Vashistha, Sumit. "Energy Efficient Scheduling Of Sensing Activity In Wireless Sensor Networks Using Information Coverage". Thesis, 2007. http://hdl.handle.net/2005/598.
Pełny tekst źródła