Spelling suggestions: "subject:"douting"" "subject:"bouting""
91 |
Cognitive Diversity Routing in Wireless Sensor NetworksEL-JABI, ZOUHEIR, 25 August 2010 (has links)
Energy efficiency and network lifetime are key factors in characterizing wireless sensor networks due to the nodes having a finite and exhaustible source of energy. Due to the nodes limited energy, it is vital to have the node functioning for as long as possible otherwise it will render the technology futile. Transmission is the most energy consuming activity a node undertakes, therefore by decreasing the number of unnecessary transmissions, the energy consumption in the nodes decreases significantly. In order to reduce unnecessary transmissions, energy-efficient data dissemination techniques have been developed to deliver the data using the minimum number of necessary transmissions. The topic of this thesis is to develop a routing protocol that will extend the network lifetime by introducing cognition to routing. Cognitive routing is an approach to make nodes more intelligent by utilizing information from the lower layers and network in order to make more informant decisions. Data from the physical layer can relay important information about the state of the node, its neighbors, and the surrounding environment hence enabling the node to make energy-efficient and aware decisions. The routing protocol formulates an energy profile, a channel profile and a traffic profile in order to make adapted and intelligent decisions. Diversity routing is used to increase the reliability of transmissions in the network to reduce unnecessary transmissions as communication is the primary reason for energy consumption in wireless sensor networks. Combining these two approaches in one protocol allows for cognitive routing to operate based on energy constraints obtained from the lower levels hence optimizing the process yielding a longer network lifetime. / Thesis (Master, Electrical & Computer Engineering) -- Queen's University, 2010-08-25 11:27:09.887
|
92 |
Cache architectures to improve IP lookupsRavinder, Sunil Unknown Date
No description available.
|
93 |
Non-bifurcated routing and scheduling in wireless mesh networksMahmood, Abdullah-Al Unknown Date
No description available.
|
94 |
Multipath route construction methods for wireless sensor networksRizvi, Saad 06 June 2013 (has links)
Routing plays an important role in energy constrained Wireless Sensor Networks (WSNs). To conserve energy in WSN, energy-efficiency of the routing protocol is an important design consideration. These protocols should maximize network lifetime and minimize energy consumption. In this thesis, a novel multipath routing protocol is proposed for WSNs, which constructs multiple paths based on residual energy of the nodes. The protocol allows the source node to select a path for data transmission from the set of discovered multiple paths based on cumulative residual energy or variance. Choosing a next-hop node based on energy, and using an alternative path for routing achieves load balancing. The results show that the proposed algorithm M-VAR has lower residual energy variance (96%, 90%, 72%, 12% less) and longer network lifetime (404%, 205%, 115%, 10%) than basic Directed Diffusion, load-balanced Directed Diffusion (LBDD-ED-RD), multipath Directed Diffusion (MDD-CRE), and the proposed algorithm M-CRE, respectively.
|
95 |
Multipath route construction methods for wireless sensor networksRizvi, Saad 06 June 2013 (has links)
Routing plays an important role in energy constrained Wireless Sensor Networks (WSNs). To conserve energy in WSN, energy-efficiency of the routing protocol is an important design consideration. These protocols should maximize network lifetime and minimize energy consumption. In this thesis, a novel multipath routing protocol is proposed for WSNs, which constructs multiple paths based on residual energy of the nodes. The protocol allows the source node to select a path for data transmission from the set of discovered multiple paths based on cumulative residual energy or variance. Choosing a next-hop node based on energy, and using an alternative path for routing achieves load balancing. The results show that the proposed algorithm M-VAR has lower residual energy variance (96%, 90%, 72%, 12% less) and longer network lifetime (404%, 205%, 115%, 10%) than basic Directed Diffusion, load-balanced Directed Diffusion (LBDD-ED-RD), multipath Directed Diffusion (MDD-CRE), and the proposed algorithm M-CRE, respectively.
|
96 |
Realistic, Efficient and Secure Geographic Routing in Vehicular NetworksZhang, Lei 10 March 2015 (has links)
It is believed that the next few decades will witness the booming development of the Internet of Things (IoT). Vehicular network, as a significant component of IoT, has attracted lots of attention from both academia and industry in recent years. In the field of vehicular networks, Vehicular Ad hoc NETwork (VANET) is one of the hottest topics investigated. This dissertation focuses on VANET geocast, which is a special form of multicast in VANET. In geocast, messages are delivered to a group of destinations in the network identified by their geographic locations. Geocast has many promising applications, i.e., geographic messaging, geographic advertising and other location-based services. Two phases are usually considered in the geocast process: phase one, message delivery from the message source to the destination area by geographic routing; phase two, message broadcast within the destination area.
This dissertation covers topics in the two phases of geocast in urban VANETs, where for phase one, a data-driven geographic routing scheme and a security and privacy preserving framework are presented; and for phase two, the networking connectivity is analyzed and studied. The contributions of this dissertation are three-fold.
First, from a real-world data trace study, this dissertation studies the city taxi- cab mobility. It proposes a mobility-contact-aware geocast scheme (GeoMobCon)for metropolitan-scale urban VANETs. The proposed scheme employs the node mobility (two levels, i.e., macroscopic and microscopic mobilities) and contact history information. A buffer management scheme is also introduced to further improve the performance.
Second, this dissertation investigates the connectivity of the message broadcast in urban scenarios. It models the message broadcast in urban VANETs as the directed connectivity problem on 2D square lattices and proposes an algorithm to derive the exact analytical solution. The approach is also applied to urban VANET scenarios, where both homogeneous and heterogeneous vehicle density cases are considered.
Third, this work focuses on the security and privacy perspectives of the opportunistic routing, which is the main technique utilized by the proposed geographic routing scheme. It proposes a secure and privacy preserving framework for the general opportunistic-based routing. A comprehensive evaluation of the framework is also provided.
In summary, this dissertation focuses on a few important aspects of the two phases of VANET geocast in urban scenarios. It shows that the vehicle mobility and contact information can be utilized to improve the geographic routing performance for large- scale VANET systems. Targeting at the opportunistic routing, a security and privacy preserving framework is proposed to preserve the confidentiality of the routing metric information for the privacy purpose, and it also helps to achieve the anonymous authentication and efficient key agreement for security purposes. On the other hand, the network connectivity for the message broadcast in urban scenarios is studied quantitatively with the proposed solution, which enables us to have a better understanding of the connectivity itself and its impact factors (e.g., bond probability and network scale). / Graduate
|
97 |
A greedy algorithm for non-atomic data dissemination in publish/subscribe network /Barua, Chowdhury Sucharit, January 2007 (has links)
Thesis (M.S.)--University of Texas at Dallas, 2007. / Includes vita. Includes bibliographical references (leaves 62-63)
|
98 |
Stabile Kommunikation in dynamischen Ad-hoc-NetzenGerharz, Michael January 2006 (has links)
Zugl.: Bonn, Univ., Diss., 2006
|
99 |
Routing protocols for mobile ad hoc networks classification, evaluation and challengesLang, Daniel January 2006 (has links)
Zugl.: München, Techn. Univ., Diss., 2006 u.d.T.: Lang, Daniel: On the evaluation and classification of routing protocols for mobile ad hoc networks / Hergestellt on demand
|
100 |
Implementation and performance measurement and analysis of OLSR protocol /Sinky, Hassan Hussein. January 1900 (has links)
Thesis (M.S.)--Oregon State University, 2010. / Printout. Includes bibliographical references (leaves 28-29). Also available on the World Wide Web.
|
Page generated in 0.0632 seconds