No description available.

Vehicular communication has been an emerging topic among current wireless research. The vehicular communication can be classified to Inter-Vehicle Communication (IVC) and Road-to-Vehicle Communication (RVC). IVC and RVC support applications mainly on two aspects: safety applications aiming to reduce dangers on the road, and data applications aiming to provide information and entertainment to people on traveling. Vehicles nearby form Vehicular Ad hoc Networks (VANETs) without any fixed infrastructures. Due to the characteristics of vehicular networks such as quickly changing and unstable network topology, IVC has special requirements to the network protocols. Several MAC protocols have been appeared or improved based on previous work for IVC. But these protocols are designed either for QoS guaranteed data service or for reliable message broadcast. There is not a protocol including both application requirements and inexpensive to implement as well. MAC protocol for vehicular communication hasn’t been finalized. In this thesis, an overlay token ring protocol (OTRP) is proposed which can work on MAC layer with broadcast function and taking into the IVC features into consideration. In OTRP, vehicles are grouped to overlapped rings with a token passed in each ring as the sole right for transmission. The ring is dynamically updated in a distributed manner based on smart algorithm at each node. OTRP provides bounded delay by assigning maximum token holding time for each node. It also reduces collisions by decreasing the number of contention nodes by times of ring size. Fair and high throughput is obtained as well. Furthermore, it provides reliable and prompt broadcast of emergency messages by pre-emptively transmitting while applying the token as an acknowledgement. The time nodes reliably receive the message is within limit. Theoretical analysis is provided and simulation results are given to evaluate the performance of OTRP under saturated traffic conditions both in safety and data applications.

Vehicular communication has been an emerging topic among current wireless research. The vehicular communication can be classified to Inter-Vehicle Communication (IVC) and Road-to-Vehicle Communication (RVC). IVC and RVC support applications mainly on two aspects: safety applications aiming to reduce dangers on the road, and data applications aiming to provide information and entertainment to people on traveling. Vehicles nearby form Vehicular Ad hoc Networks (VANETs) without any fixed infrastructures. Due to the characteristics of vehicular networks such as quickly changing and unstable network topology, IVC has special requirements to the network protocols. Several MAC protocols have been appeared or improved based on previous work for IVC. But these protocols are designed either for QoS guaranteed data service or for reliable message broadcast. There is not a protocol including both application requirements and inexpensive to implement as well. MAC protocol for vehicular communication hasn’t been finalized. In this thesis, an overlay token ring protocol (OTRP) is proposed which can work on MAC layer with broadcast function and taking into the IVC features into consideration. In OTRP, vehicles are grouped to overlapped rings with a token passed in each ring as the sole right for transmission. The ring is dynamically updated in a distributed manner based on smart algorithm at each node. OTRP provides bounded delay by assigning maximum token holding time for each node. It also reduces collisions by decreasing the number of contention nodes by times of ring size. Fair and high throughput is obtained as well. Furthermore, it provides reliable and prompt broadcast of emergency messages by pre-emptively transmitting while applying the token as an acknowledgement. The time nodes reliably receive the message is within limit. Theoretical analysis is provided and simulation results are given to evaluate the performance of OTRP under saturated traffic conditions both in safety and data applications.

This thesis investigated the performance of a positioning system that utilised UWB technology where devices regularly shifts between acting as an initiator and as a responder for distance measurements between each other. The goal was to investigate existing positional techniques and to implement a novel network where devices initiates and responds to distance measurement exchanges. Additionally, the intention of this positioning system is to prevent severe work accidents and reduce vehicle congestion costing lives, money and time in industrial workplace environments. In the thesis, two ranging techniques, skew-aware single-sided two-way ranging (SASS-TWR) and asymmetric double-sided two-way ranging (ADS-TWR) were compared to each other as well as two MAC protocols, CSMA/CA and the token ring protocol. Results showed that SASS-TWR and ADS-TWR had similar precision, but SASS-TWR was faster, making it the preferred option in a positioning system. For the MAC protocols, simulations showed that the token ring protocol outperformed CSMA/CA but had a major flaw in its current implementation with the lack of recoverability in cases where devices in the network stops functioning or leaves. The conclusion is that both ranging techniques are viable options, and for the MAC protocols, CSMA/CA could be used but lacks scalability. The token ring protocol outperformed CSMA/CA in speed and scalability but requires improvements in recoverability before it could be used in a positional system intended for the industrial workplace.

O protocolo Token Ring sem o (WTRP) é um protocolo distribuído de controle de acesso ao meio que provê qualidade de serviço em termos de uso de largura de banda e latência limitada. WTRP consiste de nós (estações) que formam topologicamente um anel. Contudo, quando o número de nós em um anel aumenta a latência aumenta e o tempo de reuso de token por parte de um nó em anel também aumenta. Neste trabalho, apresentamos uma versão extendida de WTRP com foco em reduzir a latência, tempo de reuso de token e permitir encaminhamento de dados entre anéis sem aumentar signicativamente o consumo de energia. Para provar o conceito que propomos, implementamos e testamos a nossa versão de WTRP usando simulador de rede - NS. / Wireless Token Ring Protocol (WTRP) is a distributed Medium Access Control protocol that provides quality of service in terms of reserved bandwidth and limited latency]. It consists of nodes or stations structured in ring topology. However, when the number of nodes in a ring increases latency and time of a node reuse token increases. In this work, we present an extended version WTRP that focus on reducing latency, time of token reuse and data forwarding among the rings in a MANet , without suggestive increasing of energy consumption. We have implemented and tested our version of WTRP in network simulator - NS.

O protocolo Token Ring sem o (WTRP) é um protocolo distribuído de controle de acesso ao meio que provê qualidade de serviço em termos de uso de largura de banda e latência limitada. WTRP consiste de nós (estações) que formam topologicamente um anel. Contudo, quando o número de nós em um anel aumenta a latência aumenta e o tempo de reuso de token por parte de um nó em anel também aumenta. Neste trabalho, apresentamos uma versão extendida de WTRP com foco em reduzir a latência, tempo de reuso de token e permitir encaminhamento de dados entre anéis sem aumentar signicativamente o consumo de energia. Para provar o conceito que propomos, implementamos e testamos a nossa versão de WTRP usando simulador de rede - NS. / Wireless Token Ring Protocol (WTRP) is a distributed Medium Access Control protocol that provides quality of service in terms of reserved bandwidth and limited latency]. It consists of nodes or stations structured in ring topology. However, when the number of nodes in a ring increases latency and time of a node reuse token increases. In this work, we present an extended version WTRP that focus on reducing latency, time of token reuse and data forwarding among the rings in a MANet , without suggestive increasing of energy consumption. We have implemented and tested our version of WTRP in network simulator - NS.

Thesis (doctoral)--Universität St. Gallen, 2000.

Ring networks are appropriate for the full range of network levels, including multiprocessor systems, local area computer networks and high speed backbones. The most well known and widely implemented examples are the IBM token ring and FDDI networks. Ring networks have the advantages of high channel utilisation and bounded delay if an n-limited service policy is used. The packet transfer delay, defined as the average time a packet spends in the network from the time it is generated until the time it is received at its destination node, improves with the number of rings on which a node is connected. However, many ring connections are not economically feasible since the cost of the ring interface increases with the number of rings. There has been an abundance of previous work on single token ring networks. A number of papers on slotted rings, register insertion rings and more complex ring architectures have also been published. However, there is very little existing literature on multiple ring networks as well as ring networks in clustered traffic environments, i.e. where nodes from the same cluster tend to communicate more with each other than with other nodes in the network. This thesis focuses on two network topologies that make use of multiple rings and are well suited to clustered traffic environments: the two-connected multiple ring (2-MR) and the destination removal double ring (DRDR). For the 2-MR network, three different practical token-based protocols are investigated in an attempt to optimise performance. It is further shown that significant performance improvements can be achieved by employing a slotted ring protocol rather than the token ring protocol. The DRDR network is also examined and its performance compared to the aforementioned architectures. For each of the six cases, both random and clustered traffic patterns are considered and compared. Analytical results are derived which are verified by results obtained from computer simulations. Furthermore, we look at exact methods of analysing ring networks. A mean value analysis of a single token ring network with a I-limited service discipline is performed, which clearly shows the complexity exact methods introduce. Finally, although it has been stated in the literature that an exact analysis of a multiple symmetrical token ring network is intractable, we present a novel Markov chain approach that gives exact results for near zero loads. / Thesis (M.Sc.-Electronic Engineering)-University of Natal, 1998.

STANAG 5066 Edition 2 is a node-to-node protocol developed by NATO in order to communicate via HF media. IP integration is made to be able to spread the use of STANAG 5066 protocol. However, this integration made the communication much slower which is already slow. In order to get faster the speed and communicate within single-frequency multi-node network, HFTRP, which is a derivative of WTRP, is developed. This protocol is in two parts, first is a message design for management tokens exchanged by communicating nodes, and second is the algorithms used to create, maintain, and repair the ring of nodes in the network. Scope of this thesis is to find out a faster ring setup, growing procedure and to implement. Beside, finding optimum values of tuning parameters for HFTRP is also in the scope of this thesis.