Browsing by Subject "Wireless Sensor Networks"

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    A Compressed Data Collection System For Use In Wireless Sensor Networks
    (2013-03-06) Erratt, Newlyn S.; Liang, Yao; Raje, Rajeev; Tuceryan, Mihran
    One of the most common goals of a wireless sensor network is to collect sensor data. The goal of this thesis is to provide an easy to use and energy-e fficient system for deploying data collection sensor networks. There are numerous challenges associated with deploying a wireless sensor network for collection of sensor data; among these challenges are reducing energy consumption and the fact that users interested in collecting data may not be familiar with software design. This thesis presents a complete system, comprised of the Compression Data-stream Protocol and a general gateway for data collection in wireless sensor networks, which attempts to provide an easy to use, energy efficient and complete system for data collection in sensor networks. The Compressed Data-stream Protocol is a transport layer compression protocol with a primary goal, in this work, to reduce energy consumption. Energy consumption of the radio in wireless sensor network nodes is expensive and the Com-pressed Data-stream Protocol has been shown in simulations to reduce energy used on transmission and reception by around 26%. The general gateway has been designed in such a way as to make customization simple without requiring vast knowledge of sensor networks and software development. This, along with the modular nature of the Compressed Data-stream Protocol, enables the creation of an easy to deploy and easy to configure sensor network for data collection. Findings show that individual components work well and that the system as a whole performs without errors. This system, the components of which will eventually be released as open source, provides a platform for researchers purely interested in the data gathered to deploy a sensor network without being restricted to specific vendors of hardware.
  • Thumbnail Image
    Item
    Critical-Path Aware Scheduling for Latency Efficient Broadcast in Duty-Cycled Wireless Sensor Networks
    (Hindawi, 2018) Le, Duc-Tai; Im, Giyeol; Le Duc, Thang; Zalyubovskiy, Vyacheslav V.; Kim, Dongsoo S.; Choo, Hyunseung; Electrical and Computer Engineering, School of Engineering and Technology
    Minimum latency scheduling has arisen as one of the most crucial problems for broadcasting in duty-cycled Wireless Sensor Networks (WSNs). Typical solutions for the broadcast scheduling iteratively search for nodes able to transmit a message simultaneously. Other nodes are prevented from transmissions to ensure that there is no collision in a network. Such collision-preventions result in extra delays for a broadcast and may increase overall latency if the delays occur along critical paths of the network. To facilitate the broadcast latency minimization, we propose a novel approach, critical-path aware scheduling (CAS), which schedules transmissions with a preference of nodes in critical paths of a duty-cycled WSN. This paper presents two schemes employing CAS which produce collision-free and collision-tolerant broadcast schedules, respectively. The collision-free CAS scheme guarantees an approximation ratio of in terms of latency, where denotes the maximum node degree in a network. By allowing collision at noncritical nodes, the collision-tolerant CAS scheme reduces up to 10.2 percent broadcast latency compared with the collision-free ones while requiring additional transmissions for the noncritical nodes experiencing collisions. Simulation results show that broadcast latencies of the two proposed schemes are significantly shorter than those of the existing methods.
  • Thumbnail Image
    Item
    Robust Ant Colony Based Routing Algorithm For Mobile Ad-Hoc Networks
    (2019-08) Sharma, Arush S.; Kim, Dongsoo S.; King, Brian; El-Sharkawy, Mohamed
    This thesis discusses about developing a routing protocol of mobile ad hoc networks in a bio inspired manner. Algorithms inspired by collective behaviour of social insect colonies, bird flocking, honey bee dancing, etc., promises to be capable of catering to the challenges faced by tiny wireless sensor networks. Challenges include but are not limited to low bandwidth, low memory, limited battery life, etc. This thesis proposes an energy efficient multi-path routing algorithm based on foraging nature of ant colonies and considers many other meta-heuristic factors to provide good robust paths from source node to destination node in a hope to overcome the challenges posed by resource constrained sensors.