Dissertations / Theses on the topic 'CSMA'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'CSMA.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Castiel, Eyal. "Study of QB-CSMA algorithms." Thesis, Toulouse, ISAE, 2019. http://www.theses.fr/2019ESAE0038.
Full textPerformance of wireless networks, in which users share the air as support for their communications is strongly limited by electromagnetic interference. That is, two users close to each other trying to send a message on the same frequency will experience interference between their messages, eventually leading to the loss of some information. It is then crucial to develop medium access protocols aiming to limit the occurrence of such a phenomena by choosing in an effective (and distributed) manner which station is allowed to transmit. From a scientific point of view, it is a difficult issue which has had some attention from the community in the field of computer science and applied probability in the past 30 years. Recently, a new class of medium access protocols - called adaptive CSMA - emerged and seem quite promising: for example, it has been shown that they exhibit a desirable property: throughput optimality (maximum stability). The goal of this project is to increase the knowledge we have the adaptive CSMA (or CSMA QB, for Queue Based) which is to this day quite limited (notably in the expected waiting time of a request arriving in the system, called delay). Our goal will be to prove theoric results to enhance our understanding of the throughput/delay trade-off
JAIN, NITIN. "MULTICHANNEL CSMA PROTOCOLS FOR AD HOC NETWORKS." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin995471534.
Full textTsertou, Athanasia. "Modelling interference in a CSMA/CA wireless network." Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/14589.
Full textForss, Jonas. "Real-Time Communication over Broadcast Networks." Thesis, University of Skövde, Department of Computer Science, 1999. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-308.
Full textToday the utilization of all kind of multimedia services in networks increases and due to this demand for real-time communication gets higher for every day. One of the most common protocols used today is Ethernet. It is of interest to find real-time protocols that are useful together with already existing protocols since it is expensive to rebuild the network infrastructure. Several new protocols have been proposed to solve the upcoming problems.
The objective of this project is to make an inventory and a comparison between Ethernet and these new protocols. During this project four different protocols capability to fulfill the demands for real-time communication have been studied and compared with Ethernet. Three of the protocols are built on the same basic technique as Ethernet and these are PCSMA, CSMA-DCR and DOD-CSMA-CD. The fourth protocol is ATM and it transmits in a different way over communication networks.
The analysis of this project is pointing out advantages, similarities and differences between the protocols from a real-time perspective. All four protocols are more suitable for real-time requirements than Ethernet.
Ching, Kai-Sang. "Priority CSMA schemes for integrated voice and data transmission." Thesis, University of British Columbia, 1988. http://hdl.handle.net/2429/28372.
Full textApplied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate
Ramesh, Chithrupa, Henrik Sandberg, and Karl Henrik Johansson. "Stability analysis of multiple state-based schedulers with CSMA." KTH, Reglerteknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-111461.
Full textQC 20130116
Horton, Remy A. "Distributed and deterministically maintained transmission alignment in csma protocols." Thesis, University of Bristol, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.549440.
Full textWeitzen, Christopher James. "Service differentiation using managed sleep in CSMA/CA networks." Winston-Salem, NC : Wake Forest University, 2009. http://dspace.zsr.wfu.edu/jspui/handle/10339/44746.
Full textMedapalli, Kameswara Rao. "Design, analysis and optimization of CSMA/CA based wireless networks /." May be available electronically:, 2006. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Full textMulligan, Jeanette. "A Performance Analysis of a CSMA Multihop Packet Radio Network." Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36779.
Full textThe analysis of packet radio networks is complex because system performance depends on the topology of the terminals in the network along with the random access protocol used. Researchers have been unable to model a packet radio network in its most general form. In this project, a model is developed for specific topologies of a packet radio network with a given random access protocol.
The sponsor of this project has developed a packet radio network for
an indoor wireless alarm system. At the start of the project, the
effect of message collisions on system performance was unknown. As
a result of this research, a collision model for the network has
been developed for topologies of four, five, and six alarm units.
The model has been validated with actual system testing. Furthermore,
the effects of indoor propagation on system performance have been
studied. The results of this work have led to the development of an
installation plan for the indoor wireless alarm system.
Master of Science
Li, Jing. "OFDM and p-Persistent CSMA/CD-based Indoor PLC Networks." University of Cincinnati / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1234896618.
Full textKaynia, Mariam. "Performance Analysis of ALOHA and CSMA in Spatially Distributed Wireless Networks." Thesis, Norwegian University of Science and Technology, Department of Electronics and Telecommunications, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9580.
Full textIn this thesis the performance of the ALOHA and CSMA MAC protocols are analyzed in spatially distributed wireless networks. The main measurement metric used is probability of outage, a metric that is referred to in most of the related research done in this field, but has not been treated in detail thus far. Some of the research done on other performance metrics such as transmission capacity, throughput, bit error rate, spatial reuse and delay are also noted and described briefly in this report. In our system model, users/packets arrive randomly in space and time according to a Poisson point process, and are thereby transmitted to their intended destinations using a fully distributed MAC protocol (either ALOHA or CSMA). Our model allows simultaneous transmissions between many transmitter-receiver pairs in the network. An SINR-based model is considered, and a packet transmission is encountered as successful if the received SINR is above a predetermined threshold value for the entire duration of the packet. Accurate bounds on the probability of outage, which is a function of the density of transmissions, are developed for both MAC protocols. The methods used to reach the obtained analytical results are presented in detail, and the analytical results are shown to follow the simulation results tightly. We also present the methods that were used to find expressions for the outage probability, which turned out to not be as successful as desired in terms of following the simulation results tightly for all densities. Furthermore, the derived bounds for the probability of outage are used to determine the performance advantage that CSMA provides over ALOHA and also to gain insight into the design of general MAC protocols for ad hoc networks. Our final comparison results show that CSMA performs better than unslotted ALOHA, and worse than slotted ALOHA in terms of probability of outage.
Plönnigs, Jörn. "Control network performance engineering qualitätsorientierter Entwurf von CSMA-Netzwerken der Automation." Dresden Vogt, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=3009957&prov=M&dok_var=1&dok_ext=htm.
Full textYuxiang, Yang, Dang Xiaoyu, and Zhou Tingxian. "PROPOSAL OF POLLED-CSMA PROTOCOL FOR AN AD HOC SCADA SYSTEM." International Foundation for Telemetering, 2000. http://hdl.handle.net/10150/606484.
Full textIn this paper we introduce an ad hoc distributed supervisory control and data acquisition (SCADA) system, which covers two types of traffic, a small number of slave stations with stream traffic and much larger number of slave stations with burst traffic. To improve the system’s real-time transmission and channel allocation efficiency, a MAC scheme, named Polled-CSMA, is designed by integrating the merits of polling and CSMA protocols. Extensive analysis shows that this MAC protocol meets the system’s QOS requirements.
Yang, Tao. "Characterization of the fundamental properties of wireless CSMA multi-hop networks." Thesis, The University of Sydney, 2014. http://hdl.handle.net/2123/12416.
Full textMawlawi, Baher. "Random access for dense networks : Design and Analysis of Multiband CSMA/CA." Thesis, Lyon, INSA, 2015. http://www.theses.fr/2015ISAL0112/document.
Full textOpportunistic protocols are promising candidates for future wireless systems dedicated to machine to machine (M2M) communication. Such protocols are usually based on a random access with simple techniques of medium sensing and deferring to reduce collisions while avoiding the use of complex schedulers. Among different protocols, Carrier sense multiple access/collision avoidance with a Request-To-Send/Clear-To-Send (CSMA/CA-RTS/CTS) is an opportunistic protocol which could be adopted for M2M scenarios. Such approach is efficient to avoid collisions between data packets but in a very dense network, the random access used to send the RTS suffers itself from a high probability of collision which degrades the performance. In order to mitigate this effect, RTS collisions should be reduced. This thesis proposes to address this issue by splitting the common channel in sub-channels for transmitting the RTS messages. While the common channel is used as a whole for data transmission. Multiple nodes can then contend in time and frequency for these RTS sub-channels, thereby reducing RTS collisions and increasing overall efficiency. In this work, we thus derive a complete protocol solution relying on CSMA/CA - RTS/CTS multiplexing a multi-channel configuration for RTS messages and a unique channel for data transmission. An enhanced version based on users scheduling is integrated as well. In this thesis, the proposed protocol is investigated from a joint PHY-MAC point of view. This strategy is shown to provide better system performance particularly for loaded networks. An accurate analytical model derived as a straightforward extension of the Bianchi model is analyzed and validated by simulations. Performance in terms of saturation throughput, transmission delay and packet drop probability is discussed
Lofcali, Mehmet N. "A specification of a CSMA/CD protocol using systems of communicating machines." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/26260.
Full textVASQUES, Thiago Lara. "Estimação de vazão baseada em modelagem e simulação do controle de acesso ao meio em redes PLC." Universidade Federal de Goiás, 2010. http://repositorio.bc.ufg.br/tede/handle/tde/959.
Full textWe carried out a study on throughput estimation based on analysis and modeling of the medium access control in HomePlug 1.0 standard based PLC networks. The data communication using electrical energy wires has advantages such as presenting characteristics of ubiquity due to the existent infrastructure, but faces significant obstacles as fading and noise. The main standard of this kind of home network is the HomePlug, which defines a protocol based on the method of multiple access with collision avoidance (CSMA/CA). The HomePlug adds to the CSMA/CA a technique called deferral counter (DC) that adapts the contention of the nodes in accessing the medium according to network load. The objective of this work is todo a comparative study of the throughput, which is the ratio of the packet payload, i.e., the amount of data that is inserted into the body of the datagram, and the frame transmission time. To this end, we evaluate what is the theoretical maximum throughput of the PLC channel, we developed a simulator for the CSMA/CA and we propose a simple probabilistic model to describe the throughput on the network PLC. Finally, we make a comparison between the results obtained with the simulator and the probabilistic model to those observed from a real PLC network, proving that the results of the theoretical maximum throughput and the simulation results are close and that the probability model becomes a tool for calculating throughput in PLC networks.
Neste trabalho, realizou-se um estudo sobre estimação da vazão baseada na análise e modelagem do controle de acesso ao meio em redes PLC padrão HomePlug 1.0. A comunicação de dados através do canal elétrico tem vantagens como apresentar as características de ubiquidade e da infra-estrutura pré-existente, porém enfrenta obstáculos importantes como a atenuação e o ruído. O principal padrão desse tipo de rede domiciliar é o HomePlug, que define um protocolo baseado no método de acesso múltiplo com prevenção de colisões (CSMA/CA). O HomePlug associa ao CSMA/CA uma técnica chamada de contador de adiamentos (DC) que adapta a contenção dos nós no acesso ao meio de acordo com a carga da rede. O objetivo deste trabalho é realizar um estudo comparativo da vazão, que é a razão entre carga útil do pacote, ou seja, a quantidade de dados que preenchem o corpo do datagrama, e o tempo de transmissão do quadro. Para isso, avaliou-se qual é a vazão máxima teórica do canal PLC, desenvolveu-se um simulador para o protocolo CSMA/CA e foi proposto um modelo probabilístico simples para descrever a vazão na rede PLC. Foi realizada uma comparação entre os resultados obtidos com o simulador e o modelo probabilístico com os dados observados em uma rede PLC real, comprovando que os resultados da vazão máxima teórica e os resultados da simulação são próximos e que o modelo probabilístico passa a ser uma ferramenta para cálculo de vazão em redes PLC.
Corneliussen, Jon Even. "The Optimal Packet Duration of ALOHA and CSMA in Ad Hoc Wireless Networks." Thesis, Norwegian University of Science and Technology, Department of Electronics and Telecommunications, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9911.
Full textIn this thesis the optimal transmission rate in ad hoc wireless networks is analyzed. The performance metric used in the analysis is probability of outage. In our system model, users/packets arrive randomly in space and time according to a Poisson point process, and are thereby transmitted to their intended destinations using either ALOHA or CSMA as the MAC protocol. Our model is based on an SINR requirement, i.e., the received SINR must be above some predetermined threshold value, for the whole duration of a packet, in order for the transmission to be considered successful. If this is not the case an outage has occurred. In order to analyze how the transmission rate affects the probability of outage, we assume packets of K bits, and let the packet duration, T, vary. The nodes in the network then transmit packets with a requested transmission rate of Rreq=K/T bits per second. We incorporate transmission rate into already existing lower bounds on the probability of outage of ALOHA and CSMA, and use these expressions to find the optimal packet duration that minimizes the probability of outage. For the ALOHA protocol, we derive an analytic expression for the optimal spectral efficiency of the network as a function of path loss, which is used to find the optimal packet duration Topt . For the CSMA protocol, the optimal packet duration is observed through simulations. We find that in order to minimize the probability of outage in our network, we should choose our system parameters such that our requested transmission rate divided by system bandwidth is equal to the optimal spectral efficiency of our network.
Ishigaki, Masahiro. "Studies on Modeling and Performance Analysis of Communication Systems with Improved CSMA/CD." 京都大学 (Kyoto University), 2001. http://hdl.handle.net/2433/150263.
Full textLopes, Luis Filipe Amaral. "Esquemas de controlo de acesso ao meio para sistemas CSMA/CA p-persistente." Master's thesis, FCT - UNL, 2009. http://hdl.handle.net/10362/2534.
Full textEste trabalho descreve os passos iniciais no sentido de caracterizar formalmente os protocolos de acesso ao meio baseados em heurísticas propostos para redes ad hoc sem os. Este método, denominado método de análise de heurísticas de acesso ao meio, permite caracterizar a função de utilidade de acesso ao meio de um nó, a qual está relacionada com o seu débito útil, tal como é provado experimentalmente neste trabalho. O método é particularmente vantajoso como uma ferramenta de comparação entre protocolos, pois permite efectuar uma rápida análise comparativa do débito útil para os diferentes protocolos em análise. O método foi validado com protocolos existentes e com um protocolo baseado em heurísticas proposto nesta dissertação. Para provar a viabilidade do método de análise de heurísticas, validaram-se os resultados obtidos com o mesmo com diversas simulações. Neste trabalho é proposto um segundo protocolo de acesso ao meio baseado em heurísticas, desenvolvido com o objectivo de maximizar o débito útil da rede e, simultaneamente, a justiça de acesso ao meio. Este protocolo utiliza um mecanismo inovador na gestão da janela de contenção, que também realiza a distribuição de acesso ao meio através das tramas de acknowledge. No m comparam-se os resultados obtidos por este protocolo e os resultados obtidos pelos protocolos analisados, incluindo a norma IEEE 802.11. Nesta comparação, conclui-se que o protocolo proposto neste trabalho exibe o melhor compromisso entre o débito útil e a justiça de acesso ao meio, em relação aos protocolos estudados.
Liu, Quan. "Multi-band OFDM and p-Persistent CSMA/CD-based Indoor Power Line Communication (PLC) Systems." University of Cincinnati / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1265984789.
Full textLee, Jongdae. "Performance enhancement of CSMA/CA in powerline communications under heavy traffic and hidden node conditions." [Gainesville, Fla.] : University of Florida, 2008. http://purl.fcla.edu/fcla/etd/UFE0022857.
Full textNavalekar, Abhijit C. "Distributed Digital Radios for Land Mobile Radio Applications." Digital WPI, 2010. https://digitalcommons.wpi.edu/etd-dissertations/4.
Full textKangude, Shantanu. "CSMA with Implicit Scheduling through State-keeping: A Distributed MAC Framework for QoS in Broadcast LANs." Diss., Available online, Georgia Institute of Technology, 2004:, 2004. http://etd.gatech.edu/theses/available/etd-05132004-132109/unrestricted/kangude%5Fshantanu%5F200407%5Fphd.pdf.
Full textCopeland, John, Committee Chair ; Owen, Henry, Committee Member ; Sivakumar, Raghupathy, Committee Member ; Lanterman, Aaron, Committee Member ; Dos Santos, Andre, Committee Member. Includes bibliographical references.
Abukharis, Salim H. S. "Accurate cross-layer modelling and evaluation of IEEE 802.11e using a differentiated p-persistent CSMA protocol." Thesis, University of Sheffield, 2013. http://etheses.whiterose.ac.uk/4793/.
Full textYipeng, Wang. "Implementation of the WirelessHART MAC Layer in the OPNET Simulator." Thesis, Mittuniversitetet, Avdelningen för informations- och kommunikationssystem, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-19912.
Full textMoslehi, Farhood. "Simulation of the MAC Portion of IEEE 802.11 and Bursts of Errors for Wireless Data Networks." Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36936.
Full textMaster of Science
CHEN, YUNLI. "PERFORMANCE ANALYSIS AND ENHANCEMENT OF MAC PROTOCOLS FOR IEEE 802.11 WLANS." University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1098856121.
Full textCawood, Andrew Dudley. "Adaptation, optimisation and simulation of the CSMA/CA protocol for a low earth orbit satellite UHF link." Thesis, Link to the online version, 2006. http://hdl.handle.net/10019/1608.
Full textWu, Jingqi. "Cooperative Jamming in Wireless Networks - Turning Attacks into Privacy Protection." ScholarWorks@UNO, 2008. http://scholarworks.uno.edu/td/885.
Full textYang, Zhenxiang. "Entwicklung eines Verfahrens zur Emulation der Medienzugriffssteuerung in Wireless LAN." [S.l. : s.n.], 2004. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB11482123.
Full textTang, Yong. "Performance Study for Co-existing Wi-Fi and ZigBee Systems and Design of Interoperability Techniques." Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/23169.
Full textHaque, Syed E. "Efficient GTS Allocation Schemes for IEEE 802.15.4." Digital Archive @ GSU, 2012. http://digitalarchive.gsu.edu/cs_theses/75.
Full textKumar, Nishant. "MAC and Physical Layer Design for Ultra-Wideband Communications." Thesis, Virginia Tech, 2004. http://hdl.handle.net/10919/9934.
Full textMaster of Science
Polumuru, Pushpa. "Networking of UAVs Using 802.11s." Thesis, University of North Texas, 2019. https://digital.library.unt.edu/ark:/67531/metadc1505276/.
Full textGanesh, Rajaganesh 1987. "SQ-CSMA : universally lowering the delay of queue-based CSMA/CA." Thesis, 2010. http://hdl.handle.net/2152/26517.
Full texttext
Boyana, Murat A. "Pseudo-Bayesian stability of CSMA and CSMA/CD local area networks." Thesis, 1988. http://hdl.handle.net/10945/23371.
Full textThis thesis investigates the stability of the random multiaccess protocols, slotted CSMA and slotted CSMA/CD, utilizing one power level and two power levels to create beneficial power capture effect. Use of more than two equally spaced power levels provides no significant improvement in the throughput achievable when realistic capture thresholds are considered. The investigation centers on a technique known as pseudo-Bayesian stability. Another task of this thesis is to stabilize multichannel slotted CSMA and slotted CSMA/CD with pseudo-Bayesian technique. The multichannel slotted CSMA and slotted CSMA/CD show a large improvement in throughput over a traditional single channel with a combined bit rate.
http://archive.org/details/pseudobayesianst00boya
Lieutenant Junior Grade, Turkish Navy
何明耀. "A study on the interconnection of CSMA and CSMA/CD networks." Thesis, 1990. http://ndltd.ncl.edu.tw/handle/96988024342183460636.
Full text"TCP Reno over adaptive CSMA." 2010. http://library.cuhk.edu.hk/record=b5894411.
Full textThesis (M.Phil.)--Chinese University of Hong Kong, 2010.
Includes bibliographical references (leaves 64-67).
Abstracts in English and Chinese.
Dedication --- p.iv
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Motivation --- p.1
Chapter 1.2 --- Contributions --- p.2
Chapter 1.3 --- Thesis Organization --- p.3
Chapter 2 --- Related Work --- p.4
Chapter 2.1 --- Previous Work on Rate Control and link Scheduling in Wireless Networks --- p.4
Chapter 2.2 --- Previous Work on Multi-connection TCP --- p.6
Chapter 2.3 --- Previous Work on AQM --- p.6
Chapter 3 --- Problem Settings --- p.7
Chapter 3.1 --- Network Modeling --- p.7
Chapter 3.2 --- Capacity Region of Wireless Networks and Throughput-optimal Scheduling --- p.9
Chapter 3.3 --- Throughput-optimality of A-CSMA --- p.10
Chapter 3.4 --- TCP Reno Congestion Control Modeling --- p.11
Chapter 4 --- Starvation of TCP Reno over L-CSMA and A-CSMA --- p.13
Chapter 4.1 --- TCP Reno Starves over L-CSMA --- p.13
Chapter 4.2 --- TCP Reno Starves over A-CSMA --- p.15
Chapter 4.2.1 --- Simulations --- p.15
Chapter 4.2.2 --- Observations and Explanations --- p.17
Chapter 5 --- Analysis and Our Proposed Solution --- p.19
Chapter 5.1 --- Proposed Solution: Multi-connection TCP Reno Scheme --- p.19
Chapter 5.2 --- Implementation --- p.25
Chapter 5.3 --- Discussion --- p.28
Chapter 5.3.1 --- Achieve Arbitrary Utility --- p.28
Chapter 5.3.2 --- Extension to Networks with Both Wired and Wireless Links --- p.28
Chapter 5.3.3 --- Impact of ACK Traffic --- p.30
Chapter 5.3.4 --- Tradeoff between performance and overhead --- p.31
Chapter 5.3.5 --- Overhead of Multi-connection TCP --- p.32
Chapter 6 --- Simulations --- p.37
Chapter 6.1 --- Single-hop Wireless Networks Scenario --- p.38
Chapter 6.1.1 --- Fairness and Throughput --- p.38
Chapter 6.1.2 --- Impact of Measuring Queue Length in Number of Bytes for n-ACK --- p.42
Chapter 6.1.3 --- Impact of Dummy Packets --- p.43
Chapter 6.1.4 --- Impact of Product k2β --- p.45
Chapter 6.1.5 --- Effects of Parameterβ --- p.47
Chapter 6.1.6 --- Effects of Parameter k --- p.49
Chapter 6.1.7 --- Overhead of n-ACK Solution --- p.50
Chapter 6.2 --- Multihop Wireless Networks Scenario --- p.52
Chapter 6.3 --- Multihop Networks with Wireless and Wired Links Scenario --- p.53
Chapter 7 --- Conclusions and Future Work --- p.56
Chapter 7.1 --- Conclusions --- p.56
Chapter 7.2 --- Future Work --- p.57
Chapter A --- Explanation to Starvation of TCP Reno over A-CSMA --- p.58
Chapter B --- TCP Reno over A-CSMA with AQM --- p.60
Chapter B.1 --- TCP Reno starves --- p.60
Chapter B.2 --- Explanation --- p.61
Bibliography --- p.64
Moraes, Ricardo Alexandre Reinaldo de. "Supporting Real-Time Communication in CSMA-Based Networks : the VTP-CSMA Virtual Token Passing Approach." Doctoral thesis, 2007. http://hdl.handle.net/10216/11298.
Full textMoraes, Ricardo Alexandre Reinaldo de. "Supporting Real-Time Communication in CSMA-Based Networks : the VTP-CSMA Virtual Token Passing Approach." Tese, 2007. http://hdl.handle.net/10216/11298.
Full textPhung, Van Phuc Trach. "Throughput analysis of CSMA/CF systems." Thesis, 1987. http://spectrum.library.concordia.ca/5426/1/ML50103.pdf.
Full textTzung-HanTu and 塗宗翰. "CSMA/CA-RBTv : An Enhanced Collision Avoidance CSMA/CA-based Media Access Protocol over the M2M Communication Environment." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/35qrjy.
Full text國立成功大學
資訊工程學系
103
Machine-to-Machine (M2M) communication is a machine-independent communication paradigm that can facilitate wired and wireless communications without the need for human intervention. However, as the number of network devices increases, the occurrence of collisions rises, which results in the efficiency of the MAC layer protocol being degraded and the power consumption being increased. To resolve this problem, this thesis proposes an enhanced IEEE 802.11 CSMA/CA media access scheme designated as CSMA/CA-RBTv, in which RBT denotes the Registered Backoff Time and v denotes vector. In the proposed CSMA/CA-RBTv, when a mobile node transmits data to the AP, it attaches a random number called the RBT, which denotes the next time slot the mobile node would like to transmit its next data packet, to the packet. Once the AP receives the packet, it extracts the RBT and adds it to a Registered-Time-Slot-List (RTSL) used to conduct channel access scheduling. Before transmitting the ACK packet to the mobile node, the AP (1) selects the node with the smallest RBT from the RTSL list as the next one to access the wireless channel and (2) uses RTSL to make a bit vector marking which time slots have been registered/reserved for data transmission, i.e., channel access. Finally, the AP appends the aforementioned two pieces of channel access information to the ACK packet. Since the ACK packet is transmitted in a broadcast manner, all of the mobile nodes which overhear the transmission know which node has the next right to access the channel and which time slots are still available for channel access. Consequently, the occurrence of collisions can be reduced, which also results in decreasing power consuming. The simulation results show that the proposed CSMA/CA-RBTv scheme results in a significant improvement in both the transmission performance and the energy efficiency of the M2M network as the number of mobile nodes increases.
Gurusamy, Vijay. "Service differentiation using p-persistent CSMA/CA." 2005. http://digital.library.okstate.edu/etd/umi-okstate-1629.pdf.
Full text"Performance and control of CSMA wireless networks." Thesis, 2010. http://library.cuhk.edu.hk/record=b6075260.
Full textThe above studies focus on computation and control of "equilibrium" link throughputs. Besides throughputs, an important performance measure in CSMA networks is the propensity for starvation. In this thesis, we show that links in CSMA wireless networks are particularly susceptible to "temporal" starvation. Specifically, certain links may have good equilibrium throughputs, yet they can still receive no throughput for extended periods from time to time. We develop a "trap theory" to analyze temporal throughput fluctuations. The trap theory serves two functions. First, it allows us to derive new mathematical results that shed light on the transient behavior of CSMA networks. Second, we can develop automated analytical tools for computing the "degrees of starvation" for CSMA networks to aid network design. We believe that the ability to identify and characterize temporal starvation as established in this thesis will serve as an important first step toward the design of effective remedies for it.
This thesis investigates the performance and control of CSMA wireless networks. To this end, an analytical model of CSMA wireless networks that captures the essence of their operation is important. We propose an Ideal CSMA Network (ICN) model to characterize the dynamic of the interactions and dependency of links in CSMA wireless networks. This model allows us to address various issues related to performance and control of CSMA networks.
We show that the throughput distributions of links in ICN can be computed from a continuous-time Markov chain and are insensitive to the distributions of the transmission time (packet duration) and the backoff countdown time in the CSMA MAC protocol given the ratio of their means rho, referred to as the access intensity. An outcome of the ICN model is a Back-of-the-Envelope (BoE) approximate computation method that allows us to bypass complicated stochastic analysis to compute link throughputs in many network configurations quickly. The BoE computation method emerges from ICN in the limit rho → infinity. Our results indicate that BoE is a good approximation technique for modest-size networks such as those typically seen in 802.11 deployments. Beyond serving as the foundation for BoE, the theoretical framework of ICN is also a foundation for understanding and optimization of large CSMA networks.
Kai, Caihong.
Adviser: Soung Chang Liew.
Source: Dissertation Abstracts International, Volume: 73-03, Section: B, page: .
Thesis (Ph.D.)--Chinese University of Hong Kong, 2010.
Includes bibliographical references (leaves 180-183).
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.
Lu, Wei, and 盧. 瑋. "Performance Evaluation of CSMA/CA on CC2530." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/q2fthj.
Full text國立暨南國際大學
電機工程學系
103
Wireless networks are widely popular in modern. The collision occurring is one of the reasons affecting the transmission efficiency. To mitigate the collision issue, the carrier sensing multiple access with collision avoidance (CSMA/CA) protocol is widely applied in wireless networks. IEEE 802.11 DCF protocol and IEEE 802.15.4 CSMA/CA protocol are the most well-known CSMA/CA based protocols. The primary difference between them is how carrier sensing is performed. Stations continuously sense the medium before transmissions in an IEEE 802.11 network, while stations in an IEEE 802.15.4 network only sense once after backoff operation. The thesis is mainly about software architecture design of the IEEE 802.11 DCF protocol on an IEEE 802.15.4 transceiver. Experiment results show that, without continuously sensing, the transmission failure probability of IEEE 802.15.4 CSMA/CA increases dramatically with the network size. Consequently, the IEEE 802.11 DCF protocol provides better performance in the packet loss probability and throughput than IEEE 802.15.4 CSMA/CA does.
ZENG, ZHONG-YONG, and 曾中庸. "Performance analysis of buffered csma relative protocols." Thesis, 1992. http://ndltd.ncl.edu.tw/handle/53081972897279159827.
Full textJhuang, Yong-Yi, and 莊詠驛. "Implementation of CSMA/CA Protocol on CC2530." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/37595940265865814246.
Full text國立暨南國際大學
電機工程學系
101
In IEEE 802.15.4 networks, routers cannot enter sleep mode to reduce power consumption and runs out of battery power quickly. In addition, the implementation of CSMA/CA protocol in IEEE 802.15.4 is different from that in IEEE 802.11. Because a node does not perform channel sensing during backoff, a collision may occurs when a node transmit a packet. As a result, IEEE 802.15.4 is unsuitable for wireless sensor networks (WSN). In this thesis, we design and implement the CSMA / CA protocol based on IEEE 802.11 by TI CC2530 for wireless sensor networks. For hardware-related programming, we have implemented the RF driver, the MAC Timer driver, the interrupt service routines, the channel sensing mechanism, and the two-way handshaking CSMA/CA protocol. A prototype platform was built and packets are successfully delivered between multiple nodes. In the future, the platform can be extended to a complete media access control (MAC) layer suitable for wireless sensor networks, such as the well-know S-MAC.
"Markov modulated CSMA protocols with backoff scheduling algorithms." Thesis, 2011. http://library.cuhk.edu.hk/record=b6075338.
Full textIn 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.