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

Computer Engineering Commons

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

Articles 1 - 19 of 19

Full-Text Articles in Computer Engineering

Implementation Of The Aodv Routing In An Energy-Constrained Mesh Network, Altin Zejnullahu, Zhilbert Tafa Nov 2018

Implementation Of The Aodv Routing In An Energy-Constrained Mesh Network, Altin Zejnullahu, Zhilbert Tafa

International Journal of Business and Technology

Wireless sensor networks (WSNs) compose the fundamental platform for a number of Internet of Things (IoT) applications, especially those related to the environmental, health, and military surveillance. While being autonomous in power supply, the main challenge in node’s processing and communication architecture design remains the energy efficiency. However, this goal should not limit the main functionality of the system which is often related to the network coverage and connectivity.

This paper shows the implementation of the Ad-hoc On-demand Distance Vector (AODV) routing algorithm in an XBee based platform. As shown, the network can achieve low power consumption per node ...


Implementation Of The Aodv Routing In An Energy-Constrained Mesh Network, Altin Zejnullahu, Zhilbert Tafa Nov 2015

Implementation Of The Aodv Routing In An Energy-Constrained Mesh Network, Altin Zejnullahu, Zhilbert Tafa

UBT International Conference

Wireless sensor networks (WSNs) compose the fundamental platform for a number of Internet of Things (IoT) applications, especially those related to the environmental, health, and military surveillance. While being autonomous in power supply, the main challenge in node’s processing and communication architecture design remains the energy efficiency. However, this goal should not limit the main functionality of the system which is often related to the network coverage and connectivity. This paper shows the implementation of the Ad-hoc On-demand Distance Vector (AODV) routing algorithm in an XBee based platform. As shown, the network can achieve low power consumption per node ...


Forest Sign Maker, Victor Espinosa Iii, Kevin Ly, Lisa Yip Jun 2015

Forest Sign Maker, Victor Espinosa Iii, Kevin Ly, Lisa Yip

Mechanical Engineering

Executive Summary:

The Inyo National Forest is arguably one of the most beautiful locations in California, containing natural masterpieces such as Mount Whitney and the Ancient Bristlecone Pine Forest. Despite its magnificence, the Inyo National Forest can be a treacherous region. The Friends of the Inyo take pride in being able to facilitate the viewing experience for all outdoorsmen by maintaining the mountain trails, which includes providing adequate trail signage.

Unfortunately, there is a fundamental issue with the recent state of trail signage in the Inyo National Forest: the rate at which signs are being vandalized or naturally destroyed is ...


Design Of A Scalable Path Service For The Internet, Mehmet O. Ascigil Jan 2015

Design Of A Scalable Path Service For The Internet, Mehmet O. Ascigil

Theses and Dissertations--Computer Science

Despite the world-changing success of the Internet, shortcomings in its routing and forwarding system have become increasingly apparent. One symptom is an escalating tension between users and providers over the control of routing and forwarding of packets: providers understandably want to control use of their infrastructure, and users understandably want paths with sufficient quality-of-service (QoS) to improve the performance of their applications. As a result, users resort to various “hacks” such as sending traffic through intermediate end-systems, and the providers fight back with mechanisms to inspect and block such traffic.

To enable users and providers to jointly control routing and ...


Implementing Is-Is Routing And Dhcp Services In An Ipv4 Network, Laura Thompson Jan 2015

Implementing Is-Is Routing And Dhcp Services In An Ipv4 Network, Laura Thompson

Williams Honors College, Honors Research Projects

This research project explores the operation of the IS-IS routing protocol, as well as DHCP and DNS services provided by a Raspberry Pi computer. IS-IS is a routing protocol that is commonly ignored in most training and certification programs, because it is most frequently used by service providers. However, IS-IS solutions are also deployed in some large enterprise networks, making experience with the protocol a valuable skill.

In order to gain a deeper understanding of the routing domains, route propagation, and general operation of IS-IS, additional services were implemented in this project. A Raspberry Pi computer was used as an ...


Achieving Energy Efficiency On Networking Systems With Optimization Algorithms And Compressed Data Structures, Yanjun Yao May 2014

Achieving Energy Efficiency On Networking Systems With Optimization Algorithms And Compressed Data Structures, Yanjun Yao

Doctoral Dissertations

To cope with the increasing quantity, capacity and energy consumption of transmission and routing equipment in the Internet, energy efficiency of communication networks has attracted more and more attention from researchers around the world. In this dissertation, we proposed three methodologies to achieve energy efficiency on networking devices: the NP-complete problems and heuristics, the compressed data structures, and the combination of the first two methods.

We first consider the problem of achieving energy efficiency in Data Center Networks (DCN). We generalize the energy efficiency networking problem in data centers as optimal flow assignment problems, which is NP-complete, and then propose ...


Algorithms For Fault Tolerance In Distributed Systems And Routing In Ad Hoc Networks, Qiangfeng Jiang Jan 2013

Algorithms For Fault Tolerance In Distributed Systems And Routing In Ad Hoc Networks, Qiangfeng Jiang

Theses and Dissertations--Computer Science

Checkpointing and rollback recovery are well-known techniques for coping with failures in distributed systems. Future generation Supercomputers will be message passing distributed systems consisting of millions of processors. As the number of processors grow, failure rate also grows. Thus, designing efficient checkpointing and recovery algorithms for coping with failures in such large systems is important for these systems to be fully utilized. We presented a novel communication-induced checkpointing algorithm which helps in reducing contention for accessing stable storage to store checkpoints. Under our algorithm, a process involved in a distributed computation can independently initiate consistent global checkpointing by saving its ...


An Overview Of Using Directional Antennas In Wireless Networks, Hong-Ning Dai, Kam-Wing Ng, Min-You Wu Dec 2012

An Overview Of Using Directional Antennas In Wireless Networks, Hong-Ning Dai, Kam-Wing Ng, Min-You Wu

Hong-Ning Dai

Compared with omni-directional antennas, directional antennas have many merits, such as lower interference, better spatial reuse, longer transmission range and the improved network capacity. Directional antennas enable numerous emerging outdoor and indoor applications, which have been addressed in many recent studies. Despite the advances in wireless networks with directional antennas (DAWNs), there are many research challenges in all layers of DAWNs. This paper presents a detailed study on recent advances and open research issues on DAWNs. Firstly, we briefly introduce the classification of directional antennas, antenna radiation patterns, antenna modes as well as the challenges in the physical layer of ...


Optical-Wimax Hybrid Networks, Abdou R. A. Ahmed Apr 2011

Optical-Wimax Hybrid Networks, Abdou R. A. Ahmed

Electronic Thesis and Dissertation Repository

The emergence of bandwidth-intensive Internet services, such as
circuit-quality voice transfer and interactive video gaming, create
a high demand for a very qualified next-generation access network.
In addition to high bandwidth, these future access networks should
also provide improved network availability, flexibility, mobility,
reliability, failure protection, quality of service (QoS) support
and cost-effective access. The integration between optical networks
and Worldwide Interoperability for Microwave Access (WiMAX) is a
promising solution for future access networks. Accordingly, a few
different architectures and MAC protocol components have recently
been proposed for the integration between the Ethernet Passive
Optical Network (EPON) and WiMAX. However ...


On The Feasibility And Efficacy Of Protection Routing In Ip Networks, Kin Wah (Eric) Kwong, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang Feb 2011

On The Feasibility And Efficacy Of Protection Routing In Ip Networks, Kin Wah (Eric) Kwong, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang

Departmental Papers (ESE)

With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures, and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies, and offers added flexibility in computing routes that meet different criteria. However, it also introduces new challenges; especially in reacting to failures where centralization can increase latency. This paper leverages the flexibility afforded by centralized routing to address these challenges. Specifically, we explore when and how standby backup forwarding options ...


On The Feasibility And Efficacy Of Protection Routing In Ip Networks, Kin-Wah (Eric) Kwong, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang Oct 2010

On The Feasibility And Efficacy Of Protection Routing In Ip Networks, Kin-Wah (Eric) Kwong, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang

Lixin Gao

With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures, and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies, and offers added flexibility in computing routes that meet different criteria. However, it also introduces new challenges; especially in reacting to failures where centralization can increase latency. This paper leverages the flexibility afforded by centralized routing to address these challenges. Specifically, we explore when and how standby backup forwarding options ...


A Cross-Layer Modification To The Dsr Routing Protocol In Wireless Mesh Networks, Mustafa Ramadhan Sep 2010

A Cross-Layer Modification To The Dsr Routing Protocol In Wireless Mesh Networks, Mustafa Ramadhan

Doctoral

A cross-layer modification to the DSR routing protocol that finds high throughput paths in WMNs has been introduced in this work. The Access Efficiency Factor (AEF) has been introduced in this modification as a local congestion avoidance metric for the DSR routing mechanism as an alternative to the hop count (Hc) metric. In this modification, the selected path is identified by finding a path with the highest minimum AEF (max_min_AEF) value. The basis of this study is to compare the performance of the Hc and max_min_AEF as routing metrics for the DSR protocol in WMNs using the OPNET modeler. Performance ...


On The Feasibility And Efficacy Of Protection Routing In Ip Networks, Kin-Wah (Eric) Kwong, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang Dec 2009

On The Feasibility And Efficacy Of Protection Routing In Ip Networks, Kin-Wah (Eric) Kwong, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang

Departmental Papers (ESE)

With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures, and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies, and offers added flexibility in computing routes that meet different criteria. However, it also introduces new challenges; especially in reacting to failures where centralization can increase latency. This paper leverages the flexibility afforded by centralized routing to address these challenges. Specifically, we explore when and how standby backup forwarding options ...


Always Acyclic Distributed Path Computation, Saikat Ray, Roch A. Guérin, Kin Wah (Eric) Kwong, Rute Sofia Oct 2009

Always Acyclic Distributed Path Computation, Saikat Ray, Roch A. Guérin, Kin Wah (Eric) Kwong, Rute Sofia

Departmental Papers (ESE)

Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We present a new algorithm, Distributed Path Computation with Intermediate Variables (DIV), which can be combined with any distributed routing algorithm to guarantee that the directed graph induced by the routing decisions remains acyclic at all times. The key contribution of DIV, besides its ability to operate with any routing algorithm, is an update mechanism using simple message exchanges between neighboring nodes that guarantees loop-freedom at all times. DIV provably outperforms existing loop-prevention algorithms in several key metrics such ...


Evaluating The Vulnerability Of Network Traffic Using Joint Security And Routing Analysis, Patrick Tague, David Slater, Jason Rogers, Radha Poovendran Mar 2009

Evaluating The Vulnerability Of Network Traffic Using Joint Security And Routing Analysis, Patrick Tague, David Slater, Jason Rogers, Radha Poovendran

Patrick Tague

Joint analysis of security and routing protocols in wireless networks reveals vulnerabilities of secure network traffic that remain undetected when security and routing protocols are analyzed independently. We formulate a class of continuous metrics to evaluate the vulnerability of network traffic as a function of security and routing protocols used in wireless networks. We develop two complementary vulnerability definitions using set theoretic and circuit theoretic interpretations of the security of network traffic, allowing a network analyst or an adversary to determine weaknesses in the secure network. We formalize node capture attacks using the vulnerability metric as a nonlinear integer programming ...


Optimisation Of Multicast Routing In Wireless Mesh Networks, Brian Keegan, Karol Kowalik, Mark Davis Oct 2008

Optimisation Of Multicast Routing In Wireless Mesh Networks, Brian Keegan, Karol Kowalik, Mark Davis

Conference papers

In recent years Wireless Mesh Networks have been deployed and grown in popularity in many metropolitan areas. The deployment of such networks has allowed clients to gain access to publicly available broadband networks. The implementation of wireless mesh networks requires that backhaul services (traditionally carried by wired networks) be maintained via wireless mesh points. Because of their structure, wireless mesh networks provide an excellent means for targeting a large group of end users or simply to relay data. This may be achieved by means of broadcasting or more specifically multicasting. The lack of standards and support for multicasting over wireless ...


Dream: A Theoretical Analysis, Xueying Qi Jul 2005

Dream: A Theoretical Analysis, Xueying Qi

Computer Science Theses & Dissertations

A Mobile Ad-hoc Network (MANET, for short) is a collection of mobile nodes deployed in support of a short-lived special-purpose operation. Examples include search-and-rescue missions, law-enforcement, multimedia classrooms, and among many others. Unlike cellular or satellite networks, MANET do not rely on any form of pre-existing infrastructure. The mobility of nodes combined with the lack of infrastructure makes routing in MANET notoriously difficult. It was recently suggested that routing in MANET can use to advantage geographic information that the nodes may acquire either by endowing them with a GPS chip or simply by using known localization algorithms. Distance Routing Effect ...


Clustering And Hybrid Routing In Mobile Ad Hoc Networks, Lan Wang Apr 2005

Clustering And Hybrid Routing In Mobile Ad Hoc Networks, Lan Wang

Computer Science Theses & Dissertations

This dissertation focuses on clustering and hybrid routing in Mobile Ad Hoc Networks (MANET). Specifically, we study two different network-layer virtual infrastructures proposed for MANET: the explicit cluster infrastructure and the implicit zone infrastructure. In the first part of the dissertation, we propose a novel clustering scheme based on a number of properties of diameter-2 graphs to provide a general-purpose virtual infrastructure for MANET. Compared to virtual infrastructures with central nodes, our virtual infrastructure is more symmetric and stable, but still light-weight. In our clustering scheme, cluster initialization naturally blends into cluster maintenance, showing the unity between these two operations ...


Adaptive Turn-Prohibition Routing Algorithm For The Networks Of Workstations, Amey Bhaskar Shevtekar Dec 2003

Adaptive Turn-Prohibition Routing Algorithm For The Networks Of Workstations, Amey Bhaskar Shevtekar

Theses

Deadlock occurrence is a critical problem for any computer network. Various solutions have been proposed over last two decades to solve problem of deadlocks in networks using different routing schemes, like up/down routing algorithm used in Myrinet switches. However, most of existing approaches for deadlock-free routing either try to eliminate any possibility of deadlock occurrence, which can result in putting extra restrictions on the routing in the networks or put no restrictions on routing, which leads to other approach namely deadlock recovery. In this thesis emphasis is on developing hybrid approach for routing in wormhole networks, wherein some prohibition ...