Spelling suggestions: "subject:"5ource douting"" "subject:"5ource bouting""
1 |
Throughput Of Wireless Mesh Networks : An Experimental StudyRamachandran, P 04 1900 (has links) (PDF)
Mesh network is gaining importance as the next generation network for many high speed applications such as multimedia streaming. This is because it is easy and inexpensive to setup mesh networks with mobile and PDA devices and can be used as a private network. Hence research is active in the field of routing protocols and routing metrics to improve the mesh network performance. Though most of the protocols are evaluated based on simulation, we implemented protocols based on a few metrics like Expected Transmission Count (ETX) Per-hop Packet Pair Delay (Pkt Pair) and WCETT (Weighted Cumulative Expected Transmitted Time) to investigate the performance of the network through experiments. An advanced version of DSR protocol called LQSR (Link Quality Source Routing) protocol of Microsoft Research along with MCL (Mesh Connectivity Layer) allows multiple heterogeneous adapters to be used in mesh network. Since wireless adapters of 802.11a standard offer 12 non-interfering channels and 802.11b/g standard offer 3 non-interfering channels, using multiple adapters of different bands operating on non-interfering channels to improve capacity and robustness of mesh networks was also investigated.
In this thesis we explore the possibility of increasing the coverage area of Wireless Mesh Networks (WMN) to enhance the capacity of WMN and minimize the problems due to interference. Theoretical achievable capacity to every node in a random
static wireless ad-hoc network with ideal routing is known to be where n is
the total number of nodes in the network. Therefore, with increasing number of nodes in a network, throughput drops significantly. Our measurements show that throughput in a single WMN for different path length is closer to the throughput with nodes across two WMNs of the same path length. We propose to interconnect the networks by using multiple wireless adapters in a gateway node configured with the SSID of the networks in operation. We exploit the DSR protocol feature of assigning locally unique interface indices to its adapters.
Performance of a network depends heavily on the metrics used for routing packets. Different metrics were studied in the thesis by setting up a 10-node testbed with a combination of nodes with single and two radios. Testbed was partitioned into two networks with two gateway nodes. Performance of multi-radio performance with the above metrics was compared with baseline single radio nodes in the network with the same metric. It is found that multi-radio nodes out-perform single radio nodes in the multi-hop scenario. Also, operating multi-mesh networks using multiple interfaces configured to those networks in a gateway node increases the coverage area and robustness without loss of performance.
|
2 |
Non-cooperative beaconing control in vehicular ad hoc networksGoudarzi, Forough January 2017 (has links)
The performance of many protocols and applications of Vehicular Ad hoc Networks (VANETs), depends on vehicles obtaining enough fresh information on the status of their neighbouring vehicles. This should be fulfilled by exchanging Basic Safety Messages (BSMs) also called beacons using a shared channel. In dense vehicular conditions, many of the beacons are lost due to channel congestion. Therefore, in such conditions, it is necessary to control channel load at a level that maximizes BSM dissemination. To address the problem, in this thesis algorithms for adaptation of beaconing to control channel load are proposed. First, a position-based routing protocol for VANETs is proposed and the requirement of adaptive beaconing to increase the performance of the protocol is indicated. The routing protocol is traffic-aware and suitable for city environments and obtains real-time traffic information in a completely ad hoc manner without any central or dedicated control, such as traffic sensors, roadside units, or information obtained from outside the network. The protocol uses an ant-based algorithm to find a route that has optimum network connectivity. Using information included in small control packets called ants, vehicles calculate a weight for every street segment that is proportional to the network connectivity of that segment. Ant packets are launched by vehicles in junction areas. To find the optimal route between a source and destination, a source vehicle determines the path on a street map with the minimum total weight for the complete route. The correct functionality of the protocol design has been verified and its performance has been evaluated in a simulation environment. Moreover, the performance of the protocol in different vehicular densities has been studied and indicated that in dense vehicular conditions the performance of the protocol degrades due to channel load created by uncontrolled periodic beaconing. Then, the problem of beaconing congestion control has been formulated as non-cooperative games, and algorithms for finding the equilibrium point of the games have been presented. Vehicles as players of the games adjust their beacon rate or power or both, based on the proposed algorithms so that channel load is controlled at a desired level. The algorithms are overhead free and fairness in rate or power or both rate and power allocation are achieved without exchanging excess information in beacons. Every vehicle just needs local information on channel load while good fairness is achieved globally. In addition, the protocols have per-vehicle parameters, which makes them capable of meeting application requirements. Every vehicle can control its share of bandwidth individually based on its dynamics or requirements, while the whole usage of the bandwidth is controlled at an acceptable level. The algorithms are stable, computationally inexpensive and converge in a short time, which makes them suitable for the dynamic environment of VANETs. The correct functionality of the algorithms has been validated in several high density scenarios using simulations.
|
3 |
Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion TechniquesEbada, Mohamed 18 April 2011 (has links)
In this thesis, an investigation of the performance of multipath routing in Wireless Sensor Networks (WSN) is performed. The communication in the network under study is to take place from individual nodes to the sink node. The investigation involved multipath finding methods in WSN. Also, it involves investigating the weight assignment, traffic splitting and route selection methods for the different paths discovered by each node in the WSN. Also, a comparison between Hybrid Routing Protocol, Source Routing Protocol and Diffusion Routing Protocol is performed. A simple traffic routing algorithm for each routing protocol has been developed to conceptualize how the network traffic is routed on a set of active paths. The investigation of the Hybrid, Source and Diffusion Routing Protocol involved using multiple paths simultaneously to transmit messages that belong to the same flow by using a weight assigned to each path and transmit each message as a whole. Finally, the power consumption and the QoS in terms of message delays for a WSN were investigated and compared between different protocols.
|
4 |
Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion TechniquesEbada, Mohamed 18 April 2011 (has links)
In this thesis, an investigation of the performance of multipath routing in Wireless Sensor Networks (WSN) is performed. The communication in the network under study is to take place from individual nodes to the sink node. The investigation involved multipath finding methods in WSN. Also, it involves investigating the weight assignment, traffic splitting and route selection methods for the different paths discovered by each node in the WSN. Also, a comparison between Hybrid Routing Protocol, Source Routing Protocol and Diffusion Routing Protocol is performed. A simple traffic routing algorithm for each routing protocol has been developed to conceptualize how the network traffic is routed on a set of active paths. The investigation of the Hybrid, Source and Diffusion Routing Protocol involved using multiple paths simultaneously to transmit messages that belong to the same flow by using a weight assigned to each path and transmit each message as a whole. Finally, the power consumption and the QoS in terms of message delays for a WSN were investigated and compared between different protocols.
|
5 |
Multi-Route Coding in Wireless Multi-Hop NetworksOkada, Hiraku, Nakagawa, Nobuyuki, Wada, Tadahiro, Yamazato, Takaya, Katayama, Masaaki 05 1900 (has links)
No description available.
|
6 |
Multi-Route Coding in Wireless Multi-Hop NetworksOKADA, Hiraku, NAKAGAWA, Nobuyuki, WADA, Tadahiro, YAMAZATO, Takaya, KATAYAMA, Masaaki 05 1900 (has links)
No description available.
|
7 |
Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion TechniquesEbada, Mohamed 18 April 2011 (has links)
In this thesis, an investigation of the performance of multipath routing in Wireless Sensor Networks (WSN) is performed. The communication in the network under study is to take place from individual nodes to the sink node. The investigation involved multipath finding methods in WSN. Also, it involves investigating the weight assignment, traffic splitting and route selection methods for the different paths discovered by each node in the WSN. Also, a comparison between Hybrid Routing Protocol, Source Routing Protocol and Diffusion Routing Protocol is performed. A simple traffic routing algorithm for each routing protocol has been developed to conceptualize how the network traffic is routed on a set of active paths. The investigation of the Hybrid, Source and Diffusion Routing Protocol involved using multiple paths simultaneously to transmit messages that belong to the same flow by using a weight assigned to each path and transmit each message as a whole. Finally, the power consumption and the QoS in terms of message delays for a WSN were investigated and compared between different protocols.
|
8 |
Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion TechniquesEbada, Mohamed January 2011 (has links)
In this thesis, an investigation of the performance of multipath routing in Wireless Sensor Networks (WSN) is performed. The communication in the network under study is to take place from individual nodes to the sink node. The investigation involved multipath finding methods in WSN. Also, it involves investigating the weight assignment, traffic splitting and route selection methods for the different paths discovered by each node in the WSN. Also, a comparison between Hybrid Routing Protocol, Source Routing Protocol and Diffusion Routing Protocol is performed. A simple traffic routing algorithm for each routing protocol has been developed to conceptualize how the network traffic is routed on a set of active paths. The investigation of the Hybrid, Source and Diffusion Routing Protocol involved using multiple paths simultaneously to transmit messages that belong to the same flow by using a weight assigned to each path and transmit each message as a whole. Finally, the power consumption and the QoS in terms of message delays for a WSN were investigated and compared between different protocols.
|
9 |
Efficient Bandwidth Constrained Routing Protocols For Communication NetworksHadimani, Vijayalakshmi 05 1900 (has links)
QoS routing is one of the major building blocks for supporting QoS in communication networks and, hence, a necessary component of future communication networks. Bandwidth- Constrained Routing Algorithm (BCRA) may help to satisfy QoS requirements such as end-to-end delay, delay-jitter etc when WFQ-like (Weighted Fair Queuing) scheduling mechanisms are deployed. The existing algorithms for bandwidth constrained routing suffer from high message overhead and have a high computational and space complexity. The work presented in the thesis, therefore, focuses on the different techniques that an be used to reserve bandwidth for a unicast connection with low protocol overhead in terms of number of messages. We have compared the performance of the proposed routing algorithms using simulation studies with other bandwidth constrained routing algorithms. The call blocking ratio and message overhead have been used as the performance metric to compare the proposed algorithm with the existing ones.
We present three source routing algorithms for unicast connections satisfying the band- width requirement. The first two routing algorithms are based on the partitioning of the network. The link-state broadcasts are limited to the partition. In the first algorithm, the source node queries the other partitions for the state information on a connection request and computes the path based on the information received from the other partitions. The second algorithm is based on state aggregation. The aggregated state of other partitions is maintained at every node. The source node finds a feasible path based on the aggregated information. The path is expanded in every partition, if required, at the time of resource reservation. The third QoS routing algorithm uses the Distance Vector Tables to find a route for a connection. If the shortest path satisfies the bandwidth requirement, then it is selected; otherwise a random deviation is taken at the point where bandwidth requirement is not satisfied and shortest path algorithm is again followed. In all the three algorithms presented, the packets carry the entire path information to the destination node. Therefore, no per connection information is required to be maintained at the intermediate nodes. Simulation results indicate that the proposed algorithms indeed help educing the protocol overhead considerably, and at the same time they give comparable or better performance in terms of resource utilization across a wide range of workloads.
|
10 |
Design and evaluation of security mechanism for routing in MANETs : elliptic curve Diffie-Hellman cryptography mechanism to secure Dynamic Source Routing protocol (DSR) in Mobile Ad Hoc Network (MANET)Almotiri, Sultan H. January 2013 (has links)
Ensuring trustworthiness through mobile nodes is a serious issue. Indeed, securing the routing protocols in Mobile Ad Hoc Network (MANET) is of paramount importance. A key exchange cryptography technique is one such protocol. Trust relationship between mobile nodes is essential. Without it, security will be further threatened. The absence of infrastructure and a dynamic topology changing reduce the performance of security and trust in mobile networks. Current proposed security solutions cannot cope with eavesdroppers and misbehaving mobile nodes. Practically, designing a key exchange cryptography system is very challenging. Some key exchanges have been proposed which cause decrease in power, memory and bandwidth and increase in computational processing for each mobile node in the network consequently leading to a high overhead. Some of the trust models have been investigated to calculate the level of trust based on recommendations or reputations. These might be the cause of internal malicious attacks. Our contribution is to provide trustworthy communications among the mobile nodes in the network in order to discourage untrustworthy mobile nodes from participating in the network to gain services. As a result, we have presented an Elliptic Curve Diffie-Hellman key exchange and trust framework mechanism for securing the communication between mobile nodes. Since our proposed model uses a small key and less calculation, it leads to a reduction in memory and bandwidth without compromising on security level. Another advantage of the trust framework model is to detect and eliminate any kind of distrust route that contain any malicious node or suspects its behavior.
|
Page generated in 0.0669 seconds