Search
Now showing items 1-8 of 8
The Grid Scan Heuristic for Extending Lifetime in Wireless Sensor Networks
(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 ...
Path Planning under Failures in Wireless Sensor Networks
(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 ...
Wireless Sensor Network Scheduling and Coverage Using an ABC Algorithm
(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 ...
Algorithms for Coverage Improvement in a Sensor Network
(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 ...
Shortest Path in a Wireless Sensor Network with Multiple Sensor Failures
(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 ...
Optimization Modeling for Wireless Sensor Scheduling
(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 ...
REND: Reliable and Energy-Efficient Node-Disjoint Paths in Wireless Sensor Networks
(North Dakota State University, 2010)
In wireless sensor networks, finding most reliable and most efficient paths between
source node and destination node is considered NP hard problem. We can increase
reliability by ability to find node-disjoint alternate ...
A Network Optimization Solver for Routing in Wireless Sensor Networks
(North Dakota State University, 2010)
Many wireless sensor network applications require energy efficient communication
between nodes in the network. Sensor networks are of limited resources. Due to this
limitation, the routing between the nodes is one of the ...