Open Access. Powered by Scholars. Published by Universities.®

Digital Communications and Networking Commons™

Open Access. Powered by Scholars. Published by Universities.®

2009

Discipline
Institution
Keyword
Publication
Publication Type

Articles 61 - 67 of 67

Full-Text Articles in Digital Communications and Networking

Supporting Protocols For Structuring And Intelligent Information Dissemination In Vehicular Ad Hoc Networks, Filip Cuckov Jan 2009

Supporting Protocols For Structuring And Intelligent Information Dissemination In Vehicular Ad Hoc Networks, Filip Cuckov

Electrical & Computer Engineering Theses & Dissertations

The goal of this dissertation is the presentation of supporting protocols for structuring and intelligent data dissemination in vehicular ad hoc networks (VANETs). The protocols are intended to first introduce a structure in VANETs, and thus promote the spatial reuse of network resources. Segmenting a flat VANET in multiple cluster structures allows for more efficient use of the available bandwidth, which can effectively increase the capacity of the network. The cluster structures can also improve the scalability of the underlying communication protocols. The structuring and maintenance of the network introduces additional overhead. The aim is to provide a mechanism for …


Minimizing Spatial And Time Reservation With Collision-Aware Dcf In Mobile Ad Hoc Networks, Lubo Song, Chansu Yu Jan 2009

Minimizing Spatial And Time Reservation With Collision-Aware Dcf In Mobile Ad Hoc Networks, Lubo Song, Chansu Yu

Electrical and Computer Engineering Faculty Publications

Carrier sensing is widely adopted in wireless communication to protect data transfers from collisions. For example, distributed coordination function (DCF) in IEEE 802.11 standard renders a node to defer its communication if it senses the medium busy. For the duration of deferment, each frame carries, in its MAC header, a 16-bit number in microseconds during which any overhearing node must defer. However, even if the carrier signal is detected, both ongoing and a new communication can be simultaneously successful depending on their relative positions in the network or equivalently, their mutual interference level. Supporting multiple concurrent communications is …


A Covert Encryption Method For Applications In Electronic Data Interchange, Jonathan Blackledge, Dmitry Dubovitskiy Jan 2009

A Covert Encryption Method For Applications In Electronic Data Interchange, Jonathan Blackledge, Dmitry Dubovitskiy

Articles

A principal weakness of all encryption systems is that the output data can be ‘seen’ to be encrypted. In other words, encrypted data provides a ‘flag’ on the potential value of the information that has been encrypted. In this paper, we provide a new approach to ‘hiding’ encrypted data in a digital image.

In conventional (symmetric) encryption, the plaintext is usually represented as a binary stream and encrypted using an XOR type operation with a binary cipher. The algorithm used is ideally designed to: (i) generate a maximum entropy cipher so that there is no bias with regard to any …


Multicast Encryption Infrastructure For Security In Sensor Networks, Richard R. Brooks, Brijesh Pillai, Matthew Pirretti, Michele C. Weigle Jan 2009

Multicast Encryption Infrastructure For Security In Sensor Networks, Richard R. Brooks, Brijesh Pillai, Matthew Pirretti, Michele C. Weigle

Computer Science Faculty Publications

Designing secure sensor networks is difficult. We propose an approach that uses multicast communications and requires fewer encryptions than pairwise communications. The network is partitioned into multicast regions; each region is managed by a sensor node chosen to act as a keyserver. The keyservers solicit nodes in their neighborhood to join the local multicast tree. The keyserver generates a binary tree of keys to maintain communication within the multicast region using a shared key. Our approach supports a distributed key agreement protocol that identifies the compromised keys and supports membership changes with minimum system overhead. We evaluate the overhead of …


Survivable Mesh-Network Design & Optimization To Support Multiple Qop Service Classes, Hoang N. Nguyen Jan 2009

Survivable Mesh-Network Design & Optimization To Support Multiple Qop Service Classes, Hoang N. Nguyen

Theses: Doctorates and Masters

Every second, vast amounts of data are transferred over communication systems around the world, and as a result, the demands on optical infrastructures are extending beyond the traditional, ring-based architecture. The range of content and services available from the Internet is increasing, and network operations are constantly under pressure to expand their optical networks in order to keep pace with the ever increasing demand for higher speed and more reliable links.


High-Performance Broadcast And Multicast Protocols For Multi-Radio Multi-Channel Wireless Mesh Networks, Jun Wang Jan 2009

High-Performance Broadcast And Multicast Protocols For Multi-Radio Multi-Channel Wireless Mesh Networks, Jun Wang

Electrical & Computer Engineering Theses & Dissertations

Recently, wireless mesh networks (WMNs) have attracted much attention. A vast amount of unicast, multicast and broadcast protocols has been developed for WMNs or mobile ad hoc networks (MANETs). First of all, broadcast and multicast in wireless networks are fundamentally different from the way in which wired networks function due to the well-known wireless broadcast/multicast advantage. Moreover, most broadcast and multicast protocols in wireless networks assume a single-radio single-channel and single-rate network model, or a generalized physical model, which does not take into account the impact of interference. This dissertation focuses on high-performance broadcast and multicast protocols designed for multi-radio …


Hierarchical Routing In Manets Using Simple Clustering, Adam Carnine Jan 2009

Hierarchical Routing In Manets Using Simple Clustering, Adam Carnine

UNLV Theses, Dissertations, Professional Papers, and Capstones

This thesis presents both a review of current MANET routing protocols and a new MANET routing algorithm. The routing protocols reviewed include representative samples from the three primary forms of routing found in MANETS: proactive routing, reactive routing and hybrid routing. Secure algorithms are given special treatment in the review. In addition several protocol enhancements are discussed.

The proposed routing protocol is designed to support networks of a medium size, containing over 200 nodes but less than 3,000 nodes. The design is intentionally simple to allow ease of implementation in comparison with other MANET protocols that provide similar functionality.