Erlangen-Nürnberg, Univ., Diss., 2009.

Thesis (Ph. D.)--University of Washington, 2005. / Vita. Includes bibliographical references (leaves 141-147).

Paderborn, University, Diss., 2005.

Zugl.: Paderborn, Universiẗat, Diss., 2004.

Thesis (Ph.D.)--Cornell University, 2002. / Adviser: Eva Tardos. Includes bibliographical references.

Routing in highly dynamic wireless networks such as Vehicular Ad-hoc Networks (VANETs) is a challenging task due to frequent topology changes. Sustaining a transmission path between peers in such network environment is difficult. In this thesis, Previous Hop Routing (PHR) is poposed; an opportunistic forwarding protocol exploiting previous hop information and distance to destination to make the forwarding decision on a packet-by-packet basis. It is intended for use in highly dynamic network where the life time of a hop-by-hop path between source and destination nodes is short. Exploiting the broadcast nature of wireless communication avoids the need to copy packets, and enables redundant paths to be formed. To save network resources, especially under high network loads, PHR employs probabilistic forwarding. The forwarding probability is calculated based on the perceived network load as measured by the arrival rate at the network interface. We evaluate PHR in an urban VANET environment using NS2 (for network traffic) and SUMO (for vehicular movement) simulators, with scenarios configured to re ect real-world conditions. The simulation scenarios are configured to use two velocity profiles i.e. Low and high velocity. The results show that the PHR networks able to achieve best performance as measured by Packet Delivery Ratio (PDR) and Drop Burst Length (DBL) compared to conventional routing protocols in high velocity scenarios.

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.

The automobile industry is constantly evolving and adapting to consumer demands. Automakers are constantly shaping their manufacturing and business processes to more accurately fit the market as well as reduce costs and maximize profits. Along with it, the customer expectations of vehicle quality, reliability, safety, and utility are also at an all-time high. After development, testing the developed system with various evaluation methods is important for the validation and verification of automotive systems. One of the most important evaluation methods for testing automotive systems from the automotive divisions like the power-train systems and ADAS is conducting test drives. Currently, the automotive divisions at Bosch have fixed routes that were planned manually. There is no routing solution, with updated map information and visualization of the route based on some automotive parameters, that can help them with planning the test drives for verifying their automotive systems. This thesis is based on providing a routing solution to engineers which will help them in planning routes based on the required determinants. This thesis report gives an analysis of the whole hypothesis of routing in the initial two chapters. Some fundamentally distinct routing methods and algorithms were examined. Research on some existing open source routing engines and complicated routing scenarios was also done. The outcome of this thesis is a 'TestRide planner' which provides basic routing solution with some extra route visualization functionality. Algorithms for two complex routing functions of distance-constrained routing and RDE-constraint routing were also composed.

No description available.

The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach.