Дисертації з теми "Wireless scheduling protocols"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-29 дисертацій для дослідження на тему "Wireless scheduling protocols".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Fei, Xin. "Coverage-awareness Scheduling Protocols for Wireless Sensor Networks." Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/23282.
Повний текст джерелаChui, T. Y. "Medium access control and packet scheduling algorithms for personal area wireless networking." Thesis, Queen's University Belfast, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.273216.
Повний текст джерелаSalayma, Marwa. "Reliable and energy efficient scheduling protocols for Wireless Body Area Networks (WBAN)." Thesis, Edinburgh Napier University, 2018. http://researchrepository.napier.ac.uk/Output/1532410.
Повний текст джерелаLiu, Minkui. "A cross-layer approach : impact of the physical layer on the design and performance of wireless scheduling protocols /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2005. http://wwwlib.umi.com/cr/ucsd/fullcit?p3170227.
Повний текст джерелаSánchez, Garache Marvin. "Multihop Wireless Networks with Advanced Antenna Systems : An Alternative for Rural Communication." Doctoral thesis, KTH, Kommunikationssystem, CoS, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4755.
Повний текст джерелаQC 20100908
Kunert, Kristina. "Architectures and Protocols for Performance Improvements of Real-Time Networks." Doctoral thesis, Högskolan i Halmstad, Inbyggda system (CERES), 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-14082.
Повний текст джерелаYang, Fei. "Reliable and time-constrained communication in wireless sensor networks." Phd thesis, INSA de Lyon, 2011. http://tel.archives-ouvertes.fr/tel-00706211.
Повний текст джерелаKhemapech, Ittipong. "PoRAP : an energy aware protocol for cyclic monitoring WSNs." Thesis, University of St Andrews, 2011. http://hdl.handle.net/10023/1899.
Повний текст джерелаDickow, Victor Hugo. "Avaliação de algoritmos de roteamento e escalonamento de mensagens para redes WirelessHART." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2014. http://hdl.handle.net/10183/97235.
Повний текст джерелаThe application of wireless networks has grown considerably in recent years. Protocols based on this technology are being developed for a great variety of applications. Reliability is one of the main requirements for communication protocols in industrial environments. Interferences, noisy environment and high risk processes that are monitored are factors that increase the levels of requirements in terms of reliability, redundancy and security of the protocol. The WirelessHART protocol is a wireless communication standard specifically designed for process monitoring and control applications with the necessary requirements for to be used in industrial environments. The WirelessHART standard defines several technical aspects to be used in the development of the algorithms. The algorithms of routing and scheduling messages are highly relevant to meeting the timing requirements of reliability and safety. Routing and scheduling strategies are specified, however, the routing and scheduling algorithms are not defined for use. The goal of this dissertation is to analyze some of the main algorithms that have been proposed specifically for the WirelessHART protocol and to present a set able to be applied in this protocol. Analyzes and comparisons between algorithms are realized by providing a detailed study of their impacts on the protocol performance.
Oliveira, Camila Helena Souza. "Gerenciamento AutonÃmico de Energia em Redes de Sensores Sem Fio AtravÃs do Escalonamento de Atividade dos NÃs." Universidade Federal do CearÃ, 2011. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7164.
Повний текст джерелаA evoluÃÃo no desenvolvimento de novos dispositivos, cada vez mais baratos e eficientes, expandiu o uso das Redes Sensores Sem Fio (RSSF) e incentivou a criaÃÃo de novas aplicaÃÃes, no cenÃrio contemporÃneo da ComputaÃÃo UbÃqua e Pervasiva. No entanto, a limitaÃÃo de energia continua sendo um desafio na Ãrea de RSSF. Essa situaÃÃo à agravada ainda mais pela a inviabilidade de recarga de energia jà que, em muitos casos, as RSSF sÃo utilizadas em ambientes inacessÃveis. Com o barateamento dos dispositivos utilizados nas RSSFs, ficou mais fÃcil empregar redes muito densas e de larga escala nos ambientes a serem monitorados. O emprego de redes densas, que apresentam alto grau de redundÃncia dos nÃs, permite que a rede continue funcional mesmo com a exaustÃo de alguns nÃs. AlÃm de oferecer tolerÃncia a falhas, o uso de redes muito densas oferece a oportunidade da implementaÃÃo de mecanismos de escalonamento dos nÃs redundantes, de forma que o tempo de vida da rede seja ainda melhor otimizado. Assumindo um cenÃrio com rede muito densas, este trabalho descreve a implementaÃÃo de um mecanismo de escalonamento autonÃmico, simples, robusto e escalÃvel, com o objetivo de melhorar ainda mais os resultados jà apresentados pelo BiO4SeL, um protocolo de roteamento baseado em ColÃnia de Formigas e desenvolvido para maximizar o tempo de vida da rede. Os resultados mostram que o novo esquema de escalonamento efetivamente melhora o tempo de vida de uma RSSF baseada no BiO4SeL em cenÃrios densos.
he evolution and development of new devices, increasingly cheaper and more efficient, expanded the use of Wireless Sensor Networks (WSN) and encouraged the creation of new applications in the contemporary scenery of Ubiquitous and Pervasive Computing. However, energy limitation remains a challenge in the field of WSN. This situation is aggravated even more by the infeasibility of energy recharge since, in many cases, WSN are used in inaccessible enviroments. With cheapness devices used in WSN, became easier to employ dense and large-scale networks in environments that will be monitored. The use of dense networks, which have a high degree redundancy of nodes, allows the network remains functional even with the exhaustion of some nodes. In addition to provide fault tolerance, the use of very dense networks offer the opportunity of implementing scheduling mechanisms for redundant nodes, in a way that the network lifetime is even better optimized. Assuming a scenery with very dense networks, this dissertation describes the implementation of an autonomic scheduling mechanism, simple, robust and scalable, in order to further improve the results already presented by BiO4SeL, which is a routing protocol based on Ant Colony and designed to maximize the network lifetime. The results show that the new scheduling scheme effectively improves the WSN lifetime based on BiO4SeL in dense scenarios.
Oliveira, Camila Helena Souza. "Gerenciamento Autonômico de Energia em Redes de Sensores Sem Fio Através do Escalonamento de Atividade dos Nós." reponame:Repositório Institucional da UFC, 2011. http://www.repositorio.ufc.br/handle/riufc/17478.
Повний текст джерелаSubmitted by guaracy araujo (guaraa3355@gmail.com) on 2016-06-07T17:01:05Z No. of bitstreams: 1 2011_dis_chsoliveira.htm: 516 bytes, checksum: 5f53d35c4f0938cf35fd9c5325cc0b3c (MD5)
Approved for entry into archive by guaracy araujo (guaraa3355@gmail.com) on 2016-06-07T17:01:23Z (GMT) No. of bitstreams: 1 2011_dis_chsoliveira.htm: 516 bytes, checksum: 5f53d35c4f0938cf35fd9c5325cc0b3c (MD5)
Made available in DSpace on 2016-06-07T17:01:23Z (GMT). No. of bitstreams: 1 2011_dis_chsoliveira.htm: 516 bytes, checksum: 5f53d35c4f0938cf35fd9c5325cc0b3c (MD5) Previous issue date: 2011
he evolution and development of new devices, increasingly cheaper and more efficient, expanded the use of Wireless Sensor Networks (WSN) and encouraged the creation of new applications in the contemporary scenery of Ubiquitous and Pervasive Computing. However, energy limitation remains a challenge in the field of WSN. This situation is aggravated even more by the infeasibility of energy recharge since, in many cases, WSN are used in inaccessible enviroments. With cheapness devices used in WSN, became easier to employ dense and large-scale networks in environments that will be monitored. The use of dense networks, which have a high degree redundancy of nodes, allows the network remains functional even with the exhaustion of some nodes. In addition to provide fault tolerance, the use of very dense networks offer the opportunity of implementing scheduling mechanisms for redundant nodes, in a way that the network lifetime is even better optimized. Assuming a scenery with very dense networks, this dissertation describes the implementation of an autonomic scheduling mechanism, simple, robust and scalable, in order to further improve the results already presented by BiO4SeL, which is a routing protocol based on Ant Colony and designed to maximize the network lifetime. The results show that the new scheduling scheme effectively improves the WSN lifetime based on BiO4SeL in dense scenarios.
A evolução no desenvolvimento de novos dispositivos, cada vez mais baratos e eficientes, expandiu o uso das Redes Sensores Sem Fio (RSSF) e incentivou a criação de novas aplicações, no cenário contemporâneo da Computação Ubíqua e Pervasiva. No entanto, a limitação de energia continua sendo um desafio na área de RSSF. Essa situação é agravada ainda mais pela a inviabilidade de recarga de energia já que, em muitos casos, as RSSF são utilizadas em ambientes inacessíveis. Com o barateamento dos dispositivos utilizados nas RSSFs, ficou mais fácil empregar redes muito densas e de larga escala nos ambientes a serem monitorados. O emprego de redes densas, que apresentam alto grau de redundância dos nós, permite que a rede continue funcional mesmo com a exaustão de alguns nós. Além de oferecer tolerância a falhas, o uso de redes muito densas oferece a oportunidade da implementação de mecanismos de escalonamento dos nós redundantes, de forma que o tempo de vida da rede seja ainda melhor otimizado. Assumindo um cenário com rede muito densas, este trabalho descreve a implementação de um mecanismo de escalonamento autonômico, simples, robusto e escalável, com o objetivo de melhorar ainda mais os resultados já apresentados pelo BiO4SeL, um protocolo de roteamento baseado em Colônia de Formigas e desenvolvido para maximizar o tempo de vida da rede. Os resultados mostram que o novo esquema de escalonamento efetivamente melhora o tempo de vida de uma RSSF baseada no BiO4SeL em cenários densos.
"Markov modulated CSMA protocols with backoff scheduling algorithms." Thesis, 2011. http://library.cuhk.edu.hk/record=b6075338.
Повний текст джерелаIn the light of the concern, we propose a queueing model of the general CSMA protocol with probability-based backoff scheduling algorithm. The input buffer of each node is modeled as a Geo/G/1 queue, in which the service time distribution of each individual head-of-line (HOL) packet can be described by a Markov chain. By means of this queueing model, we can obtain the characteristic equation of throughput, the packet queueing delay as well as the stable conditions with admissible input traffic. We also specify stable throughput and bounded delay regions with respect to the retransmission factor and input rate.
Last but not least, the proposed queueing model can be systematically generalized to investigate various types of MAC protocols, such as ALOHA, CSMA protocols, IEEE 802.11 protocols. Specifically, we illustrate the methodology by full analyses of the non-persistent CSMA and 1-persistent CSMA protocols in this thesis.
Medium Access Control (MAC) protocols have been continuously updated to keep up with the emerging new services and QoS requirements. Despite of the rapid changes of MAC protocols, a comprehensive performance analysis of any MAC protocol remains an open issue for over several decades.
Most of existing analysis of MAC protocols focused on the network throughput and packet access delay under the assumption that the network is saturated which is not realistic. We know very little about the stability of MAC protocol under the normal network operation for lack of a systematic model that can be adaptively applied to various MAC protocols with different service requirements and backoff scheduling algorithms.
Other than the probability-based backoff algorithm, this thesis also includes the study of window-based backoff algorithm. It is shown that the probability-based and window-based backoff algorithms are equivalent to each other. Moreover, we find that the characteristic equation of network throughput is invariant to backoff scheduling algorithms.
Wong, Pui King.
Adviser: Tony T. Lee.
Source: Dissertation Abstracts International, Volume: 73-06, Section: B, page: .
Thesis (Ph.D.)--Chinese University of Hong Kong, 2011.
Includes bibliographical references (leaves 125-133).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Abstract also in Chinese.
Miao, Lusheng. "Scheduling and QoS enhancement in wireless vehicular ad-hoc networks." 2014. http://encore.tut.ac.za/iii/cpro/DigitalItemViewPage.external?sp=1001736.
Повний текст джерелаDiscusses the protocol design in VANETs is very challenging due to their low latency and high data rate requirements in a high mobility environment. Hence, the central metrics of QoS such as throughput, reliability and delays are critical to the design of protocol in VANETs. Therefore, this project focuses on the scheduling and QoS enhancement algorithms. The QoS analytical model and multi-channel MAC protocol were completed; this was significant for the development of the VANETs.The anticipated benefits of this study may be described as: 1. The duty cycle adaptive MAC protocol could improve the QoS of VANET in the situation where the OBU is equipped with only one transceiver. 2. The results obtained from this model is significant for the designing and evaluation of the vehicular network. 3. Due to the characteristics of VANETs, the requirements of high throughput and low latency are critical in VANETs. An efficient multi-channel MAC protocol is a vital requirement in order to offer efficient, fair and stable channel access using the limited channel resources.
Su, Hang. "Design and Analysis of Opportunistic MAC Protocols for Cognitive Radio Wireless Networks." Thesis, 2010. http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8943.
Повний текст джерелаMohan, Avinash. "On Reduced-State Optimal Scheduling for Decentralized Medium Access Control of Wireless Data Collection Networks." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/5452.
Повний текст джерелаHuang, Guan-Ru, and 黃冠儒. "A Distributed-Scheduling MAC Protocol for Wireless Sensor Networks." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/94671255684163875096.
Повний текст джерела國立暨南國際大學
電機工程學系
98
In this thesis, we propose a new medium access control protocol, named DS-MAC (Distributed-Scheduling MAC) for wireless sensor networks to reduce the end-to-end delay and consumed energy. Usually sensor nodes switch between sleep and active modes to reduce energy loss. As a result, the end-to-end delay of packets that travel many hops or pass a congested will be extremely high. Similar to the well-known S-MAC, DS-MAC has two phases in each cycle: listen and sleep periods. In the first phase, each node contends by the commonly used RTS/CTS mechanism for channel access at the second phase. We use the DURATION field in a RTS/CTS packet to record the packet schedule of the considered packet. All nodes in communication range of the RTS/CTS packet can update their packet schedule. During the first phase, each node updates its own packet schedule upon sending or receiving RTS/CTS packets and the packet schedules of all nodes are created in a distributed manner. In the second phase, each node just follows its packet schedule to send or receive a packet. The major advantage of DS-MAC is that a node can serve multiple packets in a cycle. We have compared the DS-MAC with others in terms of end-to-end delay, average throughput and energy consumption. The simulation results show that the DS-MAC has better performance, especially for high traffic loading.
Hsu, Shuhuan, and 許書桓. "DMAS2-A Sleep And Transmission Scheduling Protocol For Wireless Sensor Networks." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/85570500000552722989.
Повний текст джерела靜宜大學
資訊工程學系
100
Energy conservation is one of the most important considerations in the deployment of a wireless sensor network. Among all methods, an efficient sleep and/or transmission schedule is undoubtedly the most helpful method for energy conservation. There have been many useful researches and solutions for sleep schedule, transmission schedule, or topology/routing creation. Nevertheless, very few of them can solve all of these problems in the same time. The DMAS protocol proposed by Chen et al should be the first one that can establish the network topology, the sleep/transmission schedule and the routing paths in a distributed way simultaneously. It gives significant contributions to energy conservation. However, the transmission delay still needs improvement. For this reason,this paper proposes a DMAS2 protocol that improves the transmission delay of the DMAS protocol. However, competition for transmission slots is more likely to happen for DMAS2, this will introduce another reason of packet delay. So, a resilient path mechanism is also proposed in the thesis to overcome the problem. The experimental results show that DMAS2 outperforms DMAS in transmission delay, packet arrival ratio and energy conservations.
Chang, Hsinfang, and 張心芳. "A Transmission Scheduling Protocol With Bounded Delay In Industrial Wireless Sensor Networks." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/58079984421134131314.
Повний текст джерела國立中正大學
通訊工程研究所
100
Wireless Sensor Network (WSN) has gained much attention in recent years. After being deployed in the target region, sensor nodes sense information in the region and transmit it to the base station by wireless communication and network routing technology. Due to the small size of the sensor node, the hardware resources are limited; and further, it affects the capability of computing, storage space and power supply of nodes. However, the use of WSN in industrial automation is different from that in traditional WSN. WSN in industrial automation has low tolerance on end-to-end delay. Therefore, the design of data transmission needs to provide real-time QoS. In a real-time application, the predictable bounded delay is expected. In this thesis, we propose a chain-based transmission scheduling protocol. Through the setup of multiple chains, the order of node to send data packets follows the sequential positional order of the node in the chain and furthermore these chains can provide predictable bounded delay because the number of nodes in each chain is fixed. To improve the throughput, we let each chain operate in parallel. The simulations show that the bounded delays for each node are not the same due to the dependency on their position in the sink tree and the node number of the sub-chain. The bounded delay will increase as the node degree increases.
Huang, Chun-Lien, and 黃春聯. "Implementation of Distributed-Scheduling MAC protocol for Wireless Sensor Networks by NS2 simulator." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/48975321229637911334.
Повний текст джерела國立暨南國際大學
電機工程學系
101
In this thesis, we implement a new medium access control protocol, named DS-MAC (Distributed-Scheduling MAC) for wireless sensor networks to lower end-to-end packet delay and energy consumption. Usually, sensor nodes switch between sleep and active modes to decrease energy loss. As a result, the end-to-end delays of packets that travel many hops or is under congested traffic are excessively large. Similar to the well-known S-MAC protocol, the DS-MAC protocol has three periods in each cycle: Sync period, Control period, and Data/Sleep period. We divide Data/Sleep period into multiple mini-frames. Sender and receiver execute DATA/ACK handshake in the mini-frames. In Sync period, each node broadcast or receive Sync packets to maintain a synchronized network. In Control period, every node contends for the communication channel by utilising the CSMA/CA mechanism. We use the scheduling table and the mini-frame field in one RTS/CTS packet to establish and record the packet schedules. The mini-frame field in RTS/CTS is that receivers execute DATA/ACK handshake with senders by being based on the mini-frame which is given by senders. Senders update the packet schedules according as the mini-frame is given by receivers. Then, each node receives RTS/CTS not for myself in order that per node can know the situations of using mini-frames for neighbor nodes. The packet schedules of all nodes are established in a distributed manner. In Data/Sleep period, each sensor node merely follows the assigned mini-frame in its own scheduling table to send or receive a DATA packet. The major benefit of DS-MAC is that a node can serve multiple packets in one cycle. We have compared the DS-MAC protocol with the adaptive S-MAC protocol in terms of end-to-end packet delay and energy consumption. The simulation results show that the DS-MAC protocol has great performance, especially under high traffic load.
Kleu, Christo. "An ultra-low duty cycle sleep scheduling protocol stack for wireless sensor networks." Diss., 2012. http://hdl.handle.net/2263/26400.
Повний текст джерелаDissertation (MEng)--University of Pretoria, 2012.
Electrical, Electronic and Computer Engineering
unrestricted
Lin, Yu-Chu, and 林育朱. "A Routing Protocol based on Power-controlled Sleep Scheduling for Wireless Sensor Networks." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/05938917675180604874.
Повний текст джерела淡江大學
資訊工程學系碩士在職專班
98
Wireless Sensor Networks is dispersed by a group composed of sensors and Base Stations. It can be used in various applications of remote monitoring system. Sensor nodes route the collected data to the Base Station via multi-hop wireless links. These sensors typically use batteries to operate, the battery cannot be replaced when the depletion of energy resources. Therefore, how to use energy-saving sensor networks to extend the overall working time efficiently is an important subject. Our research is base on “A Power Control Mechanism based on Sleep Scheduling for Wireless Sensor Networks”. We proposed a refined mechanism of routing protocol for wireless sensor networks with sleep scheduling. In wireless sensor network with sleep scheduling, active node adjusts its working time and even step in sleeping state earlier. In the multi-hop transmission mode, each node broadcasts the packet to confirm the receiving node. Therefore, we use routing information to reduce the number of broadcasting during transmission. When route node with low rest power cannot transfer, to remain completed route, we can execute interrupt handler procedure to reduce the package loss. Finally, to achieve power efficiency, we will simulate if the proposed algorithm can reduce energy consumption effectively in the data transmission procedure.
Zhu, Xiuming. "Adaptive wireless body medical system." 2013. http://hdl.handle.net/2152/22166.
Повний текст джерелаtext
Huang, Chung-kuo, and 黃種國. "Load-Balanced and Collision-Free Scheduling Protocol for Data Collection in Wireless Sensor Networks." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/71099994482882226523.
Повний текст джерела國立中央大學
資訊工程研究所
97
In static wireless sensor networks, it is an important research issue to achieve effectively periodic data collection and prolong the network lifetime. In this thesis, a distributed k-load-balanced tree scheme is proposed to prolong the network lifetime for periodic data collection. A k-load-balanced tree is a tree that the difference of the number of children of each two non-leaf nodes in a network is less than k. Each node chooses the node with the least current number of children and number of neighbor as parent for avoiding that the difference of the number of children of each two non-leaf nodes in a network is more than k. Furthermore, based on the k-load-balanced tree, a distributed TDMA-based scheduling scheme is proposed to avoid packet collisions in wireless data transmissions. The simulation results show that our scheme can prolong the network lifetime and the network delay time is close to the result of centralized method.
Jau, Ying-Hao, and 趙英豪. "A Combination of MC-CDMA and DQRUMA Protocol with BER Scheduling for Wireless Multimedia Networks." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/73321597653803211889.
Повний текст джерела國立臺灣科技大學
電機工程系
88
Wideband code-division multiple access (WCDMA) has been proposed as the backbone of third-generation technology. Distributed-Queueing Request Update Multiple Access (DQRUMA), is a very efficient demand-assignment multiple access protocol. In future wireless multimedia networks, there will be a mixture of different traffic classes which have their own maximum tolerable bit error rate (BER)requirements. This character will cause different bandwidths with different traffic class in the CDMA environment. In this thesis, we combine the advantages of MC-CDMA and DQRUMA to propose a novel MAC algorithm which can provide a bandwidth-on-demand fair-sharing environment for wireless communications.
Chen, Chun-Yao, and 陳俊堯. "Study on Scheduling Algorithm by Using MC-CDMA /TDMA MAC Protocol in Wireless ATM Networks." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/83830380933674737716.
Повний текст джерела國立臺灣科技大學
電機工程系
90
With many excellent advantages in ATM network, it is viewed as the backbone of high-speed network in the future. Because of the more requirement of the wireless communication, using the excellence of ATM network to wireless ATM network becomes today the popular subject of research. The goal of designing wireless ATM network is building a wireless network by seamless and efficient ways, and extending the existed wired ATM network to wireless local loop by wireless interface. This paper discusses the performance of different flow types with distinct transmission rate using MC-CDMA/TDMA multiple-access protocol from mobile hosts to base stations, and schedules packets with similar bit error rate in the same time slot with identical power to be transmitted as far as possible. By improving the scheduling algorithm, we can increase the throughput and decrease the loss rate.
Karim, Lutful. "An Integrated Framework for Wireless Sensor Network Management." Thesis, 2012. http://hdl.handle.net/10214/3741.
Повний текст джерелаTong, Fei. "Protocol design and performance evaluation for wireless ad hoc networks." Thesis, 2016. http://hdl.handle.net/1828/7623.
Повний текст джерелаGraduate
0984
0544
tong1987fei@163.com
Bhatia, Ashutosh. "Distributed TDMA-Scheduling and Schedule-Compaction Algorithms for Efficient Communication in Wireless Sensor Networks." Thesis, 2015. http://etd.iisc.ac.in/handle/2005/3552.
Повний текст джерелаBhatia, Ashutosh. "Distributed TDMA-Scheduling and Schedule-Compaction Algorithms for Efficient Communication in Wireless Sensor Networks." Thesis, 2015. http://etd.iisc.ernet.in/2005/3552.
Повний текст джерела