Now showing items 1-8 of 8

    • Algorithms for Coverage Improvement in a Sensor Network 

      Maddi, Sunil Reddy (North Dakota State University, 2011)
      Sensors are devices which have the ability to receive and respond to a signal. These sensors, when used as a group, form a sensor network. Sensors in a sensor network can communicate and transmit data. In the early stages ...
    • The Grid Scan Heuristic for Extending Lifetime in Wireless Sensor Networks 

      Pachva, Srikar (North Dakota State University, 2011)
      Wireless Sensor Networks, consisting of sensing devices which sense the environment and communicate information among each other, is an emergent field in wireless networking with many potential applications. Efficiency of ...
    • Impedance-Based Wireless Sensor Network for Metal-Protective Coating Evaluation 

      Yu, Ronghua (North Dakota State University, 2011)
      Research has focused on the influences of flowing fluid on the corrosion of bare metals, but there is little emphasis on the degradation of metal-protective coating. Evaluating the metal-protective coating usually uses the ...
    • Optimal Placement of Relay Stations in Wireless Sensor Networks 

      Vallabh, Kiran Kumar (North Dakota State University, 2013)
      Wireless sensor networks (WSNs) are a collection of nodes organized into a cooperative network with sensing, processing and transmitting capabilities. WSNs are becoming an increasingly prominent technology that can be used ...
    • Optimization Modeling for Wireless Sensor Scheduling 

      Chekuri, Srujan Kumar Raju (North Dakota State University, 2013)
      Wireless sensor networks, consisting of sensing devices which sense the environment and communicate information among each other, is an emergent field in wireless networking with many potential applications. The efficiency ...
    • Path Planning under Failures in Wireless Sensor Networks 

      Paturu Raghunatha Rao, Nityananda Suresh (North Dakota State University, 2013)
      This paper explores how an all pair shortest path can be obtained in a wireless sensor network when sensors fail. Sensors are randomly deployed in a predefined geographical area, simulating the deployment of sensors from ...
    • Shortest Path in a Wireless Sensor Network with Multiple Sensor Failures 

      Poreddy, Sandeep Reddy (North Dakota State University, 2011)
      This paper shows how a shortest path can be obtained in a wireless sensor network, between a source sensor and a destination sensor, in a hop-by-hop fashion, considering multiple sensor failures along the path of data ...
    • Wireless Sensor Network Scheduling and Coverage Using an ABC Algorithm 

      Pachaiyappan, Sathya (North Dakota State University, 2015)
      Limited sensor battery capacity is a major issue in wireless sensor networks. If all of the sensors in a network need not be in an awake state to provide adequate coverage at any given time, it is possible to strategically ...