Search
Now showing items 1-4 of 4
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 ...
Alternative Clustering Algorithms in Sensor Networks
(North Dakota State University, 2010)
A wireless sensor network is composed of a large number of tiny sensor
nodes that can be deployed in a variety of environments like battle fields, water,
large fields, and the like, and can transmit data to a Base station ...
Optimization of Mobile Sensor Movement in Self-Healing Sensor Networks
(North Dakota State University, 2010)
This paper moves forward the key idea as proposed in past research works
- a self-healing deployment approach for sensor networks, where a small
percentage of mobile sensors are deployed along with the static sensors
into ...