Category Archives: Thesis Defense

Congestion Mitigation by Traffic Dispersion in Wireless Sensor Networks

Sreekanth Yalamanchili’s Thesis Defense.

October 17, 2012
1:00pm – 3:00pm
MEC 202J

Advisor:
Dr. Sirisha Medidi

Committee:
Dr. Murali Medidi
Dr. Jyh-haw Yeh
ABSTRACT:

Wireless sensor networks (WSNs) are event based systems that rely on the collective effort of several sensor nodes. When all nodes in an area sense an event and transmit that data, it causes sudden traffic bursts which are spatially-correlated and leads to network congestion. Congestion can cause an increase in the amount of data loss, energy consumption and delay in data transmission and hinder network performance.  To improve performance of event driven applications, there arises a need for protocols which can reduce congestion and energy consumption. Existing protocols for sensing multiple events either handle congestion control or spatially-correlated contention, but not both, which can degrade network performance in terms of packet delivery ratio, latency, and energy consumption. Motivated primarily by the challenge to improve performance of event driven applications, we propose an energy efficient protocol to mitigate congestion which improves data delivery and reduces latency. This protocol mitigates congestion by dispersing network traffic using a forwarder selection mechanism that forces event reports from different nodes to disperse along different paths to the base station. Our protocol also reduces spatially-correlated contention by partitioning the sensors into different groups, so that, for each group, sensors in that group together cover the region of interest and scheduling these groups in such that only one group is active to transmit the data at any given time. We implemented our protocol using the NS2 simulator for evaluating its performance. Results show that our protocol has significant improvement in packet delivery ratio, latency and energy savings.

Events and News 2012

  1. Congestion Mitigation by Traffic Dispersion in Wireless Sensor Networks

    Sreekanth Yalamanchili’s
    Thesis Defense.October 17, 2012
    1:00pm – 3:00pm
    MEC 202J
  2. A Mini-Seminar on Mobile App Development FrameworkJoshua Barney and Brian SevyAffinityAmp (local software company)

    MEC 106
    1:30pm 3:30pm
    Friday, 9/14/2012

  3. Computer Science Proposal Approved by HERC for IGEM FundingIGEM logo csBy: Frank Zang Published 12:13 pm / June 13, 2012

    The Higher Education Research Council of the State Board of Education has awarded funds through the Idaho Global Entrepreneurial Mission (IGEM) initiative to three projects at the state’s research universities. The three winning proposals were selected by a review committee comprised of business and industry [...]

    August 21, 2012CS Events & NewsComments Off

  4. Reliable Bulk Data Dissemination Protocol in Wireless Sensor NetworksSri Haritha Kuchipudi’s Thesis Defense

    August 27, 2012 9:30am – 11:30am MEC 301 Advisor: Dr. Sirisha Medidi Committee: Dr. Murali Medidi Dr. Liljana Babinkostova   ABSTRACT: In Wireless Sensor Networks (WSNs), one of the main end-user requirements is the ability to reprogram the network as change in environmental and application requirements, creates the need to [...]

    August 20, 2012CS Events & News, Thesis DefenseComments Off

  5. Congestion Avoidance Energy Efficient MAC ProtocolAlex Sundling’s Thesis Defense

    July 30, 2012 10:00am – 12:30pm MEC 301 Advisor: Dr. Sirisha Medidi Committee: Dr. Murali Medidi Dr. Amit Jain ABSTRACT: Wireless Sensor Network (WSNs) are generally energy-constrained and resource-constrained. When multiple simultaneous events occur in densely deployed WSNs, nodes near the base station can become congested decreasing the network performance. Additionally, [...]

    July 24, 2012CS Events & News, Thesis DefenseComments Off

  6. Dynamic Diffusion for Congestion Avoidance in Wireless Sensor NetworksSri Divya Deenadayalan’s Thesis Defense

    June 15, 2012 10:00am – 12:30pm MEC 301 Advisor: Dr. Murali Medidi   ABSTRACT: Wireless Sensor Networks (WSNs) are employed for either continuous monitoring or event-detection in the area of interest. In event-driven applications, it is critical to report the detected events in the area, and with sudden bursts of [...]

    June 18, 2012CS Events & News, Thesis DefenseComments Off

  7. Meet Riak: A Distributed DatabaseJustin Pease Basho Technologies ENGR 313 19th March, 2012 6pm – 7:15pm Riak is an open source, scalable, fault-tolerant distributed database. This talk will discuss what Riak offers, some of the concepts upon which it is built, and why it should possibly be of interest to you. Many of the concepts covered are broadly applicable [...]

    April 18, 2012CS Events & NewsComments Off

  8. Toward Behavioral CoverageElena Sherman Wednesday, April 11 9:40am MEC 114 Biographical Sketch Elena Sherman is completing her Ph.D. in Computer Science at University of Nebraska – Lincoln where she also received M.S. in Computer Science. She has participated in summer internship programs at Google, Inc. and NASA‘s Ames Research Center. She is an organizer of International Workshop [...]

    April 9, 2012CS Events & NewsComments Off

  9. Turning Bad Classes Into Good Ones – Using Clustering Techniques To Guide Refactoring Of Object-Oriented Classes.Keith Cassell Monday, April 9 9:40am MEC 114 Biographical Sketch Keith Cassell is completing his PhD at Victoria University of Wellington, New Zealand.  His primary research interest involves applying artificial intelligence techniques to software engineering, particularly the use of clustering techniques to guide refactoring of object-oriented classes.  Prior to re-entering academia, he spent over 20 years as a [...]

    April 6, 2012CS Events & NewsComments Off

  10. Suffix Trees For Very Large StringsMarina Barsky Friday, April 6 9:40am MEC 114 Biographical Sketch Marina Barsky is currently a Post-Doctoral fellow in the Department of Computer Science at the University of Illinois at Urbana-Champaign, IL. She received her PhD in Computer Science from the University of Victoria, British Columbia, Canada in 2010. A large part of her post-graduate research [...]

    April 3, 2012CS Events & NewsComments Off

  11. Graph Data Management and ProcessingMichael Grossniklaus Monday, April 2 9:40am MEC 114 Biographical Sketch Michael Grossniklaus is an SNSF-funded post-doc in Prof. David Maier’s group at Portland State University, where he works on the project entitled “Exploiting Object Database Technologies for Data Management in the Cloud”. Michael obtained his PhD in Computer Science from ETH Zurich, Switzerland in the [...]

    March 27, 2012CS Events & NewsComments Off

  12. Evaluating Forum Discussions to Inform the Design of an API CriticDaqing Hou Friday, March 23 9:40am MEC 114 Biographical Sketch Dr. Daqing Hou is currently a tenure-track Assistant Professor in the Electrical and Computer Engineering Department at Clarkson University, Potsdam NY. His teaching and research interests are in Software Engineering, applications of statistical learning theory, and Computer Science Education. He is the author and co-author [...]

    March 22, 2012CS Events & NewsComments Off

  13. Boise Code Camp 2012March 24, 2012 Boise State University We will be in the Student Union Building on Boise State campus. The 2012 Boise Code Camp will be held on Saturday, March 24th at Boise State Student Union Building. Registration begins at 8 am, keynote at 9 am, sessions begin at 9:45 am. Boise’s Code Camp is among [...]

    March 19, 2012CS Events & NewsComments Off

  14. Techniques and Tools for Engineering Robust Numerical SoftwareEarl Barr Computer Science Department Faculty Candidate Monday, March 19 9:40 AM MEC 114 Biographical Sketch Earl Barr is a postdoctoral scholar at the University of California at Davis, where he received his M.S. (1999) and Ph.D. (2009) degrees, both in Computer Science. He was awarded the highly-competitive I3P Fellowship from the Department of Homeland [...]

    March 16, 2012CS Events & NewsComments Off

  15. Practical Design PatternsBrian Tuttle MetaGeek 3/1/2012, Thursday at 12:15-1:05 in MEC 309. The talk will include a conceptual overview of design patterns, some discussion of how and why they are used and an example or two. Brian Tuttle oversees the R&D process and acts as scrummaster for the software development team at MetaGeek. He is an alumni [...]

    March 13, 2012CS Events & NewsComments Off

  16. Mobile Code KitchenThe Computer Science department is pleased to announce a workshop on iPhone app development. Seating is limited!  Students need to have completed at least COMPSCI 125 (Intro to Computer Science I). Registration is required at the following website: http://coding.avalon-innovations.com/ Michael Ziray Co-Founder/Technology Architect Avalon Innovations Learn how to create and sell your next great mobile [...]

    March 13, 2012CS Events & NewsComments Off

  17. Overview of Software Stack at WhiteCloud AnalyticsTim Ramey R&D Manager WhiteCloud Analytics Thursday 2/23/2012 12:15-1:05 in MEC 309. Abstract: One question students have as they are thinking about careers after college is how the knowledge they have gained through the CS curriculum translates to actual job responsibilities.  What I will do is demonstrate WhiteCloud Analytics’ cloud-based application, talk about the technology [...]

    March 13, 2012CS Events & NewsComments Off

  18. Distributed REST Web ServicesJames Price and Justin Reed
 Clearwater Analytics Thursday, 2/16/2012 12:15-1:05 in MEC 309 The presenters will be James Price (director of development) and Justin Reed (chief architect for the major redesign of the product being discussed).  They will be showing how they solved a performance problem by doing a major redesign their client facing product by [...]

    March 13, 2012CS Events & NewsComments Off

  19. 2012 EventsPractical Design Patterns Brian Tuttle MetaGeek 3/1/2012, Thursday at 12:15-1:05 in MEC 309. The talk will include a conceptual overview of design patterns, some discussion of how and why they are used and an example or two. Brian Tuttle oversees the R&D process and acts as scrummaster for the software development team at MetaGeek. He [...]

    February 29, 2012CS Events & NewsComments Off

Reliable Bulk Data Dissemination Protocol in Wireless Sensor Networks

Sri Haritha Kuchipudi’s Thesis Defense

August 27, 2012
9:30am – 11:30am
MEC 301

Advisor:

Dr. Sirisha Medidi

Committee:

Dr. Murali Medidi

Dr. Liljana Babinkostova

 

ABSTRACT:

In Wireless Sensor Networks (WSNs), one of the main end-user requirements is the ability to reprogram the network as change in environmental and application requirements, creates the need to update the code in already deployed sensors. Reprogramming of the network generates the need to reliably disseminate large objects to every node in the network. Data Dissemination must be done with minimal disruption to the network, thus making latency a critical issue. Current approaches of data dissemination to reprogram the nodes do not effectively minimize  the number of senders, number of packet transmissions, collisions and contention that could affect latency. To provide reliable data delivery while enhancing the object delivery latency, we propose a reliable bulk data dissemination protocol. This protocol employs a data dissemination procedure in which the code is delivered by a subset of nodes to reduce contention in the network. To further reduce the contention and latency in the network, pipe-lined scheduling for data transmission is implemented. Unlike previous approaches which make use of multiple channels the proposed approach uses a single channel. We implemented our protocol using the NS2 simulator for evaluating its performance. Results show that our protocol reduces latency significantly compared to existing approaches.

Congestion Avoidance Energy Efficient MAC Protocol

Alex Sundling’s Thesis Defense

July 30, 2012
10:00am – 12:30pm
MEC 301

Advisor:

Dr. Sirisha Medidi

Committee:

Dr. Murali Medidi

Dr. Amit Jain

ABSTRACT:

Wireless Sensor Network (WSNs) are generally energy-constrained and resource-constrained. When multiple simultaneous events occur in densely deployed WSNs, nodes near the base station can become congested decreasing the network performance. Additionally, multiple nodes may sense an event leading to spatially-correlated contention further increasing congestion. In order to mitigate the effects of congestion near the base station, an energy-efficient MAC protocol that can handle multiple simultaneous events and spatially-correlated contention. Energy efficiency is important and can be achieved using duty cycles but they could degrade the network performance in terms of latency. Existing protocols either provide support for congestion near the base station or for managing spatially-correlated contention is needed. To provide energy-efficiency while maintaining the network’s performance under higher traffic load, we propose an energy-efficient congestion-aware MAC protocol. This protocol provides support for congestion near the base station and spatially correlated contention by employing a traffic shaping approach to manage the arrival times of packets to the layers close to the base station. We implemented our protocol using the NS2 simulator for evaluating its performance. Results show that our protocol has an improvement in the number of packets received at the base station while consuming less energy.

Dynamic Diffusion for Congestion Avoidance in Wireless Sensor Networks

Sri Divya Deenadayalan’s Thesis Defense

June 15, 2012

10:00am – 12:30pm

MEC 301

Advisor:

Dr. Murali Medidi

 

ABSTRACT:
Wireless Sensor Networks (WSNs) are employed for either continuous monitoring or event-detection in the area of interest. In event-driven applications, it is critical to report the detected events in the area, and with sudden bursts of traffic possible due to spatially-correlated events or multiple events, the data loss due to congestion will result in information loss or delayed arrival of the sensed information. Congestion control techniques were proposed to detect congestion and attempt to recover from packet losses due to congestion, but they cannot eliminate or prevent the occurrence of congestion. Congestion avoidance techniques employ proactive measures to alleviate future congestion using parameters like queue length, hop count, channel conditions and priority index. However, maintaining and processing such information becomes a significant overhead for the sensor nodes and degrade the performance of the network. We propose a congestion avoidance MAC protocol which uses sensor nodes’ queue buffer length to estimate the congestion and diffuse traffic to provide a congestion-free routing path towards the base station. Event reporting, packet delivery ratio, is improved by dynamically diffusing the traffic in the network using multiple forwarders in addition to backup forwarding. We used the standard Network Simulator (NS2) to evaluate the performance of our protocol. Results show that our protocol has significant improvement in event reporting in terms of packet delivery ratio, throughput and delay compared to the baseline approach.

Computer Science – Graduates by Year (Fall 2006 – Fall 2011)

Hindman, Lucas Scott (Aug. 2011)

Ammu, Ramya Bala (May 2011)

Jacobsen, Dana Allen (May 2011)

Baker, Michael Lavern (Dec. 2010)

Kamatam, Sowjanya (Aug. 2010)

Kavalapara, Rahul S (Aug. 2010)

Winder, Amy Alison (Aug. 2010)

Nandanavanam, Vamsi krishna Venkata naga (May 2010)

Ramanatha, Renu (Dec. 2009)

Shyam, Rajasree (Dec. 2009)

Phansalkar, Madhura Pradeep (Aug. 2009)

Karra, Pallayya Sarma (May 2009)

Ngazimbi, Makhosana Mbongeni (May 2009)

Prestwich, John David (May 2009)

Thibault, Julien Charles Victor (May 2009)

Guttala, Samatha (Dec. 2008)

Kompella, Uma (Aug. 2008)

Sajja, Kishore (Dec. 2007)

Ayyagari, Ravi Kiran (Aug. 2007)

Ghosh, Arpita (Aug. 2007)

Kreiner, Paul Daniel (Aug. 2007)

Seewald, Bradley Michael (Aug. 2007)

Allison, Kirsten Ann (May 2007)

Kennington, Conrad Redd (Dec. 2006)

Vail, Mason E. (Dec. 2006)